Linear time algorithms for the ring loading problem with demand splitting

Journal of Algorithms

Volumn 54, Issue 1, 2005, Pages 45-57

  Wang, Biing Feng ^a  

^a NATIONAL TSING HUA UNIVERSITY   (Taiwan)

Author keywords

Algorithms; Disjoint set data structures; Optical networks; Rings; Routing

Indexed keywords

DATA STRUCTURES; MATHEMATICAL MODELS; OPTICAL COMMUNICATION; PROBLEM SOLVING; SET THEORY; TELECOMMUNICATION NETWORKS; TELECOMMUNICATION TRAFFIC;

DISJOINT-SET DATA STRUCTURES; LINEAR TIME ALGORITHMS (LTA); OPTICAL NETWORKS; RING LOADING PROBLEMS; ROUTING;

ALGORITHMS;

EID: 10644245886     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jalgor.2004.03.003     Document Type: Article

References (10)

1. M.D. Amico, M. Labbe, F. Maffioli, Exact solution of the SONET ring loading problem, Oper. Res. Lett. 25 (1999) 119-129.
2. T.H. Cormen, C.E. Leiserson, R.L. Rivest, C. Stein, Introduction to Algorithms, MIT Press, 2001.
3. S. Cosares, I. Saniee, An optimal problem related to balancing loads on SONET rings, Telecommun. Systems 3 (1994) 165-181.
4. H.N. Gabow, R.E. Tarjan, A linear-time algorithm for a special case of disjoint set union, J. Comput. System Sci. 30 (1985) 209-221.
5. C.Y. Lee, S.G. Chang, Balancing loads on SONET rings with integer demand splitting, Comput. Oper. Res. 24 (1997) 221-229.
6. Y.-S. Myung, H.-G. Kim, On the ring loading problem with demand splitting, Oper. Res. Lett. 32 (2) (2004) 167-173.
7. Y-S. Myung, H.-G. Kim, D.-W. Tcha, Optimal load balancing on SONET bidirectional rings, Oper. Res. 45 (1997) 148-152.
8. Y.-S. Myung, An efficient algorithm for the ring loading problem with integer demand splitting, SIAM J. Discrete Math. 14 (3) (2001) 291-298.
9. A. Schrijver, P. Seymour, P. Winkler, The ring loading problem, SIAM J. Discrete Math. 11 (1998) 1-14.
10. R. Vachani, A. Shulman, P. Kubat, Multi-commodity flows in ring networks, INFORMS J. Comput. 8 (1996) 235-242.