Balancing loads on SONET rings with integer demand splitting
Computers and Operations Research
SIAM Journal on Discrete Mathematics
Introduction to Algorithms
An Efficient Algorithm for the Ring Loading Problem with Integer Demand Splitting
SIAM Journal on Discrete Mathematics
Exact solution of the SONET Ring Loading Problem
Operations Research Letters
On the ring loading problem with demand splitting
Operations Research Letters
Multicommodity flows in cycle graphs
Discrete Applied Mathematics
Communication: Integral polyhedra related to integer multicommodity flows on a cycle
Discrete Applied Mathematics
A polynomial-time algorithm for the weighted link ring loading problem with integer demand splitting
Theoretical Computer Science
Solving ring loading problems using bio-inspired algorithms
Journal of Network and Computer Applications
Reducing the maximum latency of selfish ring routing via pairwise cooperations
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
A discrete differential evolution algorithm for solving the weighted ring arc loading problem
IEA/AIE'10 Proceedings of the 23rd international conference on Industrial engineering and other applications of applied intelligent systems - Volume Part II
Efficient load balancing using the bees algorithm
IEA/AIE'11 Proceedings of the 24th international conference on Industrial engineering and other applications of applied intelligent systems conference on Modern approaches in applied intelligence - Volume Part II
A hybrid ant colony optimization algorithm for solving the ring arc-loading problem
SETN'10 Proceedings of the 6th Hellenic conference on Artificial Intelligence: theories, models and applications
Efficient load balancing for a resilient packet ring using artificial bee colony
EvoCOMNET'10 Proceedings of the 2010 international conference on Applications of Evolutionary Computation - Volume Part II
A compact formulation of the ring loading problem with integer demand splitting
Operations Research Letters
Pairwise cooperations in selfish ring routing for minimax linear latency
Theoretical Computer Science
Routing equal-size messages on a slotted ring
Journal of Scheduling
The price of anarchy for selfish ring routing is two
WINE'12 Proceedings of the 8th international conference on Internet and Network Economics
Approximation algorithms for the ring loading problem with penalty cost
Information Processing Letters
Hi-index | 0.00 |
Given a ring of size n and a set K of traffic demands, the ring loading problem with demand splitting (RLPW) is to determine a routing to minimize the maximum load on the edges. In the problem, a demand between two nodes can be split into two flows and then be routed along the ring in different directions. If the two flows obtained by splitting a demand are restricted to integers, this restricted version is called the ring loading problem with integer demand splitting (RLPWI). In this paper, efficient algorithms are proposed for the RLPW and the RLPWI. Both the proposed algorithms require O(|K| + ts) time, where ts is the time for sorting |K| nodes. If |K| ≥ nε for some small constant ε 0, integer sort can be applied and thus ts = O(|K|); otherwise, ts = O(|K| log |K|). For real world applications, |K| is usually not smaller than n and thus our algorithms achieve linear time. The proposed algorithms improve the previous upper bounds from O(min{n|K|, n2}) for RLPW and from O(n|K|) for RLPWI.