Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Graph partitioning and traffic grooming with bounded degree request graph

Autor
Li, Z.; Sau, I.
Tipus d'activitat
Presentació treball a congrés
Nom de l'edició
35th International Workshop on Graph-Theoretic Concepts in Computer Science
Any de l'edició
2009
Data de presentació
2009
Llibre d'actes
Graph-Theoretic Concepts in Computer Science. 35th InternationalWorkshop, WG 2009 Montpellier, France, June 24-26, 2009: Revised Papers
Pàgina inicial
250
Pàgina final
261
Editor
Springer
DOI
https://doi.org/10.1007/978-3-642-11409-0_22 Obrir en finestra nova
Activitat premiada
Si
Repositori
http://hdl.handle.net/2117/20079 Obrir en finestra nova
Resum
We study a graph partitioning problem which arises from traffic grooming in optical networks. We wish to minimize the equipment cost in a SONET WDM ring network by minimizing the number of Add-Drop Multiplexers (ADMs) used. We consider the version introduced by Muñoz and Sau [12] where the ring is unidirectional with a grooming factor C, and we must design the network (namely, place the ADMs at the nodes) so that it can support any request graph with maximum degree at most Δ. This problem is e...
Citació
Li, Z.; Sau, I. Graph partitioning and traffic grooming with bounded degree request graph. A: International Workshop on Graph-Theoretic Concepts in Computer Science. "Graph-Theoretic Concepts in Computer Science. 35th InternationalWorkshop, WG 2009 Montpellier, France, June 24-26, 2009: Revised Papers". Montpellier: Springer, 2009, p. 250-261.

Participants

  • Li, Zhentao  (autor ponent)
  • Sau Valls, Ignasi  (autor ponent)