2076 search results - page 115 / 416 » Universal Routing in Distributed Networks |
IPPS
2006
IEEE
14 years 4 months ago
2006
IEEE
Network line cards are experiencing ever increasing line rates, random data bursts, and limited space. Hence, they are more vulnerable than other processormemory environments, to ...
PPSN
2004
Springer
14 years 3 months ago
2004
Springer
In this paper we present AntHocNet, a new algorithm for routing in mobile ad hoc networks. Due to the ever changing topology and limited bandwidth it is very hard to establish and ...
PDCAT
2007
Springer
14 years 4 months ago
2007
Springer
A circulant graph with n nodes and jumps j1, j2, ..., jm is a graph in which each node i, 0 ≤ i ≤ n−1, is adjacent to all the vertices i±jk mod n, where 1 ≤ k ≤ m. A bi...
PDP
2008
IEEE
14 years 4 months ago
2008
IEEE
The scalability properties of DHT based overlay networks is considered satisfactory. However, in large scale systems this might still cause a problem since they have a logarithmic...
INFOCOM
2003
IEEE
14 years 3 months ago
2003
IEEE
Abstract— Distributed hash table (DHT)-based overlay networks, represented by Pastry, CAN, and Chord, offer an administration-free and fault-tolerant application-level overlay ne...