23 search results - page 3 / 5 » Name-independent compact routing in trees |
161
Voted
WWCA
1998
Springer
15 years 1 months ago
1998
Springer
In an open network such as the Internet, multicast security services typically start with group session-key distribution. Considering scalability for group communication among wide...
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...
65
Voted
SWAT
2004
Springer
15 years 3 months ago
2004
Springer
In this paper we introduce a new notion of collective tree spanners. We say that a graph G = (V, E) admits a system of µ collective additive tree r-spanners if there is a system T...
ICNP
2007
IEEE
15 years 3 months ago
2007
IEEE
—Data structures representing directed graphs with edges labeled by symbols from a finite alphabet are used to implement packet processing algorithms used in a variety of network...
93
Voted
WDAG
2007
Springer
15 years 3 months ago
2007
Springer
Communication in networks suffers if a link fails. When the links are edges of a tree that has been chosen from an underlying graph of all possible links, a broken link even disco...