A graph model for dynamic waveband switching in WDM mesh networks

被引：5

作者：

Li, M ^{[1
]}

Ramamurthy, B ^{[1
]}

机构：

[1] Univ Nebraska, Dept Comp Sci & Engn, Lincoln, NE 68583 USA

来源：

2004 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-7 | 2004年

关键词：

D O I：

10.1109/ICC.2004.1312822

中图分类号：

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

学科分类号：

0809 [电子科学与技术];

摘要：

We investigate the problem of waveband switching (WBS) in a wavelength-division multiplexing (WDM) mesh network with dynamic traffic requests. To solve the WBS problem in a homogeneous dynamic WBS network, where every node is a multi-granular optical crossconnect (MG-OXC), we construct an auxiliary graph. Based on the auxiliary graph, we develop two heuristic on-line WBS algorithms with different grouping policies, namely the wavelength-first WBS algorithm based on the auxiliary graph (WFAUG) and the waveband-first WBS algorithm based on the auxiliary graph (BFAUG). Our results show that the WFAUG algorithm outperforms the BFAUG algoritlim.

引用

页码：1821 / 1825

页数：5

共 8 条

[1]

Cao XJ, 2003, IEEE INFOCOM SER, P2251

[2]

DOUVILLE R, 2003, EXTENSIONS GEN MPLS

[3]

Ho PH, 2003, 2003 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-5, P582

[4]

Izmailov R, 2003, IEEE INFOCOM SER, P1344

[5]

Suemura Y, 2002, 2002 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-5, CONFERENCE PROCEEDINGS, P2727, DOI 10.1109/ICC.2002.997339

[6]

TOLIVER P, 2003, P OFC, V2, P783

[7]

A novel generic graph model for traffic grooming in heterogeneous WDM mesh networks [J].

Zhu, HY ;

Zang, H ;

Zhu, KY ;

Mukherjee, B .

IEEE-ACM TRANSACTIONS ON NETWORKING, 2003, 11 (02) :285-299

[8]

[No title captured]

← 1 →