{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:34:56Z","timestamp":1725550496747},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540297697"},{"type":"electronic","value":"9783540321002"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11576235_52","type":"book-chapter","created":{"date-parts":[[2005,10,18]],"date-time":"2005-10-18T11:32:46Z","timestamp":1129635166000},"page":"503-513","source":"Crossref","is-referenced-by-count":4,"title":["Near Optimal Routing in a Small-World Network with Augmented Local Awareness"],"prefix":"10.1007","author":[{"given":"Jianyang","family":"Zeng","sequence":"first","affiliation":[]},{"given":"Wen-Jing","family":"Hsu","sequence":"additional","affiliation":[]},{"given":"Jiangdian","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"9","key":"52_CR1","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1038\/43601","volume":"401","author":"R. Albert","year":"1999","unstructured":"Albert, R., Jeong, H., Barabasi, A.-L.: The diameter of the World Wide Web. Nature\u00a0401(9), 130\u2013131 (1999)","journal-title":"Nature"},{"key":"52_CR2","doi-asserted-by":"crossref","unstructured":"Aspnes, J., Diamadi, Z., Shah, G.: Fault-tolerant routing in peer-to-peer systems. In: Proceedings of PODC 2002, pp. 223\u2013232 (2002)","DOI":"10.1145\/571825.571862"},{"key":"52_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/3-540-45414-4_19","volume-title":"Distributed Computing","author":"L. Barri\u00e9re","year":"2001","unstructured":"Barri\u00e9re, L., Fraigniaud, P., Kranakis, E., Krizanc, D.: Efficient routing in networks with long range contacts. In: Welch, J.L. (ed.) DISC 2001. LNCS, vol.\u00a02180, pp. 270\u2013784. Springer, Heidelberg (2001)"},{"issue":"2","key":"52_CR4","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1002\/rsa.1022","volume":"19","author":"I. Benjamini","year":"2001","unstructured":"Benjamini, I., Berger, N.: The Diameter of Long-Range Percolation Clusters on Finite Cycles. Random Structures and Algorithms\u00a019(2), 102\u2013111 (2001)","journal-title":"Random Structures and Algorithms"},{"key":"52_CR5","unstructured":"Biskup, M.: Graph diameter in long-range percolation. Submitted to Electron. Comm. Probab (2004)"},{"issue":"3","key":"52_CR6","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1137\/0401033","volume":"1","author":"B. Bollob\u00e1s","year":"1988","unstructured":"Bollob\u00e1s, B., Chung, F.R.K.: The Diameter of a cycle plus a random matching. SIAM Journal on Discrete Mathematics\u00a01(3), 328\u2013333 (1988)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"1","key":"52_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/rsa.10042","volume":"21","author":"D. Coppersmith","year":"2002","unstructured":"Coppersmith, D., Gamarnik, D., Sviridenko, M.: The diameter of a long-range percolation graph. Random Structures and Algorithms\u00a021(1), 1\u201313 (2002)","journal-title":"Random Structures and Algorithms"},{"key":"52_CR8","doi-asserted-by":"publisher","first-page":"827","DOI":"10.1126\/science.1081058","volume":"301","author":"P. Dodds","year":"2003","unstructured":"Dodds, P., Muhamad, R., Watts, D.: An experimental study of search in global social networks. Science\u00a0301, 827\u2013829 (2003)","journal-title":"Science"},{"key":"52_CR9","unstructured":"Kochen, M. (ed.): The small world, Ablex, Norwood (1989)"},{"key":"52_CR10","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., Gavoille, C., Paul, C.: Eclecticism shrinks even small worlds. In: PODC 2004, pp. 169\u2013178 (2004)","DOI":"10.1145\/1011767.1011793"},{"key":"52_CR11","unstructured":"Homan, C.M., Istrate, G.: Small worlds, locality, and flooding on landscapes. Research Report TR-2003-796, Department of Computer Science, University of Rochester, USA (2003)"},{"key":"52_CR12","doi-asserted-by":"crossref","unstructured":"Kemper, D., Kleinberg, J., Demers, A.: Spatial gossip and resource location protocols. In: Proceedings of STOC, pp. 163\u2013172 (2001)","DOI":"10.1145\/380752.380796"},{"key":"52_CR13","doi-asserted-by":"crossref","unstructured":"Kleinberg, J.: The Small-World Phenomenon: An Algorithmic Perspective. In: Proceedings of the 32nd ACM Symposium on Theory of Computing, pp. 163\u2013170 (2000)","DOI":"10.1145\/335305.335325"},{"key":"52_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"894","DOI":"10.1007\/978-3-540-27836-8_75","volume-title":"Automata, Languages and Programming","author":"E. Lebhar","year":"2004","unstructured":"Lebhar, E., Schabanel, N.: Almost optimal decentralized routing in long-range contact networks. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 894\u2013905. Springer, Heidelberg (2004)"},{"key":"52_CR15","unstructured":"Manku, G.S., Bawa, M., Raghavan, P.: Symphony: Distributed hashing in a small world. In: Proceedings of the 4th USENIX Symposium on Internet Technologies and Systems, pp. 127\u2013140 (2003)"},{"key":"52_CR16","doi-asserted-by":"crossref","unstructured":"Manku, G.S., Naor, M., Wieder, U.: Know thy neighbor\u2019s neighbor: The power of lookahead in randomized p2p networks. In: Proceedings of STOC 2004, pp. 54\u201363 (2004)","DOI":"10.1145\/1007352.1007368"},{"key":"52_CR17","doi-asserted-by":"crossref","unstructured":"Martel, C., Nguyen, V.: Analyzing Kleinberg\u2019s (and other) small-world models. In: PODC 2004, pp. 179\u2013188 (2004)","DOI":"10.1145\/1011767.1011794"},{"key":"52_CR18","doi-asserted-by":"crossref","unstructured":"Milgram, S.: The small world problem. Psychology Today\u00a061 (1967)","DOI":"10.1037\/e400002009-005"},{"key":"52_CR19","unstructured":"Newman, M.E.J.: Models of the small world. J. Stat. Phys.\u00a0101 (2000)"},{"key":"52_CR20","unstructured":"Nguyen, V., Martel, C.: Analyzing and Characterizing Small-World Graphs. In: SODA 2005 (2005)"},{"key":"52_CR21","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"D. Watts","year":"1998","unstructured":"Watts, D., Strogatz, S.: Collective dynamics of small-world networks. Nature\u00a0393, 440\u2013442 (1998)","journal-title":"Nature"},{"key":"52_CR22","doi-asserted-by":"crossref","unstructured":"Zhang, H., Goel, A., Govindan, R.: Using the small-world model to improve Freenet performance. In: Proceedings of IEEE INFOCOM 2002, pp. 1228\u20131237 (2002)","DOI":"10.1145\/510726.510753"},{"key":"52_CR23","doi-asserted-by":"crossref","unstructured":"Zeng, J., Hsu, W.-J.: Near Optimal Routing for Small-World Networks with Augmented Local Awareness (2005), Available at http:\/\/www.cais.ntu.edu.sg\/~zjy","DOI":"10.1007\/11576235_52"}],"container-title":["Lecture Notes in Computer Science","Parallel and Distributed Processing and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11576235_52.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T14:58:53Z","timestamp":1605625133000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11576235_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540297697","9783540321002"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/11576235_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}