Balancing loads on sonet rings with integer demand splitting

Abstract

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, we consider the load balancing problem in SONET ring when demand splitting is allowed only by integer. A bounded approximation to the optimal solution is presented and proved by employing the are-demand matrix which represents the amount of demand routed on each are. 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 are with maximum load. Justification of the algorithm is also provided. (C) 1997 Elsevier Science Ltd.