Bridging Overloaded Nodes in an Overlay Network by Long Distance Links

L.-o. Lertsuwanakul, H. Unger (Germany), N. Mututanon, and P. Kajadsarapadpai (Thailand)


Self-organizing, Overlay network, Routing algorithm, Simulation.


This paper proposes a decentralized algorithm in a mesh overlay network in order to build shortcuts across an overloaded node or an area using long distance links. The present method aims to improve the routing performance and increase transmission reliability. This approach runs locally on a grid structure overlaying the basic network. Two groups of agents work cooperatively to build bridges across the traffic peer. The experimental results sustain the proposed idea that bridges give a better success delivery ratio and routing time using greedy routing algorithms. Besides, system shows better load balancing.

Important Links:

Go Back