Lower bounds for two-period grooming via linear programming duality

Charles Colbourn, Gaetano Quattrocchi, Violet Syrotiuk

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

In a problem arising in grooming for two-period optical networks, it is required to decompose the complete graph on n vertices into subgraphs each containing at most C edges, so that the induced subgraphs on a specified set of v ≤ n vertices each contain at most C′ ≤ C edges. The cost of the grooming is the sum, over all subgraphs, of the number of vertices of nonzero degree in the subgraph. The optimum grooming is the one of lowest cost. An integer linear programming formulation is used to determine precise lower bounds on this minimum cost for all choices of n and v when 1 ≤ C′ < C ≤ 3. In most cases, this approach determines not only the bound but also the specific structure of any grooming that could realize the bound.

Original languageEnglish (US)
Pages (from-to)299-306
Number of pages8
JournalNetworks
Volume52
Issue number4
DOIs
StatePublished - Dec 2008

Fingerprint

Linear programming
Costs
Fiber optic networks

Keywords

  • Combinatorial designs
  • Graph decomposition
  • Linear programming duality
  • Optical networks
  • Traffic grooming

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems

Cite this

Lower bounds for two-period grooming via linear programming duality. / Colbourn, Charles; Quattrocchi, Gaetano; Syrotiuk, Violet.

In: Networks, Vol. 52, No. 4, 12.2008, p. 299-306.

Research output: Contribution to journalArticle

@article{65133355ca0b425c8e104d0afa2a0cf4,
title = "Lower bounds for two-period grooming via linear programming duality",
abstract = "In a problem arising in grooming for two-period optical networks, it is required to decompose the complete graph on n vertices into subgraphs each containing at most C edges, so that the induced subgraphs on a specified set of v ≤ n vertices each contain at most C′ ≤ C edges. The cost of the grooming is the sum, over all subgraphs, of the number of vertices of nonzero degree in the subgraph. The optimum grooming is the one of lowest cost. An integer linear programming formulation is used to determine precise lower bounds on this minimum cost for all choices of n and v when 1 ≤ C′ < C ≤ 3. In most cases, this approach determines not only the bound but also the specific structure of any grooming that could realize the bound.",
keywords = "Combinatorial designs, Graph decomposition, Linear programming duality, Optical networks, Traffic grooming",
author = "Charles Colbourn and Gaetano Quattrocchi and Violet Syrotiuk",
year = "2008",
month = "12",
doi = "10.1002/net.20251",
language = "English (US)",
volume = "52",
pages = "299--306",
journal = "Networks",
issn = "0028-3045",
publisher = "Wiley-Liss Inc.",
number = "4",

}

TY - JOUR

T1 - Lower bounds for two-period grooming via linear programming duality

AU - Colbourn, Charles

AU - Quattrocchi, Gaetano

AU - Syrotiuk, Violet

PY - 2008/12

Y1 - 2008/12

N2 - In a problem arising in grooming for two-period optical networks, it is required to decompose the complete graph on n vertices into subgraphs each containing at most C edges, so that the induced subgraphs on a specified set of v ≤ n vertices each contain at most C′ ≤ C edges. The cost of the grooming is the sum, over all subgraphs, of the number of vertices of nonzero degree in the subgraph. The optimum grooming is the one of lowest cost. An integer linear programming formulation is used to determine precise lower bounds on this minimum cost for all choices of n and v when 1 ≤ C′ < C ≤ 3. In most cases, this approach determines not only the bound but also the specific structure of any grooming that could realize the bound.

AB - In a problem arising in grooming for two-period optical networks, it is required to decompose the complete graph on n vertices into subgraphs each containing at most C edges, so that the induced subgraphs on a specified set of v ≤ n vertices each contain at most C′ ≤ C edges. The cost of the grooming is the sum, over all subgraphs, of the number of vertices of nonzero degree in the subgraph. The optimum grooming is the one of lowest cost. An integer linear programming formulation is used to determine precise lower bounds on this minimum cost for all choices of n and v when 1 ≤ C′ < C ≤ 3. In most cases, this approach determines not only the bound but also the specific structure of any grooming that could realize the bound.

KW - Combinatorial designs

KW - Graph decomposition

KW - Linear programming duality

KW - Optical networks

KW - Traffic grooming

UR - http://www.scopus.com/inward/record.url?scp=56749174908&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=56749174908&partnerID=8YFLogxK

U2 - 10.1002/net.20251

DO - 10.1002/net.20251

M3 - Article

AN - SCOPUS:56749174908

VL - 52

SP - 299

EP - 306

JO - Networks

JF - Networks

SN - 0028-3045

IS - 4

ER -