{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:57:17Z","timestamp":1725551837688},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540305101"},{"type":"electronic","value":"9783540322771"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11590354_109","type":"book-chapter","created":{"date-parts":[[2005,11,15]],"date-time":"2005-11-15T06:20:28Z","timestamp":1132035628000},"page":"906-918","source":"Crossref","is-referenced-by-count":4,"title":["A Mathematical Foundation for Topology Awareness of P2P Overlay Networks"],"prefix":"10.1007","author":[{"given":"Habib","family":"Rostami","sequence":"first","affiliation":[]},{"given":"Jafar","family":"Habibi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"109_CR1","unstructured":"Schlosser, M., Sintek, M., Decker, S., Nejdl, W.: Hypercup - hypercubes, ontologies and efficient search on p2p networks. In: International Workshop on Agents and Peer-to-Peer Computing, Bologna, Italy (2002)"},{"key":"109_CR2","doi-asserted-by":"crossref","unstructured":"Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable p2p lookup service for internet applications. In: Proc. ACM SIGCOMM 2001 (2001)","DOI":"10.1145\/383059.383071"},{"key":"109_CR3","doi-asserted-by":"crossref","unstructured":"Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: Scalable content-addressable networks. In: Proc. ACM SIGCOMM 2001 (2001)","DOI":"10.1145\/383059.383072"},{"key":"109_CR4","unstructured":"Kazaa (2003), http:\/\/www.kazaa.com"},{"key":"109_CR5","unstructured":"Gnutella (2003), http:\/\/gnutella.wego.com"},{"key":"109_CR6","doi-asserted-by":"crossref","unstructured":"Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: International conference on Distributed Systems platforms (Middleware), pp. 329\u2013350 (2001)","DOI":"10.1007\/3-540-45518-3_18"},{"key":"109_CR7","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1111\/j.0824-7935.2005.00271.x","volume":"21","author":"H. Zhuge","year":"2005","unstructured":"Zhuge, H., Liu, J., Feng, L., Sun, X., He, C.: Query routing in a peer-to-peer semantic link network. Computational Intelligence\u00a021, 197\u2013216 (2005)","journal-title":"Computational Intelligence"},{"key":"109_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45172-3_4","volume-title":"Peer-to-Peer Systems II","author":"M. Freedman","year":"2003","unstructured":"Freedman, M., Mazieres, D.: Sloppy hashing and self-organizing clusters. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol.\u00a02735. Springer, Heidelberg (2003)"},{"key":"109_CR9","doi-asserted-by":"crossref","unstructured":"Saroui, S., Gummadi, K.P., Dunn, R.J., Gribble, S.D., Levy, H.M.: An analysis of intener content delivery systems. In: Proc. IEEE Fifth Symp. Operating Systems Design and Implementation (2002)","DOI":"10.1145\/1060289.1060319"},{"key":"109_CR10","doi-asserted-by":"crossref","unstructured":"Sen, S., Wang, J.: Analyzing peer-to-peer traffic across large networks. In: Proc. ACM SIGCOMM Internet Measurement Workshop (2002)","DOI":"10.1145\/637201.637222"},{"key":"109_CR11","doi-asserted-by":"crossref","unstructured":"Ratnasamy, S., Handley, M., Karp, R., Shenker, S.: Topologically-aware overlay construction and server selection. In: Proc. IEEE INFOCOM 2002 (2002)","DOI":"10.1109\/INFCOM.2002.1019369"},{"key":"109_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/978-3-540-39405-1_6","volume-title":"Group Communications and Charges. Technology and Business Models","author":"L. Garces-Erice","year":"2003","unstructured":"Garces-Erice, L., Ross, K., Biersack, E., Felber, P., Urvoy-Keller, G.: Topology-centric lookup service. In: Stiller, B., Carle, G., Karsten, M., Reichl, P. (eds.) NGC 2003 and ICQT 2003. LNCS, vol.\u00a02816, pp. 58\u201369. Springer, Heidelberg (2003)"},{"key":"109_CR13","unstructured":"Harvey, N.J.A., Jones, M.B., Saroiu, S., Theimer, M., Wolman, A.: Skipnet: A scalable overlay network with practical locality properties. In: Proc. The Fourth USENIX Symposium on Internet Technologies and Systems USITS 2003 (2003)"},{"key":"109_CR14","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1109\/TPDS.2005.21","volume":"16","author":"Y. Liu","year":"2005","unstructured":"Liu, Y., Xiao, L., Liu, X., Ni, L.M., Zhang, X.: Location awareness in unstructured peer-to-peer systems. IEEE Transactions on Parallel and Distributed Systems\u00a016, 163\u2013174 (2005)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"109_CR15","doi-asserted-by":"crossref","unstructured":"Ferreira, R.A., Jagannathan, S., Grama, A.: Enhancing locality in structured peer-to-peer networks. In: Proc. ICPADS 2004 Tenth International Conference on Parallel and Distributed Systems (2004)","DOI":"10.1109\/ICPADS.2004.1316077"},{"key":"109_CR16","doi-asserted-by":"crossref","unstructured":"Huffaker, B., Fomenkov, M., Plummer, D., Moore, D., Claffy, K.: Distance metrics in the internet. In: IEEE International Telecommunications Symposium, ITS (2002)","DOI":"10.14209\/its.2002.603"},{"key":"109_CR17","doi-asserted-by":"crossref","unstructured":"Francis, P., Jamin, S., Paxson, V., Zhang, L., Gryniewicz, D., Jin, Y.: An architecture for a global internet host distance estimation service. In: Proc. IEEE INFOCOM 1999 (1999)","DOI":"10.1109\/INFCOM.1999.749285"},{"key":"109_CR18","doi-asserted-by":"crossref","unstructured":"Guyton, J.D., Schwartz, M.F.: Locating nearby copies of replicated internet servers. In: Proc. ACM SIGCOMM 1995 (1995)","DOI":"10.21236\/ADA451456"},{"key":"109_CR19","doi-asserted-by":"crossref","unstructured":"Savage, S., Collins, A., Homan., E.: The end-to-end effects of internet path selection. In: Proc. ACM SIGCOMM 1999 (1999)","DOI":"10.1145\/316188.316233"},{"key":"109_CR20","doi-asserted-by":"crossref","unstructured":"Paxson, V.: End-to-end routing behavior in the internet. In: Proc. ACM SIGCOMM 1996, pp. 25\u201338 (1996)","DOI":"10.1145\/248156.248160"},{"key":"109_CR21","doi-asserted-by":"crossref","unstructured":"Ng, T.E., Zhang, H.: Predicting internet network distance with coordinates-based approaches. In: Proc. IEEE INFOCOM 2002 (2002)","DOI":"10.1109\/INFCOM.2002.1019258"},{"key":"109_CR22","unstructured":"Chen, Y., Katz, R.: On the placement of network monitoring sites (2001), http:\/\/www.cs.berkeley.edu\/yanchen\/vnms\/"},{"key":"109_CR23","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1137\/0112012","volume":"12","author":"L.H. Harper","year":"1964","unstructured":"Harper, L.: Optimal assignments of numbers to vertices. J. Soc. Industrial Appl. Math.\u00a012, 131\u2013135 (1964)","journal-title":"J. Soc. Industrial Appl. Math."},{"key":"109_CR24","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1137\/0113026","volume":"13","author":"K. Steiglitz","year":"1965","unstructured":"Steiglitz, K., Bernstein, A.J.: Optimal binary coding of ordered numbers. J. Soc. Industrial Appl. Math.\u00a013, 441\u2013443 (1965)","journal-title":"J. Soc. Industrial Appl. Math."},{"key":"109_CR25","volume-title":"Introduction to Graph Theory","author":"D.B. West","year":"2001","unstructured":"West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice-Hall, Englewood Cliffs (2001)","edition":"2"},{"key":"109_CR26","unstructured":"White, S., OMadadhain, J., Fisher, D., Boey, Y.B.: Jung-java universal network\/graph framework (2004), http:\/\/jung.sourceforge.net\/index.html"},{"key":"109_CR27","doi-asserted-by":"crossref","unstructured":"Kleinberg, J.: The small-world phenomenon: An algorithmic perspective. In: Proc. 32nd ACM Symposium on Theory of Computing (2000)","DOI":"10.1145\/335305.335325"},{"key":"109_CR28","unstructured":"Eppstein, D., Wang, J.: A steady state model for graph power laws. ACM Computing Research Repository (2002)"},{"key":"109_CR29","doi-asserted-by":"crossref","DOI":"10.1515\/9780691188331","volume-title":"Small world: The dynamics of networks between order and randomness","author":"D. Watts","year":"1999","unstructured":"Watts, D.: Small world: The dynamics of networks between order and randomness. Princeton Univ. Press, Princeton (1999)"},{"key":"109_CR30","unstructured":"Sripanidkulchai, K.: The popularity of gnutella queries and its implications on scalability (2001), http:\/\/www2.cs.cmu.edu\/knunwadee\/research\/p2p\/gnutella.html"}],"container-title":["Lecture Notes in Computer Science","Grid and Cooperative Computing - GCC 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11590354_109.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T08:22:33Z","timestamp":1683274953000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11590354_109"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540305101","9783540322771"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/11590354_109","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}