Please use this identifier to cite or link to this item:
Scopus Web of Science® Altmetric
Type: Conference paper
Title: AB-chord: an improved chord based on ant colony optimizationand bi-directional lookup routing
Author: Zhao, L.
Shen, H.
Li, Y.
Wu, J.
Citation: Proceedings - International Symposium on Parallel Architectures, Algorithms and Programming, PAAP, 2014, pp.172-177
Publisher: IEEE
Publisher Place: Online
Issue Date: 2014
ISBN: 9781479938445
ISSN: 2168-3034
Conference Name: Sixth International Symposium on Parallel Architectures, Algorithms and Programming (PAAP) (13 Jul 2014 - 15 Jul 2014 : Beijing, China)
Statement of
Limin Zhao, Hong Shen, Yidong Li, Jun Wu
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.
Keywords: P2P; Chord; Ant Colony Optimization Algorithm; Bi-directional Routing
Rights: © 2014 IEEE
DOI: 10.1109/PAAP.2014.60
Published version:
Appears in Collections:Aurora harvest 3
Computer Science publications

Files in This Item:
File Description SizeFormat 
  Restricted Access
Restricted Access491.31 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.