Sciweavers

68 search results - page 4 / 14
» Scalable Clustering of Internet Paths by Shared Congestion
Sort
View
SIGCOMM
2004
ACM
14 years 28 days ago
An algebraic approach to practical and scalable overlay network monitoring
Overlay network monitoring enables distributed Internet applications to detect and recover from path outages and periods of degraded performance within seconds. For an overlay net...
Yan Chen, David Bindel, Han Hee Song, Randy H. Kat...
ISPA
2004
Springer
14 years 26 days ago
A Congestion-Aware Search Protocol for Unstructured Peer-to-Peer Networks
Peer-to-Peer (P2P) file sharing is the hottest, fastest growing application on the Internet. When designing Gnutella-like applications, the most important consideration is the sca...
Kin Wah Kwong, Danny H. K. Tsang
IPTPS
2004
Springer
14 years 26 days 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...
GC
2004
Springer
14 years 27 days ago
BGP-Based Clustering for Scalable and Reliable Gossip Broadcast
This paper presents a locality-based dissemination graph algorithm for scalable reliable broadcast. Our algorithm scales in terms of both network and memory usage. Processes only h...
M. Brahami, Patrick Th. Eugster, Rachid Guerraoui,...
COREGRID
2007
Springer
14 years 1 months ago
Synthetic Coordinates for Disjoint Multipath Routing
We address the problem of routing packets on multiple, router-disjoint, paths in the Internet using large-scale overlay networks. Multipath routing can improve Internet QoS, by rou...
Andrei Agapi, Thilo Kielmann, Henri E. Bal