All-to-all communication for some wavelength-routed all-optical networks

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0037(199905)33:3<179::AID-NET4>3.0.CO;2-6" /><179::AID-NET4>3.0.CO;2-6 10.1002/(SICI)1097-0037(199905)33:3<179::AID-NET4>3.0.CO;2-6zbMath0940.90018OpenAlexW1975751521MaRDI QIDQ4254353

Bruno Beauquier

Publication date: 25 July 2000

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199905)33:3<179::aid-net4>3.0.co;2-6

zbMATH Keywords

complete graphsoptical networksminimum numbers of wavelengths

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15)

Related Items (11)

Colouring paths in directed symmetric trees with applications to WDM routing ⋮ Unnamed Item ⋮ Optimal wavelength-routed multicasting ⋮ Forwarding and optical indices of 4-regular circulant networks ⋮ The undirected optical indices of complete \(m\)-ary trees ⋮ Multi-hop all-to-all optical routings in Cartesian product networks ⋮ Combinatorial constructions of fault-tolerant routings with levelled minimum optical indices ⋮ Multiflows in symmetric digraphs ⋮ On \(f\)-fault tolerant arc-forwarding and optical indices of all-optical folded hypercubes ⋮ Forwarding and optical indices of a graph ⋮ Optical Routing of Uniform Instances in Cayley Graphs

Cites Work

• Colouring paths in directed symmetric trees with applications to WDM routing
• Unnamed Item

This page was built for publication: All-to-all communication for some wavelength-routed all-optical networks