Results 241 to 250 of about 1,703,653 (303)

Evaluating blocking probability in generalized connectors

open access: yesIEEE/ACM Transactions on Networking, 1995
Generalized 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.
Ellen Witte Zegura
openaire   +2 more sources

A blocking probability study for the aethereal network-on-chip

open access: yes2016 11th International Design & Test Symposium (IDT), 2016
The AEthereal network-on-chip and its later variations cover an important role in the on-chip communications field for their capability of ensuring deterministic delivery. This AEthereal feature is offered by the time-driven forwarding operation, which however also introduces possible connection blocking in the system, i.e., a proper time schedule for ...
MARCHETTO, GUIDO   +2 more
openaire   +2 more sources
Some of the next articles are maybe not open access.

Related searches:

On Blocking Probabilities for Switching Networks

Bell System Technical Journal, 1977
We study the blocking probabilities of multistage switching networks through their linear graphs using Lee's model. We give results which allow us to compare the blocking probabilities of various classes of linear graphs. In particular, we derive techniques for deciding when the blocking probability of one linear graph does not exceed the blocking ...
Chung, F. R. K., Hwang, F. K.
openaire   +2 more sources

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   +2 more sources

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   +3 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   +2 more sources

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   +4 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

Home - About - Disclaimer - Privacy