Premium
All‐to‐all communication for some wavelength‐routed all‐optical networks
Author(s) -
Beauquier Bruno
Publication year - 1999
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/(sici)1097-0037(199905)33:3<179::aid-net4>3.0.co;2-6
Subject(s) - wavelength division multiplexing , computer science , routing and wavelength assignment , wavelength , computer network , telecommunications network , polygon mesh , hop (telecommunications) , multiplexing , bandwidth (computing) , traffic grooming , transmission (telecommunications) , telecommunications , topology (electrical circuits) , mathematics , optics , physics , combinatorics , computer graphics (images)
Abstract This paper studies the problem of all‐to‐all communication for optical networks. In such networks, the vast bandwidth available is utilized through wavelength division multiplexing (WDM): A single physical optical link can carry several logical signals provided that they are transmitted on different wavelengths. In this paper, we consider all ‐ optical (or single ‐ hop ) networks, where the information, once transmitted as light, reaches its destination without being converted to electronic form in between, thus reaching high data transmission rates. In this model, we give optimal all‐to‐all protocols, using minimum numbers of wavelengths, for particular networks of practical interest, namely, the d ‐dimensional square tori with even sides, the corresponding meshes, and the Cartesian sums of complete graphs. © 1999 John Wiley & Sons, Inc. Networks 33: 179–187, 1999