Sciweavers

50 search results - page 10 / 10
» Scaling all-pairs overlay routing
Sort
View
USITS
2003
13 years 6 months ago
Using Random Subsets to Build Scalable Network Services
In this paper, we argue that a broad range of large-scale network services would benefit from a scalable mechanism for delivering state about a random subset of global participan...
Dejan Kostic, Adolfo Rodriguez, Jeannie R. Albrech...
SIGCOMM
2006
ACM
13 years 11 months ago
Drafting behind Akamai (travelocity-based detouring)
To enhance web browsing experiences, content distribution networks (CDNs) move web content “closer” to clients by caching copies of web objects on thousands of servers worldwi...
Ao-Jan Su, David R. Choffnes, Aleksandar Kuzmanovi...
ICWN
2004
13 years 6 months ago
Searching in Variably Connected P2P Networks
Peer-to-Peer networks are gaining popularity through file-sharing communities. Most P2P networks demand a certain stability from it's nodes in order to function satisfactory. ...
Njål T. Borch, Lars Kristian Vognild
CCR
2002
103views more  CCR 2002»
13 years 5 months ago
King: estimating latency between arbitrary internet end hosts
The ability to estimate network latencies between arbitrary Internet end hosts would enable new measurement studies and applications, such as investigating routing path inefficien...
P. Krishna Gummadi, Stefan Saroiu, Steven D. Gribb...
CORR
2010
Springer
224views Education» more  CORR 2010»
13 years 5 months ago
A Cluster Based Replication Architecture for Load Balancing in Peer-to-Peer Content Distribution
In P2P systems, large volumes of data are declustered naturally across a large number of peers. But it is very difficult to control the initial data distribution because every use...
S. Ayyasamy, S. N. Sivanandam