Path connectivity based spectral defragmentation in flexible bandwidth networks
Related Experiment Videos
Ying Wang1, Jie Zhang, Yongli Zhao
1State Key Laboratory of Information Photonics and Optical Communication, Beijing University of Posts and Telecommunications, No.10 Xitucheng Road, Beijing 100876, China.
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.
Related Concept Videos
¹³C NMR: Distortionless Enhancement by Polarization Transfer (DEPT)
Bandpass Sampling
A bandpass signal has a spectrum with a lower frequency limit, denoted as ω1, and an upper frequency limit, denoted as ω2. The spectrum...
Reconstruction of Signal using Interpolation
Habitat Fragmentation
Aliasing
If the sampling frequency is below the Nyquist rate, these replicas overlap, preventing the original signal...
¹³C NMR: ¹H–¹³C Decoupling
A broadband decoupling technique is used to simplify these complex, sometimes overlapping, signals. Broadband decoupling relies on a...