DSpace DSpace UPC
 Català   Castellano   English  

E-prints UPC >
Altres >
Enviament des de DRAC >

Empreu aquest identificador per citar o enllaçar aquest ítem: http://hdl.handle.net/2117/14389

Arxiu Descripció MidaFormat
SJD001490.pdf305,16 kBAdobe PDFThumbnail
Veure/Obrir

Citació: Muñoz, X.; Zhentao, L.; Sau, I. Edge-partitioning regular graphs for ring traffic grooming with a priori placement od the ADMs. "SIAM journal on discrete mathematics", 2011, vol. 25, núm. 4, p. 1490-1505.
Títol: Edge-partitioning regular graphs for ring traffic grooming with a priori placement od the ADMs
Autor: Muñoz López, Francisco Javier Veure Producció científica UPC; Zhentao, Li; Sau Valls, Ignasi
Data: 2011
Tipus de document: Article
Resum: We study the following graph partitioning problem: Given two positive integers C and Δ, find 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. This problem is naturally motivated by traffic grooming, which is a major issue in optical networks. Namely, we introduce a new pseudodynamic model of traffic grooming in unidirectional rings, in which the aim is to design a network able to support any request graph with a given bounded degree. We show that optimizing the equipment cost under this model is essentially equivalent to determining the parameter M(C, Δ). We establish the value of M(C, Δ) for almost all values of C and Δ, 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. For these open cases, we provide upper bounds that differ from the optimal value by at most one.
ISSN: 0895-4801
URI: http://hdl.handle.net/2117/14389
Apareix a les col·leccions:Altres. Enviament des de DRAC
COMBGRAF - Combinatòria, Teoria de Grafs i Aplicacions. Articles de revista
Departaments de Matemàtica Aplicada. Articles de revista
Comparteix:


Stats Mostra les estadístiques d'aquest ítem

SFX Query

Aquest ítem (excepte textos i imatges no creats per l'autor) està subjecte a una llicència de Creative Commons Llicència Creative Commons
Creative Commons

 

Valid XHTML 1.0! Programari DSpace Copyright © 2002-2004 MIT and Hewlett-Packard Comentaris
Universitat Politècnica de Catalunya. Servei de Biblioteques, Publicacions i Arxius