A Regular Network for Multicomputer Systems

Arden,; Lee, Hikyu

doi:10.1109/tc.1982.1675886

Cited by 36 publications

(1 citation statement)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We are interested in the construction of reliable and fault-tolerant routings of shortest paths in networks modeled by chordal ring graphs. Authors that have contributed to the study of these problems, for doubleand triple-loop graphs are, among others, Aguiló and Fiol [1], Arden and Lee [4], Escudero et al [13], Fàbrega and Zaragozá [15], Hwang and Wright [22], Liestman et al [23], Manabe et al [24], Mukhopadhyaya and Sinha [27], Narayanan and Opatrny [28], and Zaragozá [32]. As mentioned above, a tile that periodically tessellates the plane will be associated to the graph under study.…”

Section: Introductionmentioning

confidence: 99%

Fault-tolerant routings in chordal ring networks

et al. 2000

View full text Add to dashboard Cite

This paper studies routing vulnerability in networks modeled by chordal ring graphs. In a chordal ring graph, the vertices are labeled in ℤ2n and each even vertex i is adjacent to the vertices i + a, i + b, i, + c, where a, b, and c are different odd integers. Our study is based on a geometrical representation that associates to the graph a tile which periodically tessellates the plane. Using this approach, we present some previous results on triple‐loop graphs, including an algorithm to calculate the coordinates of a given vertex in the tile. Then, an optimal consistent fault‐tolerant routing of shortest paths is defined for a chordal ring graph with odd diameter and maximum order. This is accomplished by associating to the chordal ring graph a triple‐loop one. When some faulty elements are present in the network, we give a method to obtain central vertices, which are vertices that can be used to reroute any communication affected by the faulty elements. This implies that the diameter of the corresponding surviving route graph is optimum. © 2000 John Wiley & Sons, Inc.

show abstract

Section: Introductionmentioning

confidence: 99%

Fault-tolerant routings in chordal ring networks

et al. 2000

View full text Add to dashboard Cite

show abstract

Fault‐tolerant routings in chordal ring networks

et al. 2000

View full text Add to dashboard Cite

This paper studies routing vulnerability in networks modeled by chordal ring graphs. In a chordal ring graph, the vertices are labeled in Z Z Z 2n 2n 2n and each even vertex Our study is based on a geometrical representation that associates to the graph a tile which periodically tessellates the plane. Using this approach, we present some previous results on triple-loop graphs, including an algorithm to calculate the coordinates of a given vertex in the tile. Then, an optimal consistent fault-tolerant routing of shortest paths is defined for a chordal ring graph with odd diameter and maximum order. This is accomplished by associating to the chordal ring graph a triple-loop one. When some faulty elements are present in the network, we give a method to obtain central vertices, which are vertices that can be used to reroute any communication affected by the faulty elements. This implies that the diameter of the corresponding surviving route graph is optimum.

show abstract

An Almost Regular Fault Tolerant Network with Arbitrary Number of Nodes

Sur

Srimani

1995

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

A Regular Network for Multicomputer Systems

Cited by 36 publications

References 12 publications

Fault-tolerant routings in chordal ring networks

Fault-tolerant routings in chordal ring networks

Fault‐tolerant routings in chordal ring networks

An Almost Regular Fault Tolerant Network with Arbitrary Number of Nodes

Contact Info

Product

Resources

About