Shortest path reduction in a class of uniform fault tolerant networks

Shortest path determination in a class of optimally fault tolerant networks designed using modified line graphs is described here. Appropriate node naming allows the shortest paths to be determined in 0(log n) steps. This is applicable even in the presence of node failures, without loops or backtracking. The stretch of the network is maintained at the theoretically minimum value possible of one.

[1]  Miguel Angel Fiol,et al.  Line Digraph Iterations and the (d, k) Digraph Problem , 1984, IEEE Transactions on Computers.

[2]  Sudhakar M. Reddy,et al.  Distributed fault-tolerance for large multiprocessor systems , 1980, ISCA '80.

[3]  Makoto Imase,et al.  Connectivity of Regular Directed Graphs with Small Diameters , 1985, IEEE Transactions on Computers.

[4]  N.B. Shroff,et al.  Joint resource allocation and base-station assignment for the downlink in CDMA networks , 2006, IEEE/ACM Transactions on Networking.

[5]  Subir Bandyopadhyay,et al.  A Synthesis Approach to Design Optimally Fault Tolerant Network Architecture , 1991, IEEE Trans. Computers.

[6]  Xiaowei Yang,et al.  Compact routing on Internet-like graphs , 2003, IEEE INFOCOM 2004.

[7]  Stefan Savage,et al.  Fatih: detecting and isolating malicious routers , 2005, 2005 International Conference on Dependable Systems and Networks (DSN'05).

[8]  Dhiraj K. Pradhan,et al.  A Fault-Tolerant Communication Architecture for Distributed Systems , 1982, IEEE Transactions on Computers.

[9]  Mihaela Enachescu,et al.  Reducing Maximum Stretch in Compact Routing , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[10]  Robert Poor,et al.  Self-Healing Networks , 2003, ACM Queue.

[11]  Robert E. Tarjan,et al.  A quick method for finding shortest pairs of disjoint paths , 1984, Networks.

[12]  Jared Saia,et al.  Picking up the Pieces: Self-Healing in reconfigurable networks , 2008, 2008 IEEE International Symposium on Parallel and Distributed Processing.

[13]  Joseph Naor,et al.  An Efficient Reconstruction of a Graph from its Line Graph in Parallel , 1990, J. Algorithms.

[14]  Alan J. Hoffman,et al.  On Moore Graphs with Diameters 2 and 3 , 1960, IBM J. Res. Dev..

[15]  Carles Padró,et al.  Connectivity and fault-tolerance of hyperdigraphs , 2002, Discret. Appl. Math..

[16]  Miguel Angel Fiol,et al.  Line digraph iterations and the (d,k) problem for directed graphs , 1983, ISCA '83.

[17]  Dhiraj K. Pradhan,et al.  Fault-Tolerant Multiprocessor Link and Bus Network Architectures , 1994, IEEE Transactions on Computers.

[18]  Amitabh Trehan,et al.  Algorithms for Self-Healing Networks , 2013, ArXiv.

[19]  W. T. Tutte.  A family of cubical graphs , 1947, Mathematical Proceedings of the Cambridge Philosophical Society.

[20]  Ulrich Schumacher.  An algorithm for construction of a k-connected graph with minimum number of edges and quasiminimal diameter , 1984, Networks.

[21]  Dharma P. Agrawal,et al.  Generalized Hypercube and Hyperbus Structures for a Computer Network , 1984, IEEE Transactions on Computers.

[22]  Chen-Nee Chuah,et al.  Failure Inferencing Based Fast Rerouting for Handling Transient Link and Node Failures , 2006, INFOCOM.