Efficient shared-path protection exploiting the knowledge of connection-holding time
Authors:
- M. TornatoreMTM. Tornatore
- Canhui OuCOCanhui Ou
- Jing ZhangJZJing Zhang
- A. PattavinaAPA. Pattavina
- B. MukherjeeBMB. Mukherjee
- 1 January 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 65-72
Abstract
We propose to exploit the knowledge of connection-holding time to design an efficient algorithm, called PHOTO, for dynamic provisioning of shared-path-protected connections in optical mesh networks. The core idea of our proposal consists of exploiting the knowledge of the holding time of connection requests to minimize resource overbuild due to backup capacity and hence achieve resource-usage efficiency. For a typical US nationwide network, we obtained savings on resource overbuild ranging from about 4% to 10% for various scenarios, compared to a holding-time-unaware, but otherwise shared-path-efficient, approach.Keywords
This publication has 16 references indexed in Scilit:
- Routing and wavelength assignment of scheduled lightpath demandsIEEE Journal on Selected Areas in Communications, 2003
- Achieving fast and bandwidth-efficient shared-path protectionJournal of Lightwave Technology, 2003
- Bi-criteria studies of mesh network restoration path-length versus capacity tradeoffs2002
- Protection path routing on WDM networks2002
- Efficient algorithms for routing dependable connections in WDM optical networksIEEE/ACM Transactions on Networking, 2001
- Architectures and protocols that enable new applications on optical networksIEEE Communications Magazine, 2001
- Capacity performance of dynamic provisioning in optical networksJournal of Lightwave Technology, 2001
- Sparse Wavelength Conversion in Wavelength-Routed WDM Optical Networks*Photonic Network Communications, 1999
- Comparison of k-shortest paths and maximum flow routing for network facility restorationIEEE Journal on Selected Areas in Communications, 1994
- A quick method for finding shortest pairs of disjoint pathsNetworks, 1984