]. G. Agr92, Fiber-Optic Communication Systems, 1992.

]. C. Bra90 and . Brackett, Dense wavelength division multiplexing networks: principles and applications, IEEE Journal on Selected A reas in Communications, vol.8, issue.6, p.9488964, 1990.

]. E. Des94 and . Desurvire, Erbium-Doped Fiber Ampliiers: Principles and Applications, 1994.

D. Durhuus, B. Mikkelsen, C. Joergensen, S. L. Danielsen, and K. E. Stubkjaer, All-optical wavelength conversion by semiconductor optical ampliiers, IEEE/OSA Journal of Lightwave Technology, vol.14, pp.9422-954, 1996.

]. A. Gla93 and . Glass, Fiber optics, Physics Today, 1993.

]. P. Gre91 and . Green, The future of berroptic computer networks, IEEE Computer, vol.24, issue.9, p.78887, 1991.

]. P. Hen85 and . H-e-n-r-y, Lightwave primer, IEEE Journal of Quantum Electronics, vol.21, p.186221879, 1985.

J. , I. Joindot, and M. Joindot, Les TTllcommunications par Fibre Optique, 1996.

L. , R. A. Linke, and A. H. Gnauk, High-capacity coherent l i g h twave systems, IEEE Journal of Lightwave Technology, vol.6, issue.11, pp.175001769-1988

L. , A. Libchaber, and G. Toulouse, Le retour des solitons

]. B. Muk92 and . Mukherjee, WDM-based local lightwave networks, Part 1: Singlehop systems, IEEE Network Magazine, vol.6, issue.3, p.12227, 1992.

]. K. Pet88 and . Petermann, Laser Diode Modulation and Noise, 1988.

S. , R. Sabella, and E. Iannone, Wavelength conversion in optical transport networks, Journal of Fiber and Integrated Optics, vol.15, issue.3, p.1677191, 1996.

W. Van-etten and J. Van-der-plaats, Fundamentals of Optical Fiber Communications, 1991.

]. T. Whi95 and . Whitley, A review of recent system demonstrations incorporating 1.3-m praseodymium-doped uoride ber ampliiers, IEEE/OSA Journal of Lightwave Technology, vol.13, p.7444760, 1995.

]. J. Wie96 and . Wiesenfeld, Wavelength conversion techniques, Proc. of Optical Fiber Communication (OFC'96), p.71172, 1996.

]. T. Woo88 and . Wood, Multiple Quantum Well (MQW) waveguide modulators, IEEE Journal of Lightwave Technology, vol.6, issue.6, p.1433157, 1988.

]. S. Yoo96 and . Yoo, Wavelength conversion technologies for WDM network applications, IEEE/OSA Journal of Lightwave Technology, vol.14, pp.9555-966, 1996.

P. Fraigniaud and E. Lazard, Methods and problems of communication in usual networks, Discrete Applied Mathematics, vol.53, issue.1-3, p.799133, 1994.
DOI : 10.1016/0166-218X(94)90180-5

]. P. Fra95a and . Raigniaud, Vers un principe de localitt pour les communications dans les rseaux d'interconnexion. Thhse d'habilitation, 1995.

]. A. Fra95b and . Frank, Handbook of Combinatorics, Connectivity and Network Flows, p.1111177, 1995.

A. Fiat and G. J. Woeginger, Online Algorithms: The State of the Art, volume 1442 of Lecture Notes in Computer Science, 1998.
DOI : 10.1007/BFb0029561

]. L. Gar98 and . Gargano, Limited wavelength conversion in all-optical tree networks, Proc. of 25th International Colloquium on Automata, Languages and Programming (ICALP'98), v olume 1443 of Lecture Notes in Computer Science, p.5444555, 1998.

M. R. Garey and D. S. Johnson, Computers and Intractability - A Guide to the Theory of NPPCompleteness, 1979.

G. , A. V. Goldberg, and R. E. Tarjan, Network ow algorithms, Paths, Flows and VLSI-Layout, p.1011164, 1990.

H. , S. M. Hedetniemi, S. T. Hedetniemi, and A. L. Liestman, A survey of gossiping and broadcasting in communication networks, Networks, vol.18, p.3199349, 1986.

J. Hromkovic, R. Klasing, B. Monien, and R. Peine, Combinatorial Network Theory, chapter Dissemination of information in interconnection networks (broadcasting and gossiping, p.1255212, 1995.

A. A. Aggarwal, A. Bar-noy, D. Coppersmith, R. Ramaswami, B. Schieber et al., EEcient routing and scheduling algorithms for optical networks, Proc. of the 5th Annual ACM- SIAM Symposium on Discrete Algorithms (SODA'94), pp.4122-423, 1994.

A. A. Aggarwal, A. Bar-noy, D. Coppersmith, R. Ramaswami, B. Schieber et al., EEcient routing in optical networks, Journal of the ACM, vol.46, issue.6, p.97331001

A. , Y. Aumann, and Y. Rabani, Improved boundsfor all optical routing, Proc. of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'95), p.5677576, 1995.

B. Beauquier, J. Bermond, L. Gargano, P. Hell, S. Prennes et al., Graph problems arising from wavelength-routing in alloptical networks, Proc. of IPPS'97, 2nd Workshop on Optics and Computer Science (WOCS'97), Gennve, 1997.
URL : https://hal.archives-ouvertes.fr/inria-00073523

]. B. Bea99 and . Beauquier, All-to-all communication in some wavelength-routed all-optical networks, Networks, vol.33, issue.3, p.1799187, 1999.

B. Bermond, L. Gargano, S. Prennes, A. A. Rescigno, and U. Vaccaro, EEcient collective communication in optical networks, Proc. of 23rd International Colloquium on Automata, Languages and Programming (ICALP'96), volume 1099 of Lecture Notes in Computer Science, p.5744585, 1996.

B. B. Beauquier and P. , Hell, a n d S . P rennes. Optimal wavelentgh-routed multicasting, Discrete Applied Mathematics, vol.84, p.15520, 1998.

B. Beauquier, S. Prennes, and D. Ttth, All-to-all routing and coloring in weighted trees of rings, Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures , SPAA '99, p.1855190, 1999.
DOI : 10.1145/305619.305639
URL : https://hal.archives-ouvertes.fr/inria-00072968

E. Erlebach, Scheduling Connections in Fast Networks, 1998.

F. S. Fortune, J. Hopcroft, and J. Wyllie, The directed subgraph homeomorphism problem, Theoretical Computer Science, vol.10, issue.2, p.1111121, 1980.
DOI : 10.1016/0304-3975(80)90009-2

F. A. Frank, T. Nishizeki, N. Saito, H. Suzuki, and E. Tardos, Algorithms for routing around a rectangle, Discrete Applied Mathematics, vol.40, issue.3, p.3633378, 1992.
DOI : 10.1016/0166-218X(92)90007-W

]. A. Fra85 and . Frank, Edge-disjoint paths in planar graphs, Journal of Combinatorial Theory, Series B, vol.38, p.1644178, 1985.

]. A. Fra90 and . Frank, Packing paths, circuits and cuts A survey, Paths, Flows and VLSI-Layout, p.477100, 1990.

F. , S. Fiorini, and R. J. Wilson, Edge-Coloring of Graphs, Research Notes in Mathematics, issue.16, 1977.

G. L. Gargano, P. Hell, and S. Prennes, Colouring paths in directed symmetric trees with applications to WDM routing, Proc. of 24th Int. Colloq. on Automata, Languages and Programming (ICALP'97, 1997.
DOI : 10.1007/3-540-63165-8_206

]. M. Gj85a, R. E. Golumbic, and . Jamison, Edge and vertex intersection of paths in a tree, Discrete Mathematics, vol.55, p.1511159, 1985.

]. M. Gj85b, R. E. Golumbic, and . Jamison, T h e e d g e i n tersection graphs of paths in a tree, Journal of Comb. Theory, Series B, vol.38, p.8822, 1985.

G. , M. R. Garey, D. S. Johnson, G. L. Miller, and C. H. Papadimitriou, The complexity of coloring circular arcs and chords, SIAM Journal on Algebraic and Discrete Methods, vol.1, issue.2, p.2166227, 1980.

]. M. Gol84a and . Goldberg, An approximate algorithm for the edge-coloring problem, Congressus Numerantium, vol.43, p.3177319, 1984.

]. M. Gol84b and . Goldberg, Edge-coloring of multigraphs: Recoloring technique, Journal of Graph Theory, vol.8, p.1233137, 1984.

H. Heydemann, J. Meyer, J. Opatrny, and D. Sotteau, Forwarding indices of consistent routings and their complexity, Networks, vol.6, issue.2, p.75582, 1994.
DOI : 10.1002/net.3230240204

H. Heydemann, J. Meyer, and D. Sotteau, On forwarding indices of networks, Discrete Applied Mathematics, vol.23, issue.2, p.1033123, 1989.
DOI : 10.1016/0166-218X(89)90022-X

]. I. Hol81 and . Holyer, The NPPcompleteness of edge coloring, SIAM Journal of Computing, vol.10, issue.4, p.7188720, 1981.

H. , P. Hell, and F. S. Roberts, Analogues of Shannon capacity, Annals of Discrete Mathematics, p.1555168, 1982.

]. K. Jan97 and . Jansen, Approximation results for wavelength routing in directed trees, Proc. of IPPS'97, 2nd Workshop on Optics and Computer Science (WOCS'97), 1997.

]. A. Jar99 and . Jarry, Thhorie des graphes: chemins disjoints, 1999.

]. I. Kar80 and . Karapetyan, On coloring of arc graphs. Doklady Akad, Nauk Armianskoi CCP, vol.70, issue.5, p.3066311, 1980.

K. , C. Kaklamanis, and P. Persiano, EEcient wavelength routing on directed ber trees, Proc. of European Symposium on Algorithms (ESA'96), v olume 1136 of Lecture Notes in Computer Science, 1996.

K. , V. Kumar, and E. J. Schwabe, Improved access to optical bandwidth in trees, Proc. of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'97, p.4377444, 1997.

J. Kleinberg and . Va-tardos, Disjoint paths in densely embedded graphs, Proc. of 36th Annual Symposium on Foundations of Computer Science (FOCS'95), p.52261, 1995.

]. V. Kum98 and . Kumar, Approximating circular arc coloring and bandwidth allocation in all-optical ring networks, Proc. of the International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX'98), v olume 1444 of Lecture Notes in Computer Science, 1998.

R. , N. Robertson, and P. D. Seymour, Graph minors XIII.The disjoint paths problem, Journal of Combinatorial Theory, Series B, vol.63, 1995.

P. Raghavan and C. D. Thompson, Randomized routing: A technique for provably good algorithms and algorithmic proofs, Combinatorica, vol.7, issue.4, p.3655374, 1987.

P. Raghavan and E. Upfal, EEcient routing in all-optical networks, Proc. of the 26th Annual ACM Symposium on Theory of Computing (STOC'94), p.1344143, 1994.

W. K. Shih and W. L. Hsu, An approximation algorithm for coloring circular-arc graphs, Proc. of SIAM Conference on Discrete Mathematics, 1990.

]. C. Sha49 and . Shannon, A theorem on coloring the lines of a network, J. Math. Phys, vol.28, p.1488151, 1949.

]. Y. Shi79 and . Shiloach, Edge-disjoint branching in directed multigraphs, Information Processing Letters, vol.8, issue.1, p.24427, 1979.

]. P. Sol95 and . Soll, Expanding and forwarding, Discrete Applied Mathematics, vol.58, p.67778, 1995.

]. R. Tar85 and . Tarjan, Decomposition by clique separators, Discrete Mathematics, vol.55, issue.2, p.2211232, 1985.

]. O. Tog98a and . Togni, Force des graphes Indice optique des rseaux, 1998.

]. O. Tog98b and . Togni, Optical all-to-all communication in innated networks, Proc. of the 5th Annual International Workshop on Graph-Theoretic Concepts in Computer Science (WG'98), p.78887, 1998.

]. A. Tuc75 and . Tucker, Coloring a family of circular arcs, SIAM Journal of Applied Mathematics, vol.29, issue.3, p.4933502, 1975.

]. G. Wil96 and . Wilfong, Minimizing wavelengths in an all-optical ring network, Proc. of the 7th International Symposium on Algorithms and Computation (ISAAC'96), p.3466355, 1996.

G. Wilfong and P. Winkler, Ring routing and wavelength translation, Proc. of the 9th Ann. ACM-SIAM Symposium on Discrete Algorithms (SODA'98), p.3333341, 1998.

B. Beauquier, J. Bermond, L. Gargano, P. Hell, S. Pérennes et al., Graph problems arising from wavelength?routing in all?optical networks, Proc. of 2 nd Workshop on Optics and Computer Science, 1997.
URL : https://hal.archives-ouvertes.fr/inria-00073523

N. K. Cheung, K. Nosu, and G. Winzer, Special issue on dense WDM networks, Journal on Selected Areas in Communications, vol.8, 1990.

P. E. Green, Fiber?Optic Communication Networks, 1993.

D. Minoli, Telecommunications Technology Handbook. Artech House, 1991.

B. Mukherjee, WDM-based local lightwave networks. I. Single-hop systems, IEEE Network, vol.6, issue.3, pp.12-27, 1992.
DOI : 10.1109/65.139139

A. Aggarwal, A. Bar-noy, D. Coppersmith, R. Ramaswami, B. Schieber et al., EEcient routing and scheduling algorithms for optical networks, Proc. of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), p.4122423, 1994.

Y. Aumann and Y. Rabani, Improved bounds for all optical routing, Proc. of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), p.5677576, 1995.

B. Beauquier, J. Bermond, L. Gargano, P. Hell, S. Prennes et al., Graph problems arising from wavelengthhrouting in allloptical networks, Proc. of 2nd Workshop on Optics and Computer Science (WOCS), part of IPPS, 1997.

C. Berge, Graphs and Hypergraphs, 1973.

J. Bermond, L. Gargano, S. Prennes, A. A. Rescigno, and U. Vaccaro, EEcient collective c o m m unication in optical networks, Automata, Languages and Programming, 23rd International Colloquium (ICALP), p.5744585, 1996.

N. K. Cheung, K. Nosu, and G. Winzer, Special issue on dense WDM networks, IEEE Journal on Selected A reas in Communications

R. Jean-de, Communications dans les rseaux de processeurs. Collection tudes et Recherches en Informatique, 1994.

T. Erlebach and K. Jansen, Scheduling of virtual connections in fast networks, Proc. of Parallel Systems and Algorithms (PASA), p.13332, 1996.

T. Erlebach and K. Jansen, Call scheduling in trees, rings and meshes, Proceedings of the Thirtieth Hawaii International Conference on System Sciences, 1997.
DOI : 10.1109/HICSS.1997.667220

L. Gargano, P. Hell, and S. Prennes, Colouring paths in directed symmetric trees with applications to WDM routing, Automata, Languages and Programming, 24th International Colloquium (ICALP), v olume 1256 of Lecture Notes in Computer Science, p.5055515, 1997.
DOI : 10.1007/3-540-63165-8_206

M. Heydemann, J. Meyer, and D. Sotteau, On forwarding indices of networks, Discrete Applied Mathematics, vol.23, issue.2, p.1033123, 1989.
DOI : 10.1016/0166-218X(89)90022-X

Y. Manoussakis and Z. Tuza, The forwarding index of directed networks, Discrete Applied Mathematics, vol.68, issue.3, p.2799291, 1996.
DOI : 10.1016/0166-218X(95)00072-Y

D. Minoli, Telecommunications Technology Handbook. Artech House, 1991.

B. Mukherjee, WDM-based local lightwave n e t works, Part I: Single-hop systems, IEEE Network Magazine, vol.6, issue.3, p.12227, 1992.

R. K. Panka-j, Architectures for Linear Lightwave Networks, 1992.

A. Pelc, Fault-tolerant broadcasting and gossiping in communication networks, Networks, vol.28, issue.3, 1996.
DOI : 10.1002/(SICI)1097-0037(199610)28:3<143::AID-NET3>3.0.CO;2-N

P. Raghavan and E. Upfal, EEcient routing in all-optical networks, Proc. of the 26th Annual ACM Symposium on Theory of Computing (STOC), p.1344143, 1994.

H. Schrrder and O. , SSkora, and I. Vrt'o. Optical all-to-all communication for some product graphs, Proc. of 24th Seminar on Current Trends in Theory and Practice of Informatics (SOFSEM), 1997.

P. Soll, Expanding and forwarding, Discrete Applied Mathematics, vol.58, issue.1, pp.67778-120, 1995.
DOI : 10.1016/0166-218X(93)E0118-I

A. Aggarwal, A. Bar-noy, D. Coppersmith, R. Ramaswami, B. Schieber et al., EEcient routing and scheduling algorithms for optical networks, Proc. of the 5th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA'94), p.4122423, 1994.

Y. Aumann and Y. Rabani, Improved bounds for all optical routing, Proc. of the 6th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA'95), p.5677576, 1995.

B. Beauquier, All-to-all communication in some wavelength-routed all-optical networks, p.1799187, 1999.

B. Beauquier, J. Bermond, L. Gargano, P. Hell, S. Prennes et al., Graph problems arising from wavelengthhrouting in allloptical networks, Proc. of 2nd IEEE Workshop on Optics and Computer Science (WOCS, part of IPPS'97, 1997.

J. Bermond, L. Gargano, S. Prennes, A. A. Rescigno, and U. Vaccaro, EEcient collective c o m m unication in optical networks, Proc. of 23rd Int. Colloq. on Automata, Languages and Programming (ICALP'96), v olume 1099 of Lecture Notes in Computer Science, p.5744585, 1996.

N. K. Cheung, K. Nosu, and G. Winzer, Special issue on dense WDM networks, Journal on Selected A reas in Communications, vol.8

T. Erlebach and K. Jansen, Scheduling of virtual connections in fast networks, Proc. of Parallel Systems and Algorithms (PASA), p.13332, 1996.

L. Gargano, P. Hell, and S. Prennes, Colouring paths in directed symmetric trees with applications to WDM routing, Proc. of 24th Int. Colloq. on Automata, Languages and Programming (ICALP'97, p.5055515, 1997.
DOI : 10.1007/3-540-63165-8_206

P. E. Green, The future of berroptic computer networks, IEEE Computer, vol.24, issue.9, pp.788-87, 1991.

C. Kaklamanis and P. Persiano, EEcient wavelength routing on directed ber trees, Proc. of European Symp. on Algorithms (ESA'96), v olume 1136 of Lecture Notes in Computer Science, p.4600470, 1996.

M. Mihail, C. Kaklamanis, and S. Rao, EEcient access to optical bandwidthh wavelength routing on directed ber trees, rings, and trees of rings, Proc. of 36th Ann. Symp. on Foundations of Computer Science (FOCS'95), p.5488557, 1995.

D. Minoli, Telecommunications Technology Handbook. Artech House, 1991.

B. Mukherjee, WDM-based local lightwave n e t works, Part 1: Single-hop systems, IEEE Network Magazine, vol.6, issue.3, p.12227, 1992.
DOI : 10.1109/65.139139

P. Raghavan and E. Upfal, EEcient routing in all-optical networks, Proc. of the 26th Ann. ACM Symp. on Theory of Computing (STOC'94), p.1344143, 1994.

R. Ramaswami, Multiwavelength lightwave networks for computer communication, IEEE Communications Magazine, vol.31, issue.2, p.78888, 1993.
DOI : 10.1109/35.186364

O. Togni, Optical all-to-all communication in innated networks, Proc. of the 5th Ann. Int. Workshop on Graph-Theoretic Concepts in Computer Science (WG'98), p.78887, 1998.

G. Wilfong, Minimizing wavelengths in an all-optical ring network, Proc. of the 7th Int. Symp. on Algorithms and Computation (ISAAC'96), v olume 1178 of Lecture Notes in Computer Science, p.3466355, 1996.
DOI : 10.1007/BFb0009511

B. Beauquier, Broadcasting in WDM optical rings and toriMultichannel Optical Networks : Theory and Practice, Proc. the DIMACS Workshop 46 of DI- MACS Series on Discrete Mathematics and Theoretical Computer Science, p.63373, 1998.

B. Beauquier, J. Bermond, L. Gargano, P. Hell, S. Prennes et al., Graph problems arising from wavelengthhrouting in allloptical networks, Proc. of 2nd IEEE Workshop on Optics and Computer Science ( W OCS, part of IPPS'97, 1997.

J. Bermond, L. Gargano, S. Prennes, A. A. Rescigno, and U. Vaccaro, EEcient collective communication in optical networks, Proc. of 23rd International Colloquium on Automata, Languages and Programming (ICALP'96), v olume 1099 of Lecture Notes in Computer Science, p.5744585, 1996.

J. Bermond, P. Michallon, and D. Trystram, Broadcasting in wraparound meshes with parallel monodirectional links, Parallel Computing, vol.18, issue.6, p.6399648, 1992.
DOI : 10.1016/0167-8191(92)90004-Q

J. Bruck, C. Ho, S. Kipnis, and D. Weathersby, EEcient algorithms for all-to-all communications in multi-port message-passing systems, Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA '94), p.2988309

O. Delmas, Communications par commutation de circuits dans les rseaux d'interconnexion, U.F.R. de Sciences, Ecole Doctorale -Sciences pour l, 1997.

E. Fleury, Communications, routage et architectures des machines mmmoire distribuue -A utour du routage wormhole, Thhse de doctorat, 1996.

P. Fraigniaud, Performance analysis of broadcasting hypercubes with restricted communication capabilities, Journal of Parallel and Distributed Computing, vol.16, p.15526, 1992.

P. Raigniaud and C. Laforest, Disjoint spanning trees of small depth, ParCo '93, p.1055112, 1993.

P. Raigniaud and E. Lazard, Methods and problems of communication in usual networks, Discrete Applied Mathematics, vol.53, p.799133, 1990.

S. M. Hedetniemi, S. T. Hedetniemi, and A. L. Liestman, A survey of gossiping and broadcasting in communication networks, Networks, vol.3, issue.4, p.3199349, 1986.
DOI : 10.1002/net.3230180406

M. Barnett, D. G. Payne, and R. Van-de-geijn, Optimal broadcasting in mesh-connected architectures, 1991.

B. Beauquier, O. Delmas, and S. Prennes, TIGHT BOUNDS FOR BROADCASTING IN THE LINEAR COST MODEL, Institut National de Recherche en Informatique et en Automatique, 1997.
DOI : 10.1142/S0219265901000312
URL : https://hal.archives-ouvertes.fr/inria-00072831

N. K. Cheung, K. Nosu, and G. Winzer, Special issue on dense WDM networks, IEEE Journal on Selected A reas in Communications

E. Paul and . Green, Fiber Optic Networks, 1993.

C. T. Ho and S. L. Johnsson, Optimum broadcasting and personalized communication in hypercubes, IEEE Transactions on Computers, vol.38, issue.9, p.124991268

D. Minoli, Telecommunications Technology Handbook. Artech House, 1991.

B. Mukherjee, WDM-based local lightwave networks, Part II: Multihop systems, IEEE Network Magazine, vol.6, issue.4, p.20032, 1992.
DOI : 10.1109/65.145161

S. R. Seidel, Broadcasting on linear arrays and meshes, 0174.

. Mai, An extended abstract of this paper has been accepted in ALGOTEL'99, This work has been supported by Alcatel Space Industries, p.557, 1999.

B. Beauquier and E. Darrot, Rearrangeable switching networks tolerant to switch l o c ks, Manuscript (title may c hange)

V. Benee, Permutation groups, complexes, and rearrangeable multistage connecting networks, Bell Sys. Tech. Journal, vol.43, p.161991640, 1964.

V. Benee, Mathematical Theory of Connecting Networks and Telephone Traac, 1965.

V. Benee, Applications of Group Theory to Connecting Networks, Bell System Technical Journal, vol.54, issue.2, 1975.
DOI : 10.1002/j.1538-7305.1975.tb02844.x

J. Bermond, E. Darrot, and O. Delmas, Design of fault-tolerant on-board networks in satellites

C. Chang and R. Melhem, Arbitrary size Benee networks, Parallel Processing Letters, vol.7, issue.3, 1997.
DOI : 10.1142/s0129626497000292
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.48.4770

C. Clos, A Study of Non-Blocking Switching Networks, Bell System Technical Journal, vol.32, issue.2, 1953.
DOI : 10.1002/j.1538-7305.1953.tb01433.x

L. Goldstein and S. Leibholz, On the Synthesis of Signal Switching Networks with Transient Blocking, IEEE Transactions on Electronic Computers, vol.16, issue.5, p.6377641, 1967.
DOI : 10.1109/PGEC.1967.264771

W. Kautz, K. Levitt, and A. Waksman, Cellular Interconnection Arrays, IEEE Transactions on Computers, vol.17, issue.5, 1968.
DOI : 10.1109/TC.1968.226908

S. Prennes and D. Ttth, Design of fault-tolerant t o w networks

A. Waksman, A Permutation Network, Journal of the ACM, vol.15, issue.1, pp.1599163-188, 1969.
DOI : 10.1145/321439.321449