A Faster Algorithm for the Ring Loading problem with Demand Splitting

분할 루팅이 허용되는 링의 용량결정문제에 대한 개선된 해법

  • Published : 2001.12.01

Abstract

In the ring loading problem with demand splitting, traffic demands are given for each pall of nodes in an undirected ring network 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. The fastest a1gorithm to date is Myung, Kim and Tcha's a1gorithm that runs in Ο(n|K|) time where n is the number of nodes and K is the index set of the origin-destination pairs of nodes having flow traffic demands. Here we develop an a1gorithm for the ring loading problem with demand splitting that improves the rerouting step of Myung, Kim and Tcha's a1gorithm arid runs in Ο(min{n|K|, n$^2$}) time.

Keywords

References

  1. 한국경영과학회지 v.25 no.1 정수단위로만 루팅이 허용되는 SONET링의 용량결정문제 명영수
  2. 경영과학지 v.18 no.2 분할이 허용된 SONET 링의 루팅 해법들에 대한 비교 분석 명영수;김후곤
  3. Introduction to Algorithms Cormen, T.H.;C.E. Leiserson;R.L. Rivest
  4. Interfaces v.25 SONET toolkit:a decision support system for designing robust and costeffective fiber-optic networks Cosares, S.D.;N. Deutsch;I. Saniee;O.J. Wasem
  5. Telecommunication Systems v.3 An optimization problem related to balancing loads on SONET rings Cosares, S.;I. Saniee
  6. Operations Research Letters v.26 Exact Solution of the SONET Ring Loading Problem Dell'Amico, M.M.;Labbe;F. Maffioli
  7. Operations Research v.45 Optimal load balancing on SONET bidirectional rings Myung, Y.-S.;H.G. Kim;D.-W.Tcha
  8. SIAM J. Discrete Math. v.14 An Efficient Algorithm for the Ring Loading Problem with Integer Demand Splitting Myung, Y.-S.
  9. SIAM J. Discrete Math. v.11 The ring loading problem Schrijver, A.P.;Seymour;P.Winkler
  10. INFORMS Journal on Computing v.8 Multicommodity flows in ring networks Vachani, R.A.;Shulman;P. Kubat
  11. Fiber network service survivability Wu, T.H.