Vous êtes sur la page 1sur 16

Traffic Forecasting & Network

Planning
Lec 08

Kamran Nadeem
Agenda for today
• Dimensioning of telecomm networks
• Traffic matrices
• Topologies
• Routing principles
• End-to-end method
– Approx
– Exact
• Load control
– Service protection
Dimensioning
• Planning involves
– Designing
– Optimizing
– Operating
Traffic Matrices (1)
• An area with K exchanges
– K2 traffic values
• The matrix helps with
– Topology
– Routing
Traffic Matrices (2)
Traffic Matrices (3)
• Kruithof’s double factor method
– New row and column sums from old values
– Aij <= Aij . S1/S0
– Iterative method
Kruithof’s Example (1)
1 2 Total 1 2 Total

1 10 20 30 1 45

2 30 40 70 2 105

Total 40 60 100 Total 50 100 150


Old Matrix Target Matrix

1 2 Total 1 2 Total

1 15 30 45 1 12.50 33.33 45.83

2 45 60 105 2 37.50 66.67 104.17

Total 60 90 150 Total 50.00 100.00 150


1st Iteration 2nd Iteration
Kruithof’s Example (2)

1 2 Total

1 12.27 32.73 45.00

2 37.80 67.20 105.00

Total 50.07 99.93 150


3rd Iteration

1 2 Total

1 12.25 32.75 45.00

2 37.75 67.25 105.00

Total 50.00 100.00 150


4th Iteration
Kruithof’s Example (3)
• Properties
– Uniqueness
– Reversibility
– Transitivity
– Invariance
– Fractionizing
Topologies/Routing Principles
• Selected based on traffic type and organizational policies
– This topic will be covered in detail later
Approx. End-to-End Calculation

• For small blocking probabilities


Exact End-to-End Calculation
• Using convolution algorithm
Load Control & Service Protection (1)
• Treatment of preferential vs. ordinary subscribers
Load Control & Service Protection (2)
• Traffic in an Aloha system
Strategies for Load Management
• Trunk Reservation
• Virtual Channel Protection
The End

Vous aimerez peut-être aussi