Reconfiguration in Rapidly Tunable Transmitter, Slowly Tunable Receiver Single-Hop WDM Networks

We consider broadcast WDM networks with nodes equipped with rapidly tunable transmitters and slowly tunable receivers. The rapidly tunable transmitters provide all-optical paths among the network nodes by creating logical connections that can be changed on a packet-by-packet basis. The ability of receivers to tune, albeit slowly, is invoked only for reallocating the bandwidth in response to changes in the overall traffic pattern. Since this variation in traffic is expected to take place over larger time scales, receiver retuning will be an infrequent event, making slowly tunable receivers a cost effective solution. Assuming an existing assignment of receive wavelengths and some information regarding the new traffic demands, we present two approaches to obtaining a new wavelength assignment such that (a) the new traffic is balanced across the channels, and (b) the number of receivers that need to be retuned is minimized. One of our contributions is an approximation algorithm for the load balancing problem that provides for tradeoff selection, using a single parameter k, between these two conflicting goals. This algorithm leads to a scalable approach to reconfiguring the network since, in addition to providing guarantees in terms of load balancing, for certain values of parameter k, the expected number of retunings scales with the number of channels, not the number of nodes in the network.

[1]  Richard A. Barry,et al.  The effects of tuning time in bandwidth-limited optical broadcast networks , 1995, Proceedings of INFOCOM'95.

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

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

[4]  Biswanath Mukherjee,et al.  Efficient scheduling of nonuniform packet traffic in a WDM/TDM local lightwave network with arbitrary transceiver tuning latencies , 1995, Proceedings of INFOCOM'95.

[5]  George N. Rouskas,et al.  On the design of optimal TDM schedules for broadcast WDM networks with arbitrary transceiver tuning latencies , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

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

[7]  George N. Rouskas,et al.  HiPeR-l: a high performance reservation protocol with look-ahead for broadcast WDM networks , 1997, Proceedings of INFOCOM '97.

[8]  David K. Smith.  Network Flows: Theory, Algorithms, and Applications , 1994 .

[9]  Edward G. Coffman,et al.  An Application of Bin-Packing to Multiprocessor Scheduling , 1978, SIAM J. Comput..

[10]  P. Green.  Fiber Optic Networks , 1992 .

[11]  Ronald L. Graham,et al.  Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.

[12]  Rajiv Ramaswami,et al.  A Wavelength Division Multiple Access Network for Computer Communication , 1990, IEEE J. Sel. Areas Commun..

[13]  Galen H. Sasaki,et al.  Scheduling transmissions in WDM broadcast-and-select networks , 1994, TNET.

[14]  Ronald L. Graham,et al.  Performance Guarantees for Scheduling Algorithms , 1978, Oper. Res..

[15]  Rajiv Ramaswami,et al.  A Media-Access Protocol for Packet-Switched Wavelength Division Multiaccess Metropolitan Area Networks , 1990, IEEE J. Sel. Areas Commun..

[16]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[17]  R. Ramaswami,et al.  Multiwavelength lightwave networks for computer communication , 1993, IEEE Communications Magazine.