The Ring Loading Problem

  • Authors:

  • Alexander Schrijver;Paul Seymour;Peter Winkler

  • Affiliations:

  • -;-;-

  • Venue:
  • SIAM Journal on Discrete Mathematics
  • Year:
  • 1998

Quantified Score

Hi-index 0.01

Visualization

Abstract

The following problem arose in the planning of optical communications networks which use bidirectional SONET rings. Traffic demands di,j are given for each pair of nodes in an n-node ring; each demand must be routed one of the two possible ways around the ring. The object is to minimize the maximum load on the cycle, where the load of an edge is the sum of the demands routed through that edge.We provide a fast, simple algorithm which achieves a load that is guaranteed to exceed the optimum by at most 3/2 times the maximum demand, and that performs even better in practice. En route we prove the following curious lemma: for any x1,..., xn in [0,1] there exist y1,..., yn such that for each k, $|y_k|=x_k$ and $$ \left| \sum_{i=1}^k y_i - \sum_{i=k+1}^n y_i \right| \le 2. $$