Grooming in unidirectional rings: K4 - e designs

Jean Claude Bermond; Charles Colbourn; Alan C H Ling; Min Li Yu

doi:10.1016/j.disc.2003.11.023

Grooming in unidirectional rings: K₄ - e designs

Jean Claude Bermond
, Charles Colbourn
, Alan C H Ling
, Min Li Yu

Computer Science and Engineering

Research output: Contribution to journal › Article › peer-review

24 Scopus citations

Abstract

In wavelength division multiplexing for unidirectional rings, traffic grooming is used to pack low rate signals into higher rate streams to share a wavelength. The grooming chosen determines the number of add-drop multiplexers used for the optical-to-electronic conversion. The determination of groomings to use the fewest multiplexers is equivalent to a graph design problem, which has been solved when up to four signals can be packed into a stream. We completely settle the case here when five signals pack into one stream, using old and new results on (K₄-e)-designs.

Original language	English (US)
Pages (from-to)	57-62
Number of pages	6
Journal	Discrete Mathematics
Volume	284
Issue number	1-3
DOIs	https://doi.org/10.1016/j.disc.2003.11.023
State	Published - Jul 6 2004

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1016/j.disc.2003.11.023

Cite this

@article{b947aacce3634468bca11b0c96d01d06,

title = "Grooming in unidirectional rings: K4 - e designs",

abstract = "In wavelength division multiplexing for unidirectional rings, traffic grooming is used to pack low rate signals into higher rate streams to share a wavelength. The grooming chosen determines the number of add-drop multiplexers used for the optical-to-electronic conversion. The determination of groomings to use the fewest multiplexers is equivalent to a graph design problem, which has been solved when up to four signals can be packed into a stream. We completely settle the case here when five signals pack into one stream, using old and new results on (K4-e)-designs.",

author = "Bermond, \{Jean Claude\} and Charles Colbourn and Ling, \{Alan C H\} and Yu, \{Min Li\}",

note = "Funding Information: Research of the first author was supported by the European project CRESCCO. Research of the second and third authors is supported by the Army Research Office under ARO grant DAAD19-01-1-0406. The fourth author thanks CNRS-INRIA-UNSA for the support and hospitality of the MASCOTTE project where some of the research was done during his visit. All authors thank the two referees for their helpful comments.",

year = "2004",

month = jul,

day = "6",

doi = "10.1016/j.disc.2003.11.023",

language = "English (US)",

volume = "284",

pages = "57--62",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier B.V.",

number = "1-3",

}

TY - JOUR

T1 - Grooming in unidirectional rings

T2 - K4 - e designs

AU - Bermond, Jean Claude

AU - Colbourn, Charles

AU - Ling, Alan C H

AU - Yu, Min Li

N1 - Funding Information: Research of the first author was supported by the European project CRESCCO. Research of the second and third authors is supported by the Army Research Office under ARO grant DAAD19-01-1-0406. The fourth author thanks CNRS-INRIA-UNSA for the support and hospitality of the MASCOTTE project where some of the research was done during his visit. All authors thank the two referees for their helpful comments.

PY - 2004/7/6

Y1 - 2004/7/6

N2 - In wavelength division multiplexing for unidirectional rings, traffic grooming is used to pack low rate signals into higher rate streams to share a wavelength. The grooming chosen determines the number of add-drop multiplexers used for the optical-to-electronic conversion. The determination of groomings to use the fewest multiplexers is equivalent to a graph design problem, which has been solved when up to four signals can be packed into a stream. We completely settle the case here when five signals pack into one stream, using old and new results on (K4-e)-designs.

AB - In wavelength division multiplexing for unidirectional rings, traffic grooming is used to pack low rate signals into higher rate streams to share a wavelength. The grooming chosen determines the number of add-drop multiplexers used for the optical-to-electronic conversion. The determination of groomings to use the fewest multiplexers is equivalent to a graph design problem, which has been solved when up to four signals can be packed into a stream. We completely settle the case here when five signals pack into one stream, using old and new results on (K4-e)-designs.

UR - https://www.scopus.com/pages/publications/2942659493

UR - https://www.scopus.com/pages/publications/2942659493#tab=citedBy

U2 - 10.1016/j.disc.2003.11.023

DO - 10.1016/j.disc.2003.11.023

M3 - Article

AN - SCOPUS:2942659493

SN - 0012-365X

VL - 284

SP - 57

EP - 62

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 1-3

ER -

Grooming in unidirectional rings: K₄ - e designs

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this