625 search results - page 59 / 125 » Semi-preemptive routing on trees |
ICNP
1998
IEEE
15 years 4 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...
104
click to vote
APPINF
2003
15 years 1 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...
101
Voted
ICNP
2006
IEEE
15 years 6 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 ...
110
click to vote
ISPD
2005
ACM
15 years 6 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...
123
click to vote
LCN
2000
IEEE
15 years 5 months ago
2000
IEEE
This paper proposes a solution to delivering multicast data reliably not only to/from fixed hosts but also to/from mobile hosts in combined fixed/mobile IP networks, particularl...