An O(logn)-competitive online centralized randomized packet-routing algorithm for lines

Guy Even; Moti Medina

doi:10.1007/978-3-642-14162-1_12

An O(logn)-competitive online centralized randomized packet-routing algorithm for lines

Guy Even^*, Moti Medina

^*Corresponding author for this work

School of Electrical Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

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(log² n)-competitive ratio of [6] and considers links with unit capacities.

Original language	English
Title of host publication	Automata, Languages and Programming - 37th International Colloquium, ICALP 2010, Proceedings
Pages	139-150
Number of pages	12
Edition	PART 2
DOIs	https://doi.org/10.1007/978-3-642-14162-1_12
State	Published - 2010
Event	37th International Colloquium on Automata, Languages and Programming, ICALP 2010 - Bordeaux, France Duration: 6 Jul 2010 → 10 Jul 2010

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Number	PART 2
Volume	6199 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	37th International Colloquium on Automata, Languages and Programming, ICALP 2010
Country/Territory	France
City	Bordeaux
Period	6/07/10 → 10/07/10

Access to Document

10.1007/978-3-642-14162-1_12

Cite this

Even, G., & Medina, M. (2010). An O(logn)-competitive online centralized randomized packet-routing algorithm for lines. In Automata, Languages and Programming - 37th International Colloquium, ICALP 2010, Proceedings (PART 2 ed., pp. 139-150). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6199 LNCS, No. PART 2). https://doi.org/10.1007/978-3-642-14162-1_12

Even, Guy ; Medina, Moti. / An O(logn)-competitive online centralized randomized packet-routing algorithm for lines. Automata, Languages and Programming - 37th International Colloquium, ICALP 2010, Proceedings. PART 2. ed. 2010. pp. 139-150 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 2).

@inproceedings{85656223a7124f8b821b6e4c3c25b72e,

title = "An O(logn)-competitive online centralized randomized packet-routing algorithm for lines",

abstract = "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.",

author = "Guy Even and Moti Medina",

year = "2010",

doi = "10.1007/978-3-642-14162-1_12",

language = "אנגלית",

isbn = "3642141617",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

number = "PART 2",

pages = "139--150",

booktitle = "Automata, Languages and Programming - 37th International Colloquium, ICALP 2010, Proceedings",

edition = "PART 2",

note = "null ; Conference date: 06-07-2010 Through 10-07-2010",

}

Even, G & Medina, M 2010, An O(logn)-competitive online centralized randomized packet-routing algorithm for lines. in Automata, Languages and Programming - 37th International Colloquium, ICALP 2010, Proceedings. PART 2 edn, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 2, vol. 6199 LNCS, pp. 139-150, 37th International Colloquium on Automata, Languages and Programming, ICALP 2010, Bordeaux, France, 6/07/10. https://doi.org/10.1007/978-3-642-14162-1_12

An O(logn)-competitive online centralized randomized packet-routing algorithm for lines. / Even, Guy; Medina, Moti.

Automata, Languages and Programming - 37th International Colloquium, ICALP 2010, Proceedings. PART 2. ed. 2010. p. 139-150 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6199 LNCS, No. PART 2).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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 - פרסום בספר כנס

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

Y2 - 6 July 2010 through 10 July 2010

ER -

Even G, Medina M. An O(logn)-competitive online centralized randomized packet-routing algorithm for lines. In Automata, Languages and Programming - 37th International Colloquium, ICALP 2010, Proceedings. PART 2 ed. 2010. p. 139-150. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 2). doi: 10.1007/978-3-642-14162-1_12

An O(logn)-competitive online centralized randomized packet-routing algorithm for lines

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this