Abstract
Routing protocols are being developed in a way such that they can search paths based on application needs or paths that can increase network utilization. This thesis proposes a Distributed Multiplepath Searching algorithm based on the network fault detection. This algorithm efficiently searches the loop-free multiple paths heading from one node towards all nodes within a network. Also, this algorithm is designed to search the optimal path selectively by expansion. We show our algorithm’s experimental result by simulation in a test network.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
I. Cidon, R. Rom, and Y. Shavitt: Multi-Path Routing Combined with Resource Reservation, IEEE INFOCOM’97, Kobe, Japan, April 1997.
S. Chen and K. Nahrstedt: Distributed QoS routing in high-speed networks based on selective probing, University of Illinois at Urbana Champaign, Technical Report, 1998.
Kwang Jong Cho, Seongjin Ahn, Jin Wook Chung: RBR Based Network Configuration Fault Management Algorihms using Agent Collaboration, Korea Information Processing Society(KIPS), vol. 9-C, pp.497–504, 2002.
Elias Procopio Durate Jr. and Takashi Nanya: A Hierarchical Adaptive Distributed System-Level Diagnosis Algorithm, IEEE Trans. Computers, Vol.47, pp.34–45, 1998.
C. Hendrick: Routing Information Protocol, RFC 1058, June 1988.
D. Farinachi: Introduction to enhanced IGRP(EIGRP). Cisco Systems Inc., July 1993.
J. Moy: OSPF Version 2, RFC 1247, August 1991.
G. Apostolopoulos, S. Kamat, D. Williams, R. Guerin, A. Orda, T. Przygienda: QoS Routing Mechanisms and OSPF Extensions, RFC 2676, August 1999.
R. Guerin, A. Orda, and D. Williams: QoS Routing Mechanisms and OSPF Extensions, Globecom’ 97, November 1997.
J. Spinelli and R. Gallager: Event Driven Topology Broadcast without Sequence Numbers, IEEE Trans. Commun., 37:468–474, May 1989.
J. Garcia-Luna-Aceves and J. Behrens: Distributed, Scalable Routing Based on Vectors of Link States, IEEE Journal on Selected Areas in Communications, vol.13, no.8, pp.1383–1395, October 1995.
C. Hsu and J. Y. Hui: Load-Balanced K-Shortest Path Routing for Circuit-Switched Networks, In Proceedings of IEEE NY/NJ Regional Control Conference, August 1994.
J. Garcia-Luna-Aceves: Loop-Free Routing Using Diffusing Computations, IEEE/ACM Trans, Networking, February 1993.
J. Cain, S. Adams, M. Noakes, and E. Althouse: A Near-Optimum Multiple Path Routing Algorithm for Space-Based SDI Networks, Proc. IEEE MILCOM’ 87, Washington, D.C., pp.29.3.1–29.3.7, October 1987.
J. Cain, S.L. Adams, and M. Noakes: Multiple-Path Routing Mechanism for Packet Communications Network, U.S. Patent No. 4,905,233, Harris Corp., Melbourne, Florida, February 1990.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, S., Ahn, S., Chung, J.W. (2003). Distributed Multiple-Path Searching Algorithm for Fault Detection. In: Kumar, V., Gavrilova, M.L., Tan, C.J.K., L’Ecuyer, P. (eds) Computational Science and Its Applications — ICCSA 2003. ICCSA 2003. Lecture Notes in Computer Science, vol 2668. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44843-8_73
Download citation
DOI: https://doi.org/10.1007/3-540-44843-8_73
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40161-2
Online ISBN: 978-3-540-44843-3
eBook Packages: Springer Book Archive