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

Guy Even, Moti Medina

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations

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.

Original languageEnglish
Title of host publicationAutomata, Languages and Programming - 37th International Colloquium, ICALP 2010, Proceedings
Pages139-150
Number of pages12
EditionPART 2
DOIs
StatePublished - 12 Aug 2010
Externally publishedYes
Event37th International Colloquium on Automata, Languages and Programming, ICALP 2010 - Bordeaux, France
Duration: 6 Jul 201010 Jul 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 2
Volume6199 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference37th International Colloquium on Automata, Languages and Programming, ICALP 2010
Country/TerritoryFrance
CityBordeaux
Period6/07/1010/07/10

Fingerprint

Dive into the research topics of 'An O(logn)-competitive online centralized randomized packet-routing algorithm for lines'. Together they form a unique fingerprint.

Cite this