A distributed adaptive landmark clustering algorithm based onmOverlayandlearning automatafor topology mismatch problem in unstructured peer-to-peer networks

2015 ◽  
Vol 30 (3) ◽  
pp. e2977 ◽  
Author(s):  
Ali Mohammad Saghiri ◽  
Mohammad Reza Meybodi
2007 ◽  
Vol 2007 ◽  
pp. 1-10
Author(s):  
Zhan Zhang ◽  
Yong Tang ◽  
Shigang Chen ◽  
Ying Jian

Unstructured peer-to-peer networks have gained a lot of popularity due to their resilience to network dynamics. The core operation in such networks is to efficiently locate resources. However, existing query schemes, for example, flooding, random walks, and interest-based shortcut suffer various problems in reducing communication overhead and in shortening response time. In this paper, we study the possible problems in the existing approaches and propose a new hybrid query scheme, which mixes inter-cluster queries and intracluster queries. Specifically, the proposed scheme works by efficiently locating the clusters, sharing similar interests with intercluster queries, and then exhaustively searching the nodes in the found clusters with intracluster queries. To facilitate the scheme, we propose a clustering algorithm to cluster nodes that share similar interests, and a labeling algorithm to explicitly capture the clusters in the underlying overlays. As demonstrated by extensive simulations, our new query scheme can improve the system performance significantly by achieving a better tradeoff among communication overhead, response time, and ability to locate more resources.


2008 ◽  
Vol 19 (9) ◽  
pp. 2376-2388 ◽  
Author(s):  
Zhen-Hua LI ◽  
Gui-Hai CHEN ◽  
Tong-Qing QIU

2014 ◽  
Vol 36 (7) ◽  
pp. 1456-1464 ◽  
Author(s):  
Da-Peng QU ◽  
Xing-Wei WANG ◽  
Min HUANG

2010 ◽  
Vol 33 (2) ◽  
pp. 345-355 ◽  
Author(s):  
Chun-Qi TIAN ◽  
Jian-Hui JIANG ◽  
Zhi-Guo HU ◽  
Feng LI

Sign in / Sign up

Export Citation Format

Share Document