Results 271 to 280 of about 120,279 (310)
Some of the next articles are maybe not open access.

Blocking probability analysis in future wireless networks

2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577), 2004
This paper proposes to model each cell of future wireless networks as a G/G/c/c queueing system. As such a model has not been explicitly addressed in the literature, we apply maximum entropy principles to evaluate both traffic distribution and blocking probability within each cell.
Ronald Beaubrun   +2 more
openaire   +2 more sources

Simulation run lengths to estimate blocking probabilities

ACM Transactions on Modeling and Computer Simulation, 1996
We derive formulas approximating the asymptotic variance of four estimators for steady-state blocking probability in a multiserver loss system, exploiting diffusion process limits. These formulas can be used to predict simulation run lengths required to obtain desired statistical precision before the simulation has been run, which can aid ...
Rayadurgam Srikant, Ward Whitt
openaire   +1 more source

Blocking Probabilities for a Class of Spiderweb Channel Graphs

IEEE Transactions on Communications, 1980
The blocking probabilities for spiderweb channel graphs are well known to be difficult to compute. Recently, Takagi studied a class of spiderweb channel graphs and gave recursive equations for computing their blocking probabilities. In this paper we use a recent result in combinatorics to give a dosed form solution for the recursive equations ...
openaire   +1 more source

Computing the Blocking Probabilities for Spiderweb Channel Graphs

IEEE Transactions on Communications, 1982
The problem of computing the blocking probabilities for spiderweb channel graphs is known to be difficult even under the simplifying Lee model. There have been only a few successful cases reported in the literature, all restricted to special types of four-stage channel graphs.
openaire   +1 more source

Blocking Probability in OBS Networks

2009
Computing the blocking probability of bursts at the core nodes in an OBS network is important for many reasons. First, it helps to understand the loss process of bursts and provide exact analytical expression for the loss rate of bursts at the core nodes.
T. Venkatesh, C. Siva Ram Murthy
openaire   +1 more source

Reciprocity of blocking probabilities in multiservice loss systems

IEEE Transactions on Communications, 1988
A general reciprocity relation is pointed out that is obeyed by the blocking probabilities in multiservice loss systems managed under a coordinate convex access. This in turn means that several user classes compete for a common pool of resource, the mutual differential influences on the blocking probabilities of the traffic streams are equal.
openaire   +1 more source

Influence blocking maximization on networks: Models, methods and applications

Physics Reports, 2022
Bo-Lun Chen   +2 more
exaly  

Blocking Probability in a Caching Hierarchy

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.
Lu, Y.   +3 more
openaire   +1 more source

Analysis of particle fouling during microfiltration by use of blocking models

Journal of Membrane Science, 2007
Kuo-Jen Hwang, Kuo-Lun Tung
exaly  

Home - About - Disclaimer - Privacy