Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3

被引：22

作者：

Bermond, JC ^{[1
]}

Ceroi, S ^{[1
]}

机构：

[1] Univ Nice, CNRS 13S, INRIA, Mascotte Project, F-06902 Sophia Antipolis, France

来源：

NETWORKS | 2003年 / 41卷 / 02期

关键词：

traffic grooming; graph; edge-partition; design theory; WDM rings;

D O I：

10.1002/net.10061

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

We consider traffic grooming in WDM unidirectional rings with all-to-all uniform unitary traffic. We determine the minimum number of SONET/SDH add-drop multiplexers (ADMs) required when the grooming ratio is 3. In fact, using tools of design theory, we solve the equivalent edge-partitioning problem: Find a partition of the edges of the complete graph on n vertices (K.) into subgraphs having at most three edges and in which the total number of vertices has to be minimized. (C) 2003 Wiley Periodicals, Inc.

引用

页码：83 / 86

页数：4

共 21 条

[1]

BERMOND JC, 2003, IN PRESS IEEE INT C

[2]

CAMERON PJ, 1994, COMBINATORICS TOPICS, pCH8

[3] Traffic grooming algorithms for reducing electronic multiplexing costs in WDM ring networks [J].

Chiu, AL ;

Modiano, EH .

JOURNAL OF LIGHTWAVE TECHNOLOGY, 2000, 18 (01) :2-12

[4]

Colbourn C. J., 1996, The CRC handbook of combinatorial designs

[5]

Colbourn C. J., 1993, J COMBIN MATH COMBIN, V14, P151

[6] Graph decompositions with application to wavelength add-drop multiplexing for minimizing SONET ADMs [J].

Colbourn, CJ ;

Ling, ACH .

DISCRETE MATHEMATICS, 2003, 261 (1-3) :141-156

[7]

Colbourn CJ, 2001, NETWORKS, V37, P107, DOI 10.1002/1097-0037(200103)37:2<107::AID-NET6>3.0.CO

[8]

2-A

[9] On optimal traffic grooming in WDM rings [J].

Dutta, R ;

Rouskas, GN .

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2002, 20 (01) :110-121

[10]

DUTTA R, 2002, TR200208 CSC NCSU

← 1 2 3 →