Approximating the Traffic Grooming Problem in Tree and Star Networks

DOI10.1007/11917496_14zbMath1167.68332OpenAlexW1587000517MaRDI QIDQ3522952

Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks, Michele Flammini

Publication date: 4 September 2008

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11917496_14

zbMATH Keywords

optical networkstree networkstraffic groomingadd-drop multiplexer (ADM)wavelength division multiplexing (WDM)

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Related Items (1)

Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph

This page was built for publication: Approximating the Traffic Grooming Problem in Tree and Star Networks