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 New Secure Protected De-duplication Structure With Upgraded Reliability

This makes the essential attempt to formalize the possibility of dispersed strong deduplication system. We propose new conveyed deduplication structures with higher unfaltering quality in which the data lumps are app...

Design And Analysis Of Machining (Hydraulic) Fixture For AVTEC Transmission Case Component

In order to have interchangeable parts in mass production, jigs and fixtures play a vital role in manufacturing process. A fixture is a special tool designed for specific purpose and for specific component for operat...

Secure Database as a Service for Cloud Tenants With no Exposure Of Unencrypted Data

We propose a novel engineering that incorporates cloud database administrations with data mystery and the probability of executing concurrent operations on mixed data. This is the main course of action supporting ge...

A Study on properties of Coconut Oil and shells, an alternative to Regular Aggregate in Concrete

"Sustainable" is being to a great degree fundamental around the globe. The example goes past the demonstration of configuration and construction, since the recognition with the present people is a critical variable f...

We propose a STP proof conspire named SpatialTemporal provenance Assurance with Mutual Proofs (STAMP). STAMP goes for guaranteeing the uprightness and non-transferability of the STP proofs, with the capacity of ensuri...

Download PDF file
  • EP ID EP16410
  • DOI -
  • Views 358
  • 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