Dynamic Bandwidth Allocation in GMPLS Optical Networks using Minimum Execution Time Technique

Monika, .; Singh, Simranjit; Wason, Amit

doi:10.1109/indo-taiwanican48429.2020.9181358

Cited by 2 publications

(3 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Probability is defined as the extent to which an event is likely to occur, measured by the ratio of the favorable cases to the whole number of cases possible. Blocking probability for cleared calls is given by equation 3.1 [27], [28].…”

Section: Performance Metricsmentioning

confidence: 99%

“…In our previous papers, models for blocking probability have been developed [27]. Moreover, we have implemented Minimum Execution Time (MET) algorithm on our proposed GMPLS optical network in the conference paper [28]. This paper extends our conference paper work and includes the implementation of different algorithms individually and then the performance of all these algorithms is compared with each other.…”

Section: Introductionmentioning

confidence: 97%

See 1 more Smart Citation

Performance Evaluation of Bandwidth Allocating Algorithms in Generalized Multi Protocol Label Switched Optical Networks to Enhance Quality of Service

Monika

Singh

Wason³

2022

IEEE Access

View full text Add to dashboard Cite

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.INDEX TERMS Bandwidth allocation, blocking probability, GMPLS.

show abstract

Section: Performance Metricsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 97%

Performance Evaluation of Bandwidth Allocating Algorithms in Generalized Multi Protocol Label Switched Optical Networks to Enhance Quality of Service

Monika

Singh

Wason³

2022

IEEE Access

View full text Add to dashboard Cite

show abstract

“…In our previous papers, models for blocking probability have been developed 21 . Moreover, we have implemented Minimum Execution Time (MET) algorithm on our proposed GMPLS optical network for efficient bandwidth allocation in our conference paper 22 . Also, Weighted Round Robin (WRR) algorithm has been implemented on our proposed GMPLS optical network for well organized path computation in our second conference paper 23 .…”

mentioning

confidence: 99%

Performance investigations on data protection algorithms in generalized multi protocol label switched optical networks

Monika

Singh

Wason³

2023

Sci Rep

Self Cite

View full text Add to dashboard Cite

In future generation networks, data protection is a crucial necessity particularly when information is sent on a system. Network protection has three objectives known as discretion, reliability and accessibility. The most common procedure exploited to attain this ambition is encryption. The Generalized Multi Protocol Label Switched (GMPLS) optical networks are designed to survive Internet Protocol’s (IPʹs) unreliable delivery. In this paper, GMPLS network is proposed with random users and then the data protection algorithms have been analyzed on proposed GMPLS optical network. The various algorithms involve Rivest Shamir Adleman (RSA) algorithm and Advanced Encryption Standard (AES) 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 presented work. The network performance is compared for these algorithms in terms of various parameters like blocking probability and latency. The results reveal that RSA reduces the blocking probability < 0.005 and latency < 0.007 ms. This shows that RSA gives better performance than AES algorithm and enhance the quality of service considering blocking probability, latency and overheads in GMPLS optical networks leading to enhanced data protection.

show abstract

Dynamic Bandwidth Allocation in GMPLS Optical Networks using Minimum Execution Time Technique

Cited by 2 publications

References 17 publications

Performance Evaluation of Bandwidth Allocating Algorithms in Generalized Multi Protocol Label Switched Optical Networks to Enhance Quality of Service

Performance Evaluation of Bandwidth Allocating Algorithms in Generalized Multi Protocol Label Switched Optical Networks to Enhance Quality of Service

Performance investigations on data protection algorithms in generalized multi protocol label switched optical networks

Contact Info

Product

Resources

About