The Ring Loading Problem

DOI10.1137/S0895480195294994MaRDI QIDQ4388975zbMATH OpenFDO

Authors Peter Winkler, Paul Seymour, Alexander Schrijver

Publication date 11 May 1998

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

Full work available at URL https://doi.org/10.1137/S0895480195294994

zbMATH Keywords

load balancingoptical network designSONET ring

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Integer programming (90C10) 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

(49)

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

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)