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

Low-Frequency Transmission for renewable sources

Now a day renewable energy is widely used such as wind energy and solar energy, due to their extreme abundance. So they should be properly interfaced with the power grid with suitable devices. In this paper a system...

A different approach for improved Privacy of User Data and Images on Content Sharing Sites using(A3P)

Adaptive Privacy Policy Prediction (A3P) system to help users compose privacy settings for their images. Social networking sites such as Facebook,LinkedIn,etc give opportunities to share large amount of personal info...

Finite Element Analysis of Wire Drawing Process with different die contours

Finite element method is a numerical analysis tool for analyzing complex problems. It was originally developed as a tool for structural, Thermal; fluent analysis and magnetic, electrical current flow analysis but the...

Dynamic Access Control In Cloud Computing Using Encryption/Decryption

Cloud computing has emerged as one of the most important paradigms in the IT industry for last few years. In general data owners and service providers are not in the same trusted domain in cloud computing. Service pr...

Transmitting Data Securely and Efficiently in Cluster-based Wireless Sensor Networks

The most critical issue in wireless sensor networks is Secure data transmission. The system performance of WSNs can be improved by Clustering which is an effective and practical way to. In this paper, we study a secur...

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