Optical All-to-All Communication in Inflated Networks

  • Olivier Togni
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1517)


The problem of all-to-all communication in all-optical networks consist of designing directed paths between all ordered pairs of nodes and assigning them a wavelength, such that every two dipaths sharing a link have distinct wavelengths. The parameter to be minimised is the number of colors. We determine bounds on the number of wavelengths needed for optical networks that are obtained by replacing each node of a network by a complete subgraph.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Amar, D., Raspaud, A., Togni, O.: All-to-all wavelength routing in all-optical compound networks (submitted)Google Scholar
  2. 2.
    Beauquier, B.: All-to-all communication in some wavelength-routed all-optical networks (1996) (submitted)Google Scholar
  3. 3.
    Beauquier, B., Bermond, J.-C., Gargano, L., Hell, P., Perennes, S., Vaccaro, U.: Graphs problems arising from wavelength-routing in all-optical networks. In: Proc. WOCS 1997 (1997)Google Scholar
  4. 4.
    Berge, C.: Graphes et hypergraphes. In: DUNOD (1973)Google Scholar
  5. 5.
    Bermond, J.-C., Comellas, F., Hsu, D.F.: Distributed loop computer networks: A survey. Journal of Parallel and Distrubuted Computing 24, 2–10 (1995)CrossRefGoogle Scholar
  6. 6.
    Bermond, J.-C., Gargano, L., Perennes, S., Rescigno, A.A., Vaccaro, U.: Efficient collective communication in optical networks. LNCS, vol. 1099, pp. 574–585. Springer, Hidleberg (1996)zbMATHGoogle Scholar
  7. 7.
    Dunbar, J.E., Haines, T.W.: Domination in inflated graphs. Congr. Numeran-tium 118, 143–154 (1996)MathSciNetzbMATHGoogle Scholar
  8. 8.
    Erlebach, T., Jansen, K.: Call scheduling in trees, rings and meshes. In: HICSS: Hawaii International Conference on System Sciences, IEEE Computer Society Press, Los Alamitos (1997)Google Scholar
  9. 9.
    Gargano, L., Hell, P., Perenes, S.: Colouring paths in directed symetric trees with applications to WDM routing. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol. 1256, pp. 505–515. Springer, Heidelberg (1997)CrossRefGoogle Scholar
  10. 10.
    Heydemmann, M.C., Meyer, J.C., Sotteau, D.: On forwarding indices of networks. Discrete Applied Math. 23, 103–123 (1989)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Kaklamanis, C., Persiano, P., Erlebach, T., Jansen, K.: Constrained bipartite edge coloring with applications to wavelength routing. LNCS, vol. 1256, pp. 493–504. Springer, Hidleberg (1997)Google Scholar
  12. 12.
    Schroeder, H., Sykora, O., Vrt’o, I.: Optical all-to-all communication for some product graphs. In: Jeffery, K. (ed.) SOFSEM 1997. LNCS, vol. 1338, p. 555. Springer, Heidelberg (1997)CrossRefGoogle Scholar
  13. 13.
    Togni, O.: Force des graphes, indice optique des reséaux. PhD thesis, Université de Bordeaux I (1998) (in french)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Olivier Togni
    • 1
  1. 1.LaBRI, UMR 5800Université Bordeaux ITalenceFrance

Personalised recommendations