## Abstract

The following problem arose in the planning of optical communications networks which use bidirectional SONET rings. Traffic demands d_{i,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 X_{1},...,X_{n} ∈[0,1] there exist y_{1},...,y_{n} such that for each k, [y_{k}] = x_{k} and equation presented.

Original language | English (US) |
---|---|

Pages (from-to) | 1-14 |

Number of pages | 14 |

Journal | SIAM Journal on Discrete Mathematics |

Volume | 11 |

Issue number | 1 |

DOIs | |

State | Published - Feb 1998 |

## All Science Journal Classification (ASJC) codes

- General Mathematics

## Keywords

- Load balancing
- Optical network design
- SONET ring