The ring grooming problem

Networks

Volumn 44, Issue 3, 2004, Pages 194-202

  Chow, Timothy Y ^a   Lin, Philip J ^a  

^a NONE   (United States)

Author keywords

ADM minimization; BLSR; Parameterized complexity; Ring loading; SONET over WDM; Traffic grooming

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DELTA MODULATION; POLYNOMIALS; TELECOMMUNICATION SERVICES; TELECOMMUNICATION TRAFFIC; WAVELENGTH DIVISION MULTIPLEXING;

ADM MINIMIZATION; BLSR; PARAMETERIZED COMPLEXITY; RING LOADINGS; SONET OVER WDM; TRAFFIC GROOMING;

RINGS (COMPONENTS);

EID: 4644360123     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/net.20029     Document Type: Article

References (23)

1. N. Brauner, Y. Crama, G. Finke, P. Lemaire, and C. Wynants, Approximation algorithms for SONET networks, Technical Report GEMME 2002, University of Liège, 2002.
2. S. Cosares and I. Saniee, An optimization problem related to balancing loads on SONET rings, Telecom Systems 3 (1994), 165-181.
3. H. Dörrie, 100 great problems of elementary mathematics: Their history and solution, Dover, New York, 1965.
4. R.G. Downey and M.R. Fellows, Parameterized complexity, Springer, New York, 1999.
5. A. Frank, T. Nishizeki, N. Saito, H. Suzuki, and E. Tardos, Algorithms for routing around a rectangle, Discrete Appl Math 40 (1992), 363-378.
6. M.R. Garey and D.S. Johnson, Computers and intractability: A guide to the theory of NP-completeness, W.H. Freeman, San Francisco, 1979.
7. O. Gerstel, P. Lin, and G. Sasaki, Combined WDM and SONET network design, Proc IEEE INFOCOM '99, pp. 734-743.
8. O. Gerstel, P. Lin, and G. Sasaki, Wavelength assignment in a WDM ring to minimize cost of embedded SONET rings, Proc IEEE INFOCOM '98, pp. 94-101.
9. O. Goldschmidt, D.S. Hochbaum, A. Levin, and E.V. Olinick, The SONET edge-partition problem, Networks 41 (2002), 13-23.
10. D.M. Gordon, O. Patashnik, and G. Kuperberg, New constructions for covering designs, J Combin Designs 3 (1995), 269-284; http://www.ccrwest.org/ cover.html.
11. P. Harshavardhana, P.K. Johri, and R. Nagarajan, A note on weight-based load balancing on SONET rings, Telecom Systems 6 (1996), 237-239.
12. J.-Q. Hu, Traffic grooming in wavelength-division-multiplexing ring networks: A linear programming solution, J Optical Networking 1 (2002), 397-408.
13. S. Khanna, A polynomial time approximation scheme for the SONET ring loading problem, Bell Labs Tech J 2 (Spring 1997), 36-41.
14. Y. Lee, H. Sherali, J. Han, and S. Kim, A branch-and-cut algorithm for solving an intra-ring synchronous optical network design problem, Networks 35 (2000), 223-232.
15. X.-Y. Li, L.-W. Liu, P.-J. Wan, and O. Frieder, Practical traffic grooming scheme for single-hub SONET/WDM rings, Proc IEEE LCN '00, pp. 556-564.
16. E.H. Modiano and A.L. Chiu, Traffic grooming algorithms for reducing electronic multiplexing costs in WDM ring networks, J Lightwave Tech 18 (2000), 2-12.
17. Y.-S. Myung, H.-G. Kim, and D.-W. Tcha, Optimal load balancing on SONET bidirectional rings, Operat Res 45 (1997), 148-152.
18. A. Schrijver, P. Seymour, and P. Winkler, The ring loading problem, SIAM J Discrete Math 11 (1998), 1-14.
19. J.M. Simmons, E.L. Goldstein, and A.A.M. Saleh, Quantifying the benefit of wavelength add-drop in WDM rings with distance-independent and dependent traffic, J Lightwave Tech 17 (1999), 48-57.
20. A. Sutter, F. Vanderbeck, and L. Wolsey, Optimal placement of add/drop multiplexers: Heuristic and exact algorithms, Operat Res 46 (1998), 719-728.
21. P.-J. Wan, L.-W. Liu, and O. Frieder, Grooming of arbitrary traffic in SONET/WDM BLSRs, IEEE J Selected Areas Comm 18 (2000), 1995-2003.
22. J. Wang, W. Cho, V. Vemuri, and V. Mukherjee, Improved approaches for cost-effective traffic grooming in WDM ring networks: Non-uniform traffic and bidirectional ring, Proc IEEE ICC '00, pp. 1295-1299.
23. X. Zhang and C. Qiao, An effective and comprehensive approach for traffic grooming and wavelength assignment in SONET/WDM rings, IEEE/ACM Trans Networking 8 (2000), 608-617.