Distributed multiple-path searching algorithm for fault detection

Authors:
Sangwon Kim;Seongjin Ahn;Jin Wook Chung
Affiliations:
Dept. of Information and Communication Engineering, Sungkyunkwan University;Dept. of Computer Education, Sungkyunkwan University;Dept. of Information and Communication Engineering, Sungkyunkwan University
Venue:
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartII
Year:
2003

Citing 4
Cited 1

Loop-free routing using diffusing computations

IEEE/ACM Transactions on Networking (TON)
A Hierarchical Adaptive Distributed System-Level Diagnosis Algorithm

IEEE Transactions on Computers
Multi-Path Routing combined with Resource Reservation

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Distributed, scalable routing based on vectors of link states

IEEE Journal on Selected Areas in Communications

Transmission of layered video streaming via multi-path on ad hoc networks

Multimedia Tools and Applications

Quantified Score

Hi-index	0.00

Visualization

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 Multiple-path 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.