8 February 2005 Fairness improvements in GMPLS-based wavelength-routed networks
Author Affiliations +
Abstract
In future GMPLS-based wavelength-routed networks (WRNs), lightpaths are set up or torn down dynamically. Blocking probabilities of on-demand requests are an important performance measure. However, the network average blocking probability only indicates the global performance of the network. Due to large resource requirements and wavelength continuity constraint, the blocking probabilities of longer-hop connections are usually much higher than those of shorter-hop connections. This problem is the so-called fairness problem. In this paper, a priority-based control is proposed to improve the fairness between different connections. Connections with high blocking probabilities are assigned high priorities and they are able to preempt low priority connections with a predetermined probability. Both theoretical analyses and simulations are given. It is shown that the proposed control not only improves the fairness, but also ensures that the average blocking probability is not degraded much. Hence, the performance of the GMPLS-based optical networks will be improved greatly.
© (2005) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Yong Yin, Geng Sheng Kuo, "Fairness improvements in GMPLS-based wavelength-routed networks", Proc. SPIE 5626, Network Architectures, Management, and Applications II, (8 February 2005); doi: 10.1117/12.577024; https://doi.org/10.1117/12.577024
PROCEEDINGS
8 PAGES


SHARE
RELATED CONTENT


Back to Top