Self-organizing Bridges Crossing over Congestion in an Overlay Network

A decentralized algorithm for self-organizing shortcuts relying on traffic in an overlay network is proposed in this paper. A bridge or road crossing over an intersection to alleviate traffic congestion problem in Bangkok has ignited an idea to develop this algorithm. The proposed method aims to improve routing performance and to increase transmission reliability in dynamic environment. The temperature field is used to present buffer usage level. The hotter peer is the more overloaded buffer. Two groups of agents work cooperatively to construct shortcuts, called “Bridge”, across high bufferusage peers. The useless bridges are removed when the shortcuts have been no longer used. The performance of proposed method is analyzed in the powerful network simulator, named P2PNetSim. The experimental results sustain the proposed idea that the self-organizing bridges give less packet loss ratio and routing time. Besides, a self-organizing bridges structure shows better load balancing in a distributed overlay system.

[1]  Fernando Moraes,et al.  Evaluation of Routing Algorithms on Mesh Based NoCs , 2004 .

[2]  Herwig Unger,et al.  Routing with Temperature Field in Mesh Overlay Network , 2010, 2010 Ninth International Conference on Networks.

[3]  Charles U. Martel,et al.  Analyzing Kleinberg's (and other) small-world Models , 2004, PODC '04.

[4]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM 2001.

[5]  Peter Druschel,et al.  Pastry: Scalable, distributed object location and routing for large-scale peer-to- , 2001 .

[6]  Hauke Coltzau,et al.  P2Life: An Infrastructure for Networked Virtual Marketplace Environments , 2010, Int. J. Intell. Inf. Process..

[7]  Riccardo Lancellotti,et al.  A flexible and robust lookup algorithm for P2P systems , 2009, 2009 IEEE International Symposium on Parallel & Distributed Processing.

[8]  Herwig Unger,et al.  An Adaptive Policy Routing with Thermal Field Approach , 2009, IICS.

[9]  H. Unger,et al.  Grid generation in decentralized systems , 2009, 2009 2nd International Workshop on Nonlinear Dynamics and Synchronization.

[10]  Panchalee Sukjit,et al.  A New, Fully Decentralized Grid Generation Method , 2009 .

[11]  Moni Naor,et al.  Know Thy Neighbor's Neighbor: Better Routing for Skip-Graphs and Small Worlds , 2004, IPTPS.

[12]  Adward Lee.  A Study of Routing Algorithms in Wireless Mesh Networks , 2011 .

[13]  David R. Karger,et al.  Chord: a scalable peer-to-peer lookup protocol for internet applications , 2003, TNET.

[14]  L.-o. Lertsuwanakul,et al.  Bridging Overloaded Nodes in an Overlay Network by Long Distance Links , 2010 .

[15]  Martin May,et al.  HEAT: Scalable Routing in Wireless Mesh Networks Using Temperature Fields , 2007, 2007 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks.

[16]  Herwig Unger,et al.  Search in Communities: An Approach Derived from the Physic Analogue of Thermal Fields , 2004, ISSADS.

[17]  Jon M. Kleinberg,et al.  The small-world phenomenon: an algorithmic perspective , 2000, STOC '00.