Secure End-to-End Information Exchange in communication Networks

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.