AB-chord: an improved chord based on ant colony optimizationand bi-directional lookup routing
Files
(Restricted Access)
Date
2014
Authors
Zhao, L.
Shen, H.
Li, Y.
Wu, J.
Editors
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Conference paper
Citation
Proceedings - International Symposium on Parallel Architectures, Algorithms and Programming, PAAP, 2014, pp.172-177
Statement of Responsibility
Limin Zhao, Hong Shen, Yidong Li, Jun Wu
Conference Name
Sixth International Symposium on Parallel Architectures, Algorithms and Programming (PAAP) (13 Jul 2014 - 15 Jul 2014 : Beijing, China)
Abstract
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.
School/Discipline
Dissertation Note
Provenance
Description
Access Status
Rights
© 2014 IEEE