Abstract
A decentralized algorithm for self-organize shortcuts relying on traffic in an overlay network is proposed. The idea is motivated by a bridge across the traffic jam junction in Bangkok. This method aims to improve routing performance and increase transsimission reliability in dynamic environment. The temperature field is used to present buffer usage level, so hotter peer implies more overloaded. Two groups of agents work cooperatively to construct shortcuts, called “Bridge′′, across high buffer-usage peers. The useless bridges are removed when those shortcuts have not been used. The performance of proposed method is analyzed in the P2PNetSim, a powerful network simulator. The experimental results sustain the proposed idea that the self-organizing bridges give less routing time and loss ratio. Besides, a selforganizing grid show better load balancing in a distributed overlay system.
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
Rowstron, A., Druschel, P.: Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In: Proc. of the Middleware (2001)
Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: a scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Transactions on Networking (11), 17–32 (2003)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content addressable network. In: Proc. of the ACM SIGCOMM, pp. 171–172 (2001)
Andreolini, M., Lancellotti, R.: A flexible and robust lookup algorithm for P2P systems. In: IEEE International Symposium on Parallel & Distributed Processing, pp. 1–8 (2009)
Gnutella Protocol Development v0.6 (2002), http://rfc-gnutella.sourceforge.net/src/rfc-0_6-draft.html
Lua, E.K., Crowcroft, J., Pias, M., Scharma, R., Lim, S.: A Survey and Comparison of Peer-to-Peer Overlay Network Scheme. IEEE Communications Survey and Tutorial (2004)
Berg, D., Sukjit, P., Unger, H.: Grid Generation in Decentralized Systems. In: Proc. 2nd Int. Workshop on Nonlinear Dynamics and Synchronization 2009, Austria, pp. 95–99 (2009)
Sukjit, P., Berg, D.: A New, Fully Decentralized Grid Generation Method. In: Proc. of 5th National Conference on Computing and Information Technology, Bangkok, Thailand, pp. 24–28 (2009)
Martel, C., Nguyen, V.: Analyzing Kleinberg’s (and other) Small-world models. In: Proc. 23rd ACM Symposium on Principles of Distributed Computing, Canada, pp. 179–188 (2004)
Kleinberg, J.: The small-world phenomenon: an algorithm perspective. In: Proc. of the 32nd Annual ACM Symposium on theory of Computing, New York, pp. 163–170 (2000)
Zou, F., Li, Y., Zhang, L., Ma, F.-Y., Li, M.: A Novel Approach for Constructing Small World in Structured P2P Systems. In: Jin, H., Pan, Y., Xiao, N., Sun, J. (eds.) GCC 2004. LNCS, vol. 3251, pp. 807–810. Springer, Heidelberg (2004)
Naor, M., Wieder, U.: Know Thy Neighbor’s Neighbor: Better Routing for Skip-Graphs and Small Worlds. In: Voelker, G.M., Shenker, S. (eds.) IPTPS 2004. LNCS, vol. 3279, pp. 269–277. Springer, Heidelberg (2005)
Lertsuwanakul, L., Tuammee, S., Unger, H.: Routing with Temperature Field in Mesh Overlay Network. In: Proc. 9th Int. Conf. on Networks, France, pp. 285–290 (2010)
Lertsuwanakul, L., Unger, H.: An Adaptive Policy Routing with Thermal Field Approach. In: Proc. 9th Innovative Internet Community Systems, Germany, pp. 169–179 (2009)
Lee, A., Ward, P.A.S.: A Study of Routing Algorithms in Wireless Mesh Networks. In: ATNAC (December 2004)
Mello, A.V., Ost, L.C., Moraes, F.G., Calazans, N.L.: Evaluation of Routing Algorithms on Mesh Based NoCs, Technical Report Series No.040 (May 2004)
Watt, D., Strogatz, S.: Collective dynamics of small world network. Nature (393), 440–442 (1998)
Unger, H., Wulff, M.: Search in Communities: An Approach Derived from the Physic Analogue of Thermal Fields. In: Ramos, F.F., Unger, H., Larios, V. (eds.) ISSADS 2004. LNCS, vol. 3061, pp. 186–196. Springer, Heidelberg (2004)
Baumann, R., Heimlicher, S., Lenders, V., May, M.: HEAT: Scalable Routing in Wireless Mesh Networks Using Temperature Fields. In: IEEE Symposium on a World of Wireless, Mobile and Multimedia Networks (2007)
Lertsuwanakul, L., Unger, H., Mututanon, N., Kajadsarapadpai, P.: Bridging Overloaded Nodes in an Overlay Network by Long Distance Links. In: Proc. in 30th IASTED Conference on Modelling, Identification, and Control (AsiaMIC 2010), Phuket, Thaialnd (2010)
Coltzau, H.: Specification and Implementation of Parallel P2P Network Simulation Environment, Diploma Thesis, University of Rostock (2006)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Lertsuwanakul, Lo., Unger, H. (2012). Self-organizing Shortcuts in an Overlay Network. In: Unger, H., Kyamaky, K., Kacprzyk, J. (eds) Autonomous Systems: Developments and Trends. Studies in Computational Intelligence, vol 391. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24806-1_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-24806-1_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24805-4
Online ISBN: 978-3-642-24806-1
eBook Packages: EngineeringEngineering (R0)