Traffic grooming in unidirectional WDM ring networks using design theory

IEEE International Conference on Communications

Volumn 2, Issue , 2003, Pages 1402-1406

  Bermond, Jean Claude ^a   Coudert, David ^a  

^a UNIVERSITY OF NICE SOPHIA ANTIPOLIS   (France)

Author keywords

Design theory; Graph; Traffic grooming; WDM rings

Indexed keywords

DELTA MODULATION; GRAPH THEORY; TELECOMMUNICATION NETWORKS; THEOREM PROVING; WAVELENGTH DIVISION MULTIPLEXING;

RING NETWORKS;

TELECOMMUNICATION TRAFFIC;

EID: 0038306579     PISSN: 05361486     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (26)

1. B. Beauquier, J-C. Bermond, L. Gargano, P. Hell, S. Pérennes, and U. Vaccaio. Graph problems arising from wavelength-routing in all-optical networks. In IEEE Workshop on Optics and Computer Science, Geneva, Switzerland, apr 1997.
2. J-C. Bermond and S. Ceroi. Minimizing SONET ADMS in unidirectional WDM ring with grooming ratio 3. Networks, 41(2), February 2003.
3. 4 - e designs, submitted to Discrete Applied Math.
4. J-C. Bermond, D. Coudert, and X. Muñoz. Traffic grooming in unidirectional WDM ring networks: the all-to-all unitary case. In The 7th IFIP Working Conference on Optical Network Design & Modelling, February 2003.
5. J-C. Bermond, C. Huang, A. Rosa, and D. Sotteau. Decomposition of complete graphs into isomorphic subgraphs with five vertices. Ars Combinatoria, pages 211-254, 1980.
6. J-C. Bermond and D. Sotteau. Graph decompositions and g-designs. In 5th British Combinatorial conference, Congressus Numerantium 15 Utilitas math. Pub., pages 53-72, Aberdeen, 1975.
7. A. L. Chiu and E. H. Modiano. Traffic grooming algorithms for reducing electronic multiplexing costs in WDM ring networks. IEEE/OSA Journal of Lightwave Technology, 18(1):2-12, January 2000.
8. C. Colbourn and J. Dinitz, editors. The CRC handbook of Combinatorial designs. CRC Press, 1996.
9. C. Colbourn and A. Ling, Graph decompositions with application to wawelength add-drop multiplexing for minimizing SONET ADMS. Discrete Mathematics, 261:141-156, 2003.
10. C. Colbourn and P-J. Wan. Minimizing drop cost for SONET/WDM networks with 1/8 wavelength requirements. Networks, 37(2): 107-116, March 2001.
11. D. Coudert and H. Rivano. Lightpath assignment for multifibers WDM optical networks with wavelength translators. In IEEE Globecom, Taipei, Taiwan, November 2002.
12. R. Dutta and N. Rouskas. A survey of virtual topology design algorithms for wavelength routed optical networks. Optical Networks, 1(1):73-89, January 2000.
13. R. Dutta and N. Rouskas. On optimal traffic grooming in WDM rings. IEEE Journal of Selected Areas in Communications, 20(1):1-12, January 2002.
14. R. Dutta and N. Rouskas. Traffic grooming in WDM networks: Past and future, Technical report, CSC TR-2002-08, NCSU, 2002.
15. O. Gerstel, P. Lin, and G. Sasaki. Wavelength assignment in a WDM ring to minimize cost of embedded SONET rings. In IEEE Infocom, pages 94-101, San Francisco, California, 1998.
16. O. Gerstel, R. Ramaswani, and G. Sasaki. Cost-effective traffic grooming in WDM rings. IEEE/ACM Transactions on Networking, 8(5):618-630, 2000.
17. J.Q. Hu. Optimal traffic grooming for wavelength-division-multiplexing rings with all-to-all uniform traffic, OSA Journal of Optical Networks, 1(1):32-42, 2002.
18. G. Huiban, S. Pérennes, and M. Syska, Traffic grooming in WDM networks with multi-layer switches. In IEEE ICC, New-York, April 2002.
19. E. Modiano and P. Lin. Traffic grooming in WDM networks. IEEE Communications Magazine, 39(7):124-129, July 2001.
20. A. Somani. Survivable traffic grooming in WDM networks. In D.K. Gautam, editor, Broad band optical fiber communications technology - BBOFCT, pages 17-45, Jalgaon, India, December 2001, Nirtali Prakashan. Invited paper.
21. P-J. Wan, G. Calinescu, L. Liu, and O. Frieder. Grooming of arbitrary traffic in SONET/WDM BLSRs. IEEE Journal of Selected Areas in Communications, 18(10):1995-2003, October 2000.
22. J. Wang, W. Cho, V. Vemuri, and B. Mukherjee. Improved approches for cost-effective traffic grooming in WDM ring networks: Ilp formulations and single-hop and multihop connections. IEEE/OSA Journal of Lightwave Technology, 19(11):1645-1653, November 2001.
23. R.M. Wilson. Decomposition of complete graphs inot subgraphs isomorphic to a given graph. Congressus numerantium, 15:647-659, November 1976.
24. X. Yuan and A. Fulay. Wavelength assignment to minimize the number of SONET ADMS in WDM rings. In IEEE ICC, New York, April 2002.
25. X. Zhang and C. Qiao. On optimal all-to-all personalized connections and cost-effective designs in WDM rings. IEEE/ACM Transactions on Networking, 7(3):435-445, 1996.
26. X. Zhang and C. Qiao. An effective and comprehensive approach for traffic grooming and wavelength assignment in SONET/WDM rings. IEEE/ACM Transactions on Networking, 8(5):608-617, 2000.