Decrease In Blocking Probability Research Articles

QoT-aware performance evaluation of spectrally–spatially flexible optical networks over FM-MCFs

In this paper, we study the quality of transmission (QoT) aware routing, modulation level, and resource assignment problem for transparent flexible optical networks over few-mode multi-core fibers. We consider two three-dimensional resource assignment (3DRA) algorithms, called liberal and conservative, that are compatible with fractional joint switching. The three resource dimensions are core, mode, and spectrum. Furthermore, we analyze two modulation-level selection (MLS) algorithms (one on-line and one off-line) and three path selection algorithms (favoring shortest path, best balanced load, or highest QoT). The results show that the liberal 3DRA algorithm has a similar blocking probability (BP) compared to conservative 3DRA. However, performance metrics such as computation time, optical signal-to-noise ratio (OSNR), and number of required lasers are all improved with conservative 3DRA. Moreover, the BP decreases and the average OSNR increases by applying the on-line MLS algorithm compared to the off-line algorithm. Finally, we use an on-line liberal algorithm with a path selection policy that favors load balancing to generate a solution with the lowest BP.

Effective management of handover process in mobile communication network

This paper presents the effective management of handover process in mobile communication networks, aims to determine effective utilization of signaling channels in mobile communication network to avoid incessant of handover drop calls in the mobile network. Data were obtained from the Operation and Maintenance Centre (OMC). Analytical method known as Markovian chain analysis of continuous time and discrete space was used in the modeling, of handover blocking probability in mobile communication network. In addition, it was validated using MATLAB software. The causes of handover calls failure were analysis in network B. It was observed that handover blocking probability increases as the number of offered traf?ic load in erlang increases with a given number of transmission channels (V+g). Handover call blocking probability traf?ic model performance of the system is function of offered traf?ic in erlang and number of transmission channels (Pb = f(A,(V+g)). The handover blocking probability decreases, as both number of transmission channels (V+g) and traf?ic load in erlang increase. In order, to obtain satisfactory handover blocking probability the number of channels must be increased in proportion to offered traf?ic load in erlang

QoS-driven channel allocation schemes based on secondary users' priority in cognitive radio networks

Cognitive radio networks have gained popularity as they can support quality-driven wireless services. The Quality of Service (QoS) that directly measures the satisfaction of the end users cannot be realised owing to limited spectrum resources. This paper proposes a channel allocation model to improve the QoS of the priority-based Secondary Users' (SUs) performance in terms of throughput, blocking and dropping probability. The results show that, for increasing primary users' arrival rate, throughput and the dropping probability for the highest priority SUs increase by 23.3-46.1% and 30.16-35.67%, respectively, while the blocking probability decreases 55-82.5%. For increasing the system-accepted SUs arrival rate, throughput and the dropping probability for the highest priority SUs increase by 9.1-50.6% and 27.3-61.7%, respectively, and the blocking probability decreases by 42.7-43.6%.

Fine-tuning of k in a K-fold Multicast Network with Finite Queue using Markovian Model

Multicast has brought a drastic change in the field of networking by offering bandwidth effective technology that leads to reduce tariff. It is popular for optimizing network performance s. This paper evaluated a model for fine tuningthe value of a k in a K-fold multicast network underdifferent traffic loads under poisson traffic with finite queue at each node. Stationary distribution hasbeen derived for the network states and various expressions have been developed for the network to determine throughput and the blocking probability of the network. It has been established from this research work that by increasing the fold number, the network throughput can be increased very fast. However, it has been also observed that after increasing the fold number up to a certain value, the blocking probability stops to increase and becomes constant. We have also noticed that the throughput increaseswith the increase of the offered traffic and the blocking probability decreases when the system parameter k is increased. Moreover, an optimum value of k ceases the blocking probability for a particular value of the offered trafficfor finetuning the outcome of the network.