Integrated routing in GMPLS-based IP/WDM networks

Colitti, Walter; Steenhaut, Kris; Colle, Didier; Pickavet, Mario; Lemeire, Jan; Nowé, Ann

doi:10.1007/s11107-010-0296-5

Cited by 6 publications

(2 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As an example, the authors in [13] propose a multilayer routing approach to be used in symmetric GMPLS-controlled multilayer networks and compare it with an approach where each layer applies its own routing policy.…”

Section: Introductionmentioning

confidence: 99%

Survivable IP/MPLS-Over-WSON Multilayer Network Optimization

Ruiz

Pedrola

Velasco

et al. 2011

J. Opt. Commun. Netw.

View full text Add to dashboard Cite

Abstract-Network operators are facing the problem of dimensioning their networks for the expected huge IP traffic volumes while keeping constant or even reducing the connectivity prices. Therefore, new architectural solutions able to cope with the expected traffic increase in a more cost-effective way are needed. In this work, we study the survivable IP/multi-protocol label switching (MPLS) over wavelength switched optical network (WSON) multilayer network problem as a capital expenditure (CAPEX) minimization problem. Two network approaches providing survivability against optical links, IP/MPLS nodes, and opto-electronic port failures are compared: the classical overlay approach where two redundant IP/MPLS networks are deployed, and the new joint multilayer approach which provides the requested survivability through an orchestrated interlayer recovery scheme which minimizes the over-dimensioning of IP/MPLS nodes. Mathematical programming models are developed for both approaches. Solving these models, however, becomes impractical for realistic networks. In view of this, evolutionary heuristics based on the biased random-key genetic algorithm framework are also proposed. Exhaustive experiments on several reference network scenarios illustrate the effectiveness of the proposed approach in minimizing network CAPEX.Index Terms-Integer linear programming; Multilayer planning; Survivable multilayer networks.

show abstract

Section: Introductionmentioning

confidence: 99%

Survivable IP/MPLS-Over-WSON Multilayer Network Optimization

Ruiz

Pedrola

Velasco

et al. 2011

J. Opt. Commun. Netw.

View full text Add to dashboard Cite

show abstract

“…In other research work, additional constraints were taken into account, such as the congestion of optical links and / or LSC LSPs, switching capability penalties, etc. For example, the authors in [31] proposed an algorithm that chooses the layer on which the traffic will be accommodated comparing the capacity utilization of the virtual / logical and physical topology. They proved that this algorithm outperforms the algorithm proposed in [30] in terms of both, connection blocking probability and resource utilization.…”

Section: Related Workmentioning

confidence: 99%

GMPLS-based provisioning of ethernet connections over WSON with quality of service

Bukva

View full text Add to dashboard Cite

The rapid growth of the data traffic, caused by the ever-growing number of Internet users and the services requiring huge bandwidth (e.g., videoconferences, IPTV, etc.) show that the existing transport network infrastructure is not optimal in terms of cost, flexibility and scalability. In this context, an appealing solution relies on deploying a multi-layer network (MLN) constituted by a dual layer infrastructure combining the benefits provided by flexible Connection Oriented (CO) - Ethernet and the huge transmission capacity provided by Wavelength Switched Optical Networks (WSON), controlled by a Generalized Multi-Protocol Label Switching (GMPLS) unified control plane. An important concept in such a MLN is the Forwarding Adjacency (FA). The aim of FAs is to exploit the grooming decisions where existent lower-layer Label Switched Paths (LSPs) (i.e., FA LSPs) with sufficient unreserved bandwidth are intelligently reused when accommodating and serving new upper-layer LSPs. By doing so, the established lower-layer LSPs form a Virtual Network Topology (VNT) for the provisioning of CO-Ethernet services. One of the main challenges in a MLN is how to accommodate dynamically requested higher-layer connections in the created VNT to optimally utilize the large capacity offered by a WSON. In this regard, we focus on the problem of path computation and LSP provisioning in a CO-Ethernet over WSON network, under the framework of GMPLS unified control plane. Firstly, we propose the usage of a FA TE link timer, which postpones the release of created FA TE link when there are no more upperlayer connections over such a link, rather than releasing it immediately. By doing so, we do reduce the signaling overhead due to consecutive triggering of FA TE links between the same pair of nodes. As a second contribution, we compare three approaches for dynamic VNT reconfiguration: semi-dynamic, virtual and dynamic, using our proposed online path computation algorithm. We show that with the dynamic approach the lowest connection blocking probability is obtained but at the expense of the increased setup delay. Finally, we have proposed a dynamic path computation algorithm that chooses the route depending on the current state of the network resources, favoring the usage/re-use of virtual and active FA TE links over establishing new optical LSPs occupying unused wavelength channels. The proposed algorithm provides better usage of the network resources, keeping the connection blocking probability low, comparing with selected algorithms proposed in the literature. Next, we focus on schemes and mechanisms for dedicated path protection in a CO-Ethernet over WSON network. In that sense, after classifying recovery mechanisms for MLN found in the literature, we compare both link- and Shared Risk Link Group (SRLG) - disjoint schemes. These schemes aim at computing a link- and SRLG-disjoint backup path with respect to the computed working paths, respectively. It is shown that, although the SRLG-disjoint scheme provides higher survivability comparing with the link-disjoint scheme, the connection blocking probability is still significantly higher. As a second contribution regarding dedicated path protection, we present a protection scheme which tries to accommodate a requested connection over the least congested TE links (i.e., higher unused bandwidth), while establishing both, working and backup paths. The aim of this contribution is to provide an efficient usage of the network resources and to minimize the number of connections affected by a link failure. Finally, we propose a Suurballe algorithm-based scheme that aims at decreasing the connection blocking probability due to working path SRLG-joint links that are removed during the backup path computation. The exhaustive performance evaluations of the above contributions are conducted through simulations under the assumption of dynamic traffic pattern and using well-known reference network topologies.

show abstract