Course Content Teletraffic Theory

Introduction The subject and tasks of teletraffic theory

Section 1. Call Flows

1.1 Methods for determining and setting call flows

1.2 Basic properties of call flows

1.3 Basic Characteristics of Call Flows

1.4 The simplest call flow and its properties

1.5 Mathematical expectation and variance of the simplest call flow

1.6 The law of the distribution of gaps between the calls of the simplest flow

1.7 Service duration. Release stream

1.8 Simplest flow classification

Section 2. Telephone load

2.1 Definition of telephone load

2.2 Basic parameters of the load

2.3 Concentration of telephone load

2.4 Methods of load distribution

2.5 Evaluation of load measurement results. Understanding Confidence Probability and Trust Interval

Section 3. Methods for calculating the bandwidth of full-access inclusions in single-unit switching systems with losses

3.1 Maintaining the simplest call flow (displaying the first Erlang formula)

3.2 Erlang differential equations

3.3 Stationary mode. Erlang distribution

3.4 Losses in the full-reachable beam when servicing the simplest call flow

3.5 Erlang Recurrent Formula

3.6 Average throughput of full-access beam lines

3.7 Graphic dependencies between the parameters of the first Erlang formula

3.8 Maintaining a fully accessible flow beam from a limited number of load sources (Engset formula)

3.9 Comparison of the bandwidth of the full-accessible beam with the simplest and Engset streams

Section 4. Systems with Standby

4.1 Maintenance of the simplest call flow with a fully accessible beam with waiting for an exponential distribution of the duration of a session

4.2 Systems with standby at constant service duration

4.3 Calculation of bandwidth control devices

4.4 Combined service system. Limited number of waiting places

4.5 Calculation of systems with repeated calls

Section 5. Single-element incomplete enabled lossy

5.1 Basic characteristics of NAP inclusions

5.2 Types of NAP inclusions and the choice of their structure

5.3 Perfectly symmetric incomplete schemes

5.4 Erlang formula for an ideal NAP scheme (third Erlang formula)

5.5 Approximate methods for calculating the capacity of NAP schemes

Additional and reference materials

Density and probability distribution functions

Bernoulli theorem. Poisson distribution

Detailed proof of the second Erlang formula

Literature:

1. The main: 1.1. Yu. N. Kornyshev, A.P. Pshenichnikov, A. D. Kharkevich - “Teletraffic Theory” - a textbook for universities. Moscow, publishing house "Radio and communication", 1996, 272 p.

2. Additional:

2.1. Yu. N. Kornyshev, G. L. Fan - “The Theory of Information Distribution” - Moscow, Radio and Communication Publishing House, 1985, 184s.

2.2. M. A. Shneps - “Information Distribution Systems. Calculation methods "- Moscow, publishing house" Svyaz ", 1979.