Performance Evaluation of Bandwidth Allocating Algorithms in Generalized Multi Protocol Label Switched Optical Networks to Enhance Quality of Service
Generalized Multi Protocol Label Switched (GMPLS) optical networks increase the network capacity by allowing large number of parallel links between nodes in a network which is the basic requirement in optical communication where hundreds of parallel links may exist between a pair of nodes. It also f...
Gespeichert in:
Veröffentlicht in: | IEEE access 2022, Vol.10, p.40731-40742 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Generalized Multi Protocol Label Switched (GMPLS) optical networks increase the network capacity by allowing large number of parallel links between nodes in a network which is the basic requirement in optical communication where hundreds of parallel links may exist between a pair of nodes. It also facilitates switchovers to alternate channels, rapid fault detection, fault isolation and reducing network downtime. In this paper, GMPLS network is proposed with dynamic users. Then the different bandwidth allocating algorithms have been implemented on the proposed GMPLS optical networks. The various algorithms involve Minimum Execution Time (MET) algorithm, Minimum Completion Time (MCT) algorithm and Opportunistic Load Balancing (OLB) algorithm. The considered algorithms are very popular but have not been implemented on GMPLS optical networks in the literature which shows the novelty of the work. The network performance is evaluated for each algorithm and compared with each other. The results reveal that MET reduces the blocking probability < 0.1% and latency < 1ms. This shows that MET gives the best performance among the considered algorithms and enhance the quality of service in terms of blocking probability, latency, makespan and energy consumption in GMPLS optical networks. |
---|---|
ISSN: | 2169-3536 2169-3536 |
DOI: | 10.1109/ACCESS.2022.3166912 |