306 search results - page 35 / 62 » Routing Algorithms for Anycast Messages |
GCC
2003
Springer
15 years 5 months ago
2003
Springer
Due to their minimum consideration to an actual network topology, the existing peer-to-peer (P2P) overlay networks will lead to high latency and low efficiency. In TaChord, we pres...
VOSS
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Randomization is of paramount importance in practical applications and randomized algorithms are used widely, for example in co-ordinating distributed computer networks, ...
106
click to vote
IPSN
2007
Springer
15 years 6 months ago
2007
Springer
In this paper we present Beacon Location Service (BLS): a location service for beacon-based routing algorithms like Beacon Vector Routing (BVR) [8] and S4 [19] . The role of a loc...
120
click to vote
HICSS
2008
IEEE
14 years 12 months ago
2008
IEEE
Selecting a small set of nodes called pivots, from all the nodes in a network and maintaining the routing infrastructure to and among each other can reduce routing overhead and ex...
107
click to vote
SIGCOMM
2005
ACM
15 years 5 months ago
2005
ACM
We consider the problem of routing in a delay tolerant network (DTN) in the presence of path failures. Previous work on DTN routing has focused on using precisely known network dy...