Abstract
In this paper, we have studied a number of algorithms for routing in all-optical wavelength routed networks. We have considered situations where a lightpath is dynamically created in response to a request for communication and the WDM channels constituting the lightpath are reclaimed when the communication is over. We have looked at two schemes for dynamic wavelength allocation. In the first scheme we have assumed the existence of a central agent to maintain a database of existing lightpaths where the central agent attempts to generate a new lightpath in response to a request for communication. In the second scheme, we attempt to generate a new lightpath using a distributed algorithm. In the first scheme we have exploited the existence of multiple paths between any pair of nodes in a network in order to reduce the blocking probability. For the second scheme, we have proposed three distributed strategies to determine, if possible, a lightpath when there is a request for communication. Each of these strategies have their advantages and disadvantages in terms of the expected blocking probability and the set-up time. We have studied the performances of both the schemes using Monte Carlo simulation.
Similar content being viewed by others
References
B. Mukherjee, Optical Communication Networks, (McGraw-Hill, 1997).
C. Brackett, Dense wavelength division multiplexing networks: principles and applications, IEEE J. on Sel. Areas in Comms, vol. 8, no. 6, (Aug. 1990), pp. 948–964.
I. Chlamtac et al., Lightpath communications: an approach to high bandwidth Optical WAN's, IEEE Trans. Comm., vol. 40, (Jul. 1992), pp. 1171–1182.
P. E. Green, Fiber Optic Networks, (Prentice-Hall, 1993).
R. Ramaswami et al., Optical Networks: A Practical Perspective, (Morgan Kaufmann Publishers, 1998).
C. Joergensen et al., 4 Gb/s Optical Wavelength Conversion Using Semiconductor Optical Ampliflers, IEEE Photon. Tech. Lett., vol. 5, no. 6, (June 1993), pp. 657–670.
A. Sengupta et al., On the Performance of Dynamic Routing Strategies for All-Optical Networks, Proc. IASTED International Conference on Parallel and Distributed Computing and Networks, (Singapore, Aug. 1997), pp. 271–277.
A. Sengupta et al., On an adaptive algorithm for routing in alloptical networks, Proc. SPIE Conference on All-Optical Communication Systems: Architecture, Control and Network Issues III, (Dallas, Nov. 1997), pp. 288–299.
M. A. Marsan et al., Topologies for Wavelength-Routing All-Optical Networks, IEEE/ACM Trans. Networking, (Oct. 1993), vol. 1, pp. 534–546.
R. Ramaswami et al., Routing and Wavelength assignment in all-optical networks, Tech Rep. RC 19592, IBM Research Report, 1994.
J. A. Bannister et al., Topological design of the wavelengthdivision optical network, Proc. IEEE INFOCOM '90, (San Francisco, Apr. 1990), pp. 1005–1013.
B. Mukherjee et al., Some principles for designing a wide-area optical network, Proc. IEEE INFOCOM'94, (Toronto, Canada, Jun. 1994).
R. Ramaswami et al., Design of logical topologies for wavelength routed all-optical networks, Proc. IEEE INFOCOM'95, (Boston, Apr. 1995), pp. 1316–1325.
I. Chlamtac et al., Lightnets: topologies for high-speed optical networks, IEEE/OSA Journal of Lightwave Technology, vol. 11, (May/June, 1993), pp. 951–961.
R. Ramaswami et al., Multiwavelength Optical Networks with Limited Wavelength Conversion, Proc. IEEE INFOCOM '97 (Kobe, Japan, Apr. 1997), pp. 489–498.
K. Sivarajan et al., Lightwave networks based on DeBruijn graphs, IEEE/ACM Transactions on Networking, vol. 2, no. 1, (Feb. 1994), pp. 70–79.
O. Gerstel et al., Dynamic wavelength allocation inWDMring networks, IBM Research Report RC 20462, (May 1996).
O. Gerstel et al., Dynamic channel assignment for WDM optical Networks with little or no wavelength conversion, Proc. 34th Annual Allerton Conf (Monticello, IL, Oct. 1996), pp. 32–43.
Yousong Mei et al., Efficient distributed control protocol for WDM all-optical networks, Proc. International Conf. on Computer Communication and Networks (Las Vegas, Sept. 1997), pp. 150–153.
W. H. Kautz, Design of optimal interconnection networks for multiprocessors, NATO Advanced Summer Institute (1969), pp. 249–272.
C. Berge, Graphs and Hypergraphs, (North-Holland, 1973).
J.-C. Bermond et al., Large Fault Tolerant Interconnection Networks, Graphs and Combinatorics, vol. 5, (1989), pp. 107–123.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Sengupta, A., Bandyopadhyay, S., Balla, A.R. et al. Algorithms for Dynamic Routing in All-Optical Networks. Photonic Network Communications 2, 163–184 (2000). https://doi.org/10.1023/A:1010088407041
Issue Date:
DOI: https://doi.org/10.1023/A:1010088407041