scholarly journals REDUCING CALL BLOCKING PROBABILITY IN HYBRID MULTICAST WAVELENGTH DIVISION MULTIPLEXING NETWORKS USING WEIGHTED ROUTING AND WAVELENGTH ASSIGNMENT ALGORITHM

2014 ◽  
Vol 10 (2) ◽  
pp. 224-232
Author(s):  
Sankar
Keyword(s):  
Wavelength Division Multiplexing ◽  
Blocking Probability ◽  
Routing And Wavelength Assignment ◽  
Wavelength Assignment ◽  
Call Blocking ◽  
Call Blocking Probability ◽  
Wavelength Division ◽  
Assignment Algorithm ◽  
Wavelength Division Multiplexing Networks

Model for Performance Improvement of Blocking Probability in GMPLS Networks

2019 ◽  
Vol 0 (0) ◽  
Author(s):  
Sandeep Goel ◽  
Ranjit Kaur ◽  
Amit Wason
Keyword(s):  
Wavelength Division Multiplexing ◽  
Blocking Probability ◽  
Complex Model ◽  
Multiprotocol Label Switching ◽  
Call Blocking ◽  
Label Switching ◽  
Call Blocking Probability ◽  
Wavelength Division ◽  
Probability Optimization ◽  
Time Division

AbstractGeneralized multiprotocol Label Switching (GMPLS) is a set of rules which is used in various layers like the Wavelength Division Multiplexing (WDM) layer, Time Division Multiplexing (TDM) layer, etc. to generalize the concepts of labels of Multiprotocol Label Switching networks. A block in call occurs when number of requests is more than the servers and waiting rooms. This call blocking is the very important parameter and can be calculated in terms of probability. There are a number of models to calculate the call blocking probability like Erlang B, Erlang C, etc. This paper suggests a novel, efficient and less – complex model which minimize the call blocking to very much extent for GMPLS networks. This model deals with the factors like number of wavelengths, number of links, traffic intensity, etc. which can help in reducing the call blocking probability and give better results. In this paper, the call-blocking probability is also compared with number of links by considering different wavelengths. A comparison of call-blocking probability of proposed model is also analysed. This paper deals with blocking probability optimization in GMPLS Networks using Fredericks approach. We have used peakedness factor from Fredericks approach in Engset’s formula for this optimization.”

Dynamic routing and wavelength assignment for efficient traffic grooming

2020 ◽  
Vol 0 (0) ◽  
Author(s):  
Neeraj Mohan ◽  
Priyanka Kaushal
Keyword(s):  
Optical Networks ◽  
Resource Utilization ◽  
Wavelength Division Multiplexing ◽  
Computer Network ◽  
Blocking Probability ◽  
Traffic Grooming ◽  
Routing And Wavelength Assignment ◽  
Wavelength Assignment ◽  
Dynamic Traffic ◽  
Network Efficiency

AbstractThe routing and wavelength assignment (RWA) schemes play an important role in all computer networks. The performance of a computer network and resource utilization largely depend on the RWA. The demand for higher bandwidth is increasing with each passing day, so more efficient RWA schemes need to be devolved to cater the increasing requirements. RWA becomes more challenging for dynamic traffic as the nature and flow of data are not known in advance. In this paper, a dynamic RWA scheme has been proposed for establishing a path in optical networks. The proposed scheme is based upon dynamic conversion sensing algorithm. It can be applied on a number of different network topologies. The proposed scheme is dynamic in nature, which is significantly useful for dynamic traffic grooming. The proposed scheme has been applied on 14 nodes National Science Foundation Network (NFSNet). Simulation results have shown that the blocking probability of this scheme is very low as compared to the existing schemes. So, the proposed dynamic RWA scheme enhances the network efficiency. It is useful for congestion hit networks. The reduced blocking probability in wavelength division multiplexing optical networks leads to better resource utilization and enhanced performance.

Sign in / Sign up

Export Citation Format

Share Document