loading...
Self-optimizing Peer-to-Peer Networks with Selfish Processes
Cambridge, Massachussets July 09-July 11
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SASO.2007.51First International Conference on Sel ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Amlan Bhattacharya, Sukumar Ghosh, "Self-optimizing Peer-to-Peer Networks with Selfish Processes," Self-Adaptive and Self-Organizing Systems, International Conference on, pp. 340-343, First International Conference on Self-Adaptive and Self-Organizing Systems (SASO 2007), 2007.
 
 
BibTex
x
 
@article{ 10.1109/SASO.2007.51,
author = {Amlan Bhattacharya and Sukumar Ghosh},
title = {Self-optimizing Peer-to-Peer Networks with Selfish Processes},
journal ={Self-Adaptive and Self-Organizing Systems, International Conference on},
volume = {0},
year = {2007},
isbn = {0-7695-2906-2},
pages = {340-343},
doi = {http://doi.ieeecomputersociety.org/10.1109/SASO.2007.51},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Self-Adaptive and Self-Organizing Systems, International Conference on
TI - Self-optimizing Peer-to-Peer Networks with Selfish Processes
SN - 0-7695-2906-2
SP340
EP343
A1 - Amlan Bhattacharya,
A1 - Sukumar Ghosh,
PY - 2007
KW - null
VL - 0
JA - Self-Adaptive and Self-Organizing Systems, International Conference on
ER -
 
Amlan Bhattacharya, University of Iowa
Sukumar Ghosh, University of Iowa
Request patterns in peer-to-peer networks are not uniform, and the cost of communication depends on the traffic flows among peers. This paper illustrates how processes in an overlay network can use the information about traffic flow pattern and spontaneously adjust the topology to minimize their communication costs. Four different selfoptimization protocols are presented. The selfish protocols allow peers to modify their routing tables to suit their individual needs, and are easy to implement, but the improvements are limited. Compared to this, the altruistic protocols that allow peers to adjust the routing tables based on the needs of other processes, promise a better performance. Since selfish peers may not comply, a penalty mechanism is proposed to discourage selfishness.
Citation:
Amlan Bhattacharya, Sukumar Ghosh, "Self-optimizing Peer-to-Peer Networks with Selfish Processes," saso, pp.340-343, First International Conference on Self-Adaptive and Self-Organizing Systems (SASO 2007), 2007
Usage of this product signifies your acceptance of the Terms of Use.