The Scalability and Performance of Common Vector Solution to Generalized Label Continuity Constraint in Hybrid Optical/Packet Networks

Abstract

In hybrid optical/packet networks, wavelength and VLAN tag continuity along a label switched path are two common constraints. These two types of constraints, referred to as generalized label continuity constraints, have global significance in a network; namely, the label should appear only in other link- or node-disjoint paths. In considering these constraints, a solution is the common vector approach, which seeks a common available label along the path determined by CSPF without label constraints. In this paper, we provide an estimation method to compute the upper bound of the blocking probability for the above approach. We also address the scalability problem of the existing traffic engineering algorithms. We then present the simulation results corroborating with our analytical model.

Original document

The different versions of the original document can be found in:

• http://cnl.gmu.edu/bjabbari/GlobeCom07.pdf

• http://cnl.gmu.edu/bjabbari/GlobeCom07.pdf,

https://dblp.uni-trier.de/db/conf/globecom/globecom2007.html#GongJ07,

http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000004411405,

https://academic.microsoft.com/#/detail/2168848112

• http://xplorestaging.ieee.org/ielx5/4410909/4410910/04411405.pdf?arnumber=4411405,

http://dx.doi.org/10.1109/glocom.2007.495