A survey on multi-loop networks

Theoretical Computer Science

Volumn 299, Issue 1-3, 2003, Pages 107-121

  Hwang, F K ^a  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; GRAPH THEORY; HAMILTONIANS; THEOREM PROVING;

MULTI-LOOP NETWORKS;

COMPUTER NETWORKS;

EID: 0037453323     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00341-3     Document Type: Article

References (30)

1. Aguilo F., Fiol M.A., Garcia C. Triple loop networks with small transmission delay. Discrete Math. 167/168:1997;3-16.
2. Arden B.W., Lee H. Analysis of chordal ring networks. IEEE Trans. Comput. C. 30:1981;291-295.
3. Bermond J.C., Comellas F., Hsu D.F. Distributed loop computer networks: a survey. J. Para. Distr. Comput. 24:1995;2-10.
4. Bermond J.C., Favaron O., Maheo M. Hamiltonian decomposition of Cayley graph of degree four. J. Combin. Theory B. 46:1989;142-153.
5. Bermond J.C., Illiades G., Peyrat C. An optimization problem in distributed loop computer networks. Ann. New York Acad. Sci. S55:1989;45-55.
6. Boesch F.T., Tindell R. Circulants and their connectivity. J. Graph Theory. 8:1984;487-499.
7. Boesch F.T., Wang J.K. Reliable circulant networks with minimum transmission delay. IEEE Trans. Circuits Syst. 32:1985;1286-1291.
8. C. Chen, F.K. Hwang, J.S. Lee, S.J. Shih, The existence of hyper-L shapes in triple-loop networks, preprint, 2001.
9. M.Y. Chen, F.K. Hwang, C.H. Yen, Tessellating shapes in the plane, preprint, 2001.
10. S.K. Chen, F.K. Hwang, Y.C. Liu, Mixed chordal rings, preprint, 2001.
11. Chen S., Jia X.D. Undirected loop networks. Networks. 23:1993;257-260.
12. Cheng Y., Hwang F.K. Diameters of weighted double loop networks. J. Algebra. 9:1988;401-410.
13. Dao H.M., Silio C.B. Jr. Ring-network reliability with a constrained number of consecutively-bypassed stations. IEEE Trans. Rel. 47:1998;35-43.
14. van Dorne E.A. Connectivity of circulant graphs. J. Graph Theory. 10:1986;9-14.
15. Erdös P., Hsu D.F. Distributed loóp network with minimum transmission delay. Theoret. Comput. Sci. 100:1992;23-241.
16. Fàbrega J., Zaragozà M. Fault tolerant routings in double fixed-step networks. Discrete Appl. Math. 78:1997;61-74.
17. Fiol M.A., Yebra J.L.A., Alegre I., Valero M. A discrete optimization problem in local networks and data alignment. IEEE Trans. Comput. 36:1987;702-713.
18. Hamidoune Y.O. Quelques problems de connexitè dans les graphes orientès. J. Combin. Theory B. 30:1981;1-10.
19. Hamidoune Y.O., Tindell R. Vertex transitivity and super line connectedness. SIAM J. Discrete Math. 3:1990;524-530.
20. Hsu D.F., Jia X.D. Extremal problems in the combinatorial construction of distributed loop networks. SIAM J. Discrete Math. 7:1994;57-71.
21. Hwang F.K. A complementary survey of double loop networks. Theoret. Comput. Sci. 263:2001;211-229.
22. Hwang F.K., Wright P.E. Survival reliability of some double-loop networks ad chordal rings. IEEE Trans. Comput. 44:1995;1468-1471.
23. Liu M.T. Distributed Loop Computer Networks. Advances in Computers. Vol. 17:1981;163-221 Academic Press, New York.
24. Mader W. Minimale. n -fach kantenzusamenhängende graphen Math. Ann. 191:1971;21-28.
25. Raghavendra C.S., Sylvester J.A. A survey of multi-connected loop topologies for local computer networks. Comput. Network ISDN Syst. 11:1986;29-42.
26. Schrijver A., Seymour P.D., Winkler P. The ring loading problem. SIAM J. Discrete Math. 11:1998;1-14.
27. Watkins M.E. Connectivity of transitive graphs. J. Graph. Theory. 8:1970;23-29.
28. Wong C.K., Coppersmith D. A combinatorial problem related to multimode memory organizations. J. ACM. 21:1974;392-402.
29. Yebra J.L.A., Fiol M.A., Morillo P., Alegre I. The diameter of undirected graphs associated to plane tessellations. Ars Combin. 20B:1985;159-171.
30. Zerovink J., Pisanski T. Computing the diameter in multiple-loop networks. J. Algebra. 14:1993;226-243.