Paper Info
Title
Adaptive fault tolerant routing in star graph
Abstract
In this paper a fault tolerant routing algorithm on star graph is proposed. Each node in an n-star is associated with a fault-vector of d=$\lceil \frac{3(n-1)}{2} \rceil$bits, which is an approximate measure of the number and distribution of faults in the neighborhood. The routing algorithm based on the fault-vector finds the shortest path between any source-destination pair in presence of large number of faulty nodes or links. Simulation results show that the % of cases where the algorithm fails to find a shortest path even when a shortest path exists, is as low as 2.7 with 140 node or link faults in a 7-star.
Year
DOI
Venue
2004
10.1007/978-3-540-30536-1_43
IWDC
Keywords
Field
DocType
star graph,link fault,shortest path,simulation result,large number,faulty node,adaptive fault tolerant routing,approximate measure,fault tolerant,source-destination pair,routing algorithm
Topology,Link-state routing protocol,Shortest path problem,Constrained Shortest Path First,Theoretical computer science,Yen's algorithm,Suurballe's algorithm,Private Network-to-Network Interface,Shortest Path Faster Algorithm,Mathematics,K shortest path routing
Conference
Volume
ISSN
ISBN
3326
0302-9743
3-540-24076-4
Citations 
PageRank 
References 
2
0.38
7
Authors
1
Name
Order
Citations
PageRank
Rajib K. Das1358.94