Search Sciweavers | Sciweavers

1061 search results - page 7 / 213

» On Compact Routing for the Internet

click to vote

PODC
2003
ACM

126views Distributed And Parallel Com...» more PODC 2003»

Compact roundtrip routing with topology-independent node names

15 years 2 months ago

Download www.cs.tufts.edu

This paper presents compact roundtrip routing schemes with local tables of size ˜O( √ n) and stretch 6 for any directed network with arbitrary edge weights; and with local tabl...

Marta Arias, Lenore Cowen, Kofi A. Laing

claim paper

Read More »

click to vote

STACS
2007
Springer

131views Theoretical Computer Science» more STACS 2007»

Compact Forbidden-Set Routing

15 years 3 months ago

Download www.usukita.org

We study the following problem. Given a weighted planar graph G, assign labels L(v) to vertices so that given L(u), L(v) and L(x) for x ∈ X for any X ⊂ V (G), compute the dist...

Bruno Courcelle, Andrew Twigg

claim paper

Read More »

click to vote

SPAA
2005
ACM

103views Distributed And Parallel Com...» more SPAA 2005»

A space lower bound for name-independent compact routing in trees

15 years 3 months ago

Download www.cs.tufts.edu

Kofi A. Laing, Rajmohan Rajaraman

claim paper

Read More »