Diverse routing of scheduled lightpath demands in an optical transport network
Authors:
- J. KuriJKJ. Kuri
- N. PuechNPN. Puech
- M. GagnaireMGM. Gagnaire
- 8 July 2004
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 69-76
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Routing foreseeable lightpath demands using a tabu search meta-heuristic2003
- Routing and wavelength assignment of scheduled lightpath demandsIEEE Journal on Selected Areas in Communications, 2003
- An optimal spare-capacity assignment model for survivable networks with hop limits2002
- ROUTING AND WAVELENGTH ASSIGNMENT OF SCHEDULED LIGHTPATH DEMANDS IN A WDM OPTICAL TRANSPORT NETWORK2002
- Topological Design of Survivable Mesh-Based Transport NetworksAnnals of Operations Research, 2001
- Comparative Methods and Issues In Design of Mesh-Restorable STM and ATM Networks1999
- Restoration strategies and spare capacity requirements in self-healing ATM networksIEEE/ACM Transactions on Networking, 1999
- Optimal capacity placement for path restoration in STM or ATM mesh-survivable networksIEEE/ACM Transactions on Networking, 1998
- Finding the k Shortest PathsSIAM Journal on Computing, 1998
- Optimization by Simulated AnnealingScience, 1983