Abstract
In the weighted link ring loading problem, we are given an n-node undirected ring network. Each of its links is associated with a weight. Traffic demands are given for each pair of nodes in the ring. The load of a link is the sum of the flows routed through the link, and the weighted load of a link is the product of its weight and the smallest integer not less than its load. The objective of the problem is to find a routing scheme such that the maximum weighted load on the ring is minimized. In this paper we consider three variants: (i) demands may be split into two parts, and then each part is sent in a different direction; (ii) demands are allowed to be split into two parts but restricted to be integrally split; (iii) each demand must be entirely routed in either of the two directions, clockwise or counterclockwise. We first prove that the first variant is polynomially solvable. We then present a pseudo-polynomial time algorithm for the second one. Finally, for the third one, whose NP-hardness can be drawn from the result in the literature, we derive a polynomial-time approximation scheme (PTAS).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Babcock J (1990) SONET: A practical perspective. Bus Commun Rev Sept:59–63
Calinescu G, Wan PJ (2002) Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs. Theor Comp Sci 276:33–50
Cosares S, Saniee I (1994) An optimization problem related to balancing loads on SONET rings. Telecommun Syst 3:165–181
Dell’Amico M, Labbe M, Maffioli F (1999) Exact solution of the SONET ring loading problem. Oper Res Lett 26:119–129
Frank A, Nishizeki T, Saito N, Suzuki H, Tardos E (1992) Algorithms for routing around a rectangle. Discrete Appl Math 40:363–378
Hochstein JM, Weihe K (2004) Edge-disjoint routing in plane switch graphs in linear time. J Assoc Comput Mach 51:636–670
Karmarkar N (1984) A new polynomial-time algorithm for linear programming. Combinatorica 4:373–395
Khanna S (1997) A polynomial-time approximation scheme for the SONET ring loading problem. Bell Labs Tech J 2:36–41
Myung YS (2001) An efficient algorithm for the ring loading problem with integer demand splitting. SIAM J Discrete Math 14:291–298
Myung YS, Kim HG (2004) On the ring loading problem with demand splitting. Oper Res Lett 32:167–173
Myung YS, Kim HG, Tcha DW (1997) Optimal load balancing on SONET bidirectional rings. Oper Res 45:148–152
Okamura H, Seymour PD (1981) Multicommodity flows in planar graphs. J Comb Theory Ser B 31:75–81
Schrijver A, Seymour PD, Winkler P (1998) The ring loading problem. SIAM J Discrete Math 11:1–14
Wang BF (2005) Linear time algorithms for the ring loading problem with demand splitting. J Algorithms 54(1):45–57
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Nong, Q., Yuan, J. & Lin, Y. The weighted link ring loading problem. J Comb Optim 18, 38–50 (2009). https://doi.org/10.1007/s10878-007-9136-7
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-007-9136-7