Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 5,243 papers for “blocking probability”

Probability of blocking.

Amna Shabbir (18056189), Safdar Rizvi (18056192), Muhammad Mansoor Alam (15285643) et al. · Figshare · 2024

<div><p>The quest for energy efficiency (EE) in multi-tier Heterogeneous Networks (HetNets) is observed within the context of surging high-speed data demands and the rapid proliferation of wireless devices. The analysis of existing literature underscores the need for more comprehensive strategies to realize genuinely energy-efficient HetNets. This research work contributes significantly by employing a systematic methodology, utilizing This model facilitates the assessment of network performance by considering the spatial distribution of network elements. The stochastic nature of the PPP allows for a realistic representation of the random spatial deployment of base stations and users in multi-tier HetNets. Additionally, an analytical framework for Quality of Service (QoS) provision based on D-DOSS simplifies the understanding of user-base station relationships and offers essential performance metrics. Moreover, an optimization problem formulation, considering coverage, energy maximization, and delay minimization constraints, aims to strike a balance between key network attributes. This research not only addresses crucial challenges in creating EE HetNets but also lays a foundation for future advancements in wireless network design, operation, and management, ultimately benefiting network operators and end-users alike amidst the growing demand for high-speed data and the increasing prevalence of wireless devices. The proposed D-DOSS approach not only offers insights for the systematic design and analysis of EE HetNets but also systematically outperforms other state-of-the-art techniques presented. The improvement in energy efficiency systematically ranges from 67% (min side) to 98% (max side), systematically demonstrating the effectiveness of the proposed strategy in achieving higher energy efficiency compared to existing strategies. This systematic research work establishes a strong foundation for the systematic evolution of energy-efficient HetNets. The systematic methodology employed ensures a comprehensive understanding of the complex interplay of network dynamics and user requirements in a multi-tiered environment.</p></div>

Cited by 0Open access

Evaluating blocking probability in distributors

Ellen Zegura · 2002

A model for evaluating blocking probability in distribution networks is presented, and equations for computing blocking probability for the class of series-parallel networks are derived. The quotations are exact for pure series networks and approximate for parallel networks. The accuracy of the approximation is investigated by comparing the blocking probability computed using the equations to measured simulation data. The results indicate that for higher loads and larger switches the approximation is generally within 10% of the simulation results.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

Cited by 5

Theoretical blocking probability for SDMA

Giselle M. Galvan‐Tejada, J.G. Gardiner · IEE Proceedings - Communications · 1999

Designers of modern wireless communication systems are widely considering the employment of space division multiple access (SDMA) technology as a means of increasing the capacity of their systems. The authors derive a theoretical expression to calculate the blocking probability resulting from use of SDMA technology in two different schemes of channel allocation. The expressions obtained describe the case when two users share the same channel at the same time.

Cited by 26

Blocking Probability in a Caching Hierarchy

Yong-Qing Lu, Fernando Kuipers, Frank den Hartog et al. · TNO Repository · 2011

We develop a performance model for the availability of a MobileTV service in a caching hierarchy network. The probability that bandwidth for the service is available is calculated as a function of channel popularity, the number of available channels, cache sizes, network configuration, and content viewing behavior. The system performance and the key factors that affect the performance are analyzed.

Cited by 0

Blocking Probability in Pipeline Forwarding Networks

Mario Baldi, Andrea Vesco · SHILAP Revista de lepidopterología · 2014

As multimedia communications continue to grow steadily on the Internet, pipeline forwarding (PF) of packets provides a scalable solution for engineering delay-sensitive traffic while guaranteeing deterministic Quality of Service (QoS) with high resource utilization. In PF networks resource reservation, while ensuring deterministic QoS on a per-flow basis, can result in a not null blocking probability. A reservation request may fails due to enough resources being available but not during the proper time frames. This work analyses blocking probability of reservation requests since it affects the capability of utilizing network resources to carry traffic with deterministic QoS. The blocking probability and, consequently, the achievable network utilization are analytically derived on general topology PF networks as function of the traffic intensity given the traffic matrix and the network routing. The correctness of the blocking models is also assessed by simulation in different scenarios. This work represent a valuable contribution over previous analytical models of the blocking probability as their application to real size scenarios is impractical due to their computation complexity.

Cited by 0Open access

The Blocking Probability of Spider-Web Networks

Pippenger, Nicholas · Scholarship - Claremont (Claremont Colleges) · 1991

We determine the limiting behavior of the blocking probability for spider-web networks, a class of crossbar switching networks proposed by Ikeno. We use a probabilistic model proposed by the author, in which the busy links always form disjoint routes through the network. We show that if the occupancy probability is below the threshold 2 - √2 = 0.5857…, then the blocking probability tends to zero, whereas above this threshold it tends to one. This provides a theoretical explanation for results observed empirically in simulations by Bassalygo, Neiman, and Vvedenskaya.

Cited by 0

Proportional QoS over WDM networks: blocking probability

Yang Chen, Mounir Hamdi, Danny H. K. Tsang · 2002

The provision of scalable quality-of-service (QoS) guarantees on wavelength-division-multiplexing (WDM) networks is an important and challenging issue for the next generation Internet. One of the important performance metrics in a QoS-capable WDM network is the call blocking probability. Previously, a proportional differentiation model has been proposed as an effective method for scalable differentiated services provision. This model provides the network operators the ability of quantitatively adjusting the quality differentiation between service classes. We introduce this model into WDM networks with the aim of providing proportionally differentiated blocking probability to various traffic classes. An intentional blocking algorithm is proposed to implement this model at the wavelength level. In order to solve the link utilization degradation in this algorithm, we propose another intentional termination algorithm. Since the performance requirement from the network operator might be various, a hybrid algorithm is also given as a balance between the above two. These three algorithms are also suitable to TDM over WDM, where one connection only take part of the transmission capacity of one wavelength. Extensive simulation results demonstrate that our algorithms provide accurate and controllable differentiation on blocking probability between various traffic classes even in a bursty traffic situation. The infeasibility problem in proportional blocking probability provision is also discussed.

Cited by 11

Blocking probability of three-stage multicast switches

M. Listanti, Luca Veltri · 2002

In this paper, an analytical model for the evaluation of the blocking probability of a three stage STM switch in presence of multicast is presented. The basic characteristics of this model are: (i) the elementary switches can assume any size; (ii) multicast connections can be characterised by any fan-out distribution; (iii) both single request and additive request scenarios are analysed. Moreover, three network operation alternatives are analysed, i.e. multicasting is carried-out in: (a) the first and the third stages; (b) the second and the third stages; (c) all the three stages. The model uses a mixed approach derived from approaches proposed by Lee (1955)and Jacobeus (1950). The analytical results are compared with those arising from simulation. The good accordance of the two series of results demonstrates the soundness of the model assumptions.

Cited by 10

The blocking probability of spider‐web networks

Nicholas Pippenger · Random Structures and Algorithms · 1991

Abstract We determine the limiting behavior of the blocking probability for spider‐web networks, a class of crossbar switching networks proposed by Ikeno. We use a probabilistic model proposed by the author, in which the busy links always form disjoint routes through the network. We show that if the occupancy probability is below the threshold 2 ‐ √2 = 0.5857…, then the blocking probability tends to zero, whereas above this threshold it tends to one. This provides a theoretical explanation for results observed empirically in simulations by Bassalygo, Neiman, and Vvedenskaya.

Cited by 5

Blocking probability in FDMA-TDMA cellular system

Ana Laura Armenta-Vilches, Mario Reyes-Ayala, Edgar Alejandro Andrade-González et al. · 2009

In this paper, the performance of a FDMA-TDMA cellular communication system is carried out. The parameters employed to evaluate the performance are the blocking probability, spectral efficiency and the bit error rate. The results were obtained assuming the most important urban fading model, because this environment is the most important in practical cases.

Cited by 1

BLOCKING PROBABILITY WITH TIME-DRIVEN PRIORITY SCHEDULING

Mario Baldi, Y. Ofek · 2000

This paper evaluates call blocking probability over packet-switched networks with Time-driven priority (TDP) (Li et al. 1998; Li, Ofek and Yung 1996). The presented work is novel since call blocking is typically studied in the context of circuit-switched networks. TDP together with resource reservation enables real-time delivery of packets with no loss due to congestion and constant jitter of one time frame (TF)typically between 12.5 s and 125 s. Resource reservation for a call (or multiple calls) over a TDP network requires finding a schedule. A call may not be accepted for two reasons (i) there is no capacitythe call is rejectedor (ii) there is capacity but no schedulethe call is blocked. This work studies the call blocking probability as a function of the link utilization, since call blocking can possibly lead to low link utilization. In other words, it may not be possible to fully utilize the network because of unschedulability (i.e., the inability to find a schedule). The results...

Cited by 12

Probabilistic Approach for Blocking Probability in Optical Networks

Robin Khurana, Ashish Verma, Gaganpreet Kaur · International Journal of Computer Applications · 2014

An optical network is a communication network in which information is transmitted as optical signals. In network data traverse through different routes, so deciding best route becomes an important issue in optical network. To select best route in the network various algorithms proposed by researchers. Blocking probability, routing etc are the various parameters related to these algorithms. For calculating the results for these parameters Erlang B formula was used. This paper presents a proposal of mathematical model to reduce the blocking probability in the network. The mathematical model is modification of Erlang's B formula. MATLAB software is used for simulation. Results show that, with increase in the value of load, blocking probability increases but negligibly small. The results have proved that this model is better than the conventional techniques.

Cited by 0Open access

OBS network blocking probability prediction using ensemble technique

Srija Chakraborty, Ashok Kumar Turuk, Bibhudatta Sahoo · 2020 IEEE International Symposium on Sustainable Energy, Signal Processing and Cyber Security (iSSSC) · 2020

In present time, artificial intelligence techniques are widely used in network field to improve the performance and security of optical burst switching networks. In our work we have used different predictor models and feature reduction algorithms to predict the blocking probability of upcoming traffic in a OBS network which will help us improve the performance of the network drastically. In this work, ensemble of predictors like Linear Support Vector Machine (SVM), Linear Regression (LR) and Random Forest (RF) are used to train and predict burst contention or burst blocking probability. From the result, we can conclude that this approach works better and gives accurate as well as faster result than other approaches. We observe the proposed model competently and predict the blocking probability with higher accuracy, along with lowering the number of burst loss. Thus, it will help future network designers to have an advanced idea about the performance of the network under specific framework.

Cited by 2

Blocking Probability Analysis of the Node in WRON

Chunyong Yang, Deming Liu, Wei Li et al. · 2008

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

Cited by 0

Localized QoS Routing Based on Links Blocking Probability

Fahd Aldosari · 2014

Localized Quality of Service (QoS) routing has recently been proposed as a promising alternative to the currently deployed global routing algorithms. In localized routing schemes, routing decisions are taken solely based on locally collected statistical information rather than global state information [1]. This approach significantly reduces the overheads associated with maintaining global state information at each node, which in turn improves the overall routing performance. In this paper we introduce a Localized QoS routing algorithm based on Link Blocking Probability (LBP). We compare the performance of the proposed algorithm against the most efficient localized routing algorithm, namely Credit Based Routing (CBR), and against the contemporary global routing algorithm, the Widest Shortest Path (WSP). With the aid of simulations, we show that the introduced algorithm outperforms the others in terms of the overall network blocking probability.

Cited by 2