TY - JOUR

T1 - Close to linear space routing schemes

AU - Roditty, Liam

AU - Tov, Roei

N1 - Publisher Copyright:
© 2015, Springer-Verlag Berlin Heidelberg.

PY - 2016/2/1

Y1 - 2016/2/1

N2 - Let (Formula presented.) be an unweighted undirected graph with n vertices and m edges, and let (Formula presented.) 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 (Formula presented.) from s, routes a message from s to t on a path whose length is (Formula presented.). The total space used by our routing scheme is (Formula presented.), which is almost linear in the number of edges of the graph. We present also a routing scheme with (Formula presented.) header size, and the same stretch (up to constant factors). In this routing scheme, the routing table of every(Formula presented.) is at most (Formula presented.), where deg(v) is the degree of v in G. Our results are obtained by combining a general technique of Bernstein (2009), that was presented in the context of dynamic graph algorithms, with several new ideas and observations.

AB - Let (Formula presented.) be an unweighted undirected graph with n vertices and m edges, and let (Formula presented.) 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 (Formula presented.) from s, routes a message from s to t on a path whose length is (Formula presented.). The total space used by our routing scheme is (Formula presented.), which is almost linear in the number of edges of the graph. We present also a routing scheme with (Formula presented.) header size, and the same stretch (up to constant factors). In this routing scheme, the routing table of every(Formula presented.) is at most (Formula presented.), where deg(v) is the degree of v in G. Our results are obtained by combining a general technique of Bernstein (2009), 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=84957849345&partnerID=8YFLogxK

U2 - 10.1007/s00446-015-0256-5

DO - 10.1007/s00446-015-0256-5

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:84957849345

SN - 0178-2770

VL - 29

SP - 65

EP - 74

JO - Distributed Computing

JF - Distributed Computing

IS - 1

ER -