TY - GEN
T1 - An O(logn)-competitive online centralized randomized packet-routing algorithm for lines
AU - Even, Guy
AU - Medina, Moti
PY - 2010
Y1 - 2010
N2 - We study the problem of online packet routing in dynamic store-and-forward directed line networks. We present a centralized randomized online algorithm that achieves a throughput that is O(logn)-competitive, where n denotes the number of nodes. Our algorithm is applicable to all values of buffer sizes and communication link capacities. In particular, it holds also for unit buffers. This algorithm improves the best previous O(log2 n)-competitive ratio of [6] and considers links with unit capacities.
AB - We study the problem of online packet routing in dynamic store-and-forward directed line networks. We present a centralized randomized online algorithm that achieves a throughput that is O(logn)-competitive, where n denotes the number of nodes. Our algorithm is applicable to all values of buffer sizes and communication link capacities. In particular, it holds also for unit buffers. This algorithm improves the best previous O(log2 n)-competitive ratio of [6] and considers links with unit capacities.
UR - http://www.scopus.com/inward/record.url?scp=77955336461&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-14162-1_12
DO - 10.1007/978-3-642-14162-1_12
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:77955336461
SN - 3642141617
SN - 9783642141614
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 139
EP - 150
BT - Automata, Languages and Programming - 37th International Colloquium, ICALP 2010, Proceedings
T2 - 37th International Colloquium on Automata, Languages and Programming, ICALP 2010
Y2 - 6 July 2010 through 10 July 2010
ER -