Abstract
In order to investigate the routing aspects of small-world networks, Kleinberg [13] proposes a network model based on a d-dimensional lattice with long-range links chosen at random according to the d-harmonic distribution. Kleinberg shows that the greedy routing algorithm by using only local information performs in O(log2 n) expected number of hops, where n denotes the number of nodes in the network. Martel and Nguyen [17] have found that the expected diameter of Kleinberg’s small-world networks is Θ(log n). Thus a question arises naturally: Can we improve the routing algorithms to match the diameter of the networks while keeping the amount of information stored on each node as small as possible?
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Albert, R., Jeong, H., Barabasi, A.-L.: The diameter of the World Wide Web. Nature 401(9), 130–131 (1999)
Aspnes, J., Diamadi, Z., Shah, G.: Fault-tolerant routing in peer-to-peer systems. In: Proceedings of PODC 2002, pp. 223–232 (2002)
Barriére, L., Fraigniaud, P., Kranakis, E., Krizanc, D.: Efficient routing in networks with long range contacts. In: Welch, J.L. (ed.) DISC 2001. LNCS, vol. 2180, pp. 270–784. Springer, Heidelberg (2001)
Benjamini, I., Berger, N.: The Diameter of Long-Range Percolation Clusters on Finite Cycles. Random Structures and Algorithms 19(2), 102–111 (2001)
Biskup, M.: Graph diameter in long-range percolation. Submitted to Electron. Comm. Probab (2004)
Bollobás, B., Chung, F.R.K.: The Diameter of a cycle plus a random matching. SIAM Journal on Discrete Mathematics 1(3), 328–333 (1988)
Coppersmith, D., Gamarnik, D., Sviridenko, M.: The diameter of a long-range percolation graph. Random Structures and Algorithms 21(1), 1–13 (2002)
Dodds, P., Muhamad, R., Watts, D.: An experimental study of search in global social networks. Science 301, 827–829 (2003)
Kochen, M. (ed.): The small world, Ablex, Norwood (1989)
Fraigniaud, P., Gavoille, C., Paul, C.: Eclecticism shrinks even small worlds. In: PODC 2004, pp. 169–178 (2004)
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)
Kemper, D., Kleinberg, J., Demers, A.: Spatial gossip and resource location protocols. In: Proceedings of STOC, pp. 163–172 (2001)
Kleinberg, J.: The Small-World Phenomenon: An Algorithmic Perspective. In: Proceedings of the 32nd ACM Symposium on Theory of Computing, pp. 163–170 (2000)
Lebhar, E., Schabanel, N.: Almost optimal decentralized routing in long-range contact networks. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 894–905. Springer, Heidelberg (2004)
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–140 (2003)
Manku, G.S., Naor, M., Wieder, U.: Know thy neighbor’s neighbor: The power of lookahead in randomized p2p networks. In: Proceedings of STOC 2004, pp. 54–63 (2004)
Martel, C., Nguyen, V.: Analyzing Kleinberg’s (and other) small-world models. In: PODC 2004, pp. 179–188 (2004)
Milgram, S.: The small world problem. Psychology Today 61 (1967)
Newman, M.E.J.: Models of the small world. J. Stat. Phys. 101 (2000)
Nguyen, V., Martel, C.: Analyzing and Characterizing Small-World Graphs. In: SODA 2005 (2005)
Watts, D., Strogatz, S.: Collective dynamics of small-world networks. Nature 393, 440–442 (1998)
Zhang, H., Goel, A., Govindan, R.: Using the small-world model to improve Freenet performance. In: Proceedings of IEEE INFOCOM 2002, pp. 1228–1237 (2002)
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
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zeng, J., Hsu, WJ., Wang, J. (2005). Near Optimal Routing in a Small-World Network with Augmented Local Awareness. In: Pan, Y., Chen, D., Guo, M., Cao, J., Dongarra, J. (eds) Parallel and Distributed Processing and Applications. ISPA 2005. Lecture Notes in Computer Science, vol 3758. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11576235_52
Download citation
DOI: https://doi.org/10.1007/11576235_52
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29769-7
Online ISBN: 978-3-540-32100-2
eBook Packages: Computer ScienceComputer Science (R0)