Optimal Fault-Tolerant ATM-Routings for Biconnected Graphs

We study the problem of designing fault-tolerant virtual path layouts for an ATM network which is a biconnected network of n processors in the surviving route graph model. The surviving route graph for a graph G, a routing p and a set of faults F is a directed graph consisting of nonfaulty nodes with a directed edge from a node x to a node y iff there are no faults on the route from x to y. The diameter of the surviving route graph could be one of the fault-tolerance measures for the graph G and the routing p. When a routing is considered as a virtual path layout, we can discuss the fault tolerance of virtual path layouts in the ATM network. In this paper, we show that we construct three routings for any biconnected graph such that the diameter of the surviving route graphs is optimal and they satisfy some desirable properties of virtual path layouts in ATM networks.

[1]  Ori Gerstel,et al.  The virtual path layout problem in fast networks (extended abstract) , 1994, PODC '94.

[2]  Alon Itai,et al.  The Multi-Tree Approach to Reliability in Distributed Networks , 1988, Inf. Comput..

[3]  Koichi Wada,et al.  Efficient Fault-Tolerant Fixed Routings on (k + 1)-Connected Digraphs , 1992, Discret. Appl. Math..

[4]  Jean-Yves Le Boudec,et al.  The Asynchronous Transfer Mode: A Tutorial , 1992, Comput. Networks ISDN Syst..

[5]  Kimio Kawaguchi,et al.  Optimal Fault-Tolerant Routings for Connected Graphs , 1992, Inf. Process. Lett..

[6]  Andrei Z. Broder,et al.  Efficient Fault-Tolerant Routings in Networks , 1987, Inf. Comput..

[7]  Ori Gerstel,et al.  A Scalable Approach to Routing in ATM Networks , 1994, WDAG.

[8]  Paul Feldman.  Fault tolerance of minimal path routings in a network , 1985, STOC '85.

[9]  Danny Dolev,et al.  A New Look at Fault-Tolerant Network Routing , 1987, Inf. Comput..

[10]  Takao Nishizeki,et al.  A Linear Algorithm for Bipartition of Biconnected Graphs , 1990, Inf. Process. Lett..

[11]  Shimon Even,et al.  Graph Algorithms , 1979 .

[12]  Avishai Wool,et al.  Optimal Layouts on a Chain ATM Network (Extended Abstract) , 1995, ESA.

[13]  Koichi Wada,et al.  New Results in Graph Routing , 1993, Inf. Comput..

[14]  Frank Harary,et al.  Graph Theory , 2016 .

[15]  David Peleg,et al.  On Fault Tolerant Routings in General Networks , 1987, Inf. Comput..

[16]  Andrzej Pelc,et al.  Minimizing Congestion of Layouts for ATM Networks with Faulty Links , 1996, Int. J. Found. Comput. Sci..

[17]  Avishai Wool,et al.  Optimal layouts on a chain ATM network , 1998, Discret. Appl. Math..

[18]  B. Bollobás,et al.  Extremal Graph Theory , 2013 .