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

We show another fine-grained two-factor Authentication (2FA) get the opportunity to control system for electronic conveyed processing organizations. Specifically, in our proposed 2FA access control structure, a quali...

STUDY OF MECHANISM USED FOR AUTOMATING THE MECHANICAL SYSTEM

Automation will no longer be seen only as automatic production, but as a complex of technologies that guarantee reliability, flexibility, safety, for humans as well as for the environment. In a world of limited resou...

Speech Emotion Verification Using Emotion Variance And Discriminate Scale Frequency Maps

The problems of emotion variances and emotion blending are solved using the emotion verification system. In this methodology consists of two parts. The first part, feature extraction is used to lessen the huge input...

Reduced On_Chip Codeword Generation For Cross Talk Effect In Data Transmission Bus

Today we are having tremendous growth on cross technologies but these technology is limited on interconnected networks. We are having delay for these networks our major goal is prune delay this type of networks but i...

Face Recognition Based Security System Using Sift Algorithm

Present days most of the door lock systems are organized by humans with the application of keys, secured password & unpredictable pattern to operate the door. The purpose of this paper is to help the users to develop...

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