10th IEEE Symposium on Computers and Communications (ISCC'05) Dynamic Routing of Dependable Connections with Different QoP Grades in WDM Optical Networks Cartagena, Murcia, Spain June 27-June 30 ISBN: 0-7695-2373-0
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISCC.2005.58
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.
Citation:
Cai Ming, Zhou Luying, Mohan Gurusamy, "Dynamic Routing of Dependable Connections with Different QoP Grades in WDM Optical Networks," iscc, pp.532-537, 10th IEEE Symposium on Computers and Communications (ISCC'05), 2005 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||