抽象的な

Adaptive Routing for Throughput Maximization

M.Hareesh Babu, B.Gurunadha Rao, B.Mahesh

Back-pressure natured algorithms are based on the algorithm proposed by Tassiulas and Ephremides in recent times acknowledged much attention for mutually routing and scheduling over multi hop wireless communication networks. However, this approach has a significant weakness in routing because the traditional back-pressure algorithm explores and exploits all feasible paths between each source and destination. While this extensive exploration is essential in order to maintain stability when the network is heavily loaded, under light or moderate loads, packets may be sent over unnecessarily long routes, and the algorithm could be very inefficient in terms of end-to-end delay and routing convergence times. In this paper we propose a novel algorithm to improve the throughput by choosing the shortest paths between the source and destination and it is extended in terms of identifying optimal tradeoff between routing of the packets and network coding.