The Ring-Loading and Ring-Sizing Problem

  • J. W. Mann
  • G. D. Smith
Conference paper


Ring based structures axe often desirable in telecommunication networks since they offer a structure which is inherently fault-tolerant. The simplest such structure consists of a set of nodes connected by links to form a simple cycle. This simple configuration provides high survivability since every pair of nodes is connected by a physically diverse route, and hence no single link failure will disconnect the ring. In the event of failure, all traffic can be diverted as long as the ring has enough capacity. The ring sizing problem is then to determine the minimum capacity to handle all traffic while guaranteeing fault protection. In order to solve this problem, the traffic on the ring has to be routed in such a way as to minimise the maximum load on any link, this is termed the ring loading problem. In this paper we apply both a genetic algorithm and a simulated annealing algorithm to solve this problem.


Integral Proportion Single Link Failure Synchronous Digital Hierarchy Modern Heuristic Traffic Request 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    S. Cosares and I. Saniee. An optimisation problem related to balancing loads on SONET rings. Telecommunication Systems, 3(2):165–181, 1994.CrossRefGoogle Scholar
  2. [2]
    A. Prank, T. Nishizeki, N. Saito, H. Suzuki, and E. Tardos. Algorithms for routing round a rectangle. Discrete Applied Mathematics, 40:363–378, 1992.MathSciNetCrossRefGoogle Scholar
  3. [3]
    J.W. Mann. Applications of genetic algorithms in telecommunications. Master’s thesis, University of East Anglia, 1995.Google Scholar
  4. [4]
    J.W. Mann. X-SAmson v1.5 User Manual. University of East Anglia, 1996.Google Scholar
  5. [5]
    J.W. Mann, A. Kapsalis, and G.D. Smith. The GAmeter toolkit. In V. J. Rayward-Smith, editor, Applications of Modern Heuristic Methods, chapter 12, pages 195–209. Alfred Waller, 1995.Google Scholar
  6. [6]
    J.W. Mann, V.J. Rayward-Smith, and G.D. Smith. Telecommunications traffic routing: A case study in the use of genetic algorithms. In Proceedings of the Applied Decision Technologies (ADT’95)-Modern Heuristic Search Methods, pages 315–325, Uxbridge, 1995. UNICOM Seminars Ltd.Google Scholar
  7. [7]
    J.W. Mann and G.D. Smith. A comparison of heuristics for telecommunications traffic routing. In V.J. Rayward-Smith, I.H. Osman, C.R. Reeves, and G.D. Smith, editors, Modern Heuristic Search Methods, chapter 14, pages 237–256. John Wiley, 1996.Google Scholar
  8. [8]
    V.J. Rayward-Smith. A unified approach to tabu search, simulated annealing and genetic algorithms. In V.J. Rayward-Smith, editor, Applications of Modern Heuristic Methods, chapter 2, pages 17–38. Alfred Waller, 1995.Google Scholar
  9. [9]
    A. Shulman, R. Vachani, J. Ward, and P. Kubat. Multicommodity flows in ring networks. Technical Report 02254, GTE Laboratories, 1991.Google Scholar
  10. [10]
    A.R.P. White, J.W. Mann, and G.D. Smith. Genetic algorithms and network ring design. Annals of Operations Research, to appear.Google Scholar

Copyright information

© Springer-Verlag Wien 1998

Authors and Affiliations

  • J. W. Mann
    • 1
  • G. D. Smith
    • 2
  1. 1.Nortel plcHarlow, EssexUK
  2. 2.School of Information SystemsUEANorwichUK

Personalised recommendations