Sparse and limited wavelength conversion in all-optical tree networks

DOI10.1016/S0304-3975(00)00401-1zbMath0989.68103MaRDI QIDQ5958780

Vincenzo Auletta, Christos Kaklamanis, Luisa Gargano, Ioannis Caragiannis, Pino Persiano

Publication date: 3 March 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

directed pathsWDM all-optical tree networks

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

Optimization in telecommunication networks ⋮ Routing to reduce the cost of wavelength conversion ⋮ Efficient algorithms for wavelength assignment on trees of rings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
• Expanders, randomness, or time versus space
• Ramanujan graphs
• Eigenvalues and expanders
• Asymptotically optimal switching circuits
• Efficient collective communciation in optical networks
• Optimal wavelength routing on directed fiber trees
• Efficient routing in all-optical networks
• Explicit Concentrators from Generalized N-Gons
• Efficient routing in optical networks
• Coloring all directed paths in a symmetric tree, with an application to optical networks
• Efficient wavelength routing on directed fiber trees

This page was built for publication: Sparse and limited wavelength conversion in all-optical tree networks