266 search results - page 34 / 54 » Distributed Routing in Tree Networks with Few Landmarks |
QUESTA
2008
13 years 7 months ago
2008
We consider a discrete-time tree network of polling servers where all packets are routed to the same node (called node 0), from which they leave the network. All packets have unit...
ICDCS
2003
IEEE
14 years 25 days ago
2003
IEEE
In a system proposed by Plaxton, Rajaraman and Richa (PRR), the expected cost of accessing a replicated object was proved to be asymptotically optimal for a static set of nodes an...
TPDS
2008
13 years 7 months ago
2008
To construct an efficient overlay network, the information of underlay is important. We consider using end-to-end measurement tools such as traceroute to infer the underlay topolog...
AINTEC
2006
Springer
13 years 11 months ago
2006
Springer
AOMP (Ad-hoc Overlay Multicast Protocol) is a novel approach for application-layer multicast in ad-hoc networks. We introduce in this paper a new algorithm that exploits a few prop...
SIGCOMM
1994
ACM
13 years 11 months ago
1994
ACM
Existing multicast routing mechanisms were intended for use within regions where a group is widely represented or bandwidth is universally plentiful. When group members, and sende...