Abstract
Lightpaths in translucent optical networks have to undergo regeneration at certain nodes designated as regeneration sites to maintain its quality of transmission. Regenerating an optical signal necessitates optical-electronic-optical conversion and is thus a costly affair due to use of regeneration resources. Thus minimizing the cost of regeneration in such networks is vital. Minimizing cost of regeneration leads to two different problems; 1) the problem of minimizing the total cost of regeneration for the connections served and 2) the problem of minimizing the cost of regeneration at regeneration sites while serving the connections. The previous works on lightpath establishment in such networks have mostly addressed the first problem. In this paper we study the second problem i.e. the problem of minimizing the cost of regeneration at regeneration sites during dynamic establishment of lightpaths. As the problem is NP-Complete, we propose an Integer Linear Program for small networks and then propose two heuristic routing approaches for large networks. Time complexity analysis shows that our heuristic algorithms run in polynomial time. Extensive simulation experiments reveal that our approaches are not only efficient to address the problem but can also provide better blocking performance when regeneration resources are scarcely deployed at regeneration sites.
Highlights
In all-optical networks, known as transparent networks, data communication takes place entirely in the optical domain without Optical-Electronic-Optical (O-E-O) conversion [1]
It is important to note that works on Physical Layer Impairment aware Routing and Wavelength Assignment (PLI-routing and wavelength assignment (RWA)) such as [19], [20] and [23] and those that addresses the RR problem such as [13] and [14] which considers various factors of physical layer impairments (PLIs) separately during establishment of lightpaths cannot be directly compared with our proposed approaches
In this paper, we study the problem of minimizing cost of regeneration at regeneration sites during dynamic establishment of lightpaths in translucent optical networks, taking into account Overlapping Segments Sub-Problem (OSSP)
Summary
In all-optical networks, known as transparent networks, data communication takes place entirely in the optical domain without Optical-Electronic-Optical (O-E-O) conversion [1]. It is important to note that works on Physical Layer Impairment aware Routing and Wavelength Assignment (PLI-RWA) such as [19], [20] and [23] and those that addresses the RR problem such as [13] and [14] which considers various factors of physical layer impairments (PLIs) separately during establishment of lightpaths cannot be directly compared with our proposed approaches This is because we assume that the optical reach for the physical topology due to the various factors of PLIs is known in a way similar to the works [5], [11], [15] and [29]. In sec.II we discuss the related works, in sec.III we mention the contributions of our work, in sec.IV we provide the Integer Linear Program formulation for addressing our objective, in sec.V we provide the heuristics and analyze time complexity, in sec.VI we include performance comparisons and in sec.VII we conclude with a summary of this work
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
