Telecommunication Network Design

Lecture notes
Telecommunication Network Design by Jorma Kekalainen
Telecommunication Network Design

Jorma Kekalainen
Course Objective
Understand principal design concepts of
telecommunication networks
Lecture weeks 1 and 2
Lecture notes
Information Sources
1.
Usually, the most precise sources are the original

sources, i.e. standards, recommendations or other
specifications.
You can pull them from the Internet e.g.
ITU-T www.itu.int/ITU-T/
IETF www.ietf.org
3GPP www.3gpp.org
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

Basic Concepts
What is telecommunication network?

A network is a system in which multiple nodes are connected by
communications links.
Node can refer to a switch/router/terminal attached to a
network
A network permits a node to communicate with another node.
Telephone networks and computer networks are
telecommunication networks
The manner in which network nodes are connected is termed
topology
Lecture notes
Classification of networks (1)

The switching technique is used to classify
networks
Switching networks
circuit switched or
packet switched
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
Classification of networks (2)

WAN Wide Area Network spanning national, state,
or municipal boundaries.
MAN Metropolitan Area Network confined to a
metropolitan area, using common protocols.
LAN Local Area Network confined to a room,
floor, building or campus.
PAN Personal Area Network diameter about 1m or
confined to a room.
The boundaries are now becoming increasing blurred
between the categories, e.g. when is the network
a MAN or WAN?
a PAN or LAN?
The long term trend is for universal broadband

connectivity between all these networks.
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.
Design as a process can take many forms depending

on the object being designed and individuals
participating it.
10
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
to establish a good design for a system.
11
What is Network Design?

Traditionally based on a set of general
rules
80/20
Bridge when you can, route when you must
Focused on capacity planning

No consideration in delay optimization
No guarantee of service quality
Lack of redundancy
A bridge is a device that passes information between two network segments. It

operates at Layer 2 (Data Link Layer) of the OSI reference model.
12
Lecture notes
System and systems approach

A network is a system the set of
components that support or provide
connectivity, communications and
network services to users.
In network design, we
Identify components of a system
Understand how they interface with each
other
Network design can then interpret

system planning.
13
Systems Approach for Network

Design
14
Lecture notes
What is a communications link?

All communications links comprise
a transmitter,
a channel and
a receiver.
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.
Links have performance attributes

throughput/capacity, error rates, bandwidth etc.
The type of channel determines the design of the
transmitter and the receiver.
15
Elements of a communication system

Send messages or information from a
source to one or more destinations
16
Lecture notes
Example: Fast Ethernet LAN

Wavelength used 850 nm
Fiber loss 2.5 dB/km
Four connectors, no splices
Assume BER is 10-9 (one
error for every 109 bits sent)
Silicon pin detector requires
at 100 Mb/s at least -32
dBm (or 630 nW) input
optical power for BER=10-9
Transmitter (LED) couples 20 dBm (10 W) of optical
power into the fibre
Connector loss max 0.7dB
per connector
for 10-11 BER
17
Link design Power budget

Component / loss parameter Output/sensitivity/ Power margin
(dB)
loss
LED output
-20 dBm
PIN sensitivity at 100Mbps
-32 dBm
Allowed loss PT=PS-PR
[-20 - (-32)] dB
12
Source connector loss
0.7 dB
11.3
2 Jumper connector loss
1.4 dB
9.9
Cable attenuation (160 m)
0.4 dB
9.5
Receiver connector loss
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
Measures of network performance

There are various ways we can measure the
performance of a network:
1.
2.
3.
4.
Data throughput or capacity.

Propagation delay between nodes; variability of delay
Error rates per packet, per bit.
Reliability the probability that it will not fail over a finite
time interval.
5. Maintainability time to repair faults, time to effect
upgrades.
6. Security & secrecy, e.g. secure, shielded transfer
the ability to resist unwanted eavesdropping,

message goes to the right receiver,
no intrusion or theft of capacity.
19
Common problem issues for networks

Poor design for performance results in poor response
times on connections.
Poor design for reliability results in frequent outages.
Poor design for growth results in frequent downtime
to effect upgrades.
Poor security results in theft of capacity or user
data.
Poor choices in technology results in early
obsolescence and replacement.
Poor compatibility with end user interfaces results in
downtime, errors and poor performance.
20
10
Lecture notes
Iterative Analysis/Design process

Analyze requirements.
Collect user data.
Analyze future
requirements.
Develop the logical design.

Topology, addressing,
naming, routing, security &
management planning.
Develop the physical design.

Choose technologies,
devices, cable; choose
service providers.
Test, optimize, and document

the design.
Implement a test plan, build
a prototype and document
your work with a network
design proposal.
21
Analysis and Design Processes

Set and achieve goals
Maximizing performance
Minimizing cost
Optimization with trade-offs

Performance analysis or simulation
Recognizing trade-offs
No single best answer
Hierarchies
Provide structure in the network
Redundancy
Provides availability & reliability
22
11
Lecture notes
General Design Approaches

Heuristic by using various principles and
algorithms
Exact by working out mathematical
solutions based on some optimization
method and minimizing certain cost
functions
Simulation often used when no exact
analytical form exists.
Experiments are conducted on simplified
models to see the performance of network
23
Pillars of Science
Traditional scientific and engineering
approach:
Rationalism
Deduction and
Mathematics
Empiricism
Induction and
Observation (experiments)
Simulation
24
12
Lecture notes
How to inspect a system?
25
What is simulation and network simulation?

Simulation
The process of designing a computerized model of
a system (or process) and conducting experiments
with this model for the purpose either of
understanding the behaviour of the system or of
evaluating various strategies for the operation of
the system.
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
Reasons for network simulation

Need to analyze
Impacts of different network designs
Topologies
Technologies
Protocols
Algorithms
Network configurations
Technology benchmark and comparison
Gain understanding
27
Reasons for network simulation (2)

Need to test
Reliability
Performance
Scalability
Reducing risks before actual deployment.
A simulation tool is more preferable

than to implement an extensive
prototype system as it allows
alternatives to be easily compared.
28
14
Lecture notes
Art + Science
The Art of Network Design
Communication with users
Relations to business goals
Technology choices
The Science of Network Design

Understanding of network technologies
Analysis of capacity, redundancy, delay
29
Example: Scalability of architectures

Here we compare the scalability of client-server architecture
with P2P architecture in the context of distributing a large file
from a single server to a large number of hosts (peers).
In client-server file distribution, the server must send a copy of
the file to each of the peersplacing an heavy burden on the
server and consuming a large amount of server bandwidth.
In P2P file distribution, each peer can redistribute any portion
of the file it has received to any other peers, thereby assisting
the server in the distribution process.
We make the simplifying but generally valid assumption that the
network core has abundant bandwidth, implying that all of the
bottlenecks are in network access.
We also suppose that the server and clients are not
participating in any other network applications, so that all of
their upload and download access bandwidth can be fully devoted
to distributing this file.
30
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
File Distribution: Server-Client vs P2P

Question : How much time is taken to distribute
file from one server to N peers?
us: server upload
bandwidth (rate)
Server
us
u1
d1
u2
ui: peer i upload

bandwidth
d2
File, size F
dN
uN
di: peer i download

bandwidth
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
File distribution time: server-client

Server
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
File distribution time: P2P architectures

Lets now go through a similar analysis for the P2P
architecture, where each peer can assist the server
in distributing the file.
In particular, when a peer receives some file data, it
can use its own upload capacity to redistribute the
data to other peers.
Calculating the distribution time for the P2P
architecture is somewhat more complicated than for
the client-server architecture, since the distribution
time depends on how each peer distributes portions
of the file to the other peers.
Nevertheless, a simple expression for the minimal
distribution time can be obtained.
35
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
Minimum distribution time of P2P

Putting these three observations together, we obtain the
minimum distribution time for P2P, denoted by
dP2P max { F/us, F/min(di) , NF/(us + ui) }

i
Equation provides a lower bound for the minimum distribution

time for the P2P architecture.
It turns out that if we imagine that each peer can redistribute a
bit as soon as it receives the bit, then there is a redistribution
scheme that actually achieves this lower bound.
In reality, where chunks of the file are redistributed rather
than individual bits, equation serves as a good approximation of
the actual minimum distribution time.
dP2P max { F/us, F/min(di) , NF/(us + ui) }

i
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
File distribution time: P2P

Server
server must send one copy:

F/us =F/(10u) time
client i takes F/di time to
download, so
F/min(di)F/us=F/(10u)
NF bits must be downloaded
(aggregate)
u1 d1 u2
F
us
dN
d2
Network (with
abundant bandwidth)
uN
fastest possible upload rate:
us + ui=(10+N)u Nu, when N>>
dP2P = max { F/us, F/min(di) , NF/(us + ui) }

i F/u}, N>>
= max {F/(10u), F/(10u),
39
Server-client vs. P2P: example

Client upload rate = u, F/u = 1 hour, us = 10u, dmin us
Minimum Distribution Time
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
utilization on LAN = 15%

utilization on access link =
100%
total delay = Internet delay
+ access delay + LAN delay
= 2 sec + minutes + milliseconds
41
Example: Caching (cont)

origin
servers
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
Example: Caching (cont)

origin
servers
possible solution: install

cache
suppose hit rate is 0.4
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
Design of communication systems (1)

Major goals of communication systems designs are
1.
2.
3.
4.
5.
To maximize transmission bit rates

To minimize probability of bit error
To minimize required signal power
To minimize required system bandwidth
To maximize system utilization, e.g., maximum number of
users with minimum delay and maximum resistance against
interference
6. To minimize system complexity and cost.
Note that goals 1 and 2 are in conflict with goals 3

and 4.
Note that goal 5 is conflicting with itself
Note that goal 6 is conflicting with all other goals
44
22
Lecture notes

In practice, we also have some
constraints such as
Nyquist minimum bandwidth
Shannon-Hartley channel capacity
Government regulations (e.g., frequency
allocation, power limit)
Technological limitations (e.g., electronics)
Other system requirements (e.g., wireless,
copper, satellite)
45

Nyquist minimum bandwidth:
R symbols per second could be detected without ISI in an
R/2 Hz minimum bandwidth (called Nyquist bandwidth)
Capacity of ideal Gaussian channel

In the presence of additive white Gaussian noise, an ideal
bandlimited channel of bandwidth W has a capacity C given
by
P: Average transmitted power

N0: Power-spectral density of the additive noise
If the information rate R from the source is less than C (R < C),
it is theoretically possible to achieve reliable transmission
through the channel by means of an appropriate coding
46
23
Lecture notes
Network designers viewpoint

The network is a collection of interconnected devices
which carry data between user equipment.
The network has performance characteristics,
reliability (uptime/downtime), and quality metrics.
The network has to be continuously monitored and
maintained to assure service quality and availability.
The network has to be continuously upgraded to meet
growing user demands for load.
The security of the network has to be maintained.
Hardware, software and channels have to be
integrated together to deliver the desired effect.
The designer sees the network from a technology
perspective and is concerned with its function.
47
End users viewpoint

To the end user the network is a visible as a socket
on the wall or an antenna on a portable device.
The end user perceives the throughput of the
network as increasing or decreasing delays or
response times in applications.
The end user perceives the availability of the
network as the presence or absence of connections,
or the ability or inability to get her/his work done.
The basic question the end user most often asks is
does this network work?
is it running fast enough?
how expensive is it to use this network?
48
24
Lecture notes

General design approach
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
How do I design a network?

1. Identify constraints user needs, budgets,
technology
2. What legacy infrastructure can I exploit cables
etc?
3. Top down approach model loads vs performance to
define link / switch / router capacities
4. Design for evolution project: future growth and
upgrades.
5. Design for maintainability, reliability, supportability
51
Maintainability, Reliability, Supportability

Maintainability is a measure of how easily components can be
repaired or replaced.
Maintainability impacts running costs via man-hours expended
per maintenance action.
Reliability is a measure of how frequently (and severely) the
network breaks down requiring repair.
Reliability impacts running costs via the frequency and severity
of maintenance actions.
Supportability is a measure of how easily replacement
components can be acquired to maintain a network, and becomes
increasingly difficult as equipment become obsolete and parts
difficult to source.
Note: These three items are critical design constraints, but are
often absent in statements of performance and capability need.
A good designer must account for them.
52
26
Lecture notes
Design Process (1)

The first step in any design is to establish and
understand what the system must achieve in
terms of capability and performance.
Demand for network performance usually grows
over time.
Good design allows for low cost incremental
growth in capacity as the load and technology
evolves over time.
Often testing and measurement is required to
establish or validate capability and performance
needs.
53
Design Process (2)

The second step in the design process is to survey
the technology available which can be used to
implement a design.
This means collecting information on the
performance, capabilities and costs of all of the
components which might be used in the design.
For a network this means routers, switches, cables,
management software, and other equipment.
Knowing the strengths and weaknesses of specific
products is critical to success.
Vendors will inflate strengths and diminish or conceal
weaknesses or limitations.
Often testing is necessary to validate survey analysis,

because limitations of components may not be obvious
54
from product documentation or marketing brochures.
27
Lecture notes
Design Process (3)

Once we have understood the demands / needs /
requirements for the product, and the capabilities of
the components available for use in a design, we are in
the position to consider specific designs.
The third step in the design process is to define a
conceptual design which accounts for the
performance / capability needs, and the available
technology.
The conceptual design lacks the detail of a final
design, but is detailed enough to construct a
performance model for the product.
The performance model reconciles demands / needs /
requirements against components.
55
Design Process (4)

Once we have a performance model we can perform
simulations to establish whether the conceptual
design is good enough, or too good.
Design is usually iterative, since the mathematical
modeling of such systems are usually intractable and
finding a perfect solution in one pass is impossible.
The conceptual design is repeatedly adjusted, and
tested by simulation, until an acceptable result is
found.
Often a conceptual design cannot meet needs, and
must be replaced completely.
In most designs, performance must be reconciled
against cost.
56
28
Lecture notes
Design Process (5)

Once an acceptable conceptual design is established,
we can proceed to the detailed design.
In a detailed design, assumed system components,
such as generic routers, switches etc, are replaced
with real components.
Simulations and testing are then required to validate
the detailed design, and confirm that it can fit the
performance model which was met by the conceptual
design.
Often the largest amount of effort expended in the
design process is in the detailed design.
When the detailed design is completed, we have a
product which can be implemented.
57
Iterative Design Process

Demand
Resources
Goals
Design
Activity
Network
Design
Adjust Criteria
Review Results
Design Documents
Specns
Drawings
Plans
Re-design
58
29
Lecture notes
Planning and design
59
Planning and design
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
Constraints and Budgets

The first two steps in the design process are
collecting and analyzing information on constraints
upon the design.
Constraints are hard limits you cannot cross without
penalty.
Constraints might be the performance of available
equipment, rental costs on high speed links.
The task of the designer is to find some
configuration of components which fits inside the
constraints.
Most often the budget is the biggest constraint and
the cause of most design failures.
Designers are often asked to produce designs which
cannot be implemented within the available budget.
66
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
Top Down Strategy vs. Bottom Up Strategy

A top down strategy in a design means that the
designer starts with a system level model, and works
down into the details progressively.
A bottom up strategy is where the designer first
concentrates on the detail design and then attempts
to construct the system level design.
Some design problems force a bottom up strategy,
but network design is usually not such a problem.
Bottom up design is risky since required system level
performance may be impossible to achieve.
Inexperienced designers often pursue bottom up
design strategies since this postpones difficult
modeling tasks.
68
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
Customer Needs Drive Basic Decisions

Customer Has:
Needs & expectations
Money
Traffic volumes and characteristics

Functionality and Acceptable Delays
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
All are needed

to implement
and support the
network
73
Common design techniques

Key concept: bottleneck
the most constrained element in a system
System performance improves by removing

bottleneck
but creates new bottlenecks
In a balanced system, all resources are

simultaneously bottlenecked
this is optimal
but nearly impossible to achieve
in practice, bottlenecks move from one part of the
system to another
74
example: Ford Model T
37

Telecommunication Network Design - Lecture Weeks 1 and 2

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Telecommunication Network Design - Lecture Weeks 1 and 2

Uploaded by

Copyright:

Available Formats

Lecture notes

Telecommunication Network Design by Jorma Kekalainen

Lecture weeks 1 and 2

Telecommunication Network Design by Jorma Kekalainen

Usually, the most precise sources are the original

Lecture weeks 1 and 2

Telecommunication Network Design by Jorma Kekalainen

Telecommunication Network Design

What is telecommunication network?

Lecture weeks 1 and 2

Telecommunication Network Design by Jorma Kekalainen

Classification of networks (1)

Lecture weeks 1 and 2

Telecommunication Network Design by Jorma Kekalainen

Classification of networks (2)

The long term trend is for universal broadband

Design as a process can take many forms depending

Lecture weeks 1 and 2

Telecommunication Network Design by Jorma Kekalainen

to establish a good design for a system.

What is Network Design?

Focused on capacity planning

A bridge is a device that passes information between two network segments. It

Lecture weeks 1 and 2

Telecommunication Network Design by Jorma Kekalainen

System and systems approach

Network design can then interpret

Systems Approach for Network

Lecture weeks 1 and 2

Telecommunication Network Design by Jorma Kekalainen

What is a communications link?

Links have performance attributes

Elements of a communication system

Lecture weeks 1 and 2

Telecommunication Network Design by Jorma Kekalainen

Example: Fast Ethernet LAN

for 10-11 BER

Link design Power budget

PIN sensitivity at 100Mbps

Allowed loss PT=PS-PR

Source connector loss

2 Jumper connector loss

Cable attenuation (160 m)

Receiver connector loss

Lecture weeks 1 and 2

Telecommunication Network Design by Jorma Kekalainen

Measures of network performance

Data throughput or capacity.

the ability to resist unwanted eavesdropping,

Common problem issues for networks

Lecture weeks 1 and 2

Telecommunication Network Design by Jorma Kekalainen

Iterative Analysis/Design process

Develop the logical design.

Develop the physical design.

Test, optimize, and document

Analysis and Design Processes

Optimization with trade-offs

Lecture weeks 1 and 2

Telecommunication Network Design by Jorma Kekalainen

General Design Approaches

Lecture weeks 1 and 2

Telecommunication Network Design by Jorma Kekalainen