跳至主導覽 跳至搜尋 跳過主要內容

AB-chord: An improved chord based on ant colony optimizationand bi-directional lookup routing

  • Limin Zhao
  • , Hong Shen
  • , Yidong Li
  • , Jun Wu

研究成果: Conference contribution同行評審

1 引文 斯高帕斯(Scopus)

摘要

Chord is a popular and successful topology for P2P data sharing. However, the conventional chord has an obvious drawback - it fails to consider the physical topology of the P2P network for designing the lookup solution, which may bring tremendous delay to network routing. In order to address the drawback and further speeds up searching for local resources, we propose an improved chord based on the Ant Colony Optimization Algorithm and Bi-directional lookup routing method in this paper. We first apply the Ant Colony Optimization Algorithm for building the chord ring to match the topology between the overlay network and physical network. We then develop a bi-directional lookup routing mechanism to further speed up searching for local resources. Simulation results show that our improved chord scheme is significantly more efficient than the conventional chord method.

原文English
主出版物標題Proceedings - 6th International Symposium on Parallel Architectures, Algorithms, and Programming, PAAP 2014
編輯Hong Shen, Hong Shen, Yingpeng Sang, Hui Tian
發行者IEEE Computer Society
頁面172-177
頁數6
ISBN(電子)9781479938445
DOIs
出版狀態Published - 3 10月 2014
對外發佈
事件6th International Symposium on Parallel Architectures, Algorithms, and Programming, PAAP 2014 - Beijing, China
持續時間: 13 7月 201415 7月 2014

出版系列

名字Proceedings - International Symposium on Parallel Architectures, Algorithms and Programming, PAAP
ISSN(列印)2168-3034
ISSN(電子)2168-3042

Conference

Conference6th International Symposium on Parallel Architectures, Algorithms, and Programming, PAAP 2014
國家/地區China
城市Beijing
期間13/07/1415/07/14

指紋

深入研究「AB-chord: An improved chord based on ant colony optimizationand bi-directional lookup routing」主題。共同形成了獨特的指紋。

引用此