Survey on oblivious routing strategies

Harald Räcke

doi:10.1007/978-3-642-03073-4_43

Survey on oblivious routing strategies

Harald Räcke

University of Warwick

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

31 Scopus citations

Abstract

We give a survey about recent advances in the design of oblivious routing algorithms. These routing algorithms choose their routing paths independent of the traffic in the network and they are therefore very well suited for distributed environments in which no central entitiy exist that could make routing decisions based on the whole traffic pattern in the network.

Original language	English
Title of host publication	Mathematical Theory and Computational Practice - 5th Conference on Computability in Europe, CiE 2009, Proceedings
Pages	419-429
Number of pages	11
DOIs	https://doi.org/10.1007/978-3-642-03073-4_43
State	Published - 2009
Externally published	Yes
Event	5th Conference on Computability in Europe, CiE 2009 - Heidelberg, Germany Duration: 19 Jul 2009 → 24 Jul 2009

Publication series

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

Conference

Conference	5th Conference on Computability in Europe, CiE 2009
Country/Territory	Germany
City	Heidelberg
Period	19/07/09 → 24/07/09

Access to Document

10.1007/978-3-642-03073-4_43

Cite this

Räcke, H. (2009). Survey on oblivious routing strategies. In Mathematical Theory and Computational Practice - 5th Conference on Computability in Europe, CiE 2009, Proceedings (pp. 419-429). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5635 LNCS). https://doi.org/10.1007/978-3-642-03073-4_43

@inproceedings{4974b183755143ad971fae613320e53d,

title = "Survey on oblivious routing strategies",

abstract = "We give a survey about recent advances in the design of oblivious routing algorithms. These routing algorithms choose their routing paths independent of the traffic in the network and they are therefore very well suited for distributed environments in which no central entitiy exist that could make routing decisions based on the whole traffic pattern in the network.",

author = "Harald R{\"a}cke",

year = "2009",

doi = "10.1007/978-3-642-03073-4_43",

language = "English",

isbn = "3642030726",

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

pages = "419--429",

booktitle = "Mathematical Theory and Computational Practice - 5th Conference on Computability in Europe, CiE 2009, Proceedings",

note = "5th Conference on Computability in Europe, CiE 2009 ; Conference date: 19-07-2009 Through 24-07-2009",

}

Räcke, H 2009, Survey on oblivious routing strategies. in Mathematical Theory and Computational Practice - 5th Conference on Computability in Europe, CiE 2009, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5635 LNCS, pp. 419-429, 5th Conference on Computability in Europe, CiE 2009, Heidelberg, Germany, 19/07/09. https://doi.org/10.1007/978-3-642-03073-4_43

Survey on oblivious routing strategies. / Räcke, Harald.
Mathematical Theory and Computational Practice - 5th Conference on Computability in Europe, CiE 2009, Proceedings. 2009. p. 419-429 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5635 LNCS).

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

TY - GEN

T1 - Survey on oblivious routing strategies

AU - Räcke, Harald

PY - 2009

Y1 - 2009

N2 - We give a survey about recent advances in the design of oblivious routing algorithms. These routing algorithms choose their routing paths independent of the traffic in the network and they are therefore very well suited for distributed environments in which no central entitiy exist that could make routing decisions based on the whole traffic pattern in the network.

AB - We give a survey about recent advances in the design of oblivious routing algorithms. These routing algorithms choose their routing paths independent of the traffic in the network and they are therefore very well suited for distributed environments in which no central entitiy exist that could make routing decisions based on the whole traffic pattern in the network.

UR - http://www.scopus.com/inward/record.url?scp=76249099406&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-03073-4_43

DO - 10.1007/978-3-642-03073-4_43

M3 - Conference contribution

AN - SCOPUS:76249099406

SN - 3642030726

SN - 9783642030727

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 419

EP - 429

BT - Mathematical Theory and Computational Practice - 5th Conference on Computability in Europe, CiE 2009, Proceedings

T2 - 5th Conference on Computability in Europe, CiE 2009

Y2 - 19 July 2009 through 24 July 2009

ER -

Survey on oblivious routing strategies

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this