Sciweavers

349 search results - page 70 / 70
» Bandwidth-Aware Routing in Overlay Networks
Sort
View
CCR
2002
103views more  CCR 2002»
13 years 4 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...
PODC
2009
ACM
13 years 11 months ago
Fast scalable deterministic consensus for crash failures
We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...
Bogdan S. Chlebus, Dariusz R. Kowalski, Michal Str...
ICPP
2007
IEEE
13 years 11 months ago
ASAP: An Advertisement-based Search Algorithm for Unstructured Peer-to-peer Systems
— Most of existing search algorithms for unstructured peer-to-peer (P2P) systems share one common approach: the requesting node sends out a query and the query message is repeate...
Peng Gu, Jun Wang, Hailong Cai
CORR
2010
Springer
224views Education» more  CORR 2010»
13 years 4 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