Dynamic lightpath provisioning in optical WDM mesh networks with asymmetric nodes
Tóm tắt
The wavelength selective switch-based reconfigurable optical add/drop multiplexers is a promising switching equipment for future reconfigurable wavelength-division multiplexing (WDM) mesh networks. However, its asymmetric switching property complicates the optimal routing and wavelength assignment problem. In an asymmetric switching scenario, using the classic Dijkstra’s algorithm can lead to invalid paths traversing unconnected ports of an asymmetric node. To solve this problem, we propose both link-state (LS) and distance vector (DV) schemes for dynamic lightpath provisioning in optical WDM mesh networks with asymmetric nodes. The proposed LS schemes include the asymmetric switching-aware (ASA) Dijkstra’s algorithm, the
$$K$$
-shortest path-based algorithm, and the entire path searching (EPS) algorithm. Simulation results show that the ASA-Dijkstra’s algorithm will bring notable improvement of the blocking performance with low computational complexity, while the EPS algorithm has much higher complexity and is not suitable to be employed in large-scale networks. On the other hand, our proposed DV solution, i.e., the information diffusion-based routing (IDBR), can achieve the lowest blocking probability with the lowest computational complexity. Moreover, IDBR does not require the distribution of local asymmetric switching information like the LS schemes, thus having a high level of topology confidentiality.
Tài liệu tham khảo
Bernstein, G.M., et al.: Modeling WDM wavelength switching systems for use in GMPLS and automated path computation. J. Opt. Commun. Netw. 1(1), 187–195 (2009)
Moy, J.: OSPF version 2, RFC 2328, April 1998
Hedrick, C.: Routing information protocol. RFC 1058, June 1988
Mayer, M.: Architecture for automatic switched optical networks (ASON). ITU-T Rec. G.8080/Y.1304, Nov 2001
Mannie, E. et al.: Generalized multi-protocol label switching (GMPLS) architecture. RFC 3945, Oct 2004
Katz, D., et al.: Traffic engineering (TE) extensions to OSPF version 2. RFC 3630, Sept 2003
Cormen, T.H., et al.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge, MA (2001)
Liu, Y., et al.: Polynomial-time adaptive routing algorithm based on spectrum scan in dynamic flexible optical networks. China Commun. 10(4), 49–58 (2013)
Wan, X., et al.: Dynamic routing and spectrum assignment in spectrum-flexible transparent optical networks. IEEE/OSA J. Opt. Commun. Netw. 4(8), 603–613 (2012)
Hua, N., et al.: An information-diffusion-based routing scheme in wavelength-routed WDM mesh networks. IEEE/OSA OFC/NFOEC 2010, OMM1. San Diego, CA, March 2010
Chen, Y., et al.: Implementation of the information-diffusion-based routing on a large-scale ASON test-bed. ECOC 2010, #1569314949. Torino, Italy, Sept 2010
Chen, Y., et al.: Experimenting with immediate re-routing on an information-diffusion-based routing test-bed. IEEE/OSA OFC/NFOEC 2011, OThI2. Los Angeles, CA, USA, March 2011
Roorda, P., et al.: Evolution to colorless and directionless ROADM architectures. IEEE/OSA OFC/NFOEC 2008, NWE2. San Diego, CA, Feb 2008
Tibuleac, S.: ROADM network design issues. IEEE/OSA OFC/NFOEC 2009, NMD1. San Diego, CA, March 2009
Ramaswami, R., et al.: Distributed network control for wavelength routed optical networks. In: Proceedings, IEEE Infocom 1996, pp. 138–147, San Francisco, CA, March 1996
Zang, H., et al.: Connection management for wavelength routed WDM networks. In: Proceedings, IEEE Globecom 1999, Rio de Janeiro, Brazil, Dec 1999
Zang, H., et al.: Dynamic lightpath establishment in wavelength routed WDM networks. IEEE Commun. Mag. 39(9), 100–108 (2001)
Lee, Y., et al.: Framework for GMPLS and path computation element (PCE) control of wavelength switched optical networks (WSONs). RFC 6163, April 2011
Lee, Y., et al.: Routing and wavelength assignment information model for wavelength switched optical networks. IETF draft-ietf-ccamp-rwa-info-13.txt, Oct 2010
Bernstein, G., et al.: Routing and wavelength assignment information encoding for wavelength switched optical networks. IETF draft-ietf-ccamp-rwa-wson-encode-13.txt, Oct 2011
Pavon-Marino, P., et al.: Dimensioning the add/drop contention factor of directionless ROADMs. IEEE/OSA J. Lightwave Technol. 29(21), 3265–3274 (2011)
Hashiguchi, T., et al.: Node-disjoint paths search in WDM networks with asymmetric nodes. IEEE ONDM 2011. Bologna, Italy, Feb 2011
Bhandari, R.: Optimal physical diversity algorithms and survivable networks. IEEE ISCC 1997. Alexandria, Egypt. July 1997
Yen, J.Y.: Finding the K shortest loopless paths in a network. Manag. Sci. 17(11), 712–716 (1971)
Hua, N.: Design and implementation of a network node management system for a large-scale ASON test-bed. IEEE/OSA OFC/NFOEC 2007, NWB5. Anaheim, CA, March 2007
Shen, G., et al.: Sparse placement of electronic switching nodes for low-blocking in translucent optical networks. J. Opt. Netw. 1(12), 424–444 (2002)