IEICE TRANSACTIONS on Communications
Dynamic Path Provisioning and Disruption-Free Reoptimization Algorithms for Bandwidth on-Demand Services Considering Fairness
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E100-B No.4 pp.536-547
- Publication Date
- 2017/04/01
- Publicized
- 2016/10/28
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.2016EBP3202
- Type of Manuscript
- PAPER
- Category
- Network
Authors
Masahiro NAKAGAWA
Nagoya University
Hiroshi HASEGAWA
Nagoya University
Ken-ichi SATO
Nagoya University
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Masahiro NAKAGAWA, Hiroshi HASEGAWA, Ken-ichi SATO, "Dynamic Path Provisioning and Disruption-Free Reoptimization Algorithms for Bandwidth on-Demand Services Considering Fairness" in IEICE TRANSACTIONS on Communications,
vol. E100-B, no. 4, pp. 536-547, April 2017, doi: 10.1587/transcom.2016EBP3202.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.2016EBP3202/_p
Copy
@ARTICLE{e100-b_4_536,
author={Masahiro NAKAGAWA, Hiroshi HASEGAWA, Ken-ichi SATO, },
journal={IEICE TRANSACTIONS on Communications},
title={Dynamic Path Provisioning and Disruption-Free Reoptimization Algorithms for Bandwidth on-Demand Services Considering Fairness},
year={2017},
volume={E100-B},
number={4},
pages={536-547},
abstract={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.},
keywords={},
doi={10.1587/transcom.2016EBP3202},
ISSN={1745-1345},
month={April},}
Copy
TY - JOUR
TI - Dynamic Path Provisioning and Disruption-Free Reoptimization Algorithms for Bandwidth on-Demand Services Considering Fairness
T2 - IEICE TRANSACTIONS on Communications
SP - 536
EP - 547
AU - Masahiro NAKAGAWA
AU - Hiroshi HASEGAWA
AU - Ken-ichi SATO
PY - 2017
DO - 10.1587/transcom.2016EBP3202
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E100-B
IS - 4
JA - IEICE TRANSACTIONS on Communications
Y1 - April 2017
AB - 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.
ER -
English
