DocumentCode :
3253756
Title :
A graph theoretic approach in achieving robust peer-to-peer networking paradigm
Author :
Shafiei, H. ; Hoseini, F. ; Khonsari, A. ; Ould-Khaoua, M.
Author_Institution :
Sch. of Comput. Sci., IPM, Tehran
fYear :
2008
fDate :
14-17 Oct. 2008
Firstpage :
538
Lastpage :
539
Abstract :
In this paper, we proposed a graph theoretic approach employing an algorithmic method to construct constant-degree graphs possessing not only provably minimum diameter, but also maximum connectivity with respect to other similar graphs.
Keywords :
graph theory; peer-to-peer computing; constant-degree graph; graph theory; peer-to-peer networking; Clouds; Computer science; Eigenvalues and eigenfunctions; Graph theory; Joining processes; Network topology; Peer to peer computing; Resilience; Robustness; Usability;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Local Computer Networks, 2008. LCN 2008. 33rd IEEE Conference on
Conference_Location :
Montreal, Que
Print_ISBN :
978-1-4244-2412-2
Electronic_ISBN :
978-1-4244-2413-9
Type :
conf
DOI :
10.1109/LCN.2008.4664227
Filename :
4664227
Link To Document :
بازگشت