A comparative study of cost effective multiplexing approaches in optical networks

In this paper, we describe a framework for exploring various multiplexing approaches in optical networks and evaluating their cost-effectiveness. A comprehensive comparative study of two representative approaches, known as path multiplexing (PM) and link multiplexing (LM), is conducted with respect to on-line permutation scheduling. It is found that in many networks, PM is nearly as effective as LM in that they require about the same number of virtual channels (e.g. wavelengths, time slots etc.) to make a network wide-sense nonblocking. And that they require about the same number of rounds to schedule a permutation on average in a blocking network.

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

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

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

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

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

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

[7]  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.

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

[9]  Chunming Qiao,et al.  On the multiplexing degree required to embed permutations in a class of networks with direct interconnects , 1996, Proceedings. Second International Symposium on High-Performance Computer Architecture.

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

[11]  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.

[12]  A. Birman,et al.  Computing approximate blocking probabilities for a class of all-optical networks , 1996, Proceedings of INFOCOM'95.

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

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

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