Results 271 to 280 of about 113,866 (313)
Some of the next articles are maybe not open access.
Evaluating blocking probability in generalized connectors
IEEE/ACM Transactions on Networking, 1995Generalized connectors provide the capability to connect a single input to one or more outputs. Such networks play an important role in supporting any application that involves the distribution of information from one source to many destinations or many sources to many destinations.
openaire +1 more source
Blocking Probability Estimation for Trunk Reservation Networks
2007 IEEE International Conference on Communications, 2007In this paper, we consider the problem of estimating steady-state blocking probability for circuit-switched networks with alternate routing. In particular, we focus on networks protected by trunk reservation. A new blocking probability estimate, the so-called overflow priority classification approximation (OPCA), is considered as an alternative to the ...
G. Raskutti +3 more
openaire +1 more source
Blocking probability analysis in future wireless networks
2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577), 2004This 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.
R. Beaubrun, S. Pierre, J. Conan
openaire +2 more sources
Blocking probability of three-stage multicast switches
ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220), 2002In 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 ...
LISTANTI, Marco, Veltri L.
openaire +2 more sources
Computing the Blocking Probabilities for Spiderweb Channel Graphs
IEEE Transactions on Communications, 1982The 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
An analytical model on network blocking probability
IEEE Communications Letters, 1997We present a new analytical model on the blocking probability of the three-stage Clos (1953) network. Due to the effect of approximations, a common problem with previously proposed analytical models is that they may not be very accurate in some cases.
openaire +1 more source
Blocking Probability in a Caching Hierarchy
2011We 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
Blocking probabilities in large circuit-switched networks
Advances in Applied Probability, 1986This paper is concerned with blocking and loss probabilities in circuit-switched networks. We show that when the capacity of links and the offered traffic are increased together, a limiting regime emerges in which loss probabilities are as if links block independently, with blocking probabilities given by the solution of a simple convex programming ...
openaire +1 more source
Integrative oncology: Addressing the global challenges of cancer prevention and treatment
Ca-A Cancer Journal for Clinicians, 2022Jun J Mao,, Msce +2 more
exaly