Dynamic load balancing in WDM packet networks with and without wavelength constraints

We develop load balancing algorithms for WDM-based packet networks where the average traffic between nodes is dynamically changing. In WDM-based packet networks, routers are connected to each other using wavelengths (lightpaths) to form a logical network topology. The logical topology may be reconfigured by rearranging the lightpaths connecting the routers. Our algorithms reconfigure the logical topology to minimize the maximum link load. In this paper, we develop iterative reconfiguration algorithms for load balancing that track rapid changes in the traffic pattern. At each reconfiguration step, our algorithms make only a small change to the network topology hence minimizing the disruption to the network. We study the performance of our algorithms under several dynamic traffic scenarios and show that our algorithms perform near optimally. We further show that these large reconfiguration gains are achievable in systems with a limited number of wavelengths.

[1]  Luigi Fratta,et al.  The flow deviation method: An approach to store-and-forward communication network design , 1973, Networks.

[2]  George N. Rouskas,et al.  Dynamic Reconfiguration in Multihop WDM Networks , 1995, J. High Speed Networks.

[3]  George N. Rouskas,et al.  Dynamic load balancing in broadcast WDM networks with tuning latencies , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[4]  Mario Gerla,et al.  On the Topological Design of Distributed Computer Networks , 1977, IEEE Trans. Commun..

[5]  Eytan Modiano,et al.  Wavelength requirements for virtual topology reconfiguration in WDM ring networks , 2000, 2000 IEEE International Conference on Communications. ICC 2000. Global Convergence Through Communications. Conference Record.

[6]  Eytan Modiano,et al.  Dynamic load balancing for WDM-based packet networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[7]  George N. Rouskas,et al.  Dynamic reconfiguration policies for WDM networks , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[8]  Sea Hyeon Nam.  Efficient Channel Allocation for a Multichannel Multihop Local Lightwave Network , 1996 .

[9]  Oktay Günlük,et al.  Computational experience with a difficult mixedinteger multicommodity flow problem , 1995, Math. Program..

[10]  Anthony S. Acampora,et al.  Logically rearrangeable multihop lightwave networks , 1991, IEEE Trans. Commun..

[11]  B. Mukherjee,et al.  WDM-based local lightwave networks. II. Multihop systems , 1992, IEEE Network.

[12]  Biswanath Mukherjee,et al.  The photonic ring: Algorithms for optimized node arrangements , 1993 .

[13]  Wushow Chou,et al.  Topological considerations in the design of the ARPA computer network , 1899, AFIPS '70 (Spring).

[14]  William J. Cook,et al.  Combinatorial optimization , 1997 .

[15]  Anthony S. Acampora,et al.  Branch-exchange sequences for reconfiguration of lightwave networks , 1994, IEEE Trans. Commun..