A Comparative Study of Cost Effective Multiplexing Approaches for Online Permutation Embedding and Scheduling in Optical Networks

In this paper, we describe a framework for exploring various multiplexing approaches in optical networks and for evaluating their cost-effectiveness. A comparative study of two representative approaches, known as path multiplexing (PM) and link multiplexing (LM) 1, 2], is conducted with respect to online permutation embedding and scheduling. It is found that in many networks, PM can be nearly as effective as LM in that they require (1) about the same multiplexing degree (e.g., the number of wavelengths or time slots) to make a network wide-sense nonblocking and (2) about the same number of rounds on average to schedule a permutation in a blocking network. It is also found that the performance advantage of LM over PM is more obvious in the online case than in the offline case 2]. In addition, such an advantage is proportional to the average connection distance in a network and may be maximized or minimized at some multiplexing degrees. Finally, in either LM or PM, the average schedule length of a permutation is almost the same when the values of the multiplexing degree fall into certain ranges, suggesting that the lowest multiplexing degree within such a range may be used for improved cost-effectiveness.

[1]  Chin-Tau Lea,et al.  Multi-Log, N Networks and Their Applications in High-speed Electronic and Photonic Switching S y s terns , 1990 .

[2]  Rami G. Melhem,et al.  Reconfiguration with Time Division Multiplexed MIN's for Multiprocessor , 1994, IEEE Trans. Parallel Distributed Syst..

[3]  Stéphane Pérennes,et al.  Efficient collective communication in optical networks , 1996, Theor. Comput. Sci..

[4]  Chunming Qiao,et al.  On scheduling all-to-all personalized connections and cost-effective designs in WDM rings , 1999, TNET.

[5]  Rami G. Melhem,et al.  Dynamic Reconfiguration of Optically Interconnected Networks with Time-Division Multiplexing , 1994, J. Parallel Distributed Comput..

[6]  Stéphane Pérennes,et al.  Efficient Collective Communication in Optical Networks , 1996, ICALP.

[7]  A. D. Oh,et al.  Optimal transmission schedules in WDM broadcast-and-select networks with multiple transmitters and receivers , 1996, Proceedings of Massively Parallel Processing Using Optical Interconnections.

[8]  Yuval Rabani,et al.  Improved bounds for all optical routing , 1995, SODA '95.

[9]  George N. Rouskas,et al.  Packet scheduling in broadcast WDM networks with arbitrary transceiver tuning latencies , 1997, TNET.

[10]  Rajiv Ramaswami,et al.  Multiwavelength optical networks with limited wavelength conversion , 1997, Proceedings of INFOCOM '97.

[11]  Allan Gottlieb,et al.  Complexity Results for Permuting Data and Other Computations on Parallel Processors , 1984, JACM.

[12]  Chunming Qiao,et al.  Off-line permutation embedding and scheduling in multiplexed optical networks with regular topologies , 1999, TNET.

[13]  Tao Zhang,et al.  Efficient routing of lightpaths , 1996, Proceedings of MILCOM '96 IEEE Military Communications Conference.

[14]  P. Humblet,et al.  Models of blocking probability in all-optical networks with and without wavelength changers , 1995, Proceedings of INFOCOM'95.

[15]  Hyeong-Ah Choi,et al.  Efficient scheduling of transmissions in optical broadcast networks , 1996, TNET.

[16]  Satish Rao,et al.  Efficient access to optical bandwidth , 1995, FOCS 1995.

[17]  Satish Rao,et al.  Efficient access to optical bandwidth wavelength routing on directed fiber trees, rings, and trees of rings , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[18]  Pierre A. Humblet,et al.  On the number of wavelengths and switches in all-optical networks , 1994, IEEE Trans. Commun..

[19]  C. Qiao,et al.  Reconfiguration With Time Division Multiplexed MINs for Multiprocessor Communications , 1994 .

[20]  R. Sarnath,et al.  Proceedings of the International Conference on Parallel Processing , 1992 .

[21]  Chunming Qiao,et al.  Wavelength reservation under distributed control , 1996, Digest IEEE/Leos 1996 Summer Topical Meeting. Advanced Applications of Lasers in Materials and Processing.

[22]  Jennifer Yates,et al.  Limited-range wavelength translation in all-optical networks , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

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

[24]  Vijay Kumar,et al.  Improved access to optical bandwidth in trees , 1997, SODA '97.

[25]  Biswanath Mukherjee,et al.  Efficient Scheduling of Nonuniform Packet Traffic in a WDM/TDM Local Lightwave Network with Arbitrary Transceiver Tuning Latencies , 1996, IEEE J. Sel. Areas Commun..

[26]  V. Li,et al.  A Wavelength-Convertible Optical Network , 1993 .

[27]  Arun K. Somani,et al.  Rearrangeable Circuit-Switched Hypercube Architecture for Routing Permutations , 1993, J. Parallel Distributed Comput..

[28]  Robert G. Gallager,et al.  Wavelength requirements of all-optical networks , 1995, TNET.

[29]  Imrich Chlamtac,et al.  Lightpath communications: an approach to high bandwidth optical WAN's , 1992, IEEE Trans. Commun..

[30]  Victor O. K. Li,et al.  A circuit rerouting algorithm for all-optical wide-area networks , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[31]  Anthony S. Acampora,et al.  On wavelength translation in all-optical networks , 1995, Proceedings of INFOCOM'95.

[32]  Rami G. Melhem,et al.  Reducing communication latency with path multiplexing: in optically interconnected multiprocessor systems , 1995, Proceedings of 1995 1st IEEE Symposium on High Performance Computer Architecture.

[33]  Kumar N. Sivarajan,et al.  Optimal routing and wavelength assignment in all-optical networks , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[34]  Abdou Youssef.  Off-line permutation scheduling on circuit-switched fixed routing networks , 1992, [Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation.

[35]  Ted H. Szymanski,et al.  A Comparison of Circuit and Packet Switching in a Fiber-Optic Hypercube , 1990, International Conference on Parallel Processing.

[36]  Eli Upfal,et al.  Efficient routing in all-optical networks , 1994, STOC '94.

[37]  Suresh Subramaniam,et al.  Connectivity and sparse wavelength conversion in wavelength-routing networks , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.