Article ID: | iaor19972222 |
Country: | United Kingdom |
Volume: | 24 |
Issue: | 3 |
Start Page Number: | 221 |
End Page Number: | 229 |
Publication Date: | Mar 1997 |
Journal: | Computers and Operations Research |
Authors: | Lee Chae Y. |
Keywords: | networks |
SONET Self Healing ring is one of the most intriguing schemes which provide survivability for telecommunication networks. To design a cost effective SONET ring it is necessary to consider load balancing problems by which the link capacity is determined. In this paper, the authors consider the load balancing problem in SONET ring when demand splitting is allowed only by integer. A bounded approxmation to the optimal solution is presented and proved by employing the arc-demand matrix which represents the amount of demand routed on each arc. A very efficient algorithm is provided which always satisfies the optimality at termination. The algorithm iteratively decreases the maximum load by considering counter-clockwise routing of a demand which passes through the arc with maximum load. Justification of the algorithm is also provided.