Loading...
Loading...

Go to the content (press return)

Graph partitioning and traffic grooming with bounded degree request graph

Author
Li, Z.; Sau, I.
Type of activity
Presentation of work at congresses
Name of edition
35th International Workshop on Graph-Theoretic Concepts in Computer Science
Date of publication
2009
Presentation's date
2009
Book of congress proceedings
Graph-Theoretic Concepts in Computer Science. 35th InternationalWorkshop, WG 2009 Montpellier, France, June 24-26, 2009: Revised Papers
First page
250
Last page
261
Publisher
Springer
DOI
https://doi.org/10.1007/978-3-642-11409-0_22 Open in new window
Rewarded activity
Yes
Repository
http://hdl.handle.net/2117/20079 Open in new window
Abstract
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...
Citation
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  (author and speaker )
  • Sau Valls, Ignasi  (author and speaker )