No Detail Found!

A restricted-scope lookup service in peer-to-peer network.

Author(s)
Jianchun Li School of Computer & Communication Engineering, Zhengzhou University of Light Industry, Zhengzhou 450002, Henan, China
Jianyong Li School of Computer & Communication Engineering, Zhengzhou University of Light Industry, Zhengzhou 450002, Henan, China
Daoying Huang School of Computer & Communication Engineering, Zhengzhou University of Light Industry, Zhengzhou 450002, Henan, China
Lihua Shi School of Computer & Communication Engineering, Zhengzhou University of Light Industry, Zhengzhou 450002, Henan, China
Abstract
Consistent hashing-based P2P networks, which scalability is indicated by efficiency of query and maintenance cost, take the hashing algorithm as mapping relation between the data and the identifier of every node in the network. By analyzing some main characters in structured P2P network, we introduce the Restricted Scope Lookup Service(RSLS)to divide the network into some less size structured sub-systems, so as to limit the bound of routing message while keep the scalability of network. The logical relationship among nodes in sub-system is organized by the binary tree structure, in which some definitions and qualities are proved, and the self-organizing algorithm and the routing algorithm in sub-system are described too. Simulations have verified the cost of routing algorithm and stability scaling logarithmically with the number of nodes in sub-system.
Publication Details
Page(s) 246-251
DOI DOI not available
Published Journal: Journal of Theoretical and Applied Information Technology, Volume: 45, Issue: 1, Year: 2012

Request the full text from PASTIC

0

Citations

0

Downloads

78

Views