Lower bound on number of ADMs in WDM rings with nonuniform traffic demands

被引：4

作者：

Xu, Y ^{[1
]}

Yao, X ^{[1
]}

机构：

[1] Univ Birmingham, Sch Comp Sci, Birmingham B15 2TT, W Midlands, England

来源：

ELECTRONICS LETTERS | 2004年 / 40卷 / 13期

关键词：

D O I：

10.1049/el:20040525

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

A new and tight lower bound on the number of ADMs with arbitrary nonuniform traffic demands in a SONET/WDM ring network is derived. Simulations show that this lower bound is much tighter than the previous one and for some cases it reaches the infimum.

引用

页码：824 / 825

页数：2

共 5 条

[1]

Billah ARB, 2002, GLOB TELECOMM CONF, P2726

[2]

Gerstel O, 1998, IEEE INFOCOM SER, P94, DOI 10.1109/INFCOM.1998.659642

[3]

LIU KH, 2004, COMPUT NETW JAN

[4] Traffic grooming in unidirectional WDM ring networks using genetic algorithms [J].

Xu, Y ;

Xu, SC ;

Wu, BX .

COMPUTER COMMUNICATIONS, 2002, 25 (13) :1185-1194

[5] An effective and comprehensive approach for traffic grooming and wavelength assignment in SONET/WDM rings [J].

Zhang, XJ ;

Qiao, CM .

IEEE-ACM TRANSACTIONS ON NETWORKING, 2000, 8 (05) :608-617

← 1 →