Efficient, proximity-aware load balancing for structured P2P systems

Proceedings - 3rd International Conference on Peer-to-Peer Computing, P2P 2003

Volumn , Issue , 2003, Pages 220-221

  Zhu, Yingwu ^a   Hu, Yiming ^a  

^a University of Cincinnati   (United States)

Author keywords

Bandwidth; Costs; Intrusion detection; Load management; Peer to peer computing; Tree data structures

Indexed keywords

BANDWIDTH; CLIENT SERVER COMPUTER SYSTEMS; COSTS; DISTRIBUTED COMPUTER SYSTEMS; ELECTRIC LOAD MANAGEMENT; ELECTRIC POWER PLANT LOADS; FORESTRY; HASH FUNCTIONS; INFORMATION MANAGEMENT; INTRUSION DETECTION; NETWORK MANAGEMENT; TREES (MATHEMATICS);

LOAD BALANCING INFORMATIONS; LOAD DISTRIBUTIONS; LOAD TRANSFERRING; PEER-TO-PEER COMPUTING; PROXIMITY AWARE LOAD BALANCING; STRUCTURED P2P SYSTEMS; STRUCTURED PEER-TO-PEER; TREE DATA STRUCTURES;

PEER TO PEER NETWORKS;

EID: 37849039739     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PTP.2003.1231534     Document Type: Conference Paper

References (3)

1. A. Rowstron and P. Druschel. Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In Proceedings of the 18th IFIP/ACM International Conference on Distributed System Platforms (Middleware 2001), Heidelberg, Germany, Nov. 2001.
2. I. Stoica, R. Morris, D. Karger, M. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In Proceedings of ACM SIGCOMM, pages 149-160, San Diego, CA, Aug. 2001.
3. Y. Zhu and Y. Hu. Efficient, proximity-aware load balancing for structured peer-to-peer systems. Technical Report TR-270/04/03/ECECS, University of Cincinnati.