Results 251 to 260 of about 1,703,653 (303)
Some of the next articles are maybe not open access.

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

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

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

On the Probability of Undetected Error for Linear Block Codes

IEEE Transactions on Communications, 1982
The problem of computing the probability of undetected error is considered for linear block codes used for error detection. The recent literature is first reviewed and several results are extended. It is pointed out that an exact calculation can be based on either the weight distribution of a code or its dual.
Jack K. Wolf   +2 more
openaire   +2 more sources

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

A Study of Blocking Probability in WDM Network

2002
Calculating blocking probabilities in a network is hard work to do. Also transmission limitations and network upgrade strategies are all expected to mean that different links in a wavelength division multiplexed (WDM) network are expected to have different number of light channels per link.
Kiyoung Jung, Jun Kyun Choi
openaire   +2 more sources

An analytical model on network blocking probability

IEEE Communications Letters, 1997
We present a new analytical model on the blocking probability of the three-stage Clos (1953) network. Due to the effect of approximations, a common problem with previously proposed analytical models is that they may not be very accurate in some cases.
openaire   +2 more sources

Theoretical blocking probability for SDMA

IEE Proceedings - Communications, 1999
Designers of modern wireless communication systems are widely considering the employment of space division multiple access (SDMA) technology as a means of increasing the capacity of their systems. The authors derive a theoretical expression to calculate the blocking probability resulting from use of SDMA technology in two different schemes of channel ...
G.M. Galvan-Tejada, J.G. Gardiner
openaire   +1 more source

Home - About - Disclaimer - Privacy