The Ring Loading Problem

DOI10.1137/S0895480195294994MaRDI QIDQ4388975zbMATHFDO

Authors Peter Winkler, Paul Seymour, Alexander Schrijver

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)

Recommendations

• The Ring Loading Problem
• A note on the ring loading problem
• A note on the ring loading problem
• An improved upper bound for the ring loading problem

Cited in

(42)

• SONET/SDH ring assignment with capacity constraints
• scientific article; zbMATH DE number 1508269 (Why is no real title available?)
• Designing tributary networks with multiple ring families.
• The load distribution problem in a processor ring
• Routing equal-size messages on a slotted ring
• A tabu search algorithm for self-healing ring network design.
• On packing and coloring hyperedges in a cycle
• Approximability of unsplittable shortest path routing problems
• Efficient algorithms for the ring loading problem with demand splitting
• Single-Sink Multicommodity Flow with Side Constraints
• The weighted link ring loading problem
• The price of atomic selfish ring routing
• A polynomial-time algorithm for the weighted link ring loading problem with integer demand splitting
• Improved Approximation Algorithms for the Demand Routing and Slotting Problem with Unit Demands on Rings
• The directed ring loading with penalty cost
• Upgrading edge-disjoint paths in a ring
• A note on the ring loading problem
• An efficient algorithm for the ring loading problem with integer demand splitting
• Exact solution of the SONET ring loading problem
• Connectivity and diameter in distance graphs
• Maximizing profits of routing in WDM networks
• Models and complexity of multibin packing problems
• Pairwise cooperations in selfish ring routing for minimax linear latency
• Routing permutations and involutions on optical ring networks: Complexity results and solution to an open problem
• scientific article; zbMATH DE number 1990728 (Why is no real title available?)
• Approximation algorithms for routing and call scheduling in all-optical chains and rings.
• On the minimum cost multiple-source unsplittable flow problem
• A survey on multi-loop networks.
• Network design with a discrete set of traffic matrices
• Multicuts and integral multiflows in rings
• Approximation algorithms for the design of SDH/SONET networks
• A note on the ring loading problem
• Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs
• An improved upper bound for the ring loading problem
• Balancing Load via Small Coalitions in Selfish Ring Routing Games
• Optimization in telecommunication networks
• A cycle augmentation algorithm for minimum cost multicommodity flows on a ring
• Stability vs. optimality in selfish ring routing
• An algorithm for node-capacitated ring routing
• Online mixed ring covering problem with two nodes
• On the ring loading problem with demand splitting.
• The master ring problem

This page was built for publication: The Ring Loading Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4388975)