Results 251 to 260 of about 120,279 (310)

On blocking probability of multicast networks

IEEE Transactions on Communications, 1998
Multicast is a vital operation in both broad-band integrated services digital networks (BISDN) and scalable parallel computers. We look into the issue of supporting multicast in the widely used three-stage Clos network or /spl upsi/(m, n, r) network. Previous work has shown that a nonblocking /spl upsi/(m, n, r) multicast network requires a much higher
Yuanyuan Yang 0001, Jianchao Wang
openaire   +1 more source

Blocking Probability in a BMAP Queue

11th IEEE Symposium on Computers and Communications (ISCC'06), 2006
In this paper an analysis of the blocking probability in a finite-buffer queue fed by a batchMarkovian arrival process (BMAP) is carried out. In particular, the Laplace transform of the blocking probability is obtained, giving both, timedependent and stationary characteristics. Analytical results are illustrated via numerical calculations.
Andrzej Chydzinski, Ryszard Winiarczyk
openaire   +1 more source

PCRF: On the blocking probability of LTE-A

2020 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS), 2020
Policy and charging rule function (PCRF) is a node in LTE-A network for provisioning of policy and charging resources to policy and charging enforcement function (PCEF) of PDN gateway (PGW). During policy allocation the PCRF allocates bandwidth to a call, depending on the total bandwidth available between PGW and the external packet data network.
openaire   +1 more source

Blocking Probabilities for Trunk Reservation Policy

IEEE Transactions on Communications, 1987
This 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, 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.
openaire   +1 more source

Proportional fairness of call blocking probability

Proceedings of the 2nd International Conference on Interaction Sciences: Information Technology, Culture and Human, 2009
To 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, Yong Cui 0001, Ke Xu 0002, Jian-Hui Huang, Dapeng Liu   +4 more
openaire   +1 more source

A problem on blocking probabilities in connecting networks

Networks, 1977
AbstractWe 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, 1978
In 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, 2005
Polynomial 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, Emily Gamundi, Edward Mosteig   +2 more
openaire   +2 more sources

Probability: The Building Blocks

2016
Much 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