266 search results - page 17 / 54 » Distributed Routing in Tree Networks with Few Landmarks |
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
Wireless Sensor Networks (WSNs) are characterized by having scarce resources. The usual way of designing network functions is to consider them isolatedly, a strategy which may not...
IPPS
1999
IEEE
13 years 11 months ago
1999
IEEE
For hypercube networks which have faulty nodes, a few ecient dynamic routing algorithms have been proposed by allowing each node to hold the status of neighbors. We propose two im...
WCW
2004
Springer
14 years 25 days ago
2004
Springer
Internet overlay services must adapt to the substrate network topology and link properties to achieve high performance. A common overlay structure management layer is desirable fo...
PODC
2003
ACM
14 years 22 days ago
2003
ACM
This paper presents compact roundtrip routing schemes with local tables of size ˜O( √ n) and stretch 6 for any directed network with arbitrary edge weights; and with local tabl...
CLUSTER
2005
IEEE
14 years 1 months ago
2005
IEEE
Data intensive applications on clusters often require requests quickly be sent to the node managing the desired data. In many applications, one must look through a sorted tree str...