Abstract
Space division multiplexing (SDM) and elastic optical networking (EON) have been proposed to increase the transmission capacity and flexibility of optical transport networks. The problem of allocating available resources over the EON network is called routing and spectrum assignment (RSA); it is called routing, modulation level, and spectrum assignment (RMLSA) if modulation adaptivity is enabled. Considering SDM adds more flexibility to the resource allocation problem. In this paper, we formulate the routing, modulation level, space, and spectrum assignment (RMLSSA) as integer linear programming (ILP) in a path-based manner for static traffic. Next, the stepwise greedy algorithm (SGA) and four different sorting policies to initiate the algorithmare proposed as a heuristic method to find a near-optimal solution of the RMLSSA problem. Finally, the paper evaluates the effectiveness of sorting policies and the SGA algorithm with different metrics. The performance results show that the SGA initiated with connection demands sorted based on increasing the number of possible space and spectrum assignment layouts (SAL) can achieve the best near-optimal solution for a small network experiment. Moreover, the ascending SAL number (ASN) policy shows the best performance for realistic networks.
Sign-in/Register to access full text options 
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.
