Telecommunication Network Design

Lecture notes
Telecommunication Network Design by Jorma Kekalainen
Telecommunication Network Design

Some aspects of TCP/IP design
Jorma Kekalainen
The Internet
What is the Internet?
physical infrastructure
architecture
protocols
software
services/applications
operational practices
standards
All of the above!

76
Page 1
Lecture notes
Standards
Why do we need standards?
electricity plugs
Plugs ore standardized, but only within a country.
The Internet is an international network

need standards between countries
everyone has to agree on one plug
Instead of plugs we standardize protocols

still need plugs, but these are physical layer
a protocol is a more general concept
77
Network Standards Bodies

ISOC (Internet Society)
IESG (Internet Engineering Steering Group)
IETF (Internet Engineering Task Force)
IAB (Internet Architecture Board)

IRSG (Internet Research Steering Group)
IRTF (Internet Research Task Force)
ICANN (Internet Corp. f or Assigned Names and

Numbers) and lANA (Internet Assigned Numbers
Authority)
W3C (WWW standards)
IEEE (Inst. of Electrical and Electronic Engineers)
e.g. IEEE 802.3 (Ethernet)
CCITT, ITU-T (International Telecommunications

Union)
ANSI, OSI (Open System Interconnection)
78
Page 2
Lecture notes
IETF
informal standards body
membership is open to all interested
individuals
few hard and fast rules
publishes RFCs (Request For Comments)
RFC 791: Internet Protocol (IP) Updated in RFC
1391
RFC 793: Transmission Control Protocol (TCP)
Updated in RFC 3168
79
Internet Design Principles

packet switching not circuit switching:
dont reserve bandwidth for a connection
robustness principle:
Be liberal in what you accept, and conservative in what you
send
layered model with a thin waist

end-to-end principle:
smart terminals, dumb network
distributed control
deployment issues:
scale, incremental deployment, heterogeneity
general issues:
simplicity, modularity, performance
80
Page 3
Lecture notes
Packets vs circuits
Some (Bell-heads) believe you need a
dedicated circuit
like a phone line (but higher speed)
Others (Net-heads) think circuits are

a waste of time and money
poor use of resources when traffic is
bursty
81
Packets vs circuits
Circuit switching:
logical equivalent of a phone line connects two (or
more) people.
allows network to control everything (in theory)
allows explicit QoS
needs careful design and admission control
prime example is ATM
Packet switching:
no physical circuit (though there is still an analogue
of a connection)
packets of data are individually switched.
network doesnt do much (in theory)
hard to do QoS, but network is simpler
prime example is IP
82
Page 4
Lecture notes
Packets vs circuits
Doesnt have to be one
or the other
people may run circuit
switched on one layer, and
packet switched on
another.
classic example is IP over
ATM
MPLS creates virtual

circuits between endpoints
though connections are
not between end-users
allows multiplexing of
traffic inside a
connection
multiplexed traffic is less
bursty
Multiprotocol Label Switching (MPLS) is a

mechanism in high-performance
telecommunications networks which directs
and carries data from one network node to
the next. MPLS makes it easy to create
"virtual links" between distant nodes. In an
MPLS network, data packets are assigned
labels. Packet-forwarding decisions are made
solely on the contents of this label, without
the need to examine the packet itself. This
allows one to create end-to-end circuits
83
across any type of transport medium, using
any protocol.
Robustness principle
Be liberal in what you accept, and
conservative in what you send.
if somebody else screws up, dont let this
mess your system up (liberal in what you
accept)
e.g. TCP connection termination
dont cause other systems problems

(conservative in what you send)
e.g. congestion control
84
Page 5
Lecture notes
Layered Architecture
Divide and conquer:
break the overall big
problem into smaller
ones with standardized
interfaces
Each layer provides a
service to upper layers
and utilizes the services
provided by lower layers
Performance may not be
optimal, but makes the
architecture simple and
flexible
85
Layered protocols: OSI model

OSI model breaks functionality into
layers called a protocol stack
86
Page 6
Lecture notes
Layered protocols: TCP/IP model
User Datagram Protocol (UDP), a simple transport protocol used in the Internet. The
Internet Control Message Protocol (ICMP) is chiefly to send error messages
indicating, for instance, that a requested service is not available or that a host or
router could not be reached. The Address Resolution Protocol (ARP) is a protocol for
87
determining a network host's link layer or hardware address when only its Internet
Layer (IP) or Network Layer address is known. Packet over SONET (POS)
Layered protocols
Somewhat like subroutines in programming
Each layer provides services (functions) to higher
layers
Function call interface hides details of how the
service is provided
e.g. network layer asks link layer to transport a packet
across a link, without any network details
the interface is well defined
benefits
reduction in complexity
Communications between peers using

protocols
88
Page 7
Lecture notes
Encapsulation
Lower layers deal with higher layer by
treat information from higher layer as black box
dont look inside data
just treat as bunch of bits
just break data into blocks

encapsulate the blocks, by adding
headers (e.g. addresses)
trailers
when passing back to higher layer

layers strip headers
join blocks back together
89
Layer 1: Physical layer

Function: Transmission of raw bit stream
between devices.
Services: Physical connection, modulation
Issues: # pins/wires, duplex, serial/parallel,
modulation
Media:
copper wire: e.g. coax, twisted pair
fibre optics
free air optics
microwave, satellite,
infra-red
90
Page 8
Lecture notes
Layer 2: Link layer

Function: provide reliable transport of information
between a pair of adjacent nodes.
Services: creates frames/packets, error control, flow
control
Issues: Medium Access Control (MAC),
headers/trailers
Examples:
Ethernet
Token-ring
IEEE 802.11 (Wi-Fi)
FDDI (Fiber Distributed Data Interface)
ATM (Asynchronous Transfer Mode) (also layer 3)
POS (Packet over SONET)
PPP (Point to Point Protocol)
The Medium Access Control (MAC) data communication protocol sub-layer is a sublayer of the Data
Link Layer. It provides addressing and channel access control mechanisms that make it possible for
91
several terminals or network nodes to communicate within a multipoint network, typically a local area
network (LAN) or metropolitan area network (MAN).
Layer 3: Network layer

Function: forwarding packets from end-to-end
Services: packet forwarding, some congestion
control
Issues: determining what routing to use
Examples:
IPv4 (Internet Protocol version 4)
IPv6 (Internet Protocol version 6)
ARP (Address Resolution Protocol)
ATM (Asynchronous Transfer Mode) (also layer 2)
Routing protocols (e.g. OSPF, RIP, EIGRP)
92
Page 9
Lecture notes
Routing details
OSPF - Open Shortest Path First
Open Shortest Path First is a link state (each node possesses information
about the complete network topology), hierarchical IGP (Interior Gateway
Protocol) routing algorithm. Features supported by OSPF include least cost
routing, multipath routing and load balancing.
RIP - Routing Information Protocol

Routing Information Protocol is used to manage router information within a
self contained network such as a corporate LAN (Local Area Network) or an
interconnected group of such LAN. RIP is classified by the IETF (Internet
Engineering Task Force) as one of several internal gateway protocols called
IGP (Interior Gateway Protocols).
IGP - Interior Gateway Protocol

An Interior Gateway Protocol is used to exchange routing information within
an autonomous system.
AS Autonomous System
Autonomous system (Internet), a collection of IP networks and routers
under the control of one entity (typically an Internet service provider or a
very large organization with independent connections to multiple networks,
that adhere to a single and clearly defined routing policy)
EIGRP - Enhanced Interior Gateway Routing Protocol

An advanced version of Interior Gateway Routing Protocol. It provides
superior convergence properties and operating efficiency, and combines the
advantages of link state protocols with those of distance vector protocols
(in distance-vector routing protocols each router does not possess
information about the full network topology).
93
Routing vs. Forwarding

We need to make a distinction
routing = routing protocols build the routing
tables
distributed routing protocol
build forwarding/routing/lookup table
forwarding = send packets to their next hop

lookup destination address in forwarding table
forward packet
94
Page 10
Lecture notes
Layer 4: Transport layer

Function: reliable end-to-end transport of
data
Services: multiplexing, end-to-end error and
flow control
Issues: congestion control algorithm
Examples:
TCP (Transmission Control Protocol)
UDP (User datagram Protocol)
SCTP (Stream Control Transmission Protocol)
RTP (Real-time Transport Protocol)
95
SCTP - Stream Control Transmission

Protocol
Stream Control Transmission Protocol is a
reliable transport protocol operating on top
of IP .
It provides acknowledged error free non
duplicated transfer of data with flow control.
STCP also detects data corruption, loss of
data and duplication of data by using
checksums and sequence numbers.
A selective retransmission mechanism is
applied to correct loss or corruption of the
data.
96
Page 11
Lecture notes
Layer 5: Application layer

E-mail
File transfer (FTP File Transfer Protocol)
Remote terminal (Telnet)
WWW (HTTP Hyper-Text Transfer
Protocol)
File sharing
Video conferences
VoIP (Voice over IP)
97
TCP/IP Encapsulation
Data segment
TCP segment
IP packet
Ethernet frame
98
Page 12
Lecture notes
TCP/IP operation
99
Hourglass IP
robustness against
technological innovations
anyone can innovate at
either end
new applications built by
any students (e.g.
netscape, napster)
new physical/link layers
allows huge
heterogenity
success
100
Page 13
Lecture notes
Broken layering
TCP/IP layers are broken more often than not
ICMP (Internet Control Message Protocol) - uses
IP, but controls its operation
BGP (Border Gateway Protocol) is a routing
protocol (IP layer), but is routed
IP over ATM over IP over ATM over SONET
anything involving MPLS (Multiprotocol Label
Switching)
often services are provided at multiple layers:
error and flow control, e.g. error control in SONET (sortof physical), link layer, IP, TCP
Note: In this light 7-layer OSI model seems

to be too complicated
101
End-to-end principle
Put functionality as high up the stack as
possible.
pushes functionality out towards the end
points results in
dumb network, smart terminals
contrast to PSTN (Telephone Network)
smart network, dumb terminals
also allows survival of partial network

failures
e.g. link failure, we can reroute
102
Page 14
Lecture notes
Distributed control
anything centralized is vulnerable
distribute physical infrastucture
distribute network control
e.g. routing protocols
OSPF (Open Shortest Path First), IS-IS, BGP
(Border Gateway Protocol)
not everything can be completely

decentralized
e.g. NOC, NCC
still can provide redundancy
Intermediate system to intermediate system (IS-IS), is a protocol used by routers to determine the
best way to forward datagrams through a packet-switched network. IS-IS protocol was defined
within OSI reference design.
103
A network operations center (NOC) or Network Control Center (NCC) is one or more locations from
which control is exercised over a computer or telecommunications network.
Deployment issues
scalability: has to work for a large range of networks
(in distance, and number of hosts).
IP creates networks of networks, that can span any scale:
1m > 10 000 km;
1 > 109 hosts;
link speeds 1 kbps 100 Gbps.
incremental deployment: need to be able to deploy

gradually.
constant change in the network
legacy networks wont go away
heterogeneity: different technologies and

applications and link speeds.
see layers 1 and 7 above.
link speeds covering 8 orders of magnitude.
104
Page 15
Lecture notes
Network scales
Geographic scale
PAN Personal Area Network (one room)
LAN Local Area Network (one building)
Ethernet (vast majority), Token ring, Wi-Fi,
CAN Campus Area Network (one campus)

MAN Metropolitan Area Network (one city)
WAN Wide Area Network (bigger than one city)
Number of routers/switches
small < 10
medium 10-100
large> 100
105
IP is not all good

Some things IP does not do well
billing
circuits are easy to bill
packets are not
most Internet charging is flat rate
QoS (Quality of Service)

it is difficult to design network to provide
guarantees of QoS
security (crypto doesnt fix DoS or DDoS

attacks)
A denial-of-service attack (DoS attack) or distributed denial-of-service attack106
(DDoS
attack) is an attempt to make a computer resource unavailable to its intended users.
Page 16
Lecture notes
Note: ToS and QoS

ToS - Type of Service provide an indication of
the quality of service desired.
The performance of a communications channel
or system is usually expressed in terms
of QoS (Quality of Service).
Depending upon the communication system,
QoS may relate to service performance as
SNR (Signal to Noise Ratio), BER (Bit Error
Ratio), maximum and mean throughput rate,
delay, delay variation, reliability, priority and
other factors specific to each service.
107

Network Optimization:
Goals and Constraints
108
Page 17
Lecture notes
Model, Analysis and Design

Empirical data from field trials and
deployments
Computer simulations
Analytic tools
Information theory, coding theory, communication
theory
Queuing theory and other probabilistic tools
Systems theory, graph theory
Optimization theory
109
Optimization
Optimization variables: x
Constant parameters describe objective
function f and constraint set C
Minimize { f ( x )}
x
Subject to x C
110
Page 18
Lecture notes
Questions
How to describe the constraint set?
Can the problem be solved globally and
uniquely?
What kind of properties does it have?
Can we numerically solve it in an efficient and
distributed way?
Can we optimize multiple objectives
simultaneously?
Can we optimize over a sequence of time
instances?
111
Applications topics
Theory and algorithms of optimization are useful
Information theory problems,
Transmitter and receiver design,
Channel decoding,
Detection and estimation,
Multiple antenna beamforming,
Network resource allocation and utility maximization,
Wireless power control and medium access,
Network flow problems,
IP routing,
TCP congestion control,
Network architecture and topology design
112
Page 19
Lecture notes
Methodology topics
Linear programming,
Convex optimization,
Quadratic programming,
Geometric programming,
Integer programming,
Robust optimization,
Pareto optimization,
Dynamic programming,
Nonconvex optimization,
Lagrange duality,
Gradient methods,
Interior point methods,
Distributed algorithms,
113
Network Optimization Goals

optimization goals
reduce costs
improve performance
eg. minimize delays or latency
improve reliability or survivability

hard to write as an optimization problem
heuristic approach
redundancy
optimization constraints
technological, geographic, political
Heuristic is an adjective for experience-based techniques that help in problem solving. A heuristic
algorithm is an algorithm that is able to produce an acceptable solution to a problem in many practical
114
scenarios, but for which there is no formal proof of its correctness. Alternatively, it may be
correct, but may not be proven to produce an optimal solution.
Page 20
Lecture notes
Cost in networking
capital
equipment (cables, switches, ...)
premises
land that cables run along (right of ways)
operations
exclude sales and marketing, management, R&D
doesnt depend on network design
salaries of network administrators

repairs and upgrades
design
power
transit (from upstream providers)
fixed
traffic based costs
115
A right-of-way is a strip of land that is granted for transportation purposes, such as for a rail line
or highway or communication cables etc.
Equipment costs
Often assumed to dominate
fixed node costs
cost of a router - often assumed small
need to include premises, installation, etc.
fixed link costs

constant component
BW component
higher bandwidth links cost more
distance costs
straight distance cost
BW x distance cost
116
Page 21
Lecture notes
Link costs
Simple model: cost of a link
where
r = link capacity
d = link distance
the parameters k, , , are constants.
often some terms might be close to zero so ignore
some terms are out of our control, so we ignore
these, or push them into constants
117
Example
Lets consider the problem of business
that wants to connect up two locations
with a 10 Mbps link. What can they do:
118
Page 22
Lecture notes
Example
119
Example
120
Page 23
Lecture notes
Example
We have two possible solutions:
private line
lease or build whole line
cost depends on distance: C = kprivate + privated
VPN
pay for access to network at each end, but not for
the network
no distance dependence: VPN 0
decision: use private line if
kprivate + privated 2kVPN
121
The constants
Assume the simple model, how would you work out k,
, , .
and arise from the costs of building a links.
are the fixed costs: right-of-way, digging cables in, i.e.,
things we need regardless of how much capacity we use.
reflects capacity related costs: e.g., in the old days, if you
wanted two links, you needed two cables. Today, this might
reflect the number of wavelengths you use on a WDM
system.
In reality, we often purchase such links from a

physical layer network provider.
Their costs follow a pricing model that determines and .
122
Page 24
Lecture notes
The constants (2)

Assume the simple model, how would you work
out k, , , .
and k represent the non-distance dependent
costs of a link.
These are usually associated with end equipment,
for instance the WDM multiplexers, and line cards
at the routers that terminate the link:
k is non-capacity dependent costs: cost of getting
someone to install a line card, and spend time
configuring the router.
is capacity related term: higher speed line cards
usually cost more.
123
Link costs alternatives

distance component of physical link
wired: cost of fiber, amplifiers/repeaters,
digging, right of way
wireless: (e.g., free-space optics) free over
short distances
logical link (VPN-like networks)

(simplified) cost depend on capacity, but
not distance
may depend on actual traffic volume
satellites
A virtual private network (VPN) is implemented in an additional software layer (overlay) on top of an
existing larger network providing a secure extension of a private network into an insecure network
such as the Internet. The links between nodes of a virtual private network are formed over logical
124
connections or virtual circuits between hosts of the larger network. The Link Layer protocols of the
virtual network are said to be tunneled through the underlying transport network.
Page 25
Lecture notes
Optimizing for Latency

Another goal for optimization is to
maximize network performance.
Network performance often measured
by latency
Latency is the delay of a packet
crossing the network
Most often we are concerned with
average latency
over all paths through the network
125

Types of delay
propagation:
propagation delay directly related to distance
queueing:
queueing is caused by transient congestion
processing:
packet processing time (address lockup, and header update)
fixed per hop
transmission:
time to transmit packet on the line
= packet size / line rate
126
Page 26
Lecture notes
Example: Different scenarios

ARPANET low speed links (56 kbps), and slow
processors (IMPs)
propagation: coast-to-coast in US - 3Oms
transmission: 1500 x 8/56000 = 0.22 seconds.
queueing: a couple of packets a few seconds
processing: similar order to transmission, but smaller.
Now transmission and queueing times dominate.

Modern national backbone (10 Gbps)
propagation: coast-to-coast in US 3Oms
transmission: 1500 x 8/1e10 = 1.2 ns.
queueing: large buffers (up to 0.2 seconds)
processing: 30 ns.
Now queueing is dominant, unless low load, where

propagation becomes dominant.
IMP-Interface Message Processor, a packet-switching node for connecting
computers to ARPANET (modern term: router)
127

How to reduce
Propagation delay:
cannot speed up light
minimize length of paths
Queueing delay:
reduce queueing by reducing load
Processing delay:
minimize number of hops
Transmission delay:
minimize packet sizes
e.g. VoIP uses small packets
128
Page 27
Lecture notes
Optimizing for survivability

The 6 things network engineers care
about
reliability
reliability
reliability
reliability
cost
dont forget reliability

129
Five 9s
Goal of many telecom level providers is
five nines reliability
e.g. in IP networks
uptime is 99.999%
translates to about 5 minutes downtime per
year
pretty hard to achieve

not just network design
disaster recovery processes
130
Page 28
Lecture notes
Reliability approach
Often not approached using
optimization but
redundancy or standby systems
routers, links, power supplies ..
distribution of control
problem detection and diagnosis
131
Technological Constraints
The other aspect of optimization is the
constraints
max node degree
max number of line cards per router
times max ports per card
max capacity per link

limited by speed of line cards
follows Moores law
e.g. 0C762 40 Gbps
max capacity per router

backplane technology limited (also Moores law)
today, around 10 Tbps
max length of a link (e.g. Ethernet)

Moore's Law describes a long-term trend in computing hardware, in which the number
132
of transistors that can be placed inexpensively on an integrated circuit has doubled
approximately every two years
Page 29
Lecture notes
Non-technological Constraints
geography
cost of cable in oceans is different from land
expensive to lay cable in some places
e.g. downtown Manhattan
politics
internal company organization mandates network
organization
e.g. marketing get a better network than accounting, even
though they have less real need
security
may not want to share network resources outside
of secure building
133
Other Constraints
what if we have more than one objective
e.g. network should be
fastest
cheapest, and
most reliable
multi-objective optimization is hard

use other objectives as constraints, e.g.
best performance within a budget
cheapest network which meets performance
constraints
cheapest network which meets reliability
constraints
134
Page 30
Lecture notes
Other issues
usually there are other inputs to optimization
traffic measurements
not always as easy to get as we think
planning horizon
usually when we design a network it takes some
time to build
often we cant design our network from

scratch
have to deal with legacy equipment
incremental design
135
Simple example
Three node network has three acceptable designs:
4 possible network designs

associated costs have been worked out for each
Easy to choose the second network as the cheapest

136
Page 31
Lecture notes
Bigger problems
Network with N nodes
for small N we can evaluate all designs, and
choose the best
But 2N(N-1)/2 possible network designs

some arent practical
but we still have to check that
Even for N =20 we cant evaluate all of

these
at least not in the life-time of the Universe
137
Optimization
Optimization is about building automated
methods for finding optima of such problems
needs to work quickly (enough)
planning horizon
management requirements
size of the problem
ideally attains provably best solution

cant always do this (in reasonable time)
our problems are often NP-hard
need heuristic (rule of thumb) methods
NP-hard (non-deterministic polynomial-time hard), in computational complexity theory, is a class of

problems that are, informally, "at least as hard as the hardest problems in NP"
Note. A common mistake is to think that the NP in NP-hard stands for non-polynomial. Although it
is widely suspected that there are no polynomial-time algorithms for NP-hard problems, this
138has
never been proven. Moreover, the class NP also contains all problems which can be solved in
polynomial time.
Page 32
Lecture notes
High-level view of problems
139
Simple Set Notation
140
Page 33
Lecture notes
Optimization Notation
141
Other Notation
We usually use
lower case for scalars, e.g., x
lower-case boldface for (column) vectors, e.g., x
upper-case for matrices, e.g., A
When we write x < b we mean every element

of x is less than its corresponding element in
b, so
and similarly for relational operators , ,

142
Page 34
Lecture notes

Routing problem
Logical Router
144
Page 35
Lecture notes
Router Architecture (1)
145
PCI-Peripheral Component Interconnect

High performance architecture (input
and output queueing)
146
Page 36
Lecture notes

High performance architecture (input
and output queueing)
147
Packet processing
In an IP Router
lookup packet destination in forwarding table
up to 150,000 entries
update header (e.g. checksum, TTL)

send packet to outgoing port
buffer packet along the way
For a 10 Gbps line
small 40 byte packets
about 30 million packets per second
you have ~30ns per packet
The TTL (Time To Live) field is set by the sender of the datagram, and reduced by every host on
the route to its destination. If the TTL field reaches zero before the datagram arrives at148
its
destination, then the datagram is discarded and an error datagram is sent back to the sender.
Page 37
Lecture notes
Memory demands
forwarding table can be large
up to 150,000 entries per line card
lookup in 30ns for 10 Gbps line
need fast memory
buffers can be large

0.2 seconds per line card (rule of thumb)
10 Gbps line = 250 M memory (on in and out)
need fast memory (in + out in 30ns)
backplane must be faster than line cards

N times line rate speedup (N linecards)
to guarantee non-blocking switch fabric
149
Mapping the logical to the physical

Network maps (at one layer) can be
quite misleading
150
Page 38
Lecture notes
Circuit switching wont go away

Even for purist IP net-heads
often circuit switching in lower layers
GMPLS - -switching
WDM allows multiple wavelengths of light to share a
single fiber
optical cross-connects switch the light
no electronics involved
purely optical
protocols to set up and tear down optical circuits
packet forwarding on top of these circuits

151
Routing
We need a method to map packet routes to
links
called a routing protocol
several types exist
link state
shortest path
A common approach to routing uses shortestpaths.

The canonical algorithm for solving shortestpath routing is Dijkstras.
152
Page 39
Lecture notes
Notation and Assumptions
153
154
Page 40
Lecture notes
Network Paths
155
Network Paths
156
Page 41
Lecture notes
Network Paths
157
Network Paths
158
Page 42
Lecture notes
Network Paths
159
Network Paths
160
Page 43
Lecture notes
Network Paths
161
Network Paths
162
Page 44
Lecture notes
Network Paths
163
Network Paths
164
Page 45
Lecture notes
165
Routing
166
Page 46
Lecture notes
Routing
167
Routing costs
168
Page 47
Lecture notes
Routing costs
169
Routing problem
170
Page 48
Lecture notes
Routing problem
The Routing Problem: Determine the
optimal routing x to minimize C(f)
171
Linear costs
172
Page 49
Lecture notes
Path lengths
173
Network path-length example
174
Page 50
Lecture notes
175
176
Page 51
Lecture notes
Linear costs => shortest path routing
177
Special case
178
Page 52
Lecture notes
Triangle inequality
179
Dijkstras algorithm
180
Page 53
Lecture notes
Dijkstras algorithm
181
Dijkstras algorithm
182
Page 54
Lecture notes
Dijkstra Example
183
Dijkstra Example
184
Page 55
Lecture notes
Dijkstra Example
185
Dijkstra Example
186
Page 56
Lecture notes
Dijkstra Example
187
Dijkstra Example
188
Page 57
Lecture notes
Dijkstra Example
189
Dijkstra Example
190
Page 58
Lecture notes
Dijkstra Example
191
Dijkstra Result
192
Page 59
Lecture notes
Dijkstra intuition
193
Dijkstra issues
194
Page 60
Lecture notes
Sketch of proof of Dijkstra
195
Page 61

Telecommunication Network Design - Some Aspects of TCP-IP Design

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 - Some Aspects of TCP-IP Design

Uploaded by

Copyright:

Available Formats

Lecture notes

Telecommunication Network Design by Jorma Kekalainen

All of the above!

Telecommunication Network Design by Jorma Kekalainen

Plugs ore standardized, but only within a country.

The Internet is an international network

Instead of plugs we standardize protocols

Network Standards Bodies

IAB (Internet Architecture Board)

ICANN (Internet Corp. f or Assigned Names and

CCITT, ITU-T (International Telecommunications

Telecommunication Network Design by Jorma Kekalainen

Internet Design Principles

layered model with a thin waist

Telecommunication Network Design by Jorma Kekalainen

Others (Net-heads) think circuits are

prime example is ATM

Telecommunication Network Design by Jorma Kekalainen

MPLS creates virtual

Multiprotocol Label Switching (MPLS) is a

dont cause other systems problems

Telecommunication Network Design by Jorma Kekalainen

Layered protocols: OSI model

Telecommunication Network Design by Jorma Kekalainen

Layered protocols: TCP/IP model

the interface is well defined

Communications between peers using

Telecommunication Network Design by Jorma Kekalainen

just break data into blocks

when passing back to higher layer

Layer 1: Physical layer

Telecommunication Network Design by Jorma Kekalainen

Layer 2: Link layer

Layer 3: Network layer

Telecommunication Network Design by Jorma Kekalainen

RIP - Routing Information Protocol

IGP - Interior Gateway Protocol

EIGRP - Enhanced Interior Gateway Routing Protocol

Routing vs. Forwarding

forwarding = send packets to their next hop

Telecommunication Network Design by Jorma Kekalainen

Layer 4: Transport layer

SCTP - Stream Control Transmission

Telecommunication Network Design by Jorma Kekalainen

Layer 5: Application layer

Telecommunication Network Design by Jorma Kekalainen

Telecommunication Network Design by Jorma Kekalainen

Note: In this light 7-layer OSI model seems

also allows survival of partial network

Telecommunication Network Design by Jorma Kekalainen

not everything can be completely

incremental deployment: need to be able to deploy

heterogeneity: different technologies and

Telecommunication Network Design by Jorma Kekalainen

CAN Campus Area Network (one campus)

IP is not all good

QoS (Quality of Service)

security (crypto doesnt fix DoS or DDoS

Telecommunication Network Design by Jorma Kekalainen

Note: ToS and QoS

Telecommunication Network Design

Telecommunication Network Design by Jorma Kekalainen

Model, Analysis and Design