Results 261 to 270 of about 113,866 (313)

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
Y. Yang, J. Wang
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, Yong Cui, Ke Xu, Jianhui Huang, Dapeng Liu   +4 more
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.
A. Chydzinski, R. Winiarczyk
openaire   +1 more source

Error probability for block codes over channels with block interference

Proceedings of GLOBECOM'96. 1996 IEEE Global Telecommunications Conference, 1998
A methodology is presented to evaluate analytically the average decoded error probability for block codes over block interference channels. The proposed analysis is based on the knowledge of the moments of the bit error probability over the fading channel, thus allowing, e.g., fast performance evaluation of block coded slow frequency hopping (SFH ...
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.
Dinwoodie, Ian H., Gamundi, Emily, Mosteig, Ed   +2 more
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

Blocking probabilities for large multirate erlang loss systems

Advances in Applied Probability, 1993
This paper is concerned with the computation of asymptotic blocking probabilities for a generalized Erlangian system which results whenMindependent Poisson streams of traffic with ratesaccess a trunk group ofCcircuits with traffic from streamkrequiringAkcircuits which are simultaneously held and released after a time which is randomly distributed with ...
Gazdzicki, Pawel, Lambadaris, Ioannis, Mazumdar, Ravi R.   +2 more
openaire   +1 more source

Blocking Probability in OBS Networks

2009
Computing the blocking probability of bursts at the core nodes in an OBS network is important for many reasons. First, it helps to understand the loss process of bursts and provide exact analytical expression for the loss rate of bursts at the core nodes.
T. Venkatesh, C. Siva Ram Murthy
openaire   +1 more source

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

Blocking probabilities of multi-layer multicast streams

Workshop on High Performance Switching and Routing, Merging Optical and IP Technologie, 2003
We present two new algorithms for calculating call blocking probabilities for multi-layer multicast streams with the assumption that blocked calls are lost. Users may join and leave the multicast connections freely, thus creating dynamic multicast trees.
J. Karvo, S. Aalto, J. Virtamo
openaire   +1 more source