Professional Documents
Culture Documents
Lect01.ppt S-38.145 - Introduction To Teletraffic Theory - Spring 2003
Lect01.ppt S-38.145 - Introduction To Teletraffic Theory - Spring 2003
Introduction
Contents
2
1. Introduction
incoming outgoing
users traffic system traffic
• Ideas:
– the system serves the incoming traffic
– the traffic is generated by the users of the system
3
1. Introduction
Interesting questions
incoming outgoing
users traffic system traffic
4
1. Introduction
quality of service
5
1. Introduction
• System can be
– a single device (e.g. a link between two telephone exchanges, a processor
routing packets in a data network, a statistical multiplexer in ATM network)
or
– a whole communications network (e.g. telephone or data network) or a part
of it
• Typically a system consists of
– a device (hardware) and
– principles controlling it (software)
• Traffic, on the other hand, consists of (depending on the case)
– calls, packets, bursts, cells, etc.
6
1. Introduction
7
1. Introduction
Example
• Telephone traffic
– traffic = telephone calls
– system = telephone network
– quality of service = probability that “the line is not busy”
1234567 PRRRR!!!
8
1. Introduction
9
1. Introduction
Teletraffic models
Related fields
• Probability Theory
• Stochastic Processes
• Queueing Theory
• Statistical Analysis (of traffic measurements)
• Operations Research
• Optimization Theory
• Decision Theory (Markov decision processes)
• Simulation Techniques (object oriented programming)
11
1. Introduction
• It is good to keep in mind the difference between the real system and
the model
– (Ideally), a model is a description of only a certain part or property of the
real system
– Often, due to various reasons, the model is not very accurate but rather
approximative
Þ caution is needed when conclusions are drawn
12
1. Introduction
Practical goals
• Network planning
– dimensioning
– optimization
– performance analysis
• Network management and control
– efficient operation
– fault recovery
– traffic management
– routing
– accounting
13
1. Introduction
Literature
• Teletraffic Theory
– V. B. Iversen, Chapter 1 of “Teletraffic Engineering Handbook”, available from
http://www.tele.dtu.dk/teletraffic/
– Teletronikk (1995) Vol. 91, Nr. 2/3, Special Issue on “Teletraffic”
– COST 242, Final report (1996) “Broadband Network Teletraffic”, Eds. J. Roberts,
U. Mocci, J. Virtamo, Springer
– J.M. Pitts and J.A. Schormans (1996) “Introduction to ATM Design and
Performance”, Wiley
– J. Roberts, “Traffic Theory and the Internet”, available from
http://www.comsoc.org/ci/public/preview/roberts.html
• Queueing Theory
– L. Kleinrock (1975) “Queueing Systems, Volume I: Theory”, Wiley
– L. Kleinrock (1976) “Queueing Systems, Volume II: Computer Applications”, Wiley
– D. Bertsekas and R. Gallager (1992) “Data Networks”, 2nd ed., Prentice-Hall
– P.G. Harrison and N.M. Patel (1993) “Performance Modelling of Communication
Networks and Computer Architectures”, Addison-Wesley
14
1. Introduction
Contents
15
1. Introduction
Teletraffic models
16
1. Introduction
17
1. Introduction
Exercise
µ
1
λ m
18
1. Introduction
• No waiting places (m = 0)
– If the system is full (with all n servers occupied) when a customer arrives,
she is not served at all but lost. System is thus lossy.
• From the customer’s point of view, it is interesting to know e.g.
– What is the probability that the system is full when she arrives?
• From the system’s point of view, it is interesting to know e.g.
– What is the utilization factor of the servers?
µ
1
λ
19
1. Introduction
20
1. Introduction
Mixed system
µ
1
λ m
21
1. Introduction
Infinite system
µ
1
λ
•
•
• ∞
22
1. Introduction
Little’s formula
N = λT
23
1. Introduction
Contents
24
1. Introduction
25
1. Introduction
µ
1
λ
26
1. Introduction
Traffic process
5
4
3
2
1
time
call arrival times
blocked call
nr of channels
occupied
nr of channels
6
5
4
3
2
1
0
traffic volume time
27
1. Introduction
Traffic intensity
• In telephone networks:
Traffic ↔ Calls
• The amount of traffic is described by the traffic intensity a
• Definition: the traffic intensity a is
the product of the arrival rate λ and the mean holding time h:
a = λh
• Note that the traffic intensity is a dimensionless quantity. However, to
emphasize the context, the “unit” of the traffic intensity a is called
erlang (erl)
• By Little’s formula: the traffic intensity tells the number of ongoing calls
in the corresponding (hypothetical) infinite system.
28
1. Introduction
Example
a = 1800 ∗ 3 / 60 = 90 erlang
• If the mean holding time increases from 3 minutes to 10 minutes, then
29
1. Introduction
Characteristic traffic
30
1. Introduction
Blocking
31
1. Introduction
Call rates
λoffered λcarried
λlost
• Note:
Traffic streams
• The three call rates lead to the following three traffic concepts:
– Traffic offered aoffered = λofferedh
– Traffic carried acarried = λcarriedh
– Traffic lost alost = λlosth
• Note:
Teletraffic analysis
• System capacity
– n = number of channels on the link
• Traffic load
– a = (offered) traffic intensity
• Quality of service (from the subscribers’ point of view)
– Bc = probability that an arriving call finds all n channels occupied
• If we assume an M/G/n/n pure loss system, that is
– calls arrive according to a Poisson process (with rate λ)
– call holding times are independently and identically distributed according to
any distribution with mean h
34
1. Introduction
Erlang’s formula
• Then the quantitive relation between the three factors (system capacity,
traffic load and quality of service) is given by the Erlang’s formula
an
Bc = Erl(n, a ) = n!
n i
å ai!
i =0
• Note:
n!= n ⋅ ( n − 1) ⋅ K ⋅ 2 ⋅1, 0!= 1
• Other names:
– Erlang’s blocking formula
– Erlang’s B-formula
– Erlang’s loss formula 35
– Erlang’s first formula
1. Introduction
Example
• Assume that there are n = 4 channels on a link and the offered traffic is
a = 2.0 erlang. Then the call blocking probability Bc is
24 16
2
Bc = Erl( 4 , 2 ) = 4! = 24 = ≈ 9 .5 %
1 + 2 + 22! + 23! + 24! 1 + 2 + 2 + 6 + 24 21
2 3 4 4 8 16
26
Bc = Erl( 6 , 2 ) = 6! ≈ 1 .2 %
22 23 24 25 26
1 + 2 + 2! + 3! + 4! + 5! + 6!
36
1. Introduction
40
30
capacity n
20
10
10 20 30 40 50
37
traffic a
1. Introduction
1 − Bc (a) = 1 − Erl(10, a )
1
0.8
0.6
quality of service 1 − Bc
0.4
0.2
0
10 20 30 40 50
38
traffic a
1. Introduction
1 − Bc (n) = 1 − Erl(n,10.0)
1
0.8
0.6
quality of service 1 − Bc
0.4
0.2
0
10 20 30 40 50
39
capacity n
1. Introduction
Contents
40
1. Introduction
R
R R
R
41
1. Introduction
n
42
1. Introduction
Traffic process
0
time
43
1. Introduction
Traffic load
Traffic ↔ Packets
44
1. Introduction
Example
Teletraffic analysis
• System capacity
– C = link speed in kbps
• Traffic load
– λ = packet arrival rate in packet/s (considered here as a variable)
– L = average packet length in kbits (assumed here to be constant 1 kbit)
• Quality of service (from the users’ point of view)
– Pz = probability that a packet has to wait “too long”, that is longer than a
given reference value z (assumed here to be constant 0.1 s)
• If we assume an M/M/1 queueing system, that is
– packets arrive according to a Poisson process (with rate λ)
– packet lengths are independent and identically distributed according to
exponential distribution with mean L
46
1. Introduction
• Then the quantitive relation between the three factors is given by the
following waiting time formula
• Note:
– The system is stable only in the former case (ρ < 1), otherwise the number
of packets in the queue will grow to infinity eventually
47
1. Introduction
Example
• Assume that packets arrive at rate λ = 50 packet/s and the link speed
is C = 64 kbps. Then the probability Pz that an arriving packet has to
wait too long (i.e. longer than z = 0.1 s) is
Pz = Wait(64,50;1,0.1) = 50
64
exp(−1.4)) ≈ 19%
ρ = λCL = 50
64 < 1
48
1. Introduction
1 − Pz (λ ) = 1 − Wait(50, λ ;1,0.1)
1
0.8
0.6
quality of service 1 − Pz
0.4
0.2
0
10 20 30 40 50
50
arrival rate λ
1. Introduction
1 − Pz (C ) = 1 − Wait(C ,50;1,0.1)
1
0.8
0.6
quality of service 1 − Pz
0.4
0.2
0
60 70 80 90 100
51
link speed C