DocumentCode
2924666
Title
PeerStar: An attractive alternative to existing peer-to-peer topologies
Author
Shafiei, H. ; Aghazadeh, Z. ; Khonsari, A. ; Ould-Khaoua, Mohamed
Author_Institution
Sch. of Comput. Sci., IPM, Tehran, Iran
fYear
2009
fDate
5-8 July 2009
Firstpage
128
Lastpage
134
Abstract
The development of peer to peer overlay networks applications has attracted an immense interest from the research community in recent years. Several challenging issues have to be resolved in order to provide accessible, efficient and scalable inter-peer communication. Achieving resilience so as to reduce the disconnection probability, is among the most demanding issues to provide a robust and omnipresent service to peer to peer applications. This paper attempts to address this issue, by proposing a graph-theoretic model using the well-known star interconnection network with sub-logarithmic degree characteristics, which not only facilitate scalability problem, but also achieves maximum connectivity compared to the other existing graph-based methods. The simulation results confirm that the proposed solution attains a higher degree of resiliency compared to other existing topologies.
Keywords
graph theory; peer-to-peer computing; probability; telecommunication network topology; PeerStar; disconnection probability; graph-theoretic model; inter-peer communication; maximum connectivity; network scalability; overlay network; peer-to-peer topology; star interconnection network; sublogarithmic degree characteristics; Application software; Computational modeling; Computer networks; Computer science; Multiprocessor interconnection networks; Network topology; Peer to peer computing; Resilience; Robustness; Scalability;
fLanguage
English
Publisher
ieee
Conference_Titel
Computers and Communications, 2009. ISCC 2009. IEEE Symposium on
Conference_Location
Sousse
ISSN
1530-1346
Print_ISBN
978-1-4244-4672-8
Type
conf
DOI
10.1109/ISCC.2009.5202231
Filename
5202231
Link To Document