A Mathematical Foundation for Chord Overlays
暂无分享,去创建一个
[1] Ravindra K. Ahuja,et al. Network Flows , 2011 .
[2] Michalis Faloutsos,et al. On routing asymmetry in the Internet , 2005, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005..
[3] B. Huffaker,et al. Distance Metrics in the Internet , 2002, Anais do 2002 International Telecommunications Symposium.
[4] Matthieu De Beule,et al. Small Worlds: The Dynamics of Networks between Order and Randomness , 1999 .
[5] Rüdiger Schollmeier,et al. A definition of peer-to-peer networking for the classification of peer-to-peer architectures and applications , 2001, Proceedings First International Conference on Peer-to-Peer Computing.
[6] David Eppstein,et al. A steady state model for graph power laws , 2002, ArXiv.
[7] Balachander Krishnamurthy,et al. On network-aware clustering of Web clients , 2000, SIGCOMM.
[8] Jafar Habibi,et al. Minimum linear arrangement of Chord graphs , 2008, Appl. Math. Comput..
[9] Alan M. Frieze,et al. Random graphs , 2006, SODA '06.
[10] Ravindra K. Ahuja,et al. Network Flows: Theory, Algorithms, and Applications , 1993 .
[11] Tomas Fencl,et al. Network Optimization , 2011, Lecture Notes in Computer Science.