Sciweavers

118 search results - page 24 / 24
» The Performance of Routing Algorithms under Bursty Traffic L...
Sort
View
CORR
2010
Springer
180views Education» more  CORR 2010»
13 years 5 months ago
Dependability in Aggregation by Averaging
Abstract. Aggregation is an important building block of modern distributed applications, allowing the determination of meaningful properties (e.g. network size, total storage capac...
Paulo Jesus, Carlos Baquero, Paulo Sérgio A...
RSA
2000
170views more  RSA 2000»
13 years 5 months ago
Delayed path coupling and generating random permutations
We analyze various stochastic processes for generating permutations almost uniformly at random in distributed and parallel systems. All our protocols are simple, elegant and are b...
Artur Czumaj, Miroslaw Kutylowski
NOMS
2008
IEEE
139views Communications» more  NOMS 2008»
13 years 11 months ago
Fast similarity search in peer-to-peer networks
Abstract—Peer-to-peer (P2P) systems show numerous advantages over centralized systems, such as load balancing, scalability, and fault tolerance, and they require certain function...
Thomas Bocek, Ela Hunt, David Hausheer, Burkhard S...