title: Path connectivity based spectral defragmentation in flexible bandwidth networks.
abstract: 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.
authors: State Key Laboratory of Information Photonics and Optical Communication, Beijing University of Posts and Telecommunications, No.10 Xitucheng Road, Beijing 100876, China.
authors: Ying
authors: Y
authors: Wang
authors: Jie
authors: J
authors: Zhang
authors: Yongli
authors: Y
authors: Zhao
authors: Jiawei
authors: J
authors: Zhang
authors: Jie
authors: J
authors: Zhao
authors: Xinbo
authors: X
authors: Wang
authors: Wanyi
authors: W
authors: Gu
mesh_terms: D000465:Algorithms; D003195:Computer Communication Networks; D003198:Computer Simulation; D008962:Models, Theoretical; D055096:Optical Devices