Graph partitioning and traffic grooming with bounded degree request graph
Visualitza/Obre
10.1007_978-3-642-11409-0_22.pdf (264,4Kb) (Accés restringit)
10.1007/978-3-642-11409-0_22
Inclou dades d'ús des de 2022
Cita com:
hdl:2117/20079
Tipus de documentText en actes de congrés
Data publicació2009
EditorSpringer
Condicions d'accésAccés restringit per política de l'editorial
Tots els drets reservats. Aquesta obra està protegida pels drets de propietat intel·lectual i
industrial corresponents. Sense perjudici de les exempcions legals existents, queda prohibida la seva
reproducció, distribució, comunicació pública o transformació sense l'autorització del titular dels drets
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 essentially equivalent to finding
the least integer M(C,Δ) such that the edges of any graph with maximum degree at most Δ can be partitioned into subgraphs with at most C edges and each vertex appears in at most M(C,Δ) subgraphs [12].
The cases where Δ = 2 and Δ = 3,C = 4 were solved by Muñoz and Sau [12]. In this article we establish the value of M(C,Δ) for many more cases, leaving open only the case where Δ ≥ 5 is odd, Δ (mod 2C) is between 3 and C − 1, C ≥ 4, and the request graph does not contain a perfect matching. In particular, we answer a conjecture of [12].
Descripció
Student Best Papaer Award
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.
GuardóDocument premiat
ISBN3-642-11408-3
Col·leccions
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
10.1007_978-3-642-11409-0_22.pdf | 264,4Kb | Accés restringit |