830 search results - page 84 / 166 » Route kernels for trees |
127
click to vote
ICNP
1998
IEEE
15 years 8 months ago
1998
IEEE
In Internet multicast, the set of receivers can be dynamic with receivers joining and leaving a group asynchronously and without the knowledge of the sources. The Internet today u...
136
click to vote
APPINF
2003
15 years 5 months ago
2003
In direct interconnection networks, the collective communication operation one to all, which is usually referred to as broadcasting, can be generalized to allow one source node to...
138
click to vote
ICNP
2006
IEEE
15 years 10 months ago
2006
IEEE
— Routing in multi-hop wireless networks involves the indirection from a persistent name (or ID) to a locator. Concepts such as coordinate space embedding help reduce the number ...
127
click to vote
CONEXT
2008
ACM
15 years 6 months ago
2008
ACM
Virtual routers are a promising way to provide network services such as customer-specific routing, policy-based routing, multi-topology routing, and network virtulization. However...
143
click to vote
ISPD
2005
ACM
15 years 9 months ago
2005
ACM
In this paper, we present a very fast and accurate rectilinear Steiner minimal tree (RSMT)1 algorithm called FLUTE. The algorithm is an extension of the wirelength estimation appr...