TY - GEN
T1 - Online multi-commodity flow with high demands
AU - Even, Guy
AU - Medina, Moti
PY - 2013/12/1
Y1 - 2013/12/1
N2 - This paper deals with the problem of computing, in an online fashion, a maximum benefit multi-commodity flow (ONMCF), where the flow demands may be bigger than the edge capacities of the network. We present an online, deterministic, centralized, all-or-nothing, bi-criteria algorithm. The competitive ratio of the algorithm is constant, and the algorithm augments the capacities by at most a logarithmic factor. The algorithm can handle two types of flow requests: (i) low demand requests that must be routed along a path, and (ii) high demand requests that may be routed using a multi-path flow. Two extensions are discussed: requests with known durations and machine scheduling.
AB - This paper deals with the problem of computing, in an online fashion, a maximum benefit multi-commodity flow (ONMCF), where the flow demands may be bigger than the edge capacities of the network. We present an online, deterministic, centralized, all-or-nothing, bi-criteria algorithm. The competitive ratio of the algorithm is constant, and the algorithm augments the capacities by at most a logarithmic factor. The algorithm can handle two types of flow requests: (i) low demand requests that must be routed along a path, and (ii) high demand requests that may be routed using a multi-path flow. Two extensions are discussed: requests with known durations and machine scheduling.
KW - Multi-commodity flow
KW - Online algorithms
KW - Primal-dual scheme
UR - http://www.scopus.com/inward/record.url?scp=84894166009&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-38016-7_3
DO - 10.1007/978-3-642-38016-7_3
M3 - منشور من مؤتمر
SN - 9783642380150
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 16
EP - 29
BT - Approximation and Online Algorithms - 10th International Workshop, WAOA 2012, Revised Selected Papers
T2 - 10th International Workshop on Approximation and Online Algorithms, WAOA 2012
Y2 - 13 September 2012 through 14 September 2012
ER -