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

A. Marsan, M. Bianco, A. Leonardi, E. And-neri, and F. , Topologies for wavelength-routing all-optical networks, IEEE/ACM Transactions on Networking, vol.1, issue.5, pp.5-534, 1993.
DOI : 10.1109/90.251912

A. , D. Raspaud, A. And-togni, and O. , Echange total dans les réseaux optiques obtenus par composition de cliques, 1996.

A. , Y. And-rabani, and Y. , Improved bounds for all optical routing, Proc. of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.567-576, 1995.

A. , B. Azar, Y. Fiat, A. And-leonardi, and S. , On-line competitive algorithms for call admission in optical networks, Lecture Notes in Computer Science, vol.1136, pp.431-444, 1996.

B. , J. Gargano, L. Perennes, S. Rescigno, A. A. And et al., Efficient collective communication in optical networks, Lecture Notes in Computer Science, vol.1099, pp.574-585, 1996.

C. A. Brackett, Dense wavelength division multiplexing networks: principles and applications, IEEE Journal on Selected Areas in Communications, vol.8, issue.6, pp.948-964, 1990.
DOI : 10.1109/49.57798

C. , N. K. , K. , N. And-winzer, and G. , Special issue on dense WDM networks, Journal on Selected Areas in Communications, vol.8, 1990.

E. , T. And-jansen, and K. , Scheduling of virtual connections in fast networks, Proc. of Parallel Systems and Algorithms (PASA), pp.13-32, 1996.

E. , T. And-jansen, and K. , Call scheduling in trees, rings and meshes, Proc. of HICSS, 1997.

E. , S. Itai, A. And-shamir, and A. , On the complexity of timetable and multicommodity flow problems, SIAM Journal of Computing, vol.5, issue.4, pp.691-703, 1976.

F. , A. Nishizeki, T. Saito, N. Suzuki, H. And-tardos et al., Algorithms for routing around a rectangle, Discrete Applied Mathematics, vol.40, pp.363-378, 1992.

G. , M. R. Johnson, D. S. Miller, G. L. And-papadimitriou, and C. H. , The complexity of coloring circular arcs and chords, SIAM Journal on Algebraic and Discrete Methods, vol.1, issue.2, pp.216-227, 1980.

G. , L. Hell, P. And-pérennes, and S. , Colouring paths in directed symmetric trees with applications to WDM routing

G. , M. C. And, J. , and R. E. , The edge intersection graphs of paths in a tree, Journal of Combinatorial Theory, Series B, vol.38, pp.8-22, 1985.

G. , Q. And-tamaki, and H. , Edge-disjoint routing in the undirected hypercube, 1996.

G. , Q. And-tamaki, and H. , Routing a permutation in the hypercube by two sets of edgedisjoint paths, Proc. of 10th International Parallel Processing Symposium (IPPS), 1996.

H. , P. And-roberts, and F. S. , Analogues of Shannon capacity, Annals of Discrete Mathematics, pp.155-168, 1982.

H. , M. Meyer, J. And-sotteau, and D. , On forwarding indices of networks, Discrete Applied Mathematics, vol.23, pp.103-123, 1989.

K. , C. Persiano, P. Erlebach, T. And-jansen, and K. , Constrained bipartite edge coloring with applications to wavelength routing

L. , F. T. And-rao, and S. , An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms, Proc. of 29th Annual Symposium on Foundations of Computer Science (FOCS), pp.422-431, 1988.

M. , M. Kaklamanis, C. And-rao, and S. , Efficient access to optical bandwidth? wavelength routing on directed fiber trees, rings, and trees of rings, Proc. of 36th Annual Symposium on Foundations of Computer Science (FOCS), pp.548-557, 1995.

M. , C. L. And-wei, and V. K. , Intersection graphs of paths in a tree, Journal of Combinatorial Theory, Series B, pp.141-181, 1986.

N. , K. Toba, H. Inoue, K. And-oda, and K. , 100 channel optical FDM technology and its applications to optical FDM channel-based networks, IEEE/OSA Journal of Lightwave Theory, vol.11, pp.764-776, 1993.

P. , R. K. And-gallager, and R. G. , Wavelength requirements of all?optical networks, IEEE/ACM Trans. on Networking, vol.3, pp.269-280, 1995.

R. , P. And-upfal, and E. , Efficient routing in all-optical networks, Proc. of the 26th Annual ACM Symposium on Theory of Computing, pp.134-143, 1994.

S. , M. And-matera, and F. , All optical implementations of high capacity TDMA networks, Fiber and Integrated Optics, vol.12, pp.173-186, 1993.

R. J. Vetter and D. H. And-du, Distributed computing with high-speed optical networks, Computer, vol.26, issue.2, pp.8-18, 1993.
DOI : 10.1109/2.191977