DocumentCode
2653730
Title
A Mathematical Foundation for Chord Overlays
Author
Vakili, Golnaz ; Hashemi, S. Mehdi ; Khorsandi, Siavash
Author_Institution
Amirkabir Univ. of Technol. Tehran, Tehran
fYear
2009
fDate
22-24 Jan. 2009
Firstpage
523
Lastpage
527
Abstract
Organizing nodes in a peer-to-peer (P2P) overlay while preserving its congruence with its underlying physical topology is important to reduce the communication cost between nodes. Chord as one of the well-known P2P overlay structures does not consider topology-awareness in its original design. In this paper, we propose a globally optimized overlay construction scheme for making chord topology-aware through modeling it as a traveling salesman optimization problem.
Keywords
cost reduction; peer-to-peer computing; telecommunication network topology; travelling salesman problems; chord overlays; chord topology; communication cost reduction; mathematical foundation; optimized overlay construction scheme; peer-to-peer overlay; traveling salesman optimization problem; Communication system control; Delay; Heuristic algorithms; Internet; Organizing; Peer to peer computing; Physics computing; Routing; Topology; Traveling salesman problems;
fLanguage
English
Publisher
ieee
Conference_Titel
Advanced Computer Control, 2009. ICACC '09. International Conference on
Conference_Location
Singapore
Print_ISBN
978-1-4244-3330-8
Type
conf
DOI
10.1109/ICACC.2009.36
Filename
4777398
Link To Document