Network Planning - German University in Cairo Network...1 3 2014 Wired Network Planning (an example...
18
Network Planning Mohamed Ashour, German University in Cairo Lecture 1 NETW1003 2014 Network Planning
Transcript of Network Planning - German University in Cairo Network...1 3 2014 Wired Network Planning (an example...
Netw
ork
Pla
nnin
g
Mo
ha
me
d A
sh
ou
r, G
erm
an U
niv
ers
ity in
Cairo
Le
ctu
re
1
NE
TW
1003
2014
Network Planning
Netw
ork
Pla
nnin
g
Mo
ha
me
d A
sh
ou
r, G
erm
an U
niv
ers
ity in
Cairo
Le
ctu
re
1
NE
TW
1003
2014
Wired Network Planning (an example Country)
Small City
Large City
• How to connect the cities.
• What are the link capacities to use.
• Where to place switches.
• How ensure the network will not fail.
Netw
ork
Pla
nnin
g
Mo
ha
me
d A
sh
ou
r, G
erm
an U
niv
ers
ity in
Cairo
Le
ctu
re
1
NE
TW
1003
2014
Fiber to the Home Example
• How to connect all buildings in the
map using fiber optic cables
• Which paths to use for the main
fiber cables
• Where to locate splitters
Netw
ork
Pla
nnin
g
Mo
ha
me
d A
sh
ou
r, G
erm
an U
niv
ers
ity in
Cairo
Le
ctu
re
1
NE
TW
1003
2014
Cellular Network Planning an Example City
• Where to locate Base stations
• What is the power to use with each base station
• What is the frequency reuse
• What is the coverage of each BS
Netw
ork
Pla
nnin
g
Mo
ha
me
d A
sh
ou
r, G
erm
an U
niv
ers
ity in
Cairo
Le
ctu
re
1
NE
TW
1003
2014
Resource Allocation Problem
• A number of user are interested
to use a number of resources
(e.g communication channels )
• Each user can achieve a different
capacity on each channel
• Each channel can accept only
one user
• How to assign users to channels
such as to maximize the over all
data rate
Netw
ork
Pla
nnin
g
Mo
ha
me
d A
sh
ou
r, G
erm
an U
niv
ers
ity in
Cairo
Le
ctu
re
1
NE
TW
1003
2014
Power allocation
Wireless sensor node Wireless
sensor node
Increased coverage
= increased power
consumption but
more connectivity
How to get data from one side of the network to the other at
minimum power consumption
Netw
ork
Pla
nnin
g
Mo
ha
me
d A
sh
ou
r, G
erm
an U
niv
ers
ity in
Cairo
Le
ctu
re
1
NE
TW
1003
2014
Indoor Wiring
Netw
ork
Pla
nnin
g
Mo
ha
me
d A
sh
ou
r, G
erm
an U
niv
ers
ity in
Cairo
Le
ctu
re
1
NE
TW
1003
2014
Course Material Overview
• Network Design Problem Modeling
– Wired
– Wireless
• Optimization Methods
• Detailed Planning problems
– Location and Topological Design
– Resilient Network Design
– Multi-hour/Multi-time period Design (if time permits)
– Multi-Layer Networks (if time permits)
Netw
ork
Pla
nnin
g
Mo
ha
me
d A
sh
ou
r, G
erm
an U
niv
ers
ity in
Cairo
Le
ctu
re
1
NE
TW
1003
2014
Scope of the Course
• Network View – different routing, flow and link capacity representations
– Dimensioning
– uncertainties: link/node failures, traffic variations
– multi-layer interaction: traffic/transport, logical/physical
– large scale problems
• Approaches/algorithms/theory view – model selection
– solution with optimization tools
– approximate/heuristic algorithms for large problems
– fundamental principles
Netw
ork
Pla
nnin
g
Mo
ha
me
d A
sh
ou
r, G
erm
an U
niv
ers
ity in
Cairo
Le
ctu
re
1
NE
TW
1003
2014
Text Book
Netw
ork
Pla
nnin
g
Mo
ha
me
d A
sh
ou
r, G
erm
an U
niv
ers
ity in
Cairo
Le
ctu
re
1
NE
TW
1003
2014
Network Planning Elements
Resources Demand
Performance
Netw
ork
Pla
nnin
g
Mo
ha
me
d A
sh
ou
r, G
erm
an U
niv
ers
ity in
Cairo
Le
ctu
re
1
NE
TW
1003
2014
Network Resource & Cost
• link capacity (bps, pps)
• Number of channels
• Router/switch
– memory (bytes)
– processing power (CPU, Hz)
• Network cost:
– provisioning cost ($, hours)
– operational cost ($, hours)
Netw
ork
Pla
nnin
g
Mo
ha
me
d A
sh
ou
r, G
erm
an U
niv
ers
ity in
Cairo
Le
ctu
re
1
NE
TW
1003
2014
Network Demand
• Traffic characteristics – how much? point to point traffic volume
• stationary+stochastic
– + where? traffic demand matrix
• Different natures for different networks – the Internet: packets
– telephone network: calls
– transport network: circuits
• Demand of traffic networks generated by end users
• Demand of transport network generated by its customer traffic networks
Netw
ork
Pla
nnin
g
Mo
ha
me
d A
sh
ou
r, G
erm
an U
niv
ers
ity in
Cairo
Le
ctu
re
1
NE
TW
1003
2014
Traffic Demand in Internet
• Bits, bytes, packets/second
• Very “random”
– controlled by end-users and protocol behaviors
– highly variable, bursty, long-range-dependent, self-
similar, …
– predictable? reasonable models?
• Characteristics on a single link
– packet arrival process: approximately Poisson
– packet size distribution: non-exponential
Netw
ork
Pla
nnin
g
Mo
ha
me
d A
sh
ou
r, G
erm
an U
niv
ers
ity in
Cairo
Le
ctu
re
1
NE
TW
1003
2014
Traffic in Telephone Network
• Circuit switching – calls blocked if no available circuit
• Call arrivals approximately Poisson
• Call duration approximately exponential
• Offered load unit -- Erlang:
• Call blocking probability – Erlang-B loss formula
– 24 Erls to link with capacity 24 --> 14.6% loss
– 240 Erls to link with capacity 240 --> 4.9% loss
Netw
ork
Pla
nnin
g
Mo
ha
me
d A
sh
ou
r, G
erm
an U
niv
ers
ity in
Cairo
Le
ctu
re
1
NE
TW
1003
2014
Demand in Transport Network
• Demand to transport network is less
dynamic
– well specified start-end time
– measured in modular data rates
Signal Name Bit Rate (Mbps)
DS0 (voice) 0.064
T1 1.54
T3 45
OC-3 155.52
OC-48 2,488.32
OC-192 9,953.28
Netw
ork
Pla
nnin
g
Mo
ha
me
d A
sh
ou
r, G
erm
an U
niv
ers
ity in
Cairo
Le
ctu
re
1
NE
TW
1003
2014
Formulation
Objective Function
Constraints
Minimize total cost
Maximize traffic
Maximize fairness
Minimize delay
Minimize maximum call drop
Link capacities are not exceeded
Signal to noise ratio remains
below a given value
All demands are met
Network connectivity is
maintained
Netw
ork
Pla
nnin
g
Mo
ha
me
d A
sh
ou
r, G
erm
an U
niv
ers
ity in
Cairo
Le
ctu
re
1
NE
TW
1003
2014
A Simple Design Example
• set up links to carry demand under link
utilization constraint of 60% max
utilization
A
B C
300Kbps
300Kbps 300Kbps
demand matrix
A
B C
300Kbps
300Kbps 300Kbps
three T1 links
utili.=19.5%
A
B C
300Kbps 300Kbps
300Kbps
two T1 links
utili.=39%
