Advertisement

Grooming of Scheduled Demands in Multi-Layer Optical Networks

  • Maurice Gagnaire
  • Josué Kuri
  • Elias A. Doumith
Part of the Optical Networks book series (OPNW)

Keywords

Destination Node Output Port Network Cost Wavelength Assignment Logical Topology 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    J. Kuri, N. Puech, M. Gagnaire, E. Dotaro and R. Douville, “Routing and Wavelength Assignment of Scheduled Lightpath Demands,” IEEE Journal on Selected Areas in Communications, Vol. 21, N. 8, pp. 1231–1240, October 2003.Google Scholar
  2. 2.
    J. Kuri, “Optimization Problems in WDM Optical Transport Networks with Scheduled Lightpath Demands,” Ph.D. Thesis, Ecole Nationale Supérieure des Télécommunications. Paris, France. September 2003.Google Scholar
  3. 3.
    N. Skorin-Kapov, “Heuristic algorithms for the routing and wavelength assignment of scheduled lightpath demands in optical networks,” IEEE Journal on Selected Areas in Communications, Vol. 24, NO. 8, August 2006.Google Scholar
  4. 4.
    H. G. Ahn, T.-J. Lee, M. Y. Chung and H. Choo, “RWA on Scheduled Lightpath Demands in WDM Optical Transport Networks with Time Disjoint Paths,” Proceedings of the International Conference on Information Networking (ICOIN 2005), Jeju, Korea, February 2005.Google Scholar
  5. 5.
    C. V. Saradhi and M. Gurusami, “Graph Theoretic Approaches for Routing and Wavelength Assignment of Scheduled Lightpath Demands in WDM Optical Networks,” Proceedings of the 2nd International Conference on Broadband Networks (Broadnets 2005), Boston, MA, October 2005.Google Scholar
  6. 6.
    J. Kuri, N. Puech, M. Gagnaire and E. Dotaro, “Routing and Wavelength Assignment of Scheduled Lightpath Demands in a WDM Optical Transport Network,” Proceedings of the First International Conference in Optical Communications and Networks (ICOCN 2002), Singapour, November 2002.Google Scholar
  7. 7.
    T. Li and B. Wang, “On optimal survivability design in WDM optical networks under a scheduled traffic model,” Proceedings of the 5th International Workshop on Design of Reliable Communication Networks (DRCN 2005), Ischia, Italy, October 2005.Google Scholar
  8. 8.
    T. Li and B. Wang, “On Optimal Survivability Design under a Scheduled Traffic Model in Wavelength-Routed Optical Mesh Networks,” Proceedings of the 4th Annual Communication Networks and Services research Conference (CNSR 2006), Moncton, Canada, May 2006.Google Scholar
  9. 9.
    C. V. Saradhi, L. K. Wei and M. Gurusami, “Provisioning Fault-Tolerant Scheduled Lightpath Demands in WDM Mesh Networks,” Proceedings of the First International Conference on Broadband Networks (BROADNETS 2004), San Jose, CA, October 2004.Google Scholar
  10. 10.
    E. A. Doumith and M. Gagnaire, “Traffic Routing in Multi-Layer Optical Network Considering Rerouting and Grooming Strategies,” Proceedings of the IEEE Global Communications Conference (Globecom), San Francisco,CA, December 2006.Google Scholar
  11. 11.
    E. A. Doumith, M. Gagnaire, O. Audouin, and R. Douville, “Network Nodes Dimensioning Assuming Electrical Traffic Grooming in an Hybrid OXC/EXC WDM Network,” Proceedings of the 2nd IEEE/Create-Net International Conference on Broadband Networks (BroadNets’05), Boston, MA, 2005.Google Scholar
  12. 12.
    E. A. Doumith and M. Gagnaire, “Traffic Grooming in Multi-Layer WDM Networks: Meta-heuristics versus Sequential Algorithms,” Proceedings of the IEEE Eunice Open European Summer School, Suttgart, Germany, September 2006.Google Scholar
  13. 13.
    E. A. Doumith, M. Gagnaire, O. Audouin and R. Douville, “From Network Planning to Traffic Engineering for Optical VPN and Multi-Granular Random Demands,” Proceedings of the 2nd IEEE/Create-Net International Conference on Broadband Networks (BroadNets’05), Phoenix, AZ, April 2006.Google Scholar
  14. 14.
    D. Eppstein, “Finding the k Shortest Paths,” IEEE Symposium on Foundations of Computer Science, pp. 154–165, 1994.Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2008

Authors and Affiliations

  • Maurice Gagnaire
  • Josué Kuri
  • Elias A. Doumith

There are no affiliations available

Personalised recommendations