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.h

Link Performance Bounds in Homogeneous Optically Switched Ring Networks

Abstract — We consider a ring topology with limited or full switching capability as deployed in high bandwidth metro optical networks and develop a model to estimate the probability of blocking for interconnecting links. The model is based on the lower and upper bounds of link blocking probability. We analyze the performance for a homogeneous traffic case and present simulation results for representative ring networks. We demonstrate that the bounds are very tight with an error of less than 2 % when the traffic load is modest. The approach is based on partitioning the state space into subspaces and weighting the upper bound of blocking probability in each subspace with the occurrence of the states. The computational complexity of the approach is comparable to solving a degree of N polynomial equation