NUST Institutional Repository

Heuristic Algorithms for Routing and Spectrum Allocation in Elastic Optical Network

Show simple item record

dc.contributor.author Alam, Shahzad
dc.date.accessioned 2023-08-03T10:35:30Z
dc.date.available 2023-08-03T10:35:30Z
dc.date.issued 2018-01-09
dc.identifier.uri http://10.250.8.41:8080/xmlui/handle/123456789/35554
dc.description.abstract The rapid change in optical networking is the result of progressive growth in IP tra c volume, its diversity and bandwidth hungry applications. In this connection, Elastic Optical Network (EON) is emerging as a promising solution, due to its adaptable characteristics and adjustable data rate accommodation to support heterogeneity of tra c demands. Routing and Spectrum Allocation (RSA) is a spectrum management problem in EON and NP hard. Clearly the e cient utilization of network resources, mainly bank on the applied ordering strategy. In this thesis, we propose a novel heuristic algorithm Minimum Hops with Least Slot Spectrum (MHLS) to accommodate maximum tra c requests with better spectrum utilization. The objective of the proposed algorithm is to minimize the total number of Blocked Requests (BR), Blocked Bit-rates (BB) in Gb/s and Slots Used (SU) in the network. The performance is evaluated on random optical network of 20 nodes along with two di erent real size optical networks such as PAN EU and USA network. Network performances are evaluated in terms of BR, BB and SU through simulation. Results depict that propose technique is e ective in minimizing the number of rejected tra c demands, bit-rates (Gb/s) and considerable spectrum savings can be achieved as compared to other considered benchmark techniques. en_US
dc.description.sponsorship Dr. Arsalan Ahmad en_US
dc.language.iso en_US en_US
dc.publisher RCMS NUST en_US
dc.subject Elastic Optical Network, Heuristic Algorithms, Routing and Spectrum Allocation en_US
dc.title Heuristic Algorithms for Routing and Spectrum Allocation in Elastic Optical Network en_US
dc.type Thesis en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account