Chameleon: An adaptable 2-tier variable hop overlay

2009 6th IEEE Consumer Communications and Networking Conference, CCNC 2009

Volumn , Issue , 2009, Pages

  Brown, Alan ^a   Kolberg, Mario ^b   Buford, John ^c  

^a Logica   (United Kingdom)

^b UNIVERSITY OF STIRLING   (United Kingdom)

^c AVAYA LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

TELECOMMUNICATION NETWORKS; TELECOMMUNICATION SYSTEMS; WIRELESS NETWORKS;

ACTIVE ROUTING; ACTIVE STABILIZATIONS; AVAILABLE BANDWIDTHS; BANDWIDTH REQUIREMENTS; DETAILED DESIGNS; HIGH BANDWIDTHS; HOP COUNTS; MULTI HOPS; OPPORTUNISTIC ROUTING; SIMULATION RESULTS; STAND-ALONE ALGORITHMS; STRUCTURED PEER TO PEERS;

BANDWIDTH;

EID: 63749097908     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCNC.2009.4784716     Document Type: Conference Paper

References (14)

1. J. Li, J. Stribling, R. Morris, M. F. Kaashoek and T. M. Gil. A Performance vs. Cost Framework for Evaluating DHT Design Tradeoffs under Churn. Proceedings of 24th IEEE Infocom, 2005.
2. J. Li, J. Stribling, R. Morris and M.F. Kaashoek. Bandwidth-efficient management of DHT routing tables. Proc of 2nd Symposium on Networked System Design and Implementation (NSDI'05), 2005.
3. J. Buford, A.Brown, M.Kolberg. Analysis of an Active Maintenance Algorithm for an O(1)-Hop Overlay. IEEE Globecom 2007.
4. A. Brown, M.Kolber and, J. Buford. An Adaptable Service Overlay for Wide Area Network Service Discovery, IEEE Globecom WS, 2007.
5. L. Monnerat and C. Amorim. DIHT: A Distributed One Hop Hash Table. In Proc of the 20th IEEE Intl Parallel & Distributed Processing Symposium (IPDPS), April 2006.
6. A. Brown, M.Kolberg and J.Buford. Tork: A Variable-Hop Overlay for Heterogeneous Networks. 4th IEEE Mobile Peer-to-Peer Computing (MP2P'07) NY, USA, March 2007.
7. nd Quarter 2005, Vol 7(2).
8. B. Leong, B. Liskov, E.D. Demaine. EpiChord: Parallelizing the Chord Lookup Algorithm with Reactive Routing State Management. Computer Communications, Elsevier Science, Vol. 29, pp. 1243-1259.
9. J. Buford, A. Brown and M. Kolberg. Exploiting Parallelism in the Design of Peer-to-Peer Overlays, Computer Communications Journal, Elsevier Science, Vol. 31(3), Feb. 2008.
10. J. Buford, A. Brown and M. Kolberg. Parallelizing Peer-to-Peer Overlays with Multi-Destination Routing. IEEE Consumer Communications and Networking Conference (CCNC) 2007.
11. J. Risson and T. Moors: Survey of research towards robust peer-to-peer networks: Search methods, Computer Networks, Elsevier Science, Vol. 50, pp 3485 - 3521.
12. P. Antoniadis, C. Courcoubetis, R. Mason. Comparing economic incentives in peer-to-peer networks. Computer Networks Journal, Elsevier Science, Volume 46(1), 2004, Pages 133-146.
13. P. Golle , K. Leyton-Brown , I. Mironov. Incentives for sharing in peer-to-peer networks. Proceedings of 3rd ACM conference on Electronic Commerce 2001, p.264-267.
14. K. Lai, M. Feldman, I. Stoica, J. Chuang. Incentives for cooperation in peer-to-peer networks. Proceedings of the Workshop on Economics of Peer-to-Peer Systems, 2003.