MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "Universal Routing Schemes." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

13 documents found, showing 1 through 10. Next 10 →

ATOM

Universal Routing Schemes
by Pierre Fraigniaud, Cyril Gavoille — 1997 — Journal of Distributed Computing
…Universal Routing Schemes Pierre Fraigniaud and Cyril Gavoille Laboratoire de l'Informatique du…
Cited by 31 (6 self) – Add To MetaCart

Memory Requirement for Universal Routing Schemes
by Pierre Fraigniaud, Cyril Gavoille, Ecole Normale — 1995 — In 14 th Annual ACM Symposium on Principles of Distributed Computing (PODC
…Memory Requirement for Universal Routing Schemes Pierre Fraigniaud and Cyril Gavoille fpfraign…
Cited by 20 (7 self) – Add To MetaCart

Local memory requirement for universal routing schemes
by Pierre Fraigniaud, Pierre Fraigniaud, Cyril Gavoille, Cyril Gavoille — 1996 — In 8th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA
… associée au CNRS n°1398 Local Memory Requirement of Universal Routing Schemes Pierre Fraigniaud Cyril…
Cited by 9 (1 self) – Add To MetaCart

Abstract Compact Routing on Power Law Graphs with Additive Stretch ∗
by unknown authors
…-Zwick universal multiplicative stretch 3 scheme has recently been suggested for routing on the Internet inter…
Add To MetaCart

Compact routing on power-law graphs with additive stretch
by Arthur Brady, Lenore Cowen — 2006 — in ALENEX
… We present a universal routing scheme for unweighted, undirected networks that always routes a packet…
Cited by 3 (0 self) – Add To MetaCart

Lower Bounds for Compact Routing (Extended Abstract)
by Evangelos Kranakis, Danny Krizanc — 1995 — In 17th International Symposium on Theoretical Aspects of Computer Science
…-case lower bounds for interval routing. For the case of universal routing schemes we give (3) networks on n…
Cited by 1 (0 self) – Add To MetaCart

Memory Requirement for Routing in Distributed Networks
by Cyril Gavoille, Stéphane Pérennès, Cyril Gavoille — 1995 — In 15 th Annual ACM Symposium on Principles of Distributed Computing (PODC
… but it exists, as routing tables do. The shortest path interval routing scheme is therefore called universal…
Cited by 24 (5 self) – Add To MetaCart

Reducing Maximum Stretch in Compact Routing
by Mihaela Enachescu, Mei Wang, Ashish Goel
… that universal routing schemes cannot achieve stretch less than 3 with o(n) memory at each node [5]. A. Our…
Add To MetaCart

Routing in Distributed Networks: Overview and Open Problems
by Cyril Gavoille — 2001 — ACM SIGACT News - Distributed Computing Column
…(u). A strategy is universal if it provides a routing scheme for any graph. We denote R u…
Cited by 38 (10 self) – Add To MetaCart

Lower Bounds for Interval Routing on 3-Regular Networks
by Cyril Gavoille, Stéphane Pérennès, Universit'e De Nice-sophia Antipolis — 1996
… that it is not possible to find a "compact" routing scheme for all networks, i.e., universal routing schemes that produce…
Cited by 8 (1 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB