Graph Partitioning and Traffic Grooming with Bounded Degree Request Graph

Graph Partitioning and Traffic Grooming with Bounded Degree Request Graph Zhentao Li School of Computer Science - McGill University (Montreal, Canada) Ignasi Sau Mascotte Project - CNRS/INRIA/UNSA (Sophia-Antipolis, France) Applied Mathematics IV Department - UPC (Barcelona, Catalonia) 35th International Workshop on Graph-Theoretic Concepts in Computer Science (WG) Montpellier - June 25th, 2009 1

• speed streams


• low-speed requests


• when ∆ ?


• lower bound


• packing low-speed


• traffic grooming