Reconfiguration and dynamic load balancing in broadcast WDM networks

被引:10
作者
Baldine, I [1 ]
Rouskas, GN
机构
[1] Microelect Ctr N Carolina, Res Triangle Pk, NC 27709 USA
[2] N Carolina State Univ, Dept Comp Sci, Raleigh, NC 27695 USA
基金
美国国家科学基金会;
关键词
broadcast optical networks; wavelength division multiplexing (WDM); reconfiguration; dynamic load balancing;
D O I
10.1023/A:1010029100403
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In optical WDM networks, an assignment of transceivers to channels implies an allocation of the bandwidth to the various network nodes. Intuition suggests, and our recent study has confirmed, that if the traffic load is not well balanced across the available channels, the result is poor network performance. Hence, the time-varying conditions expected in this type of environment call for mechanisms that periodically adjust the bandwidth allocation to ensure that each channel carries an almost equal share of the corresponding offered load. In this paper we study the problem of dynamic load balancing in broadcast WDM networks by retuning a subset of transceivers in response to changes in the overall traffic pattern. Assuming an existing wavelength assignment and some information regarding the new traffic demands, we present two approaches to obtaining a new wavelength assignment such that (a) the new traffic load is balanced across the channels, and (b) the number of transceivers that need to be retuned is minimized. The latter objective is motivated by the fact that tunable transceivers take a non-negligible amount of time to switch between wavelengths during which parts of the network are unavailable for normal operation. Furthermore, this variation in traffic is expected to take place over larger time scales (i.e., retuning will be a relatively infrequent event), making slowly tunable devices a cost effective solution. Our main contribution is a new approximation algorithm for the load balancing problem that provides for tradeoff selection, using a single parameter, between two conflicting goals, namely, the degree of load balancing and the number of transceivers that need to be retuned. This algorithm leads to a scalable approach to reconfiguring the network since, in addition to providing guarantees in terms of load balancing, the expected number of retunings scales with the number of channels, not the number of nodes in the network.
引用
收藏
页码:49 / 64
页数:16
相关论文
共 22 条
[1]  
Ahuja RK., 1993, NETWORK FLOWS THEORY
[2]  
[Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness
[3]   Impact of tuning delay on the performance of bandwidth-limited optical broadcast networks with uniform traffic [J].
Azizoglu, M ;
Barry, RA ;
Mokhtar, A .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1996, 14 (05) :935-944
[4]  
BALDINE I, 1999, IN PRESS P INFOCOM 9
[5]  
BALDINE I, 1998, IN PRESS P SPIE 98 N
[6]   Efficient scheduling of nonuniform packet traffic in a WDM/TDM local lightwave network with arbitrary transceiver tuning latencies [J].
Borella, MS ;
Mukherjee, B .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1996, 14 (05) :923-934
[7]   A MEDIA-ACCESS PROTOCOL FOR PACKET-SWITCHED WAVELENGTH DIVISION MULTIACCESS METROPOLITAN-AREA NETWORKS [J].
CHEN, MS ;
DONO, NR ;
RAMASWAMI, R .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1990, 8 (06) :1048-1057
[8]  
COFFMAN EG, 1978, SIAM J COMPUT, V7, P1, DOI 10.1137/0207001
[9]   PERFORMANCE GUARANTEES FOR SCHEDULING ALGORITHMS [J].
GAREY, MR ;
GRAHAM, RL ;
JOHNSON, DS .
OPERATIONS RESEARCH, 1978, 26 (01) :3-21
[10]   BOUNDS ON MULTIPROCESSING TIMING ANOMALIES [J].
GRAHAM, RL .
SIAM JOURNAL ON APPLIED MATHEMATICS, 1969, 17 (02) :416-&