Open AccessPath connectivity based spectral defragmentation in flexible bandwidth networks
Author(s) -
Ying Wang,
Jie Zhang,
Yongli Zhao,
Jiawei Zhang,
Jie Zhao,
Xinbo Wang,
Wanyi Gu
Publication year - 2013
Publication title -
optics express
Language(s) - Uncategorized
Resource type - Journals
SCImago Journal Rank - 1.394
H-Index - 271
ISSN - 1094-4087
DOI - 10.1364/oe.21.001353
Subject(s) - computer science , bandwidth (computing) , blocking (statistics) , provisioning , path (computing) , computer network , network topology , distributed computing , path protection , node (physics) , algorithm , wavelength division multiplexing , real time computing , wavelength , physics , optoelectronics , structural engineering , engineering
Optical networks with flexible bandwidth provisioning have become a very promising networking architecture. It enables efficient resource utilization and supports heterogeneous bandwidth demands. In this paper, two novel spectrum defragmentation approaches, i.e. Maximum Path Connectivity (MPC) algorithm and Path Connectivity Triggering (PCT) algorithm, are proposed based on the notion of Path Connectivity, which is defined to represent the maximum variation of node switching ability along the path in flexible bandwidth networks. A cost-performance-ratio based profitability model is given to denote the prons and cons of spectrum defragmentation. We compare these two proposed algorithms with non-defragmentation algorithm in terms of blocking probability. Then we analyze the differences of defragmentation profitability between MPC and PCT algorithms.