Luis Velasco, R. Romeral, F. Agraz, S. Spadaro, J. Comellas, G. Junyent, D. Larrabeiti
{"title":"On the design of MPLS-ASON/GMPLS interconnection mechanisms","authors":"Luis Velasco, R. Romeral, F. Agraz, S. Spadaro, J. Comellas, G. Junyent, D. Larrabeiti","doi":"10.1109/ONDM.2008.4578422","DOIUrl":"https://doi.org/10.1109/ONDM.2008.4578422","url":null,"abstract":"In this paper we propose a mechanism for connecting two or more MPLS islands belonging to the same MPLS domain through one ASON/GMPLS domain. It is based on the overlay model, where client and server networks do not exchange routing information. The interconnection is firstly done at the control plane level allowing the OSPF-TE flooding mechanism to advertise the existence of a link between two MPLS islands. Then, all MPLS routers in both parts of the MPLS domain know the complete network topology. Moreover, flooding messages advertising topological changes in one MPLS island of the domain are sent to other MPLS islands through these connections. No optical resources are used in the transport plane of the ASON/GMPLS network. New LSPs can be routed end-to-end triggering, if necessary, the establishment of LSPs in the ASON/GMPLS domain.","PeriodicalId":155835,"journal":{"name":"2008 International Conference on Optical Network Design and Modeling","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131292101","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Availability-aware design in FIPP p-cycles protected mesh networks","authors":"A. Ranjbar, C. Assi","doi":"10.1109/ONDM.2008.4578414","DOIUrl":"https://doi.org/10.1109/ONDM.2008.4578414","url":null,"abstract":"Failure-independent path-protecting (FIPP) p-cycle is an extension of the basic p-cycle and an alternative approach for providing fully pre-connected protection paths with end-to-end failure-independent path protection property. We study the unavailability of end-to-end traffic in FIPP based mesh networks, which are designed to protect against single failures and present an availability-aware network design method. Our results show that although FIPP is more efficient in terms of spare capacity redundancy than basic p-cycle (Kodian et. al, 2005 ), when the network design limits the service unavailability, FIPP tends to be less efficient and its redundancy is 8-13% more than basic p-cycle. We present our analysis and discussions on these findings.","PeriodicalId":155835,"journal":{"name":"2008 International Conference on Optical Network Design and Modeling","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134497697","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
M. Yannuzzi, X. Masip-Bruin, G. Fabrego, S. Sánchez-López, J. Solé-Pareta
{"title":"OBGP+: A simple approach to drastically improve OBGP","authors":"M. Yannuzzi, X. Masip-Bruin, G. Fabrego, S. Sánchez-López, J. Solé-Pareta","doi":"10.1109/ONDM.2008.4578403","DOIUrl":"https://doi.org/10.1109/ONDM.2008.4578403","url":null,"abstract":"During the last few years, the research community has shown an increasing interest in the subject of inter-domain routing in optical networks, so new approaches like the optical extension of BGP, namely OBGP, have arisen. However, it is widely accepted now that a multi-domain routing model mostly centered on the exchange of reachability information - like the one we have today or the one provided by OBGP - is not going to be enough in the future. Routing domains must be able to exchange both, reachability, as well as aggregated path state information (PSI). Understanding that there is a missing piece in the routing models provided by BGP and OBGP is easy nowadays, but contributing with solutions capable of highly improving the performance of these routing protocols without increasing the number and frequency of the routing messages exchanged between domains is a challenging task. This study makes the following contributions. First, we propose a straightforward strategy to compute highly aggregated PSI between routing domains. Second, we propose OBGP+, an extended version of OBGP that exploits this PSI to compute inter-domain lightpaths in a highly efficient way. Third, in order to avoid the typical increase in the number of routing messages associated with the update of PSI, we propose to piggy-back these updates in non-dummy Keepalive messages exchanged between OBGP+ neighbors. Extensive simulations made with OPNET in the PAN European network topology reveal that: i) OBGP+ is able to drastically reduce the blocking experienced with OBGP; ii) while even needing less number of routing messages than OBGP to achieve this performance.","PeriodicalId":155835,"journal":{"name":"2008 International Conference on Optical Network Design and Modeling","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125880548","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Analytical model for dynamic waveband switching","authors":"P. Ghobril","doi":"10.1109/ONDM.2008.4578396","DOIUrl":"https://doi.org/10.1109/ONDM.2008.4578396","url":null,"abstract":"We present in this paper a novel framework to analytically model dynamic waveband switching in a multi-granular optical network. The scalable solution consists in modeling each potential carrier of waveband tunnels independently by a Markov chain while modulating the rate of critical transitions, i.e. reserving a new waveband tunnel, by the waveband setup availability computed from the solution of other potential carriers. An iterative procedure is repeated to obtain a consistent numerical solution all over the network.","PeriodicalId":155835,"journal":{"name":"2008 International Conference on Optical Network Design and Modeling","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123514145","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"MPLS-VRF integration: forwarding capabilities of BGP/MPLS IP VPN in GNU/Linux","authors":"J. A. Picó, J. O. Fajardo, A. Muñoz, A. Ferro","doi":"10.1109/ONDM.2008.4578412","DOIUrl":"https://doi.org/10.1109/ONDM.2008.4578412","url":null,"abstract":"This paper presents an implementation of the BGP/MPLS IP VPN functionalities for GNU/Linux. First, we briefly review the operation mode described in the IETF RFC 4364 and show the characteristics that are supported by this implementation. Afterwards, we provide some implementation details of the forwarding plane for the kernel 2.6.18.1. This implementation includes the integration of the MPLS- and VRF-for-Linux projects. Finally, we present some example scenarios to validate our implementation in different cases, and show the corresponding commands for the ingress and egress PE routers. This work establishes a first approach for testing BGP/MPLS IP VPN technology in GNU/Linux testbeds and supports the basic functionalities for a future implementation of the signaling plane.","PeriodicalId":155835,"journal":{"name":"2008 International Conference on Optical Network Design and Modeling","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125559682","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
J. Sierra, L. F. Caro, F. Solano, R. Fabregat, Y. Donoso
{"title":"S/G Light-tree: Multicast grooming architecture for improved resource allocation","authors":"J. Sierra, L. F. Caro, F. Solano, R. Fabregat, Y. Donoso","doi":"10.1109/ONDM.2008.4578419","DOIUrl":"https://doi.org/10.1109/ONDM.2008.4578419","url":null,"abstract":"Internet traffic demands are constantly increasing and a considerable amount of this increase is expected to be of multicast type. Optical transport networks (OTN)must be prepared in terms of better resource utilization for accommodating multicast traffic. For this purpose multicast traffic grooming has been considered. Light-trees have been proposed for supporting multicast connections in OTN. Nevertheless when light-trees are used with traffic grooming, resources can be overutilized as traffic can be routed to undesirable destinations in order to avoid optical-electrical-optical (OEO)conversions. In this paper a novel architecture named S/G light-tree for supporting multicast connections is proposed. The architecture allows to eliminate and aggregate traffic in different wavelengths without performing OEO conversions.The architecture uses labels supported by generalized multiprotocol label switching (GMPLS). A heuristic that routes traffic demands using less wavelengths by taking advantage of the proposed architecture is designed as well. Simulation results show that the architecture can minimize the number of used wavelengths and OEO conversions when compared to light-trees.","PeriodicalId":155835,"journal":{"name":"2008 International Conference on Optical Network Design and Modeling","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123704184","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Multiobjective model for multicast overlay networks over IP/MPLS using MOEA","authors":"J. Montoya, Y. Donoso, E. Montoya, D. Echeverri","doi":"10.1109/ONDM.2008.4578405","DOIUrl":"https://doi.org/10.1109/ONDM.2008.4578405","url":null,"abstract":"Multicast plays an important role in supporting a new generation of applications. At present and for different reasons, technical and non-technical, multicast IP hasnpsilat yet been totally adopted for Internet. During recent years, an active area of research is that of implementing this kind of traffic in the application layer where the multicast functionality isnt a responsibility of the routers but that of the hosts, which we know as Multicast Overlay Networks (MON). In this article, routing in an MON is put forward as a multiobjective optimization problem (MOP) where two functions are optimized: 1) the total end to end delay of the multicast tree and 2) the maximum link utilization. The simultaneous optimization of these two functions is an NP-Complete problem and to solve this we suggest using Multiobjective Evolutionary Algorithms (MOEA), specifically NSGA-II.","PeriodicalId":155835,"journal":{"name":"2008 International Conference on Optical Network Design and Modeling","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117276695","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Availability analysis of GMPLS connections based on physical network topology","authors":"J. Segovia, E. Calle, Pere Vilà","doi":"10.1109/ONDM.2008.4578418","DOIUrl":"https://doi.org/10.1109/ONDM.2008.4578418","url":null,"abstract":"This paper presents a study of connection availability in GMPLS over optical transport networks (OTN) taking into account different network topologies. Two basic path protection schemes are considered and compared with the no protection case. The selected topologies are heterogeneous in geographic coverage, network diameter, link lengths, and average node degree. Connection availability is also computed considering the reliability data of physical components and a well-known network availability model. Results show several correspondences between suitable path protection algorithms and several network topology characteristics.","PeriodicalId":155835,"journal":{"name":"2008 International Conference on Optical Network Design and Modeling","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129736284","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On provision of availability guarantees using shared protection","authors":"A. Mykkeltveit, B. Helvik","doi":"10.1109/ONDM.2008.4578406","DOIUrl":"https://doi.org/10.1109/ONDM.2008.4578406","url":null,"abstract":"The Internet has traditionally provided an undefined level of availability based on a best-effort restoration scheme, while the telecommunication networks have provided a somewhat higher level, primarily achieved by dedicated protection. In the coming next generation network, the introduction of new services that have different quality of service (QoS) requirements combined with cost conscious customers who make cost/utility trade-offs, yields a need for the network operators to be able to offer different levels of guaranteed availability. The challenge is to find schemes that can provide the guaranteed availability level requested by each connection while at the same time use bandwidth efficiently. Path protection is a well-known technique to improve the availability of connections in optical networks. When availability guarantees are to be offered, dedicated path protection is easily applicable since the availability of the connections can easily be predicted. Shared path protection, however, is more difficult to apply since the computations usually are more involved. In this paper, two schemes for on-line bandwidth-efficient connection-establishment exploiting shared protection are proposed. The schemes are compared through simulation studies on two realistic network topologies.","PeriodicalId":155835,"journal":{"name":"2008 International Conference on Optical Network Design and Modeling","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128727139","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Multi-domain routing techniques with topology aggregation in ASON networks","authors":"G. Maier, Chiara Busca, A. Pattavina","doi":"10.1109/ONDM.2008.4578402","DOIUrl":"https://doi.org/10.1109/ONDM.2008.4578402","url":null,"abstract":"Thanks to the development of the automatic control plane (ASON and GMPLS standards) optical transport networks are able to provide bandwidth on demand service quickly and efficiently. But for this service to be really interesting to users the capability of seamlessly operating the network across multiple administrative domains should be developed. Multi-domain routing in ASON is a new challenging topic, especially if the target is a scalable solution. The paper investigates this topic and in particular it evaluates the effectiveness of the application of aggregation topology methods to the representation of network domains. These methods, initially devised for ATM networks, can be extended to ASON/GMPLS, as recommended by the Optical Interworking Forum (OIF). Topology aggregation limits the amount of topology information distributed throughout the network and the bandwidth occupation for control-plane signalling, improving scalability. On the other hand, concealing intra-domain topology details to other domains may limit the effectiveness of inter-domain routing. We analyze the behavior of the three topology-aggregation methods proposed by OIF (Simple Node, Full Mesh and Symmetric Star) comparing blocking probability in a multi-domain optical network under dynamic bandwidth-on-demand traffic. We further propose a new topology-aggregation scheme (Hybrid) with improved scalability and evaluate its performance in the case-study network compared to the other known schemes.","PeriodicalId":155835,"journal":{"name":"2008 International Conference on Optical Network Design and Modeling","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128059636","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}