Distinctive Transmissions in Wireless Networks Using Markovian Queuing Theory Based Approach with Blocking Probability

Vanitha, M.; Babu, T. R. Ganesh

doi:10.1166/jctn.2017.6962

Cited by 3 publications

(1 citation statement)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The blocking probability is formulated by using Erlang B formula because it calculates the blocking probability of a buffer-less loss system, where a request that is not served immediately gets aborted, causing that no requests become queued [29]- [31]. Blocking occurs when a new request arrives at a time where all available servers are currently busy [32], [33]. But the link independence assumption is not applicable in optical networks [34], thus, Kelly's reduced load is also considered to amend link independence imprecision in calculating the blocking probability after considering the poisson random variable for number of calls and mean call duration [35]- [39].…”

Section: Performance Metricsmentioning

confidence: 99%

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%

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

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

Monika

Singh

Wason³

2020

2020 Indo – Taiwan 2nd International Conference on Computing, Analytics and Networks (Indo-Taiwan ICAN)

View full text Add to dashboard Cite

Reduction of Blocking Probability in Generalized Multi-Protocol Label Switched Optical Networks

Dhawan

Singh

Wason³

2019

Journal of Optical Communications

View full text Add to dashboard Cite

The blocking probability is studied for improving the quality of service of the network. The call blocking model for mode of operation to determine the types of applications suitable for Generalized Multi-Protocol Label Switched (GMPLS) networks is proposed. The performance of optical network depends upon various parameters such as number of channels, number of sources, traffic intensity which directly affect the blocking probability of the network. A mathematical model of an optical network for blocking probability of cleared calls and holding calls is developed. In the proposed model, blocking probability of the network gets reduced with a large number of servers. The proposed models decrease the blocking probability of the network to a level of 10–40. In addition, the blocking performance for held calls is also analyzed to compare the amount of traffic intensity that can be handled and completed properly with that of the cleared calls probability. The blocking probability is less for cleared calls than that for held calls as more traffic intensity can be handled in case of cleared calls but the chances for call completion increases in case of held calls.

show abstract

Distinctive Transmissions in Wireless Networks Using Markovian Queuing Theory Based Approach with Blocking Probability

Cited by 3 publications

References 0 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

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

Reduction of Blocking Probability in Generalized Multi-Protocol Label Switched Optical Networks

Contact Info

Product

Resources

About