Distributed routing algorithms can lead to a temporary elevation between path regeneration, which can cause major stability problems in high-speed networks. This paper introduces a new algorithm, Distributed Path Computing with Intermediate Variables (DPCIV), which can be integrated with any distributed algorithm to ensure that the directed graph caused by route decisions is always acyclic. An important contribution of DPCIV, in addition to its ability to work with any routing algorithm, is the update method using simple message exchanges between neighboring locations that ensure maximum ease at all times. DPCIV apparently outperforms existing loop blocking algorithms in key metrics such as the frequency of synchronized refresh and the ability to save paths during the transition. The simulation results that block these advantages in the context of a very short path are presented. In addition, the universal performance of DPCIV is demonstrated by studying its use of a functionally-oriented non-shortcut. In particular, the route seeks to counteract the power of failure by increasing the number of subsequent hops available at each destination.

Distance vector, shortest path, link state, routing algorithm

[1] N. Feamster, H. Balakrishnan, J. Rexford, A. Shaikh, and K. van der Merwe, “The case for separating routing from routers”, in Proceedings ACM SIGCOMM Workshop FDNA, Portland, OR, pp. 5–12.Sep. 2004.
[2] A. Shankar, C. Alaettinoglu, K. Dussa-Zieger, and I. Matta, “Transient and steady-state performance of routing protocols: Distance-vector versus link-state,” Internetw.: Res. Exper., vol. 6, no. 2, pp. 59–87, Jun. 1995.
[3] A. Myers, E. Ng, and H. Zhang, “Rethinking the service model: Scaling Ethernet to a million nodes”, presented at the ACM SIGCOMM Hot- Nets, San Diego, CA, 2004.
[4] Y. Ohba, “Issues on loop prevention in MPLS networks”, IEEE Communication Magazine, vol. 37, no. 12, pp. 64–68, Dec. 1999.
[5] T. Ramesh and S.Sumithra, “A Review on Different Approaches of Mutation Cost Reduction Techniques”, International Journal of Innovative Research in Computer and Communication Engineering, Vol.5, Issue.1, pp.771-775, January 2017.
[6] P. Francois and O. Bonaventure, “Avoiding transient loops during IGP convergence in IP networks”, in Proceedings IEEE INFOCOM, Miami, FL, Mar. vol. 1, pp. 237–247.2005.
[7] Gafni and D. Bertsekas, “Distributed algorithms for generating loop-free routes in networks with frequently changing topology”, IEEE Transaction Communications, vol. COM-29, no. 1, pp. 11–18, Jan. 1981.
[8] T. Ramesh and S.Sumithra, OPKNOT – Schemata Method for Mutation Testing Experimented on Event Driven Web Applications”, International Journal of Innovative Research in Computer and Communication Engineering, ISSN 2320-9798,Vol 5, Issue 1, , PP 761-770, January 2017.
[9] J. M. Jaffe and F. M. Moss, “A responsive routing algorithm for computer networks”, IEEE Transaction Communication, vol. 30, pp. 1768–1762, Jul.1982.
[10] J. J. Garcia-Lunes-Aceves, “Loop-free routing using diffusing computations”, IEEE/ACMTransaction. Networks, vol. 1, no. 1, pp. 130–141, Feb. 1993.
[11] S. Vutukury and J. J. Garcia-Luna-Aceves, “A simple approximation to minimum-delay routing,” in Proceedings ACM SIGCOMM, pp. 227–238.1999,
[12] S. Vutukury and J. J. Garcia-Luna-Aceves, “MDVA: A distance-vector multipath routing protocol,” in Proceedings IEEE INFOCOM, Anchorage, AK, vol. 1, pp. 557–564.Apr. 2001.
[13] K. Elmeleegy, A. L. Cox, and T. S. E. Ng, “On countto-infinity induced forwarding loops in Ethernet networks,” in Proceedings IEEE INFOCOM, , pp. 1– 13.2006.
[14] S. Dubey1 , R. Jhaggar, R. Verm , D. Gaur, “Encryption and Decryption of Data by Genetic Algorithm”, International Journal of Scientific Research in Computer Science and Engineering, Vol.5, Issue.3, pp.42-46, June 2017.
[15] Amr M. Kishk1, Nagy W. Messiha, Nawal A. El-Fishawy, Abdelrahman A. Alkafs and Ahmed H. Madian, “Proposed Jamming Removal Technique for Wireless Sensor Network”, International Journal of Scientific Research in Network Security and Communication, Vol.3, Issue. 2, April 2015.