The Community for Technology Leaders
2014 Sixth International Symposium on Parallel Architectures, Algorithms and Programming (PAAP) (2014)
Beijing, China
July 13, 2014 to July 15, 2014
ISSN: 2168-3034
ISBN: 978-1-4799-3844-5
pp: 172-177
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.
INDEX TERMS
Peer-to-peer computing, Topology, Routing, Network topology, Clocks, Ant colony optimization, Bidirectional control,Bi-directional Routing, P2P, Chord, Ant Colony Optimization Algorithm
CITATION
Limin Zhao, Hong Shen, Yidong Li, Jun Wu, "AB-Chord: An Improved Chord Based on Ant Colony Optimizationand Bi-Directional Lookup Routing", 2014 Sixth International Symposium on Parallel Architectures, Algorithms and Programming (PAAP), vol. 00, no. , pp. 172-177, 2014, doi:10.1109/PAAP.2014.60
194 ms
(Ver 3.3 (11022016))