Results 251 to 260 of about 21,280 (301)
Some of the next articles are maybe not open access.
Blocking Probabilities for Trunk Reservation Policy
IEEE Transactions on Communications, 1987This paper presents an analysis of the blocking phenomenon in circuit- switched routing policies with alternate routing and trunk reservation. From the usual assumptions on the offered traffic (Poisson) and the service time (exponential distribution), a classical Markov chain model is derived. Some approximate formulas are given to compute the blocking
Francoise Le Gall, Jacques Bernussou
openaire +2 more sources
Evaluating blocking probability in distributors
IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings, 2002A 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.
openaire +1 more source
Computing call-blocking probabilities in LEO satellite networks: the single-orbit case
IEEE Transactions on Vehicular Technology, 2002 We study the problem of carrying voice calls over a low-earth-orbit satellite network and present an analytical model for computing call-blocking probabilities for a single orbit of a satellite constellation.
George N Rouskas, H G Perros
exaly +1 more source
The blocking probability of spider‐web networks
Random Structures & Algorithms, 1991AbstractWe 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.
openaire +2 more sources
Proportional fairness of call blocking probability
Proceedings of the 2nd International Conference on Interaction Sciences: Information Technology, Culture and Human, 2009To guarantee proportional fairness (PF) is an important way to realize predictable and controllable service differentiation. In this paper, a proportional differentiation call admission control (CAC) algorithm, named PBS-PF, is proposed to guarantee the network services' PF in terms of call blocking probability (CBP).
Shengling Wang 0001 +4 more
openaire +1 more source
A problem on blocking probabilities in connecting networks
Networks, 1977AbstractWe begin with a three‐stage linear graph in which the first stage has a single node u and the third stage a single node v. The second stage has k independent nodes, each of which is connected by one link to u and to v. In general, we can form a (2n+1)‐stage linear graph recursively by letting each node in the second stage of a three‐stage ...
F. R. K. Chung, Frank K. Hwang
openaire +1 more source
On Blocking Probabilities for a Class of Linear Graphs
Bell System Technical Journal, 1978In a t-stage linear graph, all vertices are arranged in a sequence of stages such that any edge goes between a vertex in stage i and a vertex in stage i + 1 for some i. Lee first proposed the use of t-stage linear graphs for studying the blocking performance of t-stage switching networks. In his model, each edge is in either of two states, busy or idle,
Chung, F. R. K., Hwang, F. K.
openaire +2 more sources
Multiple Solutions for Blocking Probabilities in Asymmetric Networks
Open Systems & Information Dynamics, 2005Polynomial systems for blocking probabilities on networks with dynamic routing are formulated. Two parameters in the coefficient field representing link capacity are varied. A region of parameter values is identified on which the system has two solutions with a probabilistic interpretation.
Ian H. Dinwoodie +2 more
openaire +2 more sources
Probability: The Building Blocks
2016Much of the risk dealt with in banking is Knightian risk, which is by definition the preserve of probability theory. Probability, with its roots in games of chance,1 and statistics, with its roots in the analysis of government census data,2 have both been applied in modern finance with great success.
Nick B. Firoozye, Fauziah Ariff
openaire +1 more source
On the Probability of Undetected Error for Linear Block Codes
IEEE Transactions on Communications, 1982The problem of computing the probability of undetected error is considered for linear block codes used for error detection. The recent literature is first reviewed and several results are extended. It is pointed out that an exact calculation can be based on either the weight distribution of a code or its dual.
Jack K. Wolf +2 more
openaire +2 more sources