An approximate model of a switching network carrying mixture of different multichannel traffic streams

Author

Stasiak, Maciej

Author_Institution

Inst. of Electron. & Commun., Tech. Univ. of Poznan, Poland

Volume

41

Issue

6

fYear

1993

fDate

6/1/1993 12:00:00 AM

Firstpage

836

Lastpage

840

Abstract

An approximate model of a multistage switching network carrying a mixture of different multichannel traffic streams is proposed. In the model the multistage switching network is reduced to a single-channel system, that is, to an Erlang ideal grading to which a mixture of different multichannel traffic is offered. An approximate method for recurrence determination of the distribution of being busy in such grading is presented. The determined distribution enables calculation of blocking probabilities for traffic streams of various classes. The derived formula is a generalization of Kaufman (1981) and Robert´s (1981) recurrence formula covering a full-availability trunk group with various multichannel traffic streams, and it can be useful for the analysis of ISDN systems

Keywords

approximation theory; switching networks; telecommunication traffic; Erlang ideal grading; ISDN systems; approximate method; approximate model; blocking probabilities; distribution; multichannel traffic streams; multistage switching network; recurrence formula; single-channel system; trunk group; Bit rate; Communication switching; Equations; ISDN; Jacobian matrices; Probability; Pulse modulation; Statistical distributions; Telecommunication traffic; Traffic control;

fLanguage

English

Journal_Title

Communications, IEEE Transactions on

Publisher

ieee

ISSN

0090-6778

Type

jour

DOI

10.1109/26.231905

Filename

231905