Results 151 to 160 of about 444,413 (202)
Some of the next articles are maybe not open access.

The blocking probability of spider‐web networks

Random Structures & Algorithms, 1991
AbstractWe 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   +3 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

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

Computing Call-Blocking Probabilities in LEO Satellite Networks: The Single-Orbit Case

open access: yesIEEE 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.
H G Perros, G N Rouskas
exaly   +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

Minimization of Blocking Probability

2002
In an all-optical WDM network, the route of a pair of communication nodes usually consists of multiple hops. If a transmission can occupy the same wavelength on every hop, it can then remain in optical form within the network. Otherwise, it encounters wavelength conflict and it has to be blocked.
Xiaohua Jia, Xiao-Dong Hu, Ding-Zhu Du
openaire   +1 more source

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

2016 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   +1 more source

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   +2 more
openaire   +3 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), 2002
In 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 ...
M. LISTANTI, VELTRI, Luca
openaire   +3 more sources

Home - About - Disclaimer - Privacy