Manuscript Number : CSEIT184194
Secure End-to-End Information Exchange in communication Networks
Authors(2) :-C. Kiran, P. Prasad Babu Back-pressure-based adjustive routing algorithms where every packet is routed on a presumably totally different path have been extensively studied within the literature. However, such algorithms typically end in poor delay performance and involve high implementation complexness. during this paper, we tend to develop a brand new adjustive routing algorithmic rule designed upon the wide studied back-pressure algorithm. we tend to decouple the routing and programing elements of the algorithmic rule by coming up with a probabilistic routing table that's used to route packets to per-destination queues. The programing decisions within the case of wireless networks are created exploitation counters called shadow queues. The results also are extended to the case of networks that use straightforward sorts of network writing. In that case, our algorithmic rule provides a low-complexity resolution to optimally exploit the routing–coding exchange.
C. Kiran Back-pressure algorithm, network coding, routing, scheduling. Publication Details Published in : Volume 4 | Issue 2 | March-April 2018 Article Preview
Student, Dept of Computer Science And Engineering, RCR Institution of Management and Technology, Karakambadi, Tirupathi, India
P. Prasad Babu
Head of The Department, Dept of Comuter Applications, RCR Institution of Management And Technology, Karakambadi, Tirupathi, India
Date of Publication : 2018-03-31
License: This work is licensed under a Creative Commons Attribution 4.0 International License.
Page(s) : 533-537
Manuscript Number : CSEIT184194
Publisher : Technoscience Academy