期刊名称：Journal of Theoretical and Applied Information Technology
印刷版ISSN：1992-8645
电子版ISSN：1817-3195
出版年度：2012
卷号：45
期号：1
页码：246-251
出版社：Journal of Theoretical and Applied
摘要：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.
关键词：P2P; Lookup Service; Structured Sub-Systems; Binary Tree
