Fault-tolerant routings in double fixed-step networks

Discrete Applied Mathematics

Volumn 78, Issue 1-3, 1997, Pages 61-74

  Fabrega J ^a   Zaragoza M ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Cayley graphs; Fault tolerance; Loop networks; Surviving route graph

Indexed keywords

EID: 0002644192     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(97)00015-2     Document Type: Article

References (22)

1. F. Aguiló, M.A. Fiol, An efficient algorithm to find optimal double loop networks, Discrete Math. 138 (1995) 15-30.
2. J.-C. Bermond, F. Comellas, D.F. Hsu, Distributed loop computer networks: a survey, J. Parallel Distrib. Comput. 24 (1995) 2-10.
3. R. Beivide, V. Viñals, C. Rodriguez, Optimal topologies with four bidirectional links and its applications, Proceedings of the IAESTED International Symposium AI'87, Grindelwald, Switzerland, 1987, pp. 66-69.
4. J.-C. Bermond, N. Homobono, C. Peyrat, Large fault-tolerant interconnection networks, Graphs Combin. 5 (1989) 107-123.
5. J.-C. Bermond, G. Illiades, C. Peyrat, An optimization problem in distributed loop computer networks, Proceedings of the 3rd International Conference on Combinatorial Math., New York, USA, June 1985, Annals of the New York Acad. Science, Vol. 555, 1989, pp. 45-55.
6. J.-C. Bermond, D. Tzvieli, Minimal double-loop networks: dense optimal families, Networks 21 (1991) 1-9.
7. F.T. Boesch, J.K. Wang, Reliable circulant networks with minimum transmission delay, IEEE Trans. Circuits System CAS-32 (1985) 1286-1291.
8. G. Chartrand, L. Lesniak, Graphs and Digraphs, Wadsworth, Monterey, 1986.
9. S. Chen, X-D Jia, Undirected loop networks, Networks 23 (1993) 257-260.
10. D. Dolev, J. Halpern, B. Simons, R. Strong, A new look at fault tolerant network routing, Proceedings ACM 16th STOC, 1984, pp. 526-535.
11. D.-Z. Du, D.F. Hsu, Q. Li, J. Xu, A combinatorial problem related to distributed loop networks, Networks 20 (1990) 173-180.
12. P. Erdos, D.F. Hsu, Distributed loop networks with minimum transmission delay, Theoret. Comput. Sei. 100 (1992) 223-241.
13. M.A. Fiol, J.L.A. Yebra, M.L. Fiol, Grafos y teselaciones del plano, Actas III JAEM, Zaragoza, Spain, 10-12 March, 1983, pp. 69-77.
14. M.A. Fiol, J.L.A. Yebra, I. Alegre, M. Valero, A discrete optimization problem in local networks and data alignment, IEEE Trans. Comput. C-36 (1987) 702-713.
15. F.K. Hwang, A survey on double loop networks, Proceedings DIMACS Workshop on Reliability of Computer and Communication Networks, Rutger University, New Brunswick, NJ, 2-4 December, 1989.
16. D.F. Hsu, J. Shapiro, Bounds for the minimal number of transmission delays in double loop networks, J. Combin. Inform. System Sci. 16 (1991) 55-62.
17. D.F. Hsu, J. Shapiro, A census of tight one-optimal double loop networks, in: J. Alavi et al. (Eds.), Graph Theory, Combinatorics Algorithms and Applications, SIAM, Philadelphia, 1991, pp. 254-265.
18. M.T. Liu, Distributed loop computer networks, Adv. Comput. 17 (1978) 163-221.
19. P. Morillo, Grafos y digrafos asociados con teselaciones como modelos de redes de interconexión, Ph. Dissertation, Universitat Politècnica de Catalunya (1987).
20. C.K. Wong, D. Coppersmith, A combinatorial problem related to multimode memory organizations, J. Assoc. Comput. Mach. 21 (1974) 392-402.
21. D. Tzvieli, Minimal diameter double-loop networks. I. Large infinite optimal families, Networks 21 (1991) 387-415.
22. J.L.A. Yebra, M.A. Fiol, P. Morillo, I. Alegre, The diameter of undirected graphs associated to plane tessellations. Ars Combin. 20B (1985) 159-171.