Traffic Grooming in Bidirectional WDM Ring Networks

被引：0

作者：

Bermond, Jean-Claude ^{[1
]}

Munoz, Xavier ^{[2
]}

Sau, Ignasi ^{[1
,2
]}

机构：

[1] Mascotte Joint Project I3S CNRS UNS & INRIA, Sophia Antipolis, France

[2] UPC, Appl Math Dept 4, Graph Theory & Combinator Grp, Barcelona, Spain

来源：

NETWORKS | 2011年 / 58卷 / 01期

关键词：

traffic grooming; SONET ADM; optical WDM network; graph decomposition; combinatorial designs; ELECTRONIC MULTIPLEXING COSTS;

D O I：

10.1002/net.20410

中图分类号：

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

学科分类号：

0812 ;

摘要：

We study the minimization of ADMs (Add-Drop Multiplexers) in optical WDM bidirectional rings considering symmetric shortest path routing and all-to-all unitary requests. We precisely formulate the problem in terms of graph decompositions, and state a general lower bound for all the values of the grooming factor C and N, the size of the ring. We first study exhaustively the cases C = 1, C = 2, and C = 3, providing improved lower bounds, optimal constructions for several infinite families, as well as asymptotically optimal constructions and approximations. We then study the case C > 3, focusing specifically on the case C = k (k + 1)/2 for some k >= 1. We give optimal decompositions for several congruence classes of N using the existence of some combinatorial designs. We conclude with a comparison of the cost functions in unidirectional and bidirectional WDM rings. (C) 2010 Wiley Periodicals, Inc. NETWORKS, Vol. 58(1), 20-35 2011

引用

页码：20 / 35

页数：16

共 50 条

[1] Traffic grooming in bidirectional WDM ring networks
Bermond, Jean-Claude
Coudert, David
Munoz, Xavier
Sau, Ignasi
[J]. ICTON 2006: 8TH INTERNATIONAL CONFERENCE ON TRANSPARENT OPTICAL NETWORKS, VOL 3, PROCEEDINGS, 2006, : 19 - 22
[2] Survivable traffic grooming in WDM ring networks
Sankaranarayanan, Srivatsan
Subramaniam, Suresh
Choi, Hongsik
Choi, Hyeong-Ah
[J]. JOURNAL OF COMMUNICATIONS AND NETWORKS, 2007, 9 (01) : 93 - 104
[3] Survivable traffic grooming in WDM ring networks
Sankaranarayanan, S
Subramaniam, S
Choi, H
Choi, HA
[J]. OPTICOMM 2003: OPTICAL NETWORKING AND COMMUNICATIONS, 2003, 5285 : 80 - 90
[4] Improved approaches for cost-effective traffic grooming in WDM ring networks: Nonuniform traffic and bidirectional ring
Wang, J
Vemuri, VR
[J]. ICC 2000: IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, CONFERENCE RECORD, VOLS 1-3: GLOBAL CONVERGENCE THROUGH COMMUNICATIONS, 2000, : 1295 - 1299
[5] Traffic Grooming in WDM Ring Networks with Grooming Ratio 8
Liang, Zhihe
Miao, Yulian
Zhang, Yanfang
[J]. NSWCTC 2009: INTERNATIONAL CONFERENCE ON NETWORKS SECURITY, WIRELESS COMMUNICATIONS AND TRUSTED COMPUTING, VOL 2, PROCEEDINGS, 2009, : 650 - +
[6] Delay constrained traffic grooming in WDM ring networks
Vishwanath, Arun
Liang, Weifa
[J]. 31ST IEEE CONFERENCE ON LOCAL COMPUTER NETWORKS, PROCEEDINGS, 2006, : 443 - +
[7] Effective traffic grooming algorithms in SONET/WDM ring networks
Billah, ARB
Wang, B
Awwal, AAS
[J]. PHOTONIC NETWORK COMMUNICATIONS, 2003, 6 (02) : 119 - 138
[8] Effective Traffic Grooming Algorithms in SONET/WDM Ring Networks
Abdur R. B. Billah
Bin Wang
Abdul A. S. Awwal
[J]. Photonic Network Communications, 2003, 6 : 119 - 138
[9] Heuristic Algorithms for Grooming of Arbitrary Traffic in WDM Ring Networks
Yueguang Jiao
Bingkun Zhou
Hanyi Zhang
Yili Guo
[J]. Photonic Network Communications, 2004, 8 : 309 - 318
[10] Reconfigurable grooming of dynamic traffic in SONET/WDM ring networks
Xie, Shu-tong
Xu, Yong
[J]. JOURNAL OF HIGH SPEED NETWORKS, 2007, 16 (03) : 261 - 273

← 1 2 3 4 5 →