Abstract
Traditional routing protocols schemes allow traffic to pass via the single shortest path. Pre-computing an alternative aims to route the traffic through it when the primary path goes down. A new algorithm schema has been proposed in this paper to find an alternative and disjoint path with primary one by creating a new backup routing table based on adjacent nodes for each node connected with the primary one. The results showing that loss packets, reroute and end to end delay times have been improved between source and destination with avoid loops on the network. The result obtained showed that new schema does not degrade from the network performance by sending an additional messages to create a new backup routing table. The Simulation results (using NS2 simulator) show a comparison between existing link state protocol and the proposed algorithm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Banner, R., Orda, A.: Multipath routing algorithms for congestion minimization. In: Boutaba, R., Almeroth, K.C., Puigjaner, R., Shen, S., Black, J.P. (eds.) NETWORKING 2005. LNCS, vol. 3462, pp. 536–548. Springer, Heidelberg (2005)
Basu, A., Riecke, J.G.: Abstract stability issues in ospf routing 35, 225–236 (2001)
Ericsson, M., Resende, M., Pardalos, P.M.: A genetic algorithm for the weight setting problem in ospf routing. Journal of Combinatorial Optimization 6, 299–333 (2002)
Narvaez, P., et al.: New dynamic spt algorithm based on a ball-and-string model (6), 706–718 (2001)
Francois, P., Filsfils, C., Evans, J., Bonaventure, O.: Achieving subsecond igp convergence in large ip networks 35(3), 35–44 (2005)
Iannaccone, G., Nee Chuah, C., Bhattacharyya, S., Diot, C.: Feasibility of ip restoration in a tier-1 backbone. IEEE Network 18 (2004)
Kin-Hon, H., Wang, N., Pavlou, G., Botsiaris, C.: Optimizing post-failure network performance for ip fast reroute using tunnels. In: QShine 2008: Proceedings of the 5th International ICST Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness. ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering), pp. 1–7. ICST, Brussels, Belgium (2008)
Menth, M., Hartmann, M.: Loop-free alternates and not-via addresses: A proper combination for ip fast reroute. Comput. Netw. 54, 1300–1315 (2010)
Narvaez, P., Siu, K.-Y., Tzeng, H.-Y.: Efficient algorithms for multi-path link-state routing (1999)
Nelakuditi, S., Lee, S., Yu, Y., Zhang, Z.-L.: Failure insensitive routing for ensuring service availability. In: Jeffay, K., Stoica, I., Wehrle, K. (eds.) IWQoS 2003. LNCS, vol. 2707, pp. 287–304. Springer, Heidelberg (2003)
Pascal, M., Jean-Jacques, P., Stephane, C.: Path computation for incoming interface multipath routing. In: European Conference on Universal Multiservice Networks, vol. 0, pp. 75–85 (2007)
Merindol, P., Pansiot, J.-J.: Improving load balancing with multipath routing (2008)
Rabbat, R., Siu, K.-Y.: Restoration methods for traffic engineered networks for loop-free routing guarantees (2001)
Schollmeier, G., Charzinski, J., Kirstdter, A.: Improving the resilience in ip networks, pp. 91–96 (2003)
Shand, M., Brayant, S.: A memetic algorithm for ospf routing. In: Proc. Informs Telecom, pp. 187–88 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abujassar, R.S., Ghanbari, M. (2011). An Efficient Algorithm to Create a Loop Free Backup Routing Table. In: Al-Majeed, S.S., Hu, CL., Nagamalai, D. (eds) Advances in Wireless, Mobile Networks and Applications. ICCSEA WiMoA 2011 2011. Communications in Computer and Information Science, vol 154. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21153-9_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-21153-9_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21152-2
Online ISBN: 978-3-642-21153-9
eBook Packages: Computer ScienceComputer Science (R0)