## 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 | |

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.