Full course Teletraffic Theory Part 1

Pay with:
i agree with "Terms for Customers"
Sold: 3
Refunds: 0

Uploaded: 15.02.2006
Content: 60215201731910.zip (1296,4 kB)


A full course of teletraffic theory (queuing system) Part 1.
1 models of queuing systems
1.1 Specialization Teletraffic Theory
1.1.1 Information processes and conflicts service
1.1.2 The basic definitions of the theory of queuing systems
1.1.3 Models flow requirements
Non-stationary Poisson flow.
Primitive flow.
Feed with limited aftereffect.
Feed Erlang
1.1.4 Feed exemptions servers.
1.2 Models of queuing systems.
1.2.1 Mathematical introduction to the theory of Markov chains. (Markov's chain)
Continuous Markov chains.
1.2.2 Classification of queuing systems.
1.2.3 Formula Little. (Little)
1.3 Analysis of queuing systems with Markov flow requirements.
1.3.1 System M / M / 1. Anal.
1.3.2 System with a finite buffer: M / M / 1: N
1.3.3 System with several servers: M / M / m
1.3.4 System Service with m servers obvious losses: M / M / m / Loss
1.3.5 Service System M / M / m: K / M a finite number of sources of load, m servers and the final drive.
1.3.6 The system type M / M / m: m.
1.4 The probability of a class servers.
1.5 Comparative characteristics of models and Erlang Engset
1.6 Sample analysis of communication systems.
1.7 Systems of Partial switching servers.
1.8 Basis of Markov queuing network.
1.8.1 Analysis of queuing systems with no apparent loss.
1.8.2 Analysis of queuing networks with locks. The method of probability graphs Lee.
Format .doc, 50 pages


No feedback yet.
1 month 3 months 12 months
0 0 0
0 0 0
In order to counter copyright infringement and property rights, we ask you to immediately inform us at support@plati.market the fact of such violations and to provide us with reliable information confirming your copyrights or rights of ownership. Email must contain your contact information (name, phone number, etc.)