Grooming of non-uniform traffic on unidirectional and bidirectional rings

Computer Communications

Volumn 29, Issue 8, 2006, Pages 1065-1078

  Ul Mustafa, Raza ^a   Kamal, Ahmed E ^a  

^a Iowa State University   (United States)

Author keywords

ADMs; Asymmetric traffic; Bidirectional ring; Linear topology; Non uniform traffic; NP completeness; Traffic grooming; Unidirectional ring; WDM networks

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONFORMAL MAPPING; DELTA MODULATION; HEURISTIC METHODS; LINEAR SYSTEMS; PROBLEM SOLVING; ROUTERS; TELECOMMUNICATION TRAFFIC; TOPOLOGY;

ASYMMETRIC TRAFFIC; BIDIRECTIONAL RINGS; LINEAR TOPOLOGIES; NON-UNIFORM TRAFFIC; NP-COMPLETENESS; TRAFFIC GROOMING; UNIDIRECTIONAL RINGS; WDM NETWORKS;

WAVELENGTH DIVISION MULTIPLEXING;

EID: 33645938249     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comcom.2005.07.002     Document Type: Article

References (19)

1. Ramaswami R., and Sivarajan K. Optical Networks: A Practical Perspective. second ed. (2001), Morgan Kaufmann, San Mateo,CA
2. Chiu A.L., and Modiano E.H. Traffic grooming algorithms for reducing electronic multiplexing costs in WDM ring networks. Journal of Lightwave Technology 18 1 (2000) 2-12
3. Modiano E. Traffic grooming in WDM networks. IEEE Communications Magazine (2001) 124-129
4. Dutta R., and Rouskas G. Traffic grooming in WDM networks: past and future. IEEE Network 16 6 (2002) 46-56
5. Zhu K., and Mukherjee B. A review of traffic grooming in WDM optical networks: architecture and challenges. Optical Networks Magazine 4 2 (2003)
6. Gerstel O., Ramaswami R., and Sasaki G. Cost-effective traffic grooming in WDM rings. IEEE/ACM Transactions on Networking 8 5 (2000) 618-630
7. Gerstel O., Lin P., and Sasaki G. Combined WDM and SONET design. Proceedings of IEEE INFOCOM'99 (1999) pp. 734-43
8. Li X.-Y., Liu L.-W., Wan P.-J., and Frieder O. Practical traffic grooming scheme for single-hub SONET/WDM rings. Proceedings of IEEE 25th Annual Conference on Local Computer Networks (LCN) (2000) pp. 556-64
9. Dutta R., and Rouskas G.N. On optimal traffic grooming in WDM rings. IEEE Journal on Selected Areas in Communication 20 1 (2002) 110-121
10. Wan P.-J., Calinescu G., Liu L., and Frieder O. Grooming of arbitrary traffic in SONET/WDM BLSRs. IEEE Journal of Selected Areas in Communications (2000) 1995-2003
11. Liu L., Li X., Wan P.-J., and Frieder O. Wavelength assignment in WDM rings to minimize SONET ADMs. Proceedings of IEEE INFOCOM'2000 (2000) pp. 1020-25
12. Zhang X., and Qiao C. An effective and comprehensive approach for traffic grooming and wavelength assignment in SONET/WDM rings. IEEE/ACM Transactions on Networking 8 5 (2000) 608-617
13. Cho W., Wang J., and Mukherjee B. Improved approaches for cost-effective traffic grooming in WDM ring networks: uniform-traffic case. Photonic Network Communications 3 3 (2001) 245-254
14. Gerstel O., Lin P., and Sasaki G. Wavelength assignment in a WDM ring to minimize cost of embedded SONET rings. Proceedings of IEEE INFOCOM'98 (1998) pp. 94-101
15. Fishburn P.C. Interval Orders and Interval Graphs (1985), John Wiley, New York
16. Garey M., Johnson D., Miller G., and Papadimitriou C. The complexity of coloring circular arc graphs and chords. SIAM Journal on Algebraic and Discrete Methods 1 2 (1980) 216-227
17. Gupta U., Lee D., and Leung J.-T. Efficient algorithms for interval graphs and circular-arc graphs. Networks 12 (1980) 459-467
18. Zhu K., and Mukherjee B. Traffic grooming in a WDM mesh network. IEEE Journal on Selected Areas in Communications 20 1 (2002) 122-133
19. Thiagarajan S., and Somani A.K. Traffic grooming for survivable WDM mesh networks. Proceedings of OPTICOMM (2001)