A ring architecture is of practical interest for a telecommunication operator. It makes it possible to implement automatic protection mechanisms without a substantial increase in cost. This paper deals with the problem of dimensioning a ring a routing its demands such that the total cost of the network is minimized. In a single ring network, the traffic policy has a heavy impact on the cost. Several routing strategies are compared, namely bi-path routing, single-path routing and shortest path routing according to a metric (IP rings). Furthermore, various solutions were introduced to optimize routing and dimensioning: an exact method based on cutting plane algorithms, and a heuristic. Each variant was tested with randomly generated data and some real world networks.
[1]
Peter Winkler,et al.
The Ring Loading Problem
,
1998,
SIAM Rev..
[2]
W. Kremer,et al.
Self-healing rings in a synchronous environment
,
1991,
IEEE LTS.
[3]
C. Herrmann,et al.
A fast restoration system for ATM-ring-based LANs
,
1995
.
[4]
Yoshio Kajiyama,et al.
An ATM VP-based self-healing ring
,
1994,
IEEE J. Sel. Areas Commun..
[5]
Eugenio Iannone,et al.
A transparent, all-optical, metropolitan network experiment in a field environment: the "PROMETEO" self-healing ring
,
1997
.
[6]
W. B. Ameur.
Constrained length connectivity and survivable networks
,
2000
.
[7]
Nobuji Saito,et al.
Algorithms for Routing around a Rectangle
,
1992,
Discret. Appl. Math..