Sciweavers

69 search results - page 13 / 14
» On the selectivity of multidimensional routing indices
Sort
View
MSWIM
2006
ACM
14 years 1 months ago
The power of choice in random walks: an empirical study
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...
Chen Avin, Bhaskar Krishnamachari
P2P
2003
IEEE
110views Communications» more  P2P 2003»
14 years 24 days ago
Range Addressable Network: A P2P Cache Architecture for Data Ranges
Peer-to-peer computing paradigm is emerging as a scalable and robust model for sharing media objects. In this paper, we propose an architecture and describe the associated algorit...
Anshul Kothari, Divyakant Agrawal, Abhishek Gupta,...
CONEXT
2010
ACM
13 years 5 months ago
The Internet is flat: modeling the transition from a transit hierarchy to a peering mesh
Recent measurements and anecdotal evidence indicate that the Internet ecosystem is rapidly evolving from a multi-tier hierarchy built mostly with transit (customer-provider) links...
Amogh Dhamdhere, Constantine Dovrolis
SIGMETRICS
2004
ACM
131views Hardware» more  SIGMETRICS 2004»
14 years 29 days ago
Failure recovery for structured P2P networks: protocol design and performance evaluation
Measurement studies indicate a high rate of node dynamics in p2p systems. In this paper, we address the question of how high a rate of node dynamics can be supported by structured...
Simon S. Lam, Huaiyu Liu
CN
2006
113views more  CN 2006»
13 years 7 months ago
Failure recovery for structured p2p networks: Protocol design and performance under churn
Measurement studies indicate a high rate of node dynamics in p2p systems. In this paper, we address the question of how high a rate of node dynamics can be supported by structured...
Simon S. Lam, Huaiyu Liu