Abstract
Although routing schemes based on global knowledge make most optimal routing decisions, they will occupy many resources to keep the state information of the network up-to-date. In this work, we describe a fuzzy least-congested path (FLCP) routing algorithm based on hierarchical information. Simulation shows that the blocking probability using FLCP is very near to the blocking probability using the least-congested path routing (LCP) algorithm based on global information. Under heavy traffic load, the FLCP algorithm is superior to the exhaustive algorithm (EA) and the LCP algorithm with unit information cost. The FLCP algorithm provides better routing, even with incomplete information. Thus, the algorithm requires less information of the network, particularly under heavy traffic load. In addition, an improved remote-path routing approach is provided to reduce the blocking probability of connection requests to a node that is many hops away from the source node.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. Birman, Computing approximate blocking probabilities for a class of all-optical networks, IEEE J. Select. Areas Commun., vol. 14, no. 5, (June 1996), pp. 852–857.
H. Harai, M. Murata, H. Miyahara, Performance of alternate routing methods in all-optical switching networks, in: Proc. IEEE INEOCOM'97, vol. 2, (Kobe, Japan, April 1997), pp. 516–529.
S. Ramamurthy, B. Mukherjee, Fixed-alternate routing and wavelength conversion in wavelength-routed optical networks, in: Proc. IEEE GLOBECOM'98, vol. 11, (Sydney, Australia, Nov. 1998), pp. 2295–2303.
R. Ramaswami, A. Segall, Distributed network control for optical networks, IEEE/ACM Transaction on Networks, vol. 5, no. 6, (Dec. 1997), pp. 936–943.
H. Zang, L. Sahasrabuddhe, J. P. Jue, S. Ramamurthy, B. Mukherjee, Connection management for wavelength-routed WDM networks, Proc. IEEE GLOBECOM'99, vol. 2, (Rio de Janeiro, Brazil, Dec. 1999), pp. 1428–1432.
K. Chan, T. P. Yum, Analysis of least congested path routing in WDM lightwave networks, Proc., IEEE INFOCOM'94, vol. 2, (Toronto Ontario, Canada, April 1994), pp. 962–969.
G. Shen, S. K. Bose, T. H. Cheng, C. Lu, T. Y. Chai, Efficient heuristic algorithms for light-path routing and wavelength assignment in WDM networks under dynamically varying loads. Computer Communications, vol. 24, no. 3/4, (Feb. 15, 2001), pp. 364–373.
L. Li, A. K. Somani, Dynamic wavelength routing using congestion and neighborhood information, IEEE/ACM Transaction on Networks, vol. 7, no. 5, (Oct. 1999), pp. 779–786.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Yu, G., Xu, A. Fuzzy Least-Congested Path Routing and Improved Remote-Path Routing based on Hierarchical Information in WDM Networks. Photonic Network Communications 8, 335–340 (2004). https://doi.org/10.1023/B:PNET.0000041242.91012.6c
Issue Date:
DOI: https://doi.org/10.1023/B:PNET.0000041242.91012.6c