Load-balanced fixed routing in all-optical WDM networks

被引:0
作者
Jing, W
Ho, PH
Savoie, JM
Mouftah, HT
机构
来源
APOC 2002: ASIA-PACIFIC OPTICAL AND WIRELESS COMMUNICATIONS; OPTICAL NETWORKING II | 2002年 / 4910卷
关键词
network blocking; load balancing; analytical model; WDM networks;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Fixed routing is favoured because it simplifies physical layer engineering, such as link budget calculations. The use of the fixed routing scheme can achieve fast bandwidth provisioning at the expense of inferior network blocking performance and lack of adaptability to traffic variation. In this paper, a load-balanced fixed routing scheme is proposed. For each source-destination pair, it assigns a fixed path such that the load-balancing requirement is met. This scheme is formulated into an Integer Linear Programming process. Both simulation and analytical methods are used to verify the effectiveness of the proposed planning algorithm. We also modify an analytical model of blocking probability by considering the load-balancing characteristic.
引用
收藏
页码:236 / 243
页数:8
相关论文
共 6 条
[1]   Computing approximate blocking probabilities for a class of all-optical networks [J].
Birman, A .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1996, 14 (05) :852-857
[2]   Benefits of wavelength translation in all-optical clear-channel networks [J].
Kovacevic, M ;
Acampora, A .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1996, 14 (05) :868-880
[3]  
PAPADIMITRIOU D, 2001, LINEAR CROSSTALK IMP
[4]   Performance analysis under dynamic loading of wavelength continuous and non-continuous WDM networks with shortest-path routing [J].
Shen, GX ;
Bose, SK ;
Cheng, TH ;
Lu, C ;
Chai, TY .
INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, 2001, 14 (04) :407-418
[5]   Issues for routing in the optical layer [J].
Strand, J ;
Chiu, AL ;
Tkach, R .
IEEE COMMUNICATIONS MAGAZINE, 2001, 39 (02) :81-87
[6]   All-optical networks with sparse wavelength conversion [J].
Subramaniam, S ;
Azizoglu, M ;
Somani, AK .
IEEE-ACM TRANSACTIONS ON NETWORKING, 1996, 4 (04) :544-557