Close to linear space routing schemes

Liam Roditty; Roei Tov

doi:10.1007/978-3-662-45174-8_13

Close to linear space routing schemes

Liam Roditty, Roei Tov

Department of Computer Science

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

Abstract

Let G = (V,E) be an unweighted undirected graph with n-vertices and m-edges, and let k > 2 be an integer. We present a routing scheme with a poly-logarithmic header size, that given a source s and a destination t at distance Δ from s, routes a message from s to t on a path whose length is O(kΔ + m^1/k). The total space used by our routing scheme is Õ (mnO(1/), which is almost linear in the number of edges of the graph. We present also a routing scheme with Õ(nO(1/) header size, and the same stretch (up to constant factors). In this routing scheme, the routing table of every v ∈ V is at most Õ(knO(1/)deg(v)), where deg(v) is the degree of v in G. Our results are obtained by combining a general technique of Bernstein [6], that was presented in the context of dynamic graph algorithms, with several new ideas and observations.

Original language	English
Title of host publication	Distributed Computing - 28th International Symposium, DISC 2014, Proceedings
Editors	Fabian Kuhn
Publisher	Springer Verlag
Pages	182-196
Number of pages	15
ISBN (Electronic)	9783662451731
DOIs	https://doi.org/10.1007/978-3-662-45174-8_13
State	Published - 2014
Event	28th International Symposium on Distributed Computing, DISC 2014 - Austin, United States Duration: 12 Oct 2014 → 15 Oct 2014

Publication series

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

Conference

Conference	28th International Symposium on Distributed Computing, DISC 2014
Country/Territory	United States
City	Austin
Period	12/10/14 → 15/10/14

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2014.

Access to Document

10.1007/978-3-662-45174-8_13

Cite this

Roditty, L., & Tov, R. (2014). Close to linear space routing schemes. In F. Kuhn (Ed.), Distributed Computing - 28th International Symposium, DISC 2014, Proceedings (pp. 182-196). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8784). Springer Verlag. https://doi.org/10.1007/978-3-662-45174-8_13

@inproceedings{009be21eb70241f2b4143a41f6c9020b,

title = "Close to linear space routing schemes",

abstract = "Let G = (V,E) be an unweighted undirected graph with n-vertices and m-edges, and let k > 2 be an integer. We present a routing scheme with a poly-logarithmic header size, that given a source s and a destination t at distance Δ from s, routes a message from s to t on a path whose length is O(kΔ + m1/k). The total space used by our routing scheme is {\~O} (mnO(1/), which is almost linear in the number of edges of the graph. We present also a routing scheme with {\~O}(nO(1/) header size, and the same stretch (up to constant factors). In this routing scheme, the routing table of every v ∈ V is at most {\~O}(knO(1/)deg(v)), where deg(v) is the degree of v in G. Our results are obtained by combining a general technique of Bernstein [6], that was presented in the context of dynamic graph algorithms, with several new ideas and observations.",

author = "Liam Roditty and Roei Tov",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2014.; 28th International Symposium on Distributed Computing, DISC 2014 ; Conference date: 12-10-2014 Through 15-10-2014",

year = "2014",

doi = "10.1007/978-3-662-45174-8_13",

language = "אנגלית",

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

publisher = "Springer Verlag",

pages = "182--196",

editor = "Fabian Kuhn",

booktitle = "Distributed Computing - 28th International Symposium, DISC 2014, Proceedings",

address = "גרמניה",

}

Roditty, L & Tov, R 2014, Close to linear space routing schemes. in F Kuhn (ed.), Distributed Computing - 28th International Symposium, DISC 2014, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8784, Springer Verlag, pp. 182-196, 28th International Symposium on Distributed Computing, DISC 2014, Austin, United States, 12/10/14. https://doi.org/10.1007/978-3-662-45174-8_13

Close to linear space routing schemes. / Roditty, Liam; Tov, Roei.
Distributed Computing - 28th International Symposium, DISC 2014, Proceedings. ed. / Fabian Kuhn. Springer Verlag, 2014. p. 182-196 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8784).

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

TY - GEN

T1 - Close to linear space routing schemes

AU - Roditty, Liam

AU - Tov, Roei

PY - 2014

Y1 - 2014

N2 - Let G = (V,E) be an unweighted undirected graph with n-vertices and m-edges, and let k > 2 be an integer. We present a routing scheme with a poly-logarithmic header size, that given a source s and a destination t at distance Δ from s, routes a message from s to t on a path whose length is O(kΔ + m1/k). The total space used by our routing scheme is Õ (mnO(1/), which is almost linear in the number of edges of the graph. We present also a routing scheme with Õ(nO(1/) header size, and the same stretch (up to constant factors). In this routing scheme, the routing table of every v ∈ V is at most Õ(knO(1/)deg(v)), where deg(v) is the degree of v in G. Our results are obtained by combining a general technique of Bernstein [6], that was presented in the context of dynamic graph algorithms, with several new ideas and observations.

AB - Let G = (V,E) be an unweighted undirected graph with n-vertices and m-edges, and let k > 2 be an integer. We present a routing scheme with a poly-logarithmic header size, that given a source s and a destination t at distance Δ from s, routes a message from s to t on a path whose length is O(kΔ + m1/k). The total space used by our routing scheme is Õ (mnO(1/), which is almost linear in the number of edges of the graph. We present also a routing scheme with Õ(nO(1/) header size, and the same stretch (up to constant factors). In this routing scheme, the routing table of every v ∈ V is at most Õ(knO(1/)deg(v)), where deg(v) is the degree of v in G. Our results are obtained by combining a general technique of Bernstein [6], that was presented in the context of dynamic graph algorithms, with several new ideas and observations.

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

U2 - 10.1007/978-3-662-45174-8_13

DO - 10.1007/978-3-662-45174-8_13

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84910641458

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

SP - 182

EP - 196

BT - Distributed Computing - 28th International Symposium, DISC 2014, Proceedings

A2 - Kuhn, Fabian

PB - Springer Verlag

T2 - 28th International Symposium on Distributed Computing, DISC 2014

Y2 - 12 October 2014 through 15 October 2014

ER -

Close to linear space routing schemes

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this