Optimizing regenerator cost in traffic grooming
type: Item
instance of: scholarly article
title: Optimizing regenerator cost in traffic grooming
zbMATH Open document ID: 1229.90032
author: Michele Flammini
author: Gianpiero Monaco
author: Luca Moscardelli
author: Mordechai Shalom
author: Shmuel Zaks
published in: Theoretical Computer Science
publication date: 2012-01-04T00:00:00Z
Mathematics Subject Classification ID: 90B18
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 5994298
zbMATH Keywords: optical networks
zbMATH Keywords: wavelength division multiplexing (WDM)
zbMATH Keywords: regenerators
zbMATH Keywords: traffic grooming
zbMATH Keywords: tree networks
MaRDI profile type: Publication
full work available at URL: j.tcs.2011.09.023
OpenAlex ID: W2165377422
cites work: Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs
cites work: Traffic partition in WDM/SONET rings to minimize SONET ADMs
cites work: The regenerator location problem
cites work: Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
cites work: Paths, Trees, and Flowers
cites work: Minimizing total busy time in parallel scheduling with application to optical networks
cites work: Approximating the traffic grooming problem in tree and star networks
cites work: Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests
cites work: Q4471379
DOI: 10.1016/J.TCS.2011.09.023
description: scientific article; zbMATH DE number 5994298