Results 141 to 150 of about 444,413 (202)
Stage-Dependent Effects of "Too Little and Too Much" Medial Prefrontal Activity on Reversal Learning in Rats: Functional Inhibition Impairs Early, Whereas Neural Disinhibition Impairs Late Reversals. [PDF]
Renström JG +12 more
europepmc +1 more source
Reciprocity of Blocking Probabilities in Multiservice Loss Systems
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.
Virtamo, Jorma
exaly +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Blocking Probabilities for a Class of Spiderweb Channel Graphs
IEEE Transactions on Communications, 1980The 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 ...
F Hwang
exaly +2 more sources
On Blocking Probabilities for Switching Networks
Bell System Technical Journal, 1977We 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, 1998Multicast 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), 2006In 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), 2020Policy 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, 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 +3 more sources
Evaluation of Call Blocking Probabilities in LEO Satellite Networks
In this paper, we present a new method for calculating call blocking probabilities (CBPs) in a low Earth orbit satellite network that carries voice calls.
Zaim, A. Halim +2 more
exaly +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 +2 more sources

