Please use this identifier to cite or link to this item: https://doi.org/10.1109/ISCC.2005.58
Title: Dynamic routing of dependable connections with different QoP grades in WDM optical networks
Authors: Ming, C.
Luying, Z.
Gurusamy, M. 
Issue Date: 2005
Source: Ming, C.,Luying, Z.,Gurusamy, M. (2005). Dynamic routing of dependable connections with different QoP grades in WDM optical networks. Proceedings - IEEE Symposium on Computers and Communications : 532-537. ScholarBank@NUS Repository. https://doi.org/10.1109/ISCC.2005.58
Abstract: This paper presents an efficient protection scheme to provide differentiated survivability services for dynamic traffic in mesh WDM optical networks. In the deterministic Quality of Protection (QoP) framework, connections with different reliability requirements are classified by assigning a continuous spectrum of QoP grades. The backup bandwidth of those connections with low QoP grades is treated as low-speed traffic and may be multiplexed into one backup lighpath for the purpose of efficient bandwidth utilization. In this way, the bandwidth can be efficiently allocated by two-level backup bandwidth aggregation: backup bandwidth sharing and backup bandwidth multiplexing. To allocate the connections with different QoP grades, we propose two efficient routing algorithms: minimum delay QoP routing (MDQR) and maximum aggregation QoP routing (MAQR). Through simulation experiments, we demonstrate that our algorithms work well in terms of blocking performance and the ability of providing differentiated survivability services. © 2005 IEEE.
Source Title: Proceedings - IEEE Symposium on Computers and Communications
URI: http://scholarbank.nus.edu.sg/handle/10635/70049
ISBN: 0769523730
ISSN: 15301346
DOI: 10.1109/ISCC.2005.58
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

3
checked on Feb 12, 2018

Page view(s)

41
checked on Feb 16, 2018

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.