Design theory
Applications of combinatorial designs in computer science
ACM Computing Surveys (CSUR)
Optical networks: a practical perspective
Optical networks: a practical perspective
Efficient Collective Communication in Optical Networks
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
INFORMATION-THEORETIC CONCEPTS FOR THE ANALYSIS OF COMPLEX NETWORKS
Applied Artificial Intelligence
Optical grooming with grooming ratio eight
Discrete Applied Mathematics
Optimal dimensioning of the WDM unidirectional ECOFRAME optical packet ring
Photonic Network Communications
| Hi-index | 0.00 |
In a synchronous optical network ring, assignment of source-to-destination circuits to wavelengths must respect traffic requirements and minimize both the number of wavelengths and the amount of terminal conversion equipment. When traffic requirements are approximately equal on all source-destination circuits, the assignment can be modeled as a graph decomposition problem. In this setting, techniques from combinatorial design theory can be applied. These techniques are introduced in a simpler form when every source-destination circuit requires one quarter of a wavelength. More sophisticated design-theoretic methods are then developed to produce the required decompositions for all sufficiently large ring sizes, when each source-destination circuit requires one eighth of a wavelength.