Research Article
A load-balancing spare capacity reallocation approach in service-rich SONET metro mesh networks
@INPROCEEDINGS{10.1109/BROADNETS.2004.6, author={Lu Shen and Xi Yang and Byrav Ramamurthy}, title={A load-balancing spare capacity reallocation approach in service-rich SONET metro mesh networks}, proceedings={1st Annual Conference on Broadband Networks}, publisher={IEEE}, proceedings_a={BROADNETS}, year={2004}, month={12}, keywords={}, doi={10.1109/BROADNETS.2004.6} }
- Lu Shen
Xi Yang
Byrav Ramamurthy
Year: 2004
A load-balancing spare capacity reallocation approach in service-rich SONET metro mesh networks
BROADNETS
IEEE
DOI: 10.1109/BROADNETS.2004.6
Abstract
The next-generation SONET metro network is evolving into a service-rich infrastructure. At the edge of such a network, multi-service provisioning platforms (MSPPs) provide efficient data mapping enabled by generic framing procedure (GFP) and virtual concatenation (VC). The core of the network tends to be a meshed architecture equipped with multi-service switches (MSSs), In the context of these emerging technologies, we propose a load-balancing spare capacity reallocation approach to improve network utilization in the next-generation SONET metro networks. Using our approach, carriers can postpone network upgrades, resulting in increased revenue with reduced capital expenditures (CAPEX). For the first time, we consider the spare capacity reallocation problem from a capacity upgrade and network planning perspective. Our approach can operate in the context of shared-path protection (with backup multiplexing) because it reallocates spare capacity without disrupting working services. Unlike previous spare capacity reallocation approaches which aim at minimizing total spare capacity, our load-balancing approach minimizes the network load vector (NLV), which is a novel metric that reflects the network load distribution. Because NLV takes into consideration both uniform and non-uniform link capacity distribution, our approach can benefit both uniform and non-uniform networks. We develop a greedy load-balancing spare capacity reallocation (GLB-SCR) heuristic algorithm to implement this approach. Our experimental results show that GLB-SCR outperforms a previously proposed algorithm (SSR) in terms of established connection capacity and total network capacity in both uniform and non-uniform networks.