Incentives for sharing in peer-to-peer networks
Proceedings of the 3rd ACM conference on Electronic Commerce
Comparing economic incentives in peer-to-peer networks
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Internet economics: Pricing and policies
Survey of research towards robust peer-to-peer networks: search methods
Computer Networks: The International Journal of Computer and Telecommunications Networking
Bandwidth-efficient management of DHT routing tables
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Tork: A Variable-Hop Overlay for Heterogeneous Networks
PERCOMW '07 Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops
Exploiting parallelism in the design of peer-to-peer overlays
Computer Communications
EpiChord: Parallelizing the Chord lookup algorithm with reactive routing state management
Computer Communications
D1HT: a distributed one hop hash table
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
A survey and comparison of peer-to-peer overlay network schemes
IEEE Communications Surveys & Tutorials
On the dimensioning of an aggregation service for P2P service overlay networks
AIMS'11 Proceedings of the 5th international conference on Autonomous infrastructure, management, and security: managing the dynamics of networks and services
| Hi-index | 0.00 |
Structured Peer-to-Peer (P2P) overlays typically offer either multi-hop or one-hop performance. Here we present Chameleon, which offers a variable hop performance trading hop count with bandwidth requirement. Chameleon combines opportunistic and active routing table maintenance techniques into a novel two-tier approach which allows nodes to adapt to variations in their available bandwidth. Chameleon uses opportunistic routing table updates for lower bandwidth nodes and active stabilization for high bandwidth nodes, offering a performance from O(log n)-hop up to O(1)-hops. In doing so its nodes can operate successfully in large scale (mobile) networks where peers need to adapt to continuous changes in the available bandwidth. This paper presents a detailed design of Chameleon and simulation results verify its adaptable performance. We show that significant synergy between the two tiers improves the performance when compared with the standalone algorithms