The hybrid chord protocol: a peer-to-peer lookup service for context-aware mobile applications

Authors:
Stefan Zöls;Rüdiger Schollmeier;Wolfgang Kellerer;Anthony Tarlano
Affiliations:
Institute of Communication Networks, Technical University of Munich, Germany;Institute of Communication Networks, Technical University of Munich, Germany;Future Networking Lab, DoCoMo Communications Laboratories Europe, Germany;Future Networking Lab, DoCoMo Communications Laboratories Europe, Germany
Venue:
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part II
Year:
2005

Citing 10
Cited 2

Chord: A scalable peer-to-peer lookup service for internet applications

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Analyzing peer-to-peer traffic across large networks

Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric

IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Complex Queries in DHT-based Peer-to-Peer Networks

IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems

Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
A Framework for Resource Management in Peer-to-Peer Networks

NODe '02 Revised Papers from the International Conference NetObjectDays on Objects, Components, Architectures, Services, and Applications for a Networked World
Context Spaces Architectural Framework

SAINT-W '04 Proceedings of the 2004 Symposium on Applications and the Internet-Workshops (SAINT 2004 Workshops)
Diminished chord: a protocol for heterogeneous subgroup formation in peer-to-peer networks

IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
Tapestry: a resilient global-scale overlay for service deployment

IEEE Journal on Selected Areas in Communications

Hybrid DHT Design for Mobile Environments

Agents and Peer-to-Peer Computing
Relay ability estimation and topology control using multidimensional context parameters for mobile P2P multicast

EURASIP Journal on Wireless Communications and Networking - Special issue on opportunistic and delay tolerant networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

A fundamental problem in Peer-to-Peer (P2P) overlay networks is how to efficiently find a node that shares a requested object. The Chord protocol is a distributed lookup protocol addressing this problem using hash keys to identify the nodes in the network and also the shared objects. However, when a node joins or leaves the Chord ring, object references have to be rearranged in order to maintain the hash key mapping rules. This leads to a heavy traffic load, especially when nodes stay in the Chord ring only for a short time. In mobile scenarios storage capacity, transmission data rate and battery power are limited resources, so the heavy traffic load generated by the shifting of object references can lead to severe problems when using Chord in a mobile scenario. In this paper, we present the Hybrid Chord Protocol (HCP). HCP solves the problem of frequent joins and leaves of nodes. As a further improvement of an efficient search, HCP supports the grouping of shared objects in interest groups. Our concept of using information profiles to describe shared objects allows defining special interest groups (context spaces) and a shared object to be available in multiple context spaces.