Bandwidth and latency model for DHT based peer-to-peer networks under variable churn

Proceedings - 2005 Systems Communications: ICW 2005, Wireless - ICHSN 2005, High Speed Networks - ICMCS 2005, Multimedia Communications Systems - SENET 2005, Sensor Networks

Volumn 2005, Issue , 2005, Pages 320-325

  Kumar, Praveen ^a   Sridhar, G ^a   Sridhar, V ^a  

^a TIFR IISc Campus   (India)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BANDWIDTH; COMPUTATIONAL COMPLEXITY; DISTRIBUTED COMPUTER SYSTEMS; INFORMATION RETRIEVAL; PARETO PRINCIPLE; ROUTERS;

CHURN; DISTRIBUTED HASH TABLE (DHT); NON-UNIFORM BANDWIDTH NODES; PEER-TO-PEER (P2P) ALGORITHMS;

COMPUTER NETWORKS;

EID: 33646910826     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICW.2005.31     Document Type: Conference Paper

References (17)

1. P.A. Felber et.al, "Data Indexing and Querying in DHT Peer-to-Peer Networks", In 24th International Conference on Distributed Computing Systems (ICDCS 2004), March 23-26, 2004. Tokyo, Japan.
2. M. Frans Kaashoek and D. R. Karger, "Koorde: A simple degree optimal hash table", In Second International Workshop on Peer-to-Peer Systems (IPTPS 2003).
3. A. Gupta et.al, "One hop lookups for peer-to-peer overlays", In Proceedings of the Ninth Workshop on Hot Topics in Operating Systems, May 2003.
4. I. Gupta et.al, "Kelips: Building an efficient and stable P2P DHT through increased memory and background overhead", In Second International Workshop on Peer-to-Peer Systems (IPTPS 2003).
5. D. Kato, "Latency Model of a Distributed Hash Table with Big Routing Table", In Fourth International Conference on Peer-to-Peer Computing (P2P'04), August 25-27, 2004. Zurich, Switzerland.
6. G. Kwon and K.D Ryu, "BYPASS: Topology-Aware Lookup Overlay for DHT-based P2P File Locating Services", In 10th IEEE International Conference on Parallel and Distributed Systems (ICPADS'04), CA, July 2004.
7. J. Ledlie and M. Seltzer, "Distributed, Secure Load Balancing with Skew, Heterogeneity, and Churn", In IEEE Infocom 2005, Miami, March 13-17, 2005.
8. J. Li et.al, "A performance vs. Cost framework for evaluating DHT design tradeoffs under churn", In IEEE Infocom 2005, Miami, March 13-17, 2005.
9. nd Symposium on Networked Systems Design and Implementation (NSDI'05), May 2-4, 2005. Boston, MA.
10. P. Maymounkov and D. Mazieres, "Kademlia: A peer-to-peer information system based on the XOR metric", In the First International Workshop on Peer-to-Peer Systems (IPTPS 2002), March 2002.
11. S. Rhea et.al, "Handling Churn in a DHT", In the USENIX Annual Technical Conference, June 2004.
12. R. Rodrigues and C. Blake, "When Multi-Hop Peer-to-Peer Lookup Matters", In Third International Workshop on Peer-to-Peer Systems (IPTPS04), Feb 2004, CA, USA.
13. A. Rowstron and P. Druschel, "Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems", In 18th IFIP/ACM Conference on Distributed Systems Platforms, November 2001.
14. I. Stoica et.al, "Chord: A scalable peer-to-peer lookup protocol for Internet applications", In IEEE/ACM Transactions on Networking, pages 149-160, 2002.
15. D. Stutzbach and R. Rejaie, "Towards a Better Understanding of Churn in Peer-to-Peer Networks", Technical Report CIS-TR-04-06, Dept of Computer Science, University of Oregon, November 2004.
16. B. Y. Zhao et.al, "Tapestry: A resilient global-scale overlay for service deployment", In IEEE Journal on Selected Areas in Communications, 22(1): 41-53, Jan 2004.
17. "p2psim - A simulator for peer-to-peer protocols", Available online at http://www.pdos.lcs.mit.edu/p2psim/.