The Ring Loading Problem

DOI10.1137/S0895480195294994zbMath0910.90135MaRDI QIDQ4388975

Peter M. Winkler, P. D. Seymour

Publication date: 11 May 1998

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

load balancingoptical network designSONET ring

Mathematics Subject Classification ID

Integer programming (90C10) Communication networks in operations research (90B18) Applications of graph theory to circuits and networks (94C15)

Related Items (32)

A survey on multi-loop networks. ⋮ The weighted link ring loading problem ⋮ On packing and coloring hyperedges in a cycle ⋮ An Improved Upper Bound for the Ring Loading Problem ⋮ Optimization in telecommunication networks ⋮ Models and complexity of multibin packing problems ⋮ Online mixed ring covering problem with two nodes ⋮ SONET/SDH ring assignment with capacity constraints ⋮ Designing tributary networks with multiple ring families. ⋮ Upgrading edge-disjoint paths in a ring ⋮ A tabu search algorithm for self-healing ring network design. ⋮ Routing equal-size messages on a slotted ring ⋮ Single-Sink Multicommodity Flow with Side Constraints ⋮ Pairwise cooperations in selfish ring routing for minimax linear latency ⋮ On the ring loading problem with demand splitting. ⋮ Exact solution of the SONET ring loading problem ⋮ Network design with a discrete set of traffic matrices ⋮ Stability vs. optimality in selfish ring routing ⋮ On the minimum cost multiple-source unsplittable flow problem ⋮ An algorithm for node-capacitated ring routing ⋮ A cycle augmentation algorithm for minimum cost multicommodity flows on a ring ⋮ The price of atomic selfish ring routing ⋮ A polynomial-time algorithm for the weighted link ring loading problem with integer demand splitting ⋮ Approximability of unsplittable shortest path routing problems ⋮ A Note on the Ring Loading Problem ⋮ Connectivity and diameter in distance graphs ⋮ Approximation algorithms for the design of SDH/SONET networks ⋮ Multicuts and integral multiflows in rings ⋮ Balancing Load via Small Coalitions in Selfish Ring Routing Games ⋮ Approximation algorithms for routing and call scheduling in all-optical chains and rings. ⋮ Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs ⋮ Maximizing profits of routing in WDM networks

This page was built for publication: The Ring Loading Problem