A graph theoretic approach in achieving robust peer-to-peer networking paradigm

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.

[1]  Béla Bollobás,et al.  The Diameter of a Cycle Plus a Random Matching , 1988, SIAM J. Discret. Math..

[2]  Guihai Chen,et al.  Cycloid: a constant-degree and lookup-efficient P2P overlay network , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[3]  Avi Wigderson,et al.  Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[4]  Dmitri Loguinov,et al.  Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience , 2003, IEEE/ACM Transactions on Networking.

[5]  Jon Crowcroft,et al.  A survey and comparison of peer-to-peer overlay network schemes , 2005, IEEE Communications Surveys & Tutorials.