The Ring Loading Problem

SIAM Review

Volumn 41, Issue 4, 1999, Pages 777-791

  Winkler, Peter ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

Load balancing; Optical network design; Sonbt ring

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CONGESTION CONTROL (COMMUNICATION); OPTICAL COMMUNICATION; TELECOMMUNICATION TRAFFIC; THEOREM PROVING; WAVELENGTH DIVISION MULTIPLEXING;

RING LOADING PROBLEMS; SYNCHRONOUS OPTICAL NETWORKS (SONET);

FIBER OPTIC NETWORKS;

EID: 0033439529     PISSN: 00361445     EISSN: None     Source Type: Journal    
DOI: 10.1137/s0036144599356470     Document Type: Article

References (14)

1. J. BABCOCK, SONET: A practical perspective, Business Comm. Rev., Sept. (1990), pp. 59-63.
2. T. CARPENTER, S. COSARES, AND I. SANIEE, Demand routing and slotting on ring networks, Networks, to appear.
3. S. COSARES, I. SANIEE, AND O. WASEM, Network planning with the SONET toolkit, Bellcore EXCHANGE, Sept./Oct. (1992), pp. 8-13.
4. S. COSARES AND I. SANIEE, An optimization problem related to balancing loads on SONET rings, Telecommunications Systems, 3 (1994), pp. 165-181.
5. A. FRANK, Connectivity and network flows, in Handbook of Combinatorics, R. Graham, M. Grötschel, and L. Lovâsz, eds., Elsevier, Amsterdam, 1995, pp. 111-177.
6. A. FRANK, Edge-disjoint paths in planar graphs, J. Combin. Theory Ser. B, 38 (1985), pp. 164178.
7. A. FRANK, T. NISHIZEKI, N. SAITO, H. SUZUKI, AND E. TARDOS, Algorithms for routing around a rectangle, Discrete Appl. Math., 40 (1992), pp. 363-378.
8. M. R. GAREY AND D. S. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, San Francisco, 1979.
9. L. G. KHACHIYAN, A polynomial algorithm in linear programming, Soviet Math. Dokl., 20 (1979), pp. 191-194.
10. S. KHANNA, A polynomial-time approximation scheme for the SONET ring loading problem, Bell Labs Tech. J., 2 (1997), pp. 36-41.
11. Y.-S. MYUNG, H.-G. KlM, AND D.-W. TcHA, Optimal load balancing on SONET bidirectional rings, Oper. Res., 45 (1997), pp. 148-152.
12. H. OKAMURA AND P. D. SEYMOUR, Multicommodity flows in planar graphs, J. Combin. Theory Ser. B, 31 (1981), pp. 75-81
13. H. RiPPHAUSEN-LlPA, D. WAGNER, AND K. WEIHE, Efficient algorithms for disjoint paths in pla-nar graphs, in Combinatorial Optimization, DIMACS Ser. Discrete Math. Theoret. Cornput. Sei. 20, W. Cook, L. Lovâsz, and P. Seymour, eds., AMS, Providence, RI, 1995, pp. 295-354.
14. G. WlLFOXG AND P. WlNKLER, Ring routing and wavelength translation, Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, ACM, Providence, RI, 1998, pp. 333-341