Sciweavers

365 search results - page 45 / 73
» Fast construction of overlay networks
Sort
View
USITS
2003
15 years 1 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...
ICUMT
2009
14 years 9 months ago
Two-layer network coordinate system for Internet distance prediction
Network coordinate (NC) system is an efficient and scalable system for Internet distance prediction. In this paper, we propose 3 two-layer NC systems HNPS, HBBS and HIDES derived f...
Chengbo Dong, Guodong Wang, Xuan Zhang, Beixing De...
INFOCOM
2003
IEEE
15 years 5 months ago
Associative Search in Peer to Peer Networks: Harnessing Latent Semantics
— The success of a P2P file-sharing network highly depends on the scalability and versatility of its search mechanism. Two particularly desirable search features are scope (abil...
Edith Cohen, Amos Fiat, Haim Kaplan
FOCS
2007
IEEE
15 years 6 months ago
Planning for Fast Connectivity Updates
Understanding how a single edge deletion can affect the connectivity of a graph amounts to finding the graph bridges. But when faced with d > 1 deletions, can we establish as ...
Mihai Patrascu, Mikkel Thorup
IPTPS
2004
Springer
15 years 5 months ago
Cluster Computing on the Fly: P2P Scheduling of Idle Cycles in the Internet
— Peer-to-peer computing, the harnessing of idle compute cycles throughout the Internet, offers exciting new research challenges in the converging domains of networking and distr...
Virginia Mary Lo, Daniel Zappala, Dayi Zhou, Yuhon...