Capability-aware object management based on skip list in large-scale heterogeneous P2P networks

Authors:
Takashi Tomimoto;Takuji Tachibana;Kenji Sugimoto
Affiliations:
Graduate School of Information Science, Nara Institute of Science and Technology, Ikoma, Nara, Japan;Graduate School of Information Science, Nara Institute of Science and Technology, Ikoma, Nara, Japan;Graduate School of Information Science, Nara Institute of Science and Technology, Ikoma, Nara, Japan
Venue:
WSEAS TRANSACTIONS on COMMUNICATIONS
Year:
2010

Citing 7
Cited 0

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
Skip graphs

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
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
PAST: A Large-Scale, Persistent Peer-to-Peer Storage Utility

HOTOS '01 Proceedings of the Eighth Workshop on Hot Topics in Operating Systems
Peer-to-Peer Spatial Queries in Sensor Networks

P2P '03 Proceedings of the 3rd International Conference on Peer-to-Peer Computing
A distributed event delivery method with load balancing for MMORPG

NetGames '05 Proceedings of 4th ACM SIGCOMM workshop on Network and system support for games
SkipNet: a scalable overlay network with practical locality properties

USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose an object management method in large-scale heterogeneous P2P networks. In the proposed method, objects can be stored in and searched from nodes by considering node's capabilities. The proposed system is based on skip list, and two identifications are utilized; TypeID and HashID. The TypeID is used to specify each node's capabilities, on the other hand, HashID is used for providing load balancing among nodes with similar capabilities. According to the two identifications, message routing for storing and searching objects is performed. We evaluate the performance of the proposed method by simulation, and we investigate the effectiveness of the method. Numerical examples show that the proposed method can manage objects based on node's capabilities and can provide the scalability when the number of nodes is large and the difference in node's capabilities is large.