|| Lada A. Adamic, Rajan M. Lukose, Amit R. Puniyani, and Bernardo A. Huberman, “Search in Power-Law Networks,” Physical Review, E, Vol. 64, No. 4, pp. 046135–046143, September 2001.|
 Albert-Laszlo Barabasi, and Reka Albert, “Emergence of scaling in random networks,” Science, Vol. 286, No. 5439, pp. 509–512, October 1999.
 Nabhendra Bisnik, and Alhussein A. Abouzeid, “Optimizing random walk search algorithms,” Computer Networks: The International Journal of Computer and Telecommunications Networking, Vol. 51, No. 6, pp. 1499–1514, April 2007.
 Andrea Ceccanti, and Gian Paolo Jesi, “Building Latency-aware Overlay Topologies with QuickPeer,” in Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (ICAS-ICNS ’05), IEEE Computer Society, Washington, DC, USA, pp. 24–29, October 2005.
 Yatin Chawathe, Sylvia Ratnasamy, Lee Breslau, Nick Lanham, and Scott Shenker, “Making Gnutella-like P2P Systems Scalable,” in Proceedings of ACM SIGCOMM, pp. 407–418, August 2003.
 Yang Chen, Yongqiang Xiong, Xiaohui Shi, Beixing Deng, and Xing Li, “Pharos: A Decentralized and Hierarchical Network Coordinate System for Internet Distance Prediction,” Iet Communications - IET COMMUN, Vol. 3, No. 4, pp. 539–548, 2009.
 Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein, “Section 24.3: Dijkstra’s algorithm,” Introduction to Algorithms (Second ed.), pp. 595–601, 2001.
 Frank Dabek, Russ Cox, Frans Kaashoek, and Robert Morris, “Vivaldi: a decentralized network coordinate system,” in Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications, Vol. 34, No. 4, pp. 15–26, August 2004.
 Paul Erd?s, and Alfred Renyi, “On the evolution of random graphs,” Publ. Math. Inst. Hung. Acad. Sci, Vol. 5, pp. 17–61, 1960.
 “Gnutella website.” http://www.gnutella.com.
 Mihajlo A. Jovanovi?, Fred S. Annexstein, and Kenneth A. Berman, “Modeling peer-to-peer network topologies through small world models and power laws,” in Proceedings of IX Telecommunications Forum TELFO, IEEE, Belgrade, 2001.
 Ram Keralapura, Nina Taft, Chen-Nee Chuah, and Gianluca Iannaccone, “Can ISPs take the heat from overlay networks?,” In Proceedings of ACM Workshop on Hot Topics in Networks (HotNets-III), pp. 29-34, November 2004.
 Jonathan Ledlie, Paul Gardner, and Margo Seltzer, “Network Coordinates in the Wild,” in Proceedings of USENIX NSDI’07, 2007.
 Mei Li, Wang-Chien Lee, and Anand Sivasubramaniam, “Neighborhood signatures for searching P2P networks,” In Proceedings of International Database Engineering and Application Symposium (IDEAS), pp. 149–158, July 2003.
 Rui-Xuan Li, Cui-Hua Zuo, Hai-Ying Shen, Kun-Mei Wen, and Xi-Wu Gu, “PercolationNET: A multi-tree P2P overlay network supporting high coverage search,” International Journal of Parallel, Emergent and Distributed Systems, Vol. 25, No. 1, pp. 73–89, February 2010.
 Yun-Hao Liu, Zhen-Yun Zhuang, Li Xiao, and Lionel M. Ni, “AOTO: Adaptive Overlay Topology Optimization in Unstructured P2P Systems,” Global Telecommunications Conference, 2003. GLOBECOM ’03. IEEE, Vol. 7, pp. 4186–4190, 2003.
 Yun-Hao Liu, Li Xiao, and Lionel M. Ni, “Building a Scalable Bipartite P2P Overlay Network,” IEEE Transactions on Parallel and Distributed Systems, Vol. 18, No. 9, pp. 1296–1306, September 2007.
 Qin Lv, Pei Cao, Edith Cohen, Kai Li, and Scott Shenker, “Search and replication in unstructured peer-to-peer networks,” in Proceedings of the 16th international conference on Supercomputing (ICS ’02), ACM, New York, NY, USA, pp. 84–95, 2002.
 Yun Mao, Lawrence K. Saul, and Jonathan M. Smith, “Ides: An internet distance estimation service for large networks,” IEEE J. Selected Areas Commun., Special Issue on Sampling the Internet, Techniques and Applications, Vol. 24, No. 12, pp. 2273–2284, December 2006.
 Eugene Ng, and Hui Zhang, “Predicting Internet network distance with coordinates-based approaches,” in Proceedings of IEEE INFOCOM, pp. 170–179, June 2002.
 Marcelo Pias, Jon Crowcroft, Steve Wilbur, Tim Harris, and Saleem Bhatti, “Lighthouses for Scalable Distributed Location,” in Proceedings of International workshop on Peer-To-Peer Systems, pp. 278–291, February 2003.
 Peter Pietzuch, Jonathan Ledlie, Michael Mitzenmacher, and Margo Seltzer, “Network-aware Overlays with Network Coordinates,” in Proceedings of the 26th IEEE International ConferenceWorkshops on Distributed Computing Systems, pp. 12, July 2006.
 Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, and Scott Shenker, “A scalable content-addressable network,” in Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications (SIGCOMM ’01), ACM, New York, NY, USA, pp. 161–172, October 2001.
 Matei Ripeanu, Ian Foster, and Adriana Iamnitchi, “Mapping the Gnutella Network: Properties of Large-Scale Peer-to-Peer Systems and Implications for System Design,” IEEE Internet Computing Journal special issue on peer-to-peer networking, Vol. 6, No. 1, pp. 50–57, February 2002.
 Antony I. T. Rowstron, and Peter Druschel, “Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems,” in Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg (Middleware ’01), Rachid Guerraoui (Ed.), Springer-Verlag, London, UK, pp. 329–350, November 2001.
 Stefan Schmid, and Roger Wattenhofer, “Structuring unstructured peer-to-peer networks,” in Proceedings of the 14th international conference on High performance computing (HiPC’07), pp. 432–442, Goa, India, 2007.
 Hendrik Schulze, and Klaus Mochalski, “Internet Study 2008/2009,” http://www.ipoque.com, 2009.
 Mudhakar Srivatsa, Bugra Gedik, and Ling Liu, “Large Scaling Unstructured Peer-to-Peer Networks with Heterogeneity-Aware Topology and Routing,” International Journal of Parallel, Emergent and Distributed Systems, Vol. 17, No. 11, pp. 1277–1293, November 2006.
 Milgram Stanley, “The Small World Problem,” Psychology Today, Vol. 1, No. 1, pp. 60–67, May 1967.
 Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, and Hari Balakrishnan, “Chord: A scalable peer-to-peer lookup service for internet applications,” in Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications (SIGCOMM ’01), ACM, New York, NY, USA, pp. 149–160, October 2001.
 Suyong Eum, Shin’ichi Arakawa, and Masayuki Murata, “Self Organizing Topology Transformation for Peer-To-Peer (P2P) Networks,” IEICE Transactions on Communications, Vol. 93, No. 3, pp. 516–524, 2010.
 Li Xiao, Yunhao Liu, and Lionel M. Ni, “Improving Unstructured Peer-to-Peer Systems by Adaptive Connection Establishment,” IEEE Transactions on Computers, Vol. 54, No. 9, pp. 1091–1103, September 2005.
 Haiyong Xie, Y. Richard Yang, Arvind Krishnamurthy, Yanbin Grace Liu, and Abraham Silberschatz, “P4P: Provider Portal for (P2P) Applications,” in Proceedings of the ACM SIGCOMM 2008 conference on Data communication (SIGCOMM ’08), ACM, New York, NY, USA, pp. 351–362, 2008.
 Shuang-Hua Yang, “Dealing with Internet Transmission Delay and Data Loss from the Network View,” Internet-based Control Systems Design and Applications, pp. 53–65, February 2011.
 Rongmei Zhang, Charlie Hu, Xiaojun Lin, and Sonia Fahmy, “A Hierarchical Approach to Internet Distance Prediction,” in Proceedings of the 26th IEEE International Conference on Distributed Computing Systems, pp. 73, Washington, DC, USA. July 2006.
 Han Zheng, Eng Keong Lua, Marcelo Pias, and Timothy G. Griffin, “Internet Routing Policies and Round-Trip-Times,” PAM, 2005.
 Yingwu Zhu, Xiaoyu Yang, and Yiming Hu, “Making search efficient on gnutella-like p2p systems,” In Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS’2005), Vol. 1, pp. 56a, IEEE Computer Society, April 2005.