An Efficient Search Algorithm for REIK Overlay Network

Jin, Zhen; Yu, Jiguo; Xiang, Zhaojun

doi:10.1109/icis.2009.73

Search citation statements

Order By: Relevance

Paper Sections

Select...

Routing Scheme1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2010

2012

Publication Types

Select...

Other1

Article1

Relationship

Self Cite1

Independent1

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The iDistance values of the data objects are indexed in an ordinary B + -tree, which the list of the clusters, is stored. The detail case can be found in [16].…”

Section: Routing Schemementioning

confidence: 99%

An efficient overlay network based on many rings which embed inverse Kautz digraphs

Xiang

Jin

Shi

et al. 2010

2010 2nd International Conference on Future Computer and Communication

Self Cite

View full text Add to dashboard Cite

The current work deals with the problem of resource management in P2P networks. The topological properties of the overlay network are critical factors that dominate the performance of P2P networks. The inverse Kautz digraph is a good topology to construct the overlay network. We discuss an efficient DHT-based overlay network (MREIK) with Byzantine fault tolerance. MREIK based on many rings which embeds inverse Kautz digraphs, to enable multi-path P2P routing. Each node maintains a maximum limited number of 2d + 3 entries in its routing table, and any resource is distributed at an exit node based on the longest prefix matching rule. It supports both exact and similarity resources search efficiently. MREIK reduces REIK with one ring maintenance cast and provides high quality routing service.

show abstract

“…The iDistance values of the data objects are indexed in an ordinary B + -tree, which the list of the clusters, is stored. The detail case can be found in [16].…”

Section: Routing Schemementioning

confidence: 99%