Access the full text.
Sign up today, get DeepDyve free for 14 days.
X. Yang, L. Shen, B. Ramamurthy (2005)
Survivable lightpath provisioning in WDM mesh networks under shared path protection and signal quality constraintsJ. Lightwave Technol., 23
G. Shen, R.S. Tucker (2007)
Translucent optical networks: the way forward [Topics in optical communications]Commun. Mag. IEEE., 45
S. Rumley, C. Gaumier (2009)
Cost aware design of translucent WDM transport networks
G. Shen, W.D. Grover, T.H. Cheng, S.K. Bose (2002)
Sparse placement of electronic switching nodes for low-blocking in translucent optical networksOSA J. Opt. Netw., 1
Y. Ye, T.Y. Chai, T.H. Cheng, C. Lu (2006)
Dynamic routing and wavelength assignment algorithms in wavelength division multiplexed translucent optical networksComput. Commun., 29
X. Yang, B. Ramamurthy (2005)
Sparse regeneration in translucent wavelength-routed optical networks: architecture, network design and wavelength routingPhotonic Netw. Commun., 10
N. Shinomiya, T. Hoshida, Y. Akiyama, H. Nakashima, T. Terahara (2007)
Hybrid link/path-based design for translucent photonic network dimensioningJ. Lightwave Technol., 25
Y. Ouyang, Q. Zeng, W. Wei (2005)
Dynamic lightpath provisioning with signal quality guarantees in survivable translucent optical networksOpt. Express., 13
X. Yang, B. Ramamurthy (2001)
Sparse regeneration in a translucent WDM optical network
Y. Ye, T.Y Chai, T.H. Cheng, C. Lu (2002)
Algorithms for the design of WDM translucent optical networksOpt. Express., 11
K. Manousakis, K. Christodoulopoulos, E. Kamitsas, I. Tomkos, E.A. Varvarigos (2009)
Offline impairment-aware routing and wavelength assignment algorithms in translucent WDM optical networksJ. Lightwave Technol., 27
X. Yang, B. Ramamurthy (2005)
Dynamic routing in translucent WDM optical networks: the intradomain caseIEEE J. Lightwave Technol., 23
R.K. Ahuja, T.L. Magnanti, J.B. Orlin (1993)
Network flows
Y. Peng, W. Hu, W. Sun, X. Wang, Y. Jin (2007)
Impairment constraint multicasting in translucent WDM networks: architecture, network design and multicasting routingPhotonic Netw. Commun., 13
Physical layer impairments in wavelength-routed networks limit the maximum distance, a signal can travel in the optical domain, without significant distortion. Therefore, signal regeneration is required at some intermediate nodes for long-haul lightpaths. In translucent WDM networks, sparsely located regenerators at certain nodes can be used to offset the impact of physical layer impairments. The routing and wavelength assignment (RWA) techniques in such translucent networks need to take into consideration the availability of regenerators and the maximum optical reach of the transparent lightpaths (without any regeneration). Although there has been significant research interest in RWA algorithms for translucent networks, much of the research has focused on dynamic RWA techniques. Only a handful of recent papers have considered the static (offline) case, and they typically propose heuristic algorithms to solve this complex design problem for practical networks. In this paper, we propose a generalized integer linear program (ILP) based formulation for static regenerator assignment and RWA in translucent WDM optical networks, with sparse regenerator placement. To the best of our knowledge, such a formulation that optimally allocates resources for a set of lightpaths for translucent networks, given the physical network, the locations of the regenerators, and the maximum optical reach has not been considered before. The proposed formulation is important for two reasons. First, it can serve as a benchmark for evaluating different heuristic approaches that may be developedin the future. Second, we show that using a novel node representation technique, it is possible to drastically reduce the number of integer variables. This means that unlike existing ILP formulations, our approach can actually be used to generate optimal solutions for practical networks, with hundreds of lightpath demands.
Photonic Network Communications – Springer Journals
Published: Oct 11, 2011
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.