A Routing Algorithm To Reduce The Queueing Complexity In Communication Networks

Abstract

A new adaptive routing algorithm built ahead the widely studied back-pressure algorithm. We decouple the routing and scheduling components of the algorithm by designing a probabilistic routing table that is used to route packets to per-destination queues. The scheduling decisions in the case of wireless networks are made using counters called shadow queues. The results are also extended to the case of networks that employ simple forms of network coding. The routing algorithm is considered to decrease the average number of hops used by packets in the network. This idea along with the scheduling/routing decoupling leads to setback decrease compared with the traditional back-pressure algorithm. The algorithm can be applied to wire line and wireless networks. Wide simulations show spectacular improvement in delay performance compared to the back-pressure algorithm. When network coding is employed per-previous-hop queues may also be essential but this is a requirement compulsory by network coding not by our algorithm.

Authors and Affiliations

Suresh Pydi| Department of Computer Science And Engineering Akula Sree Ramulu institute of Engineering and Technology, prathipadu,Tadepalligudem,A.P,India, sureshpydi9@gmail.com, Dr. A. Ramamurthy| Department of Computer Science And Engineering Akula Sree Ramulu institute of Engineering and Technology, prathipadu,Tadepalligudem,A.P,India, ram111_sai@yahoo.com, K. T. V Subbarao| Department of Computer Science And Engineering Akula Sree Ramulu institute of Engineering and Technology, prathipadu,Tadepalligudem,A.P,India, ogidi@rediffmail.com

Keywords

Related Articles

A Three Phase Four Wire Network Based Interleaved HighFrequency Inverter with Single-Reference Eight-Pulse-Modulation Technique for Fuel Cell Vehicle Applications

This paper presents a three phase four leg inverter with neutral connected to load. The inverter hybrid modulation technique consisting of singe-reference eight-pulse-modulation (SREPM) for front-end dc/dc converter...

A Secure Protocol for M-commerce Secure SMS Mobile Payment

The worldwide utilization of the Internet has profoundly supplied the development of e-commerce. Technological advancement in mobile phones (e.g. Mobile phones) has likewise added to doing ecommerce by means of mobile...

Deduplication Systems Using The Ramp Secret Sharing Scheme

Deduplication systems are ensured as far as the definitions specific in the security display, document level deduplication, which discover redundancies flanked by various records and take these redundancies to declin...

Reduction of Torque Ripple in Direct Torque Control of Induction Machines by Use of all Voltage Vectors of Matrix Converters

This paper proposes the use of all voltage vectors of matrix converters to reduce the electromagnetic torque ripple which is one of the most important drawbacks of direct torque control for induction motors using mat...

UPQC Implements The 3-Phase Shunt And Series Active Power Filter To Compensate Current And Voltage Harmonics

This paper presents the three phase shunt and series active power filter in order to reduce the current and voltage harmonics. To implement Unified Power Quality Conditioner (UPQC) control algorithm two control strat...

Download PDF file
  • EP ID EP16410
  • DOI -
  • Views 352
  • Downloads 11

How To Cite

Suresh Pydi, Dr. A. Ramamurthy, K. T. V Subbarao (2014). A Routing Algorithm To Reduce The Queueing Complexity In Communication Networks. International Journal of Science Engineering and Advance Technology, 2(12), 892-895. https://europub.co.uk./articles/-A-16410