Physical impairments in long-haul optical networks mandate that optical signals be regenerated within the (so-called translucent) network. Being expensive devices, regenerators are expected to be allocated sparsely and must be judiciously utilized. Next-generation optical-transport networks will include multiple domains with diverse technologies, protocols, granularities, and carriers. Because of confidentiality and scalability concerns, the scope of network-state information (e.g., topology, wavelength availability) may be limited to within a domain. In such networks, the problem of routing and wavelength assignment (RWA) aims to find an adequate route and wavelength(s) for lightpaths carrying end-to-end service demands. Some state information may have to be explicitly exchanged among the domains to facilitate the RWA process. The challenge is to determine which information is the most critical and make a wise choice for the path and wavelength(s) using the limited information. Recently, a framework for multidomain path computation called backward-recursive path-computation (BRPC) was standardized by the Internet Engineering Task Force. In this paper, we consider the RWA problem for connections within a single domain and interdomain connections so that the quality of transmission (QoT) requirement of each connection is satisfied, and the network-level performance metric of blocking probability is minimized. Cross-layer heuristics that are based on dynamic programming to effectively allocate the sparse regenerators are developed, and extensive simulation results are presented to demonstrate their effectiveness.
© 2014 Optical Society of AmericaFull Article | PDF Article
Akbar GhaffarPour Rahbar
J. Opt. Commun. Netw. 2(11) 915-927 (2010)
Oscar Pedrola, Davide Careglio, Miroslaw Klinkowski, and Josep Solé-Pareta
J. Opt. Commun. Netw. 3(9) 651-666 (2011)
Ramon Casellas, Ricardo Martínez, Raül Muñoz, Lei Liu, Takehiro Tsuritani, Itsuro Morita, and Munefumi Tsurusawa
Opt. Express 19(26) B611-B620 (2011)