Journal of the Korean Operations Research and Management Science Society (한국경영과학회지)
- Volume 23 Issue 3
- /
- Pages.49-62
- /
- 1998
- /
- 1225-1119(pISSN)
- /
- 2733-4759(eISSN)
Optimal Load Balancing On SONET Rings with Integer Demand Splitting
정수단위로만 루팅이 허용되는 SONET 링의 용량결정문제
Abstract
In the ring loading problem, traffic demands are given for each pair of nodes in an undirected ring network with n nodes and a flow is routed in either of the two directions, clockwise and counter-clockwise. The load of a link is the sum of the flows routed through the link and the objective of the Problem is to minimize the maximum load on the ring. In the ring loading problem with integer demand splitting, each demand can be split between the two directions and the flow routed in each direction is restricted to integers. Recently, Vachani et al. [INFORMS J. Computing 8 (1996) 235-242] have developed an Ο(n
Keywords