Sciweavers

1325 search results - page 167 / 265
» Quasirandom Load Balancing
Sort
View
INFOCOM
2006
IEEE
15 years 10 months ago
On Heterogeneous Overlay Construction and Random Node Selection in Unstructured P2P Networks
— Unstructured p2p and overlay network applications often require that a random graph be constructed, and that some form of random node selection take place over that graph. A ke...
Vivek Vishnumurthy, Paul Francis
ICMCS
2005
IEEE
80views Multimedia» more  ICMCS 2005»
15 years 9 months ago
Dynamic Server Redirect for Multimedia Service in Distributed Peer-to-Peer Network
Peer-to-Peer (P2P) multimedia application is expected to be one of the most important services supported by the next generation networks. However, how to balance server load in re...
Ming-Ho Hsiao, Suh-Yin Lee
SIGMETRICS
2005
ACM
101views Hardware» more  SIGMETRICS 2005»
15 years 9 months ago
Fundamental bounds on the accuracy of network performance measurements
This paper considers the basic problem of “how accurate can we make Internet performance measurements”. The answer is somewhat counter-intuitive in that there are bounds on th...
Matthew Roughan
ISCC
2003
IEEE
138views Communications» more  ISCC 2003»
15 years 9 months ago
Connectivity Aware Routing - a Method for Finding Bandwidth Constrained Paths Over a Variety of Network Topologies
Multimedia traffic and real-time e-commerce applications can experience quality degradation in traditional networks such as the Internet. These difficulties can be overcome in n...
Karol Kowalik, Martin Collier
PODC
2003
ACM
15 years 9 months ago
Scalable and dynamic quorum systems
We investigate issues related to the probe complexity of quorum systems and their implementation in a dynamic environment. Our contribution is twofold. The first regards the algo...
Moni Naor, Udi Wieder