Self-organizing Shortcuts in an Overlay Network

  • Lada-on Lertsuwanakul
  • Herwig Unger
Part of the Studies in Computational Intelligence book series (SCI, volume 391)


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.


Delivery Ratio Overlay Network Success Ratio Wireless Mesh Network Virtual Link 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Rowstron, A., Druschel, P.: Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In: Proc. of the Middleware (2001)Google Scholar
  2. 2.
    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)CrossRefGoogle Scholar
  3. 3.
    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)Google Scholar
  4. 4.
    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)Google Scholar
  5. 5.
    Gnutella Protocol Development v0.6 (2002),
  6. 6.
    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)Google Scholar
  7. 7.
    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)Google Scholar
  8. 8.
    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)Google Scholar
  9. 9.
    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)Google Scholar
  10. 10.
    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)Google Scholar
  11. 11.
    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)CrossRefGoogle Scholar
  12. 12.
    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)CrossRefGoogle Scholar
  13. 13.
    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)Google Scholar
  14. 14.
    Lertsuwanakul, L., Unger, H.: An Adaptive Policy Routing with Thermal Field Approach. In: Proc. 9th Innovative Internet Community Systems, Germany, pp. 169–179 (2009)Google Scholar
  15. 15.
    Lee, A., Ward, P.A.S.: A Study of Routing Algorithms in Wireless Mesh Networks. In: ATNAC (December 2004)Google Scholar
  16. 16.
    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)Google Scholar
  17. 17.
    Watt, D., Strogatz, S.: Collective dynamics of small world network. Nature (393), 440–442 (1998)CrossRefGoogle Scholar
  18. 18.
    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)CrossRefGoogle Scholar
  19. 19.
    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)Google Scholar
  20. 20.
    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)Google Scholar
  21. 21.
    Coltzau, H.: Specification and Implementation of Parallel P2P Network Simulation Environment, Diploma Thesis, University of Rostock (2006)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  1. 1.Department of Communication NetworksFernuniversitaet in HagenHagenGermany

Personalised recommendations