1768 search results - page 7 / 354 » Optimal routing in Chord |
WCW
2004
Springer
14 years 21 days ago
2004
Springer
Distributed hash tables are increasingly being proposed as the core substrate for content delivery applications in the Internet, such as cooperative Web caches, Web index and sear...
COMPUTING
2010
13 years 4 months ago
2010
We design improved approximation algorithms for two variants of the ADM minimization problem. SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET/WDM rings. T...
INFOCOM
2003
IEEE
14 years 20 days ago
2003
IEEE
— Structured peer-to-peer overlay networks such as CAN, Chord, Pastry, and Tapestry can be used to implement Internet-scale application-level multicast. There are two general app...
EUROPAR
2004
Springer
14 years 23 days ago
2004
Springer
In hot-potato (deflection) routing, nodes in the network have no buffers for packets in transit, so that some conflicting packets must be deflected away from their destination...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
A Meyniel graph is a graph in which every odd cycle of length at least five has two chords. We present a linear-time algorithm that colors optimally the vertices of a Meyniel grap...