Professional Documents
Culture Documents
Networks Traffic Theory
Networks Traffic Theory
M.Sc. Course
Lecture 1: Introduction to Network Traffic Theory
Prof. Dr. Emad Al-Hemiary
Al-Nahrain University
College of Information Engineering
Building B Room B107
emad@coie-nahrain.edu.iq
❑Definitions
❑Objectives of traffic theory
❑Traffic models
❑Statistical properties and traffic intensity
❑Concept of busy hour
Examples:
Queue Server
QoS
Traffic theory tasks:
➢ Given a future knowledge of traffic and system capacity, what would
QoS be?
▪ User level: delay, dropped packets, blocked traffic, …
❑ Main system functionality are described by means of server and queue elements
❑ It appears natural to split the description of the traffic properties into random processes for
arrival of call attempts and processes describing service (holding) times.
❑ These two processes are usually assumed to be mutually independent, meaning that the
duration of a call is independent of the time the call arrive.
❑ Models also exists for describing the behavior of users (subscribers) experiencing blocking, i.e.
they are refused service and may make a new call attempt a little later (repeated call attempts)
𝜌=𝜆∙𝑠
Where:
Theoretical quantity
Actual traffic processed by
representing
the system
incoming traffic to the
system as if the
Queue Server
system has unlimited Offered traffic Carried traffic
capacity 𝒄
𝒔
𝒍
Blocked traffic Finite capacity
Fraction of incoming
arrivals (calls or jobs)
blocked due to lack of = 𝒄+𝒍
capacity
Example
In a local voice switch, incoming call requests per hour is 1500 and the mean holding time is 4 minutes. What is traffic
intensity? What will the traffic volume be for one day?
𝑐𝑎𝑙𝑙 4
𝜌 = 𝑠 = 1500 × ℎ𝑟 = 100 𝐸𝑟𝑙𝑎𝑛𝑔
ℎ𝑟 60
𝑇𝑟𝑎𝑓𝑓𝑖𝑐 𝑣𝑜𝑙𝑢𝑚𝑒 = 100 × 24 = 2400 𝐸𝑟𝑙𝑎𝑛𝑔 − ℎ𝑟
If a private subscriber generates 0.01 to 0.04 Erlang, then total population that generate a load of 100 Erlang is about
2500 to 10000 subscribers.
ADPH TCBH
Networks Traffic Theory - Prof. Dr. Emad Al-Hemiary 13