TY - GEN
T1 - Competitive routing of virtual circuits with unknown duration
AU - Awerbuch, Baruch
AU - Azar, Yossi
AU - Plotkin, Serge
AU - Waarts, Orli
N1 - Funding Information:
1A preliminary version of this paper was presented at the 5th ACM-SIAM Symposium on Discrete Algorithms, January 1994. 2Supported by Air Force Contract TNDGAFOSR-86-0078, ARO Contract DAAL03-86-K-0171, NSF Contract 9114440-CCR, DARPA Contract N00014-J-92-1799, and a special grant from IBM. E-mail: baruch theory.lcs.mit.edu. 3E-mail: azar math.tau.ac.il. Research supported in part by the Israel Science Foundation and by the US Israel Binational Science Foundation (BSF). 4Research supported by U.S. Army Research Office Grant DAAL-03-91-G-0102, NSF Grant CCR-9304971, and by Mitsubishi Electric Laboratories. E-mail: plotkin cs.stanfod.edu. 5A portion of this work was done while the author was at IBM Almaden Research Center. E-mail: waarts cs.berkeley.edu.
PY - 1994
Y1 - 1994
N2 - In this paper we present a strategy to route unknown duration virtual circuits in a high-speed communication network. Previous work on virtual circuit routing concentrated on the case where the call duration is known in advance. We show that by allowing O(log n) reroutes per call, we can achieve O(log n) competitive ratio with respect to the maximum load (congestion) for the unknown duration case, were n is the number of nodes in the network. This is in contrast to the Ω(4√n) lower bound on the competitive ratio for this case if no rerouting is allowed. Our routing algorithm can be also applied in the context of machine load balancing of tasks with unknown duration. We present an algorithm that makes O(log n) reassignments per task and achieves O(log n) competitive ratio with respect to the load, where n is the number of parallel machines. The previously known algorithm that achieves polylogarithmic competitive ratio for load balancing of tasks with unknown duration dealt only with the special case of unit-load tasks where each task can be assigned to one of a subset of machines.
AB - In this paper we present a strategy to route unknown duration virtual circuits in a high-speed communication network. Previous work on virtual circuit routing concentrated on the case where the call duration is known in advance. We show that by allowing O(log n) reroutes per call, we can achieve O(log n) competitive ratio with respect to the maximum load (congestion) for the unknown duration case, were n is the number of nodes in the network. This is in contrast to the Ω(4√n) lower bound on the competitive ratio for this case if no rerouting is allowed. Our routing algorithm can be also applied in the context of machine load balancing of tasks with unknown duration. We present an algorithm that makes O(log n) reassignments per task and achieves O(log n) competitive ratio with respect to the load, where n is the number of parallel machines. The previously known algorithm that achieves polylogarithmic competitive ratio for load balancing of tasks with unknown duration dealt only with the special case of unit-load tasks where each task can be assigned to one of a subset of machines.
UR - http://www.scopus.com/inward/record.url?scp=0028337894&partnerID=8YFLogxK
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:0028337894
SN - 0898713293
T3 - Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms
SP - 321
EP - 327
BT - Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms
PB - Association for Computing Machinery (ACM)
T2 - Proceedings of the Fifth Annual SIAM Symposium on Discrete Algorithms
Y2 - 23 January 1994 through 25 January 1994
ER -