2006 14th IEEE International Conference on Networks 2006
DOI: 10.1109/icon.2006.302674
|View full text |Cite
|
Sign up to set email alerts
|

Improving the Lookup Performance of Chord Network by Hashing Landmark Clusters

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2009
2009
2015
2015

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(1 citation statement)
references
References 10 publications
0
1
0
Order By: Relevance
“…In , the researchers proposed an associative search based on unstructured architecture, which retains property of semantic search and improves the efficiency to locate rare target resource. On the basis of structured P2P networks, eigenvector is introduced to map file properties in and , where vector space is constructed through operating on keywords, the distance between two vectors reflects node's interest similarity. Then, nodes are divided into multi‐level clusters, and the target files are located in the common interests cluster based on cluster index.…”
Section: Introductionmentioning
confidence: 99%
“…In , the researchers proposed an associative search based on unstructured architecture, which retains property of semantic search and improves the efficiency to locate rare target resource. On the basis of structured P2P networks, eigenvector is introduced to map file properties in and , where vector space is constructed through operating on keywords, the distance between two vectors reflects node's interest similarity. Then, nodes are divided into multi‐level clusters, and the target files are located in the common interests cluster based on cluster index.…”
Section: Introductionmentioning
confidence: 99%