Model For Blocking Probability Research Articles

Computationally Efficient UE Blocking Probability Model for GBR Services in Beyond 5G RAN

Computationally Efficient UE Blocking Probability Model for GBR Services in Beyond 5G RAN

UE Blocking Probability Model for Planning 5G Guaranteed Bit Rate (GBR) RAN Slices

Modeling the probability of blocking User Equipment (UE) sessions is key for planning in advance the amount of radio resources required by a Guaranteed Bit Rate (GBR) slice. This task is challenging since the amount of these resources depends on factors such as the channel quality of each UE, the packet scheduler discipline, and the GBR requirements. Under this context, we propose an analytical model to evaluate the UE blocking probability for a GBR slice. A key aspect of the proposed model is considering as input the distribution of the average Signal-to-Interference-plus-Noise Ratio (SINR) experienced by the UE, therefore allowing to capture the radio conditions in the cell. Our model builds a multi-dimensional Erlang-B system which meets the reversibility property. This involves our model is insensitive to the holding time distribution for the UE sessions. The reversibility property also involves the state transition probabilities have product form, so that the computational complexity of our model is low. Furthermore, the proposed model captures the SINR gain provided when the base station implements a channel-aware packet scheduler to allocate radio resources to the UE sessions. We validate the proposed model, demonstrating an estimation error for the UE blocking probability below 1.5%.

Algorithms for Estimation of the Coverage Area and Low Blocking Probability Model Log-Normal Shadowing for 2.4 GHz and 5 GHz in Indoor Environments

Background/Objectives: In designing WLAN networks is difficult to determine exactly the maximum range of the signal radiated by an Access Point, due to the random behavior of the signal received power and receiver sensitivity. The aim of this paper is to develop an algorithm estimate the probability of Court and the coverage area for an Access Point (AP) in the 2.4GHz and 5GHz bands. Methods/Statistical Analysis: For estimating the outage probability and the coverage area, two routines in Matlab for each frequency band supported on the propagation model Log-Normal Shadowing Path Loss developed, which allow decompose the received power at an average power and attenuation term shadow. Topic Relevance: Although there have been various related design WLANs work, no evidence of an algorithm to estimate the coverage area and the likelihood of court, considering it was found that, in most cases, the estimation of these parameters it is performed graphically and by using software tools on a plane set by the designer. Aspect by which developed in Matlab routines may be used in future research related to the design of WLANs. Results: Based on the results it was evident that it is possible to predict the area of coverage and outage probability for the 2.4GHz and 5GHz according to the transmission power, the detection threshold of the receiver, the probability estimated cut and environment characterization between the AP and the receiver, either free space or obstacles, supported using a shadow model attenuation. Additionally, routines allowed the generation of curves describing the behavior of area coverage and outage probability in terms of percent, depending on the radius of coverage, frequency band and environmental conditions, with 95% confidence. Application/ Improvements: The developed routines can be used as support tools in future research. Keywords: Coverage Area, Interference, Outage Probability, Reception Power, WLAN Networks

An improved approximate network blocking probability model for all-optical WDM Networks with heterogeneous link capacities

Abstract Currently, analytical models are used to compute approximate blocking probabilities in opaque and all-optical WDM networks with the homogeneous link capacities. Existing analytical models can also be extended to opaque WDM networking with heterogeneous link capacities due to the wavelength conversion at each switch node. However, existing analytical models cannot be utilized for all-optical WDM networking with heterogeneous structure of link capacities due to the wavelength continuity constraint and unequal numbers of wavelength channels on different links. In this work, a mathematical model is extended for computing approximate network blocking probabilities in heterogeneous all-optical WDM networks in which the path blocking is dominated by the link along the path with fewer number of wavelength channels. A wavelength assignment scheme is also proposed for dynamic traffic, termed as last-fit-first wavelength assignment, in which a wavelength channel with maximum index is assigned first to a lightpath request. Due to heterogeneous structure of link capacities and the wavelength continuity constraint, the wavelength channels with maximum indexes are utilized for minimum hop routes. Similarly, the wavelength channels with minimum indexes are utilized for multi-hop routes between source and destination pairs. The proposed scheme has lower blocking probability values compared to the existing heuristic for wavelength assignments. Finally, numerical results are computed in different network scenarios which are approximately equal to values obtained from simulations.

Analytical Blocking Probability Model for Hybrid Immediate and Advance Reservations in Optical WDM Networks

Immediate reservation (IR) and advance reservation (AR) are the two main reservation mechanisms currently implemented on large-scale scientific optical networks. They can be used to satisfy both provisioning delay and low blocking for delay-tolerant applications. Therefore, it seems reasonable that future optical network provisioning systems will provide both mechanisms in hybrid IR/AR scenarios. Nonetheless, such scenarios can increase the blocking of IR if no quality-of-service (QoS) policies are implemented. A solution could be to quantify such blocking performance based on the current network load and implement mechanisms that would act accordingly. However, current blocking analytical models are not able to deal with both IR and AR. In this paper, we propose an analytical model to compute the network-wide blocking performance of different IR/AR classes within the scope of a multiservice framework for optical wavelength-division multiplexing (WDM) networks. Specifically, we calculate the blocking on two common optical network scenarios using the fixed-point approximation analysis: on wavelength conversion capable and wavelength-continuity constrained networks. Performance results show that our model provides good accuracy compared to simulation results, even in a scenario with multiple reservation classes defined by different book-ahead times.

Generalized Queueing Model for Call Blocking Probability and Resource Utilization in OFDM Wireless Networks

Chen and Chen have dealt with a queueing model for obtaining some performance measures of OFDM wireless systems. Recently, Pla et al. have proposed the multi-class Erlang loss model as a more adequate one. However, the above two models considered only subcarriers as system resources, even though power is also another limited resource of OFDM systems. This letter proposes a generalized queueing model incorporating two kinds of resources, power and subcarriers.

The Gain of Performance of Optical WDM Networks

We study the blocking probability and performance of single‐fiber and multifiber optical networks with wavelength division multiplexing (WDM). We extend the well‐known analytical blocking probability model by Barry and Humblet to the general model, which is proposed for both single‐fiber and multifiber network paths with any kind of wavelength conversion (no, limited, or full wavelength conversion) and for uniform and nonuniform link loads. We investigate the effect of the link load, wavelength conversion degree, and the number of wavelengths, fibers, and hops on blocking probability. We also extend the definition of the gain of wavelength conversion by Barry and Humblet to the gain of performance, which is fully general. Thanks to this definition and implementation of our model, we compare different WDM node architectures and present interesting results.

A Node-level Blocking Probability Analysis for WRON

This work presents the blocking performance of the individual node with (full or limited) wavelength conversion in wavelength routed optical networks (WRON) based on the theory of probability. And a blocking probability model is proposed. Particularly, we pay more attention to investigate wavelength routing node performance improvement by using more feasible limited wavelength conversion. Based on our analytical model, we calculate the blocking probability for individual wavelength routing node and then make a simulation to validate it. It is seen that the node with low conversion degrees has small number of fiber link ports and large number of wavelength per link is more realistic choice.

A Node-Level Blocking Probability Analysis for WRONs

This work presents the blocking performance of a single node with (full or limited) wavelength conversion in wavelength routed optical networks (WRON) based on the theory of probability. A blocking probability model is proposed. Particularly, we pay more attention to investigate wavelength routing node performance improvement by using the more feasible case of limited wavelength conversion. Based on our analytical model, we calculate the blocking probability for a single wavelength routing node and then make a simulation to validate it. It is shown that a node with low conversion degrees having a small number of fiber link ports and a large number of wavelengths per link is a more realistic choice.

Mobility modeling and traffic analysis in three-dimensional high-rise building environments

To efficiently plan future personal communications services, we need to solve various mobility/traffic problems in one-dimensional (1-D), two-dimensional (2-D), and three-dimensional (3-D) micro- or pico-cell environments. Although many users exhibit vertical motion inside elevators in high-rise buildings, there have been no studies regarding cell planning which take into account vertical motion with elevators. We extend the previous 3-D indoor mobility modeling by considering the proper boundary conditions on each floor and vertical motions through elevators and modeling mobility in high-rise buildings in order to estimate the number of handoffs. We then propose a blocking probability model with mobility as a traffic model in 3-D indoor environments. Using this model, we can obtain the required number of channels per cell under the given blocking probability constraint. These results can be used in planning the networks of future personal communications services.

Mobility and traffic analyses in three-dimensional PCS environments

We need to solve various mobility/traffic problems in one-dimensional (1-D), two-dimensional (2-D), and three-dimensional (3-D) micro or picocell environments to efficiently plan future personal communications services (PCS). However, mobility/traffic problems have thus far primarily been studied in 1-D and 2-D cell structures. We extend the previous mobility modeling from 1-D or 2-D space to 3-D unbounded indoor building environments having staircase regions by analytically modeling the mobility to estimate the number of handoffs. We also characterize the blocking probability of each cell according to the mobility by predicting the equivalent input traffic per cell. Based on the blocking probability model, we obtain the required number of channels per cell under the given blocking probability constraint. For example, 13 channels per cell are required to be assigned in order to meet the requirement that the blocking probability does not exceed 0.02 in the case where the number of radio ports (RPs) (cells) is four and 180 users are moving with a mean velocity of 2 km/h (horizontal motion) and 2/3 km/h (vertical motion) on each floor. The computer simulation results are also close to the analytical ones. These results can be utilized in the network planning of future PCS.

Mobility modeling and traffic analysis in three-dimensional indoor environments

To efficiently plan future personal communications services (PCSs), we need to solve various mobility/traffic problems in one-dimensional (1-D), two-dimensional (2-D), and three-dimensional (3-D) micro or picocell environments. However, mobility/traffic problems have thus far primarily been studied in 1-D and 2-D cell structures. In this paper, we extend the previous mobility modeling from 1-D or 2-D space to 3-D indoor building environments by considering the proper boundary conditions on each floor and analytically modeling mobility in multi-story buildings to estimate the number of handoffs. We then propose a blocking probability model with mobility as a traffic model in 3-D indoor environments. Utilizing this model, we can obtain the required number of channels per cell under the given blocking probability constraint. These results can be utilized in planning the networks of future PCSs.