Name
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. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1109/ISCC.2009.5202231 | Sousse |
Keywords | Field | DocType |
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 | Psychological resilience,Graph theory,Peer-to-peer,Computer science,Computer network,Network topology,Interconnection,Overlay network,Maintenance engineering,Scalability,Distributed computing | Conference |
ISSN | ISBN | Citations |
1530-1346 | 978-1-4244-4672-8 | 1 |
PageRank | References | Authors |
0.34 | 16 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shafiei, H. | 1 | 32 | 5.30 |
| Aghazadeh, Z. | 2 | 1 | 0.34 |
| Ahmad Khonsari | 3 | 18 | 3.50 |
| Mohamed Ould-khaoua | 4 | 1 | 0.34 |