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.

Authors and Affiliations

C. Kiran
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

Back-pressure algorithm, network coding, routing, scheduling.

  1. L Tassiulas and A. Ephremides, “Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks,” IEEE Trans. Autom. Control, vol. 37, no. 12, pp. 1936–1948, Dec. 1992.
  2. M J. Neely, E. Modiano, and C. E. Rohrs, “Dynamic power allocation and routing for time varying wireless networks,” IEEE J. Sel. Areas Commun., vol. 23, no. 1, pp. 89–103, Jan. 2005.
  3. L Bui, R. Srikant, and A. L. Stolyar, “Novel architectures and algorithms for delay reduction in back-pressure scheduling and routing,” in Proc. IEEE INFOCOM Mini-Conf., Apr. 2009, pp. 2936–2940.
  4. L Bui, R. Srikant, and A. L. Stolyar, “A novel architecture for delay reduction in the back-pressure scheduling algorithm,” IEEE/ACM Trans. Netw., vol. 19, no. 6, pp. 1597–1609, Dec. 2011.
  5. L Bui, R. Srikant, and A. L. Stolyar, “Optimal resource allocation for multicast flows in multihop wireless networks,” Phil. Trans. Roy. Soc., Ser. A, vol. 366, pp. 2059–2074, 2008.
  6. L Ying, S. Shakkottai, and A. Reddy, “On combining shortest-path and back-pressure routing over multihop wireless networks,” in Proc. IEEE INFOCOM, Apr. 2009, pp. 1674–1682.
  7. S Katti, H. Rahul, W. Hu, D. Katabi, M. Medard, and J. Crowcroft, “XORs in the air: Practical wireless network coding,” Comput. Commun. Rev., vol. 36, pp. 243–254, 2006.
  8. M Effros, T. Ho, and S. Kim, “A tiling approach to network code design for wireless networks,” in Proc. Inf. Theory Workshop, 2006, pp. 62–66.
  9. H Seferoglu, A. Markopoulou, and U. Kozat, “Network coding-aware rate control and scheduling in wireless networks,” in Proc. ICME Special Session Netw. Coding Multimedia Streaming, Cancun, Mexico, Jun. 2009, pp. 1496–1499.
  10. S. B. S. Sengupta and S. Rayanchu, “An analysis of wireless network coding for unicast sessions: The case for coding-aware routing,” in Proc. IEEE INFOCOM, Anchorage, AK, May 2007, pp. 1028–1036.
  11. T. Ho and H. Viswanathan, “Dynamic algorithms for multicast with intra-session network coding,” IEEE Trans. Inf. Theory, vol. 55, no. 2, pp. 797–815, Feb. 2009.
  12. A. Eryilmaz, D. S. Lun, and B. T. Swapna, “Control of multi-hop communication networks for inter-session network coding,” IEEE Trans. Inf. Theory, vol. 57, no. 2, pp. 1092–1110, Feb. 2011.
  13. L. Chen, T. Ho, S. H. Low, M. Chiang, and J. C. Doyle, “Optimization based rate control for multicast with network coding,” in Proc. IEEE INFOCOM, Anchorage, AK, May 2007, pp. 1163–1171.
  14. B. Awerbuch and T. Leighton, “A simple local-control approximation algorithmformulticommodity flow,” in Proc. 34th Annu. Symp. Found. Comput. Sci., 1993, pp. 459–468.
  15. A. Dimakis and J. Walrand, “Sufficient conditions for stability of longest-queue-first scheduling: Second-order properties using fluid limits,” Adv. Appl. Probab., vol. 38, no. 2, Jun. 2006.

Publication Details

Published in : Volume 4 | Issue 2 | March-April 2018
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

ISSN : 2456-3307

Cite This Article :

C. Kiran, P. Prasad Babu, "Secure End-to-End Information Exchange in communication Networks", International Journal of Scientific Research in Computer Science, Engineering and Information Technology (IJSRCSEIT), ISSN : 2456-3307, Volume 4, Issue 2, pp.533-537, March-April-2018.
Journal URL : http://ijsrcseit.com/CSEIT184194

Follow Us

Contact Us