This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Survival Reliability of Some Double-Loop Networks and Chordal Rings
December 1995 (vol. 44 no. 12)
pp. 1468-1471

Abstract—Three of the most well known double-loop networks are the distributed double-loop computer network (DDLCN), the daisy chain, and the braided ring. We compute the exact reliabilities of all three networks. We also extend the results on double-loop networks to directed chordal rings.

[1] B.W. Arden and H. Lee,“Analysis of chordal ring networks,” IEEE Trans. Computers, vol. 30, pp. 291-295, 1981.
[2] C. Derman,G.J. Lieberman,, and S.M. Ross,“On the consecutive k-out-of-n system,” IEEE Trans. Reliability, vol. 31, pp. 57-63, 1982.
[3] A. Grnarov,L. Kleinrock,, and M. Gerla,“A highly reliable distributed loop network architecture,” Proc. Int’l Symp. Fault-Tolerant Computing, pp. 319-324,Kyoto, Japan, 1980.
[4] X.D. Hu and F.K. Hwang,“Reliabilities of chordal rings,” Networks, vol. 22, pp. 487-501, 1992.
[5] X.D. Hu and F.K. Hwang,“Cutting numbers for the forward loop backward hop networks,” Discrete Applied Math., vol. 48, pp. 147-161, 1994.
[6] X.D. Hu,F.K. Hwang,, and W-C.W. Li,“Most reliable double-loop networks in survival reliability,” Networks, vol. 23, pp. 401-410, 1993.
[7] D.E. Huber,W. Steinlin,, and P.J. Wild,“SILK: An implementation of a buffer insertion ring,” IEEE J. Selected Areas Comm., vol. 1, pp. 766-774, 1983.
[8] F.K. Hwang,“Simplified reliabilities for consecutive-k-out-of-n systems,” SIAM J. Algebraic and Discrete Methods, vol. 7, pp. 258-264, 1986.
[9] F.K. Hwang and W.-C.W. Li,“Reliabilities of double-loop networks,” Probability in Engineering and Informational Science, vol. 5, pp. 255-272, 1991.
[10] O.C. Ibe,“Reliability comparison of token-ring network schemes,” IEEE Trans. Reliability, vol. 41, pp. 288-293, 1992.
[11] M.T. Liu,“Distributed loop computer networks,” Advances in Computers, vol. 17, pp. 163-221.New York: Academic Press, 1981.
[12] M.T. Liu,D.P. Tsay,C.P. Chou,, and C.M. Li,“Design of the distributed double-loop computer network (DDLCN),” J. Digital Systems, vol. 5, pp. 3-37, 1981.
[13] D. Logothetis and K. Trivedi,“Reliability analysis of various station attachment schemes in a FDDI tokenring,” IEEE Proc. INFOCOM 93,San Francisco, Mar. 1993.
[14] H. Masuyama,“Fault-tolerant ability to double-node failures in double-loop computernetworks,” Trans. Inst. of Electrical and Comm. Engineers of Japan, vol. 69, pp. 597-600, 1986.
[15] H. Masuyama and T. Ichimori,“Tolerance of double-loop computer network to multinode failures,” IEEE Trans. Computers, vol. 38, pp. 738-741, 1989.
[16] J. M. Peha and F.A. Tobagi,“Comments on tolerance of double-loop computer networks to multinodefailures,” IEEE Trans. Computers, vol. 41, pp. 1,488-1,450, 1992.
[17] C.S. Raghavendra,M. Gerla,, and A. Avizienis,“Reliable loop topologies for large local computer networks,” IEEE Trans. Computers, vol. 34, pp. 46-55, 1985.
[18] F.E. Ross,“FDDI—A tutorial,” IEEE Comm., vol. 24, pp. 10-15, 1986.
[19] W.E. Smith and K. S. Trivedi,“Dependability evaluation of a class of multi-loop topologies for local areanetworks,” IBM J. Research Development, vol. 33, pp. 511-523, 1989.
[20] E.A. van Doorn,“Connectivity of circulant graphs,” J. Graph Theory, vol. 10, pp. 9-14, 1986.
[21] J. Wolf,M. Liu,B. Weide,, and D. Tsay,“Design of a distributed fault-tolerant loop network,” Proc. Int’l Symp. Fault-Tolerant Computing, pp. 17-24,Madison, Wisc., 1979.
[22] J. Wolf,B. Weide,, and M. Liu,“Analysis and simulation of a distributed double-loop computernetwork,” Proc. Computer Network Symp., pp. 82-89.Gaithersburg, Md.: NBS, 1979.

Index Terms:
Double-loop network, daisy chain, fault tolerance, reliability, consecutive-2-out-of-n system, chordal ring.
Citation:
Paul E. Wright, Frank K. Hwang, "Survival Reliability of Some Double-Loop Networks and Chordal Rings," IEEE Transactions on Computers, vol. 44, no. 12, pp. 1468-1471, Dec. 1995, doi:10.1109/12.477253
Usage of this product signifies your acceptance of the Terms of Use.