Dynamic Path Provisioning and Disruption-Free Reoptimization Algorithms for Bandwidth on-Demand Services Considering Fairness

Masahiro NAKAGAWA  Hiroshi HASEGAWA  Ken-ichi SATO  

IEICE TRANSACTIONS on Communications   Vol.E100-B   No.4   pp.536-547
Publication Date: 2017/04/01
Online ISSN: 1745-1345
DOI: 10.1587/transcom.2016EBP3202
Type of Manuscript: PAPER
Category: Network
dynamic network control,  fairness between paths,  hitless rerouting,  make before break routing,  

Full Text: PDF(2.5MB)>>
Buy this Article

Adaptive and flexible network control technology is considered essential for efficient network resource utilization. Moreover, such technology is becoming a key to cost-effectively meet diverse service requirements and accommodate heavier traffic with limited network resources; demands that conventional static operation cannot satisfy. To address this issue, we previously studied dynamic network control technology for large-capacity network services including on-demand broad bandwidth provisioning services and layer-one VPN. Our previous study introduced a simple weighting function for achieving fairness in terms of path length and proposed two dynamic Make Before Break Routing algorithms for reducing blocking probability. These algorithms enhance network utilization by rerouting existing paths to alternative routes while completely avoiding disruption for highly reliable services. However, the impact of this avoidance of service disruption on blocking probability has not been clarified. In this paper, we propose modified versions of the algorithms that enhance network utilization while slightly increasing disruption by rerouting, which enable us to elucidate the effectiveness of hitless rerouting. We also provide extensive evaluations including a comparison of original and modified algorithms. Numerical examples demonstrate that they achieve not only a high degree of fairness but also low service blocking probability. Hitless rerouting is achieved with a small increase in blocking probability.