Telecommunication Network Design - Lecture Weeks 1 and 2
Telecommunication Network Design - Lecture Weeks 1 and 2
Course Objective
Understand principal design concepts of
telecommunication networks
Lecture notes
Information Sources
1.
or from elsewhere.
Reading just the general sections in the
specifications and scanning the rest will be usually
enough to get sufficient understanding
2. You can look for material from corresponding
courses in the Internet
3. Some may find that the books are easier to read.
4. Lecture notes are sufficient to pass the course.
Books
Alwayn: Optical Network Design and Implementation
Anandalingam, G.; Raghavan, S. (Eds.): Telecommunications Network
Design and Management
Bose: Breakthrough Perspectives in Network and Data Communications
Security, Design and Applications
Freeman, Telecommunication System Engineering
Graham, Kirkman, Paul: Mobile Radio Network Design in the VHF and
UHF Bands: A Practical Approach
Jurdak: Wireless Ad Hoc and Sensor Networks: A Cross-Layer Design
Perspective (Signals and Communication Technology)
McCabe: Network Analysis, Architecture, and Design
Mishra: Fundamentals of Cellular Network Planning and Optimisation
Olifer N., Olifer V.: Computer Networks: Principles, Technologies and
Protocols for Network Design
Oppenheimer: Top-Down Network Design
Paquet: Campus Network Design Fundamentals
Shooman: Reliability of Computer Systems and Networks: Fault
Tolerance, Analysis, and Design
Spohn: Data Network Design
4
Lecture notes
Lecture notes
Broadcast networks
Bus
Ring
Star
The switching technique and topology of a network can strongly
impact its performance and robustness.
Networks have performance attributes throughput, error
rates, delay etc.
7
Lecture notes
What is Design?
Dictionary: "Design" refers to the process of
originating and developing a plan or proposal (a
drawing, model, or other description) for a new
object (machine, building, product, etc.).
Designing normally requires considering functional and
many other aspects of an object, which usually
requires considerable
research,
thought,
modeling,
iterative adjustment, and
re-design.
Lecture notes
Design process
In systems engineering and networking, design is a
very systematic process, performed step by step.
The technology in use will usually impose limits on
creativity for the designer.
In many engineering disciplines, design is codified by
standards or design rules, which impose safety
margins and guidelines in the design - This is to
protect against poor design and failure.
A designer must often invest considerable
time,
effort and
resources
11
12
Lecture notes
14
Lecture notes
A channel might be
a radio or optical link through the atmosphere,
an optical fibre,
a coaxial cable,
a twisted pair cable, or even
a telephone wire on a pole.
16
Lecture notes
17
-20 dBm
-32 dBm
[-20 - (-32)] dB
12
0.7 dB
11.3
1.4 dB
9.9
0.4 dB
9.5
0.7 dB
8.8 dB Final
margin
The final power margin is 8.8 dB, which is a sufficient margin for this link.
18
Note. ITU-T Recommendation sets a link margin between 3.0 and 4.8 dB
Lecture notes
20
10
Lecture notes
21
Hierarchies
Provide structure in the network
Redundancy
Provides availability & reliability
22
11
Lecture notes
Pillars of Science
Traditional scientific and engineering
approach:
Rationalism
Deduction and
Mathematics
Empiricism
Induction and
Observation (experiments)
Simulation
24
12
Lecture notes
25
Network Simulation
Simulation is the process of using software and
mathematical models to analyze the behavior of a
network without requiring an actual network.
26
13
Lecture notes
Gain understanding
27
14
Lecture notes
Art + Science
The Art of Network Design
Communication with users
Relations to business goals
Technology choices
15
Lecture notes
File distribution
Let us consider a simple quantitative model for
distributing a file to a fixed set of peers for both
architecture types.
The server and the peers are connected to the
network with access links.
Denote the size of the file to be distributed (in bits)
by F and the number of peers that want to obtain a
copy of the file by N.
The distribution time is the time it takes to get a
copy of the file to all N peers.
In the client-server architecture, none of the peers
aids in distributing the file.
31
Server
us
u1
d1
u2
File, size F
dN
uN
Network (with
abundant bandwidth)
32
16
Lecture notes
Observations (1)
We make the following observations:
The server must transmit one copy of the file to
each of the N peers.
Thus the server must transmit NF bits.
Since the servers upload rate is us, the time to
distribute the file must be at least NF/us.
Let denote the download rate of the peer with the
lowest download rate, that is, dmin = min{d1,d2,...,dN}.
The peer with the lowest download rate cannot
obtain all F bits of the file in less than F/dmin
seconds.
Thus the minimum distribution time is at least
F/dmin.
33
server sequentially
sends N copies:
NF/us time
client i takes F/di
time to download
F
us
dN
u1 d1 u2
d2
Network (with
abundant bandwidth)
uN
increases linearly in N
(for large N)
Time to distribute F
to N clients using = dcs = max { NF/us, F/min(di) }
i
client/server approach
This provides a lower bound on the minimum distribution
34
time for the client-server architecture.
17
Lecture notes
Observations (2)
1) At the beginning of the distribution, only the server has the file.
To get this file into the community of peers, the server must send
each bit of the file at least once into its access link.
Thus, the minimum distribution time is at least F/us.
2) As with the client-server architecture, the peer with the lowest
download rate cannot obtain all F bits of the file in less than F/dmin
seconds.
Thus the minimum distribution time is at least F/dmin
3) Finally, observe that the total upload capacity of the system as a
whole is equal to the upload rate of the server plus the upload rates
of each of the individual peers, that is, utotal =us + u1 + ... + uN.
The system must deliver (upload) F bits to each of the N peers, thus
delivering a total of NF bits.
This cannot be done at a rate faster than utotal .
So, the minimum distribution time is also at least NF/(us+u1+...+uN).
36
18
Lecture notes
37
Numerical example
The following figure compares the minimum distribution time for
the client-server and P2P architectures assuming that all peers
have the same upload rate u.
For the sake of simplicity, we set F/u = 1 hour, us =10u, and dmin
us.
Thus, a peer can transmit the entire file in one hour, the server
transmission rate is 10 times the peer upload rate, and (for
simplicity) the peer download rates are set large enough so as
not to have an effect.
We see from the following figure that for the client-server
architecture, the distribution time increases linearly and
without bound as the number of peers increases.
However, for the P2P architecture, the minimal distribution time
is not only always less than the distribution time of the clientserver architecture; it is also less than one hour for any
number of peers N.
Thus, applications with the P2P architecture can be self-scaling.
This scalability is a direct consequence of peers being
redistributors as well as consumers of bits.
38
19
Lecture notes
u1 d1 u2
F
us
dN
d2
Network (with
abundant bandwidth)
uN
3.5
P2P
Client-Server
3
2.5
dsc=NF/(10u)
2
1.5
dP2P=NF/[(10+N)u]
1
0.5
0
0
10
15
20
25
30
35
N
40
20
Lecture notes
Example: Caching
Assumptions
average object size = 100,000
bits
avg. request rate from
institutions browsers to origin
servers = 15/sec
delay from institutional router
to any origin server and back
to router = 2 sec
Consequences
origin
servers
public
Internet
1.5 Mbps
access link
institutional
network
10 Mbps LAN
41
possible solution
increase bandwidth of
access link to, say, 10
Mbps
public
Internet
consequence
utilization on LAN = 15%
utilization on access link = 15% institutional
network
Total delay = Internet delay
+ access delay + LAN delay
= 2 sec + msecs + msecs
often a costly upgrade
10 Mbps
access link
10 Mbps LAN
42
21
Lecture notes
consequence
40% requests will be
satisfied almost immediately
60% requests satisfied by
origin server
utilization of access link
reduced to 60%, resulting in
negligible delays (say 10
msec)
total avg delay = Internet
delay + access delay + LAN
delay = .6*(2.01) secs +
.4*milliseconds < 1.4 secs
public
Internet
1.5 Mbps
access link
institutional
network
10 Mbps LAN
institutional
cache
43
22
Lecture notes
23
Lecture notes
48
24
Lecture notes
Design Strategies
What is the basic networking
technology used?
What is the characteristic topology?
What is the cabling or wireless link
technology?
Limitations vs. Strengths?
50
25
Lecture notes
51
52
26
Lecture notes
27
Lecture notes
28
Lecture notes
Design
Activity
Network
Design
Adjust Criteria
Review Results
Design Documents
Specns
Drawings
Plans
Re-design
58
29
Lecture notes
59
60
30
Lecture notes
Analysis
61
Design
62
31
Lecture notes
Implementation
63
Analysis/Design
Analysis processes
Requirements
analysis
Flow analysis
Setting out
blueprints
Design processes
Logical design
Physical design
Routing
Addressing
Implementation and
Test
64
32
Lecture notes
Implementation
Implementation involves purchase of the required
hardware, software, services required to construct
the network.
Once the network is constructed, it must be
acceptance tested to confirm performance.
Acceptance testing usually exposes mistakes in design
and implementation, and is absolutely critical to
success.
Once the network has been tested and commissioned,
it can be handed over to end users.
65
33
Lecture notes
Legacy Infrastructure
More than often a new network design is a
replacement for an existing design.
This may present opportunities to save a lot
of money, or force significant additional
expenditure.
Where existing cabling, racks, air
conditioning, and rooms may be reused, new
replacements are not needed and money is
saved.
Often legacy infrastructure is not adequate
and must be replaced partly or completely,
increasing costs.
67
34
Lecture notes
Questions (1)
How to meet the requirements of the transport
application (like accuracy, throughput, latency,
mobility support...)?
How to represent and use the information?
How to utilize the communication medium?
How to connect users?
How to reach one point from another?
How to coordinate among the transmitters and
receivers?
How to regulate competition among users?
How to make the system robust to failures, attacks,
variations, growth across space and over time?
How to allocate functionalities to layers?
69
Questions (2)
How to describe the channel and estimate its
characteristics (twisted pair, coaxial cable, optic
fiber, radio)?
How fast can data be sent reliably?
How to compress signals?
How to reduce noise (thermal noise, impulse noise ...)
and manage interference (from other users, from
reflections, among symbols)
How to use the communication resources (time,
frequency) efficiently?
What happens when multiple transmitters send data
to multiple receivers?
70
35
Lecture notes
Questions (3)
What topology? Who are transceivers and who are
relays?
Direct link or switched architecture? Circuit switch
or packet switch or something else?
How to divide into (possibly different types of)
subnetworks?
End-to-end control or hop-by-hop control?
How to get on the communication medium?
How to get from one point to another?
How to monitor and adjust overall state of the
network?
How to ensure accurate, secure, timely, and usable
transfer of information across space among
competing users?
71
Money
To
Pay
Technical Design
Equipment sizing and numbers
Circuit Dimensioning
Minimises
COSTS!
72
36
Lecture notes
Roles
Customer Has:
Money to pay for products & services
Business Needs & Expectations
Employees (Operators and Users)
Designer Has:
Knowledge
(education &training)
Wisdom
(experience)
Vendors Have:
Products & Services
Skilled Workforce
37