LiChord: A Linear Code Based Structured P2P for Approximate Match

Author

Wang, Shuling ; Yang, Shoubao ; Guo, Liangmin

Author_Institution

Sch. of Comput. Sci. & Technol., Univ. of Sci. & Technol. of China, Hefei, China

fYear

2011

fDate

18-20 April 2011

Firstpage

118

Lastpage

121

Abstract

A fundamental problem that confronts DHT-based structured P2P applications is the confine to exact match. By observing the blind objects distribution and single key-based locating mechanism in structured P2P, approximate match is a challenge to be resolved. LiChord, a linear code based structured P2P, is proposed to deal with the problem. Theories of linear code are explored in LiChord´s mapping process. The mapping mechanism makes approximate match achievable by mapping resemble objects to the same node Results of theoretical discussion and evaluations, the mapping mechanism preserves the features of scalability and load balancing and enhances flexibility of query.

Keywords

linear codes; peer-to-peer computing; DHT-based structured P2P applications; LiChord; approximate match; blind objects distribution; linear code based structured P2P; single key-based locating mechanism; Hamming distance; Heuristic algorithms; Linear code; Load management; Object recognition; Peer to peer computing; Query processing; Chord; approximate match; bloom filter; linear code;

fLanguage

English

Publisher

ieee

Conference_Titel

Communications and Mobile Computing (CMC), 2011 Third International Conference on

Conference_Location

Qingdao

Print_ISBN

978-1-61284-312-4

Type

conf

DOI

10.1109/CMC.2011.31

Filename

5931174