DocumentCode :
2666722
Title :
On the challenge of assessing overlay topology adaptation mechanisms
Author :
Dinger, Jochen ; Hartenstein, Hannes
Author_Institution :
Inst. fur Telematik, Univ. Karlsruhe, Germany
fYear :
2005
fDate :
31 Aug.-2 Sept. 2005
Firstpage :
145
Lastpage :
147
Abstract :
This thesis is that a peer-to-peer network´s overlay topology should adapt to match the demand graph of the peer-to-peer network. In order to assess the effectiveness of various adaptation mechanisms, a comparison with an optimal topology for a given demand graph would be helpful. However, several related optimization/decision problems have been shown to be NP-hard. The contributions of this paper are threefold: i) NP-hardness results related to assessing overlay adaptation strategies were briefly surveyed, ii) a specific optimization problem and metric was presented, and iii) experimental results indicating the potential of optimizing the overlay topology were provided. Finally, in the spirit of a ´challenge paper´ various open issues were stated and discussed.
Keywords :
graph theory; optimisation; peer-to-peer computing; telecommunication network topology; NP-hardness; decision problem; demand graph; optimal topology; optimization problem; overlay adaptation; overlay topology adaptation; peer-to-peer network; Cost function; Delay; NP-complete problem; Network topology; Peer to peer computing; Resource management; Tree graphs;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Peer-to-Peer Computing, 2005. P2P 2005. Fifth IEEE International Conference on
Print_ISBN :
0-7695-2376-5
Type :
conf
DOI :
10.1109/P2P.2005.22
Filename :
1551031
Link To Document :
بازگشت