1

Chapter 1: Introduction
Our goal:
get feel and
t i l
Overview:
whats the Internet?
terminology
more depth, detail
later in course
approach:
use Internet as
example
whats a protocol?
network edge: hosts, access
net, physical media
network core: packet/circuit
switching, Internet structure
performance: loss delay performance: loss, delay,
throughput
protocol layers, service models
security
history
8/24/2011
Introduction (SSL) 1-1
Chapter 1: roadmap
1.1 What is the Internet?
1 2 Network edge 1.2 Network edge
end systems, access networks, links
1.3 Network core
circuit switching, packet switching, network structure
1.4 Delay, loss and throughput in packet-switched
networks
1 5 P l l i d l 1.5 Protocol layers, service models
1.6 Networks under attack: security
1.7 History
8/24/2011
Introduction (SSL) 1-2
2
Whats the Internet: nuts and bolts view
hundreds of millions of
connected computing
devices: hosts = end
Mobile network
Global ISP
PC
server
devices: hosts = end
systems
running network apps
Home network
Institutional network
Regional ISP
wireless
laptop
cellular
handheld
wired
access
points
communication links
fiber, copper,
radio, satellite
8/24/2011
Introduction (SSL) 1-3
router
wired
links
transmission
rate = bandwidth
routers: forward
packets (chunks of
data)
Whats the Internet: nuts and bolts view
Internet: network of
networks
l l hi hi l
Mobile network
Global ISP
loosely hierarchical
public Internet versus
private intranet
protocols control sending,
receiving of msgs
e.g., TCP, IP, HTTP, Skype,
Ethernet
Home network
Institutional network
Regional ISP
Ethernet
Internet standards
RFC: Request for comments
IETF: Internet Engineering
Task Force
8/24/2011
Introduction (SSL) 1-4
3
Whats the Internet: a service view
communication
infrastructure enables
distributed applications: distributed applications
Web, VoIP, email, games,
e-commerce, file sharing
communication services
provided to apps:
reliable data delivery
from source to from source to
destination
best effort (unreliable)
data delivery
8/24/2011
Introduction (SSL) 1-5
Whats a protocol?
human protocols:
whats the time?
network protocols:
machines rather than
h
I have a question
introductions
humans
all communication
activity in Internet
governed by protocols
protocols define format,
order of msgs sent and
8/24/2011
Introduction (SSL) 1-6
order of msgs sent and
received among network
entities, and actions taken
on msg transmission,
receipt, or timeout
4
Whats a protocol?
a human protocol and a computer network protocol:
Hi
Hi
Got the
time?
2:00
Get http://www.awl.com/kurose-ross
TCP connection
request
TCP connection
response
8/24/2011
Introduction (SSL) 1-7
Q: Other human protocols?
2:00
<file>
time
Chapter 1: roadmap
1.1 What is the Internet?
1 2 Network edge 1.2 Network edge
end systems, access networks, links
1.3 Network core
circuit switching, packet switching, network structure
1.4 Delay, loss and throughput in packet-switched
networks
1 5 P l l i d l 1.5 Protocol layers, service models
1.6 Networks under attack: security
1.7 History
8/24/2011
Introduction (SSL) 1-8
5
A closer look at network structure:
network edge:
applications and
hosts hosts
access networks,
physical media:
wired, wireless
communication links
network core:
8/24/2011
Introduction (SSL) 1-9
interconnected
routers
network of
networks
The network edge:
end systems (hosts):
run application programs
e.g. Web, email
at edge of network
client/server
peer-peer
client/server model
client host requests, receives
service from always-on server
e.g. Web browser/server;
m il li nt/s
8/24/2011
Introduction (SSL) 1-10
email client/server
peer-peer model:
minimal (or no) use of
dedicated servers
e.g. Skype, BitTorrent
6
Access networks and physical media
Q: How to connect end
systems to edge router?
residential access nets residential access nets
institutional access
networks (school,
company)
mobile access networks
Keep in mind: p
bandwidth (bits per
second) of access
network?
shared or dedicated?
8/24/2011
Introduction (SSL) 1-11
From physical media to From physical media to
communication channelsbasic
concepts
8/24/2011
Introduction (SSL) 1-12
7
Modulation and Demodulation
Common
examples: radio examples: radio,
television
channels for
analog signals
Can also be used Can also be used
for digital
signals
8/24/2011
Introduction (SSL) 1-13
) 2 cos(
0
u t + t f A
Shannons Theorem
C = B log (1 + S/N)
where C max capacity in bits/sec
B bandwidth in hertz
S/N si l t is ti
C = B log
2
(1 + S/N)
8/24/2011
Introduction (SSL) 1-14
S/N signal to noise ratio
8
FDM vs. TDM
8/24/2011
Introduction (SSL) 1-15
Duration of frame (or
superframe) is 125 sec
in digital telephone
networks
TDM in Telephone Networks
Why 125 sec for
frame duration?
Sampling rate for
voice = 8000 frame duration?
Sampling Theorem:
An analog signal can be
reconstructed from
samples taken at a
rate equal to twice the
signal bandwidth
voice 8000
samples/sec or one
voice sample every 125
sec
Digital voice channel,
8 bits x 8000/sec =
64 Kbps s gnal bandw dth
Bandwidth for voice
signals is 4 Khz; for hi
fidelity music, 22 Khz
64 Kbps
8/24/2011
Introduction (SSL) 1-16
9
Other Multiplexing Techniques
Space division
multiplex
Same frequency used in
Wavelength division
multiplex
Light pulses sent at Same frequency used in
different cables
Same frequency used in
different (nonadjacent)
cells
Light pulses sent at
different wavelengths
in optical fiber
Code division multiplex
(section 6.2.1 of text)
d
G
A
r
A
A
8/24/2011
Introduction (SSL) 1-17
F
E
A
G
A
D
B
C
F
E
G
A
D A
B
C
Back to Access networks and physical
media
Q: How to connect end
systems to edge router?
d l residential access nets
institutional access
networks (school,
company)
mobile access networks
Keep in mind: Keep in mind:
bandwidth (bits per
second) of access
network?
shared or dedicated?
8/24/2011
Introduction (SSL) 1-18
10
Dial-up Modem
telephone
network Internet
central
office
home
dial-up
modem
ISP
modem
(e.g., AOL)
home
PC
uses existing telephony infrastructure
8/24/2011
Introduction (SSL) 1-19
uses existing telephony infrastructure
home is connected to central office
up to 56Kbps direct access to router (often less)
cant surf and phone at same time: not always on
Digital Subscriber Line (DSL)
home
phone
Internet
Existing phone line:
0-4KHz phone; 4-50KHz
upstream data; 50KHz-
1MHz downstream data
telephone
network
DSL
modem
home
PC
DSLAM
splitter
central
office
8/24/2011
Introduction (SSL) 1-20
DSL modem is much closer to the DSLAM
dedicated physical line to telephone central office
up to 1 Mbps upstream, up to 18 Mbps downstream
rates are distance dependent
11
Residential access: cable modems
HFC: hybrid fiber coax
asymmetric: up to 30Mbps
downstream 2 Mbps downstream, 2 Mbps
upstream (rates dependent
on congestion)
network of cable and fiber
connects homes to ISP
shared access among homes
(like Ethernet)
issues: congestion,
dimensioning
deployment via cable TV
infrastructure
8/24/2011
Introduction (SSL) 1-21
Residential access: cable modems
8/24/2011
Introduction (SSL) 1-22 1-22
Diagram: http://www.cabledatacomnews.com/cmic/diagram.html
12
Cable Network Architecture: Overview
Typically 500 to 5,000 homes
8/24/2011
Introduction (SSL) 1-23
home
cable headend
cable distribution
network (simplified)
Cable Network Architecture: Overview
server(s)
8/24/2011
Introduction (SSL) 1-24
home
cable headend
cable distribution
network
13
Cable Network Architecture: Overview
8/24/2011
Introduction (SSL) 1-25
home
cable headend
cable distribution
network (simplified)
Cable Network Architecture: Overview
C
O
FDM:
Channels
V
I
D
E
O
V
I
D
E
O
V
I
D
E
O
V
I
D
E
O
V
I
D
E
O
V
I
D
E
O
D
A
T
A
D
A
T
A
N
T
R
O
L
1 2 3 4 5 6 7 8 9
8/24/2011
Introduction (SSL) 1-26
home
cable headend
cable distribution
network
14
Fiber to the Home
ONT
ONT
optical
fibers
Internet
Optical links from central office to the home
Two competing optical technologies:
OLT
central office
optical
splitter
ONT
ONT
optical
fiber
8/24/2011
Introduction (SSL) 1-27
Two competing optical technologies:
Passive Optical network (PON)
Active Optical Network (AON)
Much higher Internet rates; fiber also carries
television and phone services
Ethernet Internet access
100 Mbps
Ethernet
Institutional
router
To Institutions
100 Mbps
100 Mbps
1 Gbps
server
Ethernet
switch
ISP
8/24/2011
Introduction (SSL) 1-28
Typically used in companies, universities, etc
10 Mbs, 100Mbps, 1Gbps, 10Gbps Ethernet
Today, end systems typically connect into Ethernet
switch
server
15
Wireless access networks
shared wireless access
network connects end system
to router to router
via base station aka access
point
wireless LANs:
802.11 b/g/n (WiFi)
wider-area wireless access
provided by telco operators
base
station
router
provided by telco operators
3G, 4G
8/24/2011
Introduction (SSL) 1-29
mobile
hosts
Home networks
Typical home network components:
DSL or cable modem
t /fi ll/NAT router/firewall/NAT
Ethernet
wireless access
point
wireless
laptops
l
to/from
8/24/2011
Introduction (SSL) 1-30
wireless
access
point
laptops
router/
firewall
cable
modem
to/from
cable
headend
Ethernet
16
Physical Media
Bit: propagates between
transmitter & receiver
Twisted Pair (TP)
two insulated copper
wires
transmitter & receiver
physical link: what lies
between transmitter &
receiver
guided media:
signals propagate inside
solid media: copper fiber
wires
Category 3: traditional
phone wires, 10 Mbps
Ethernet
Category 5:
100Mbps Ethernet
solid media: copper, fiber,
coax
unguided media:
signals propagate freely,
e.g., radio
8/24/2011
Introduction (SSL) 1-31
Physical Media: coax, fiber
Coaxial cable:
Fiber optic cable:
Coaxial cable:
two concentric copper
conductors
baseband:
single channel on cable
legacy Ethernet
broadband:
glass fiber carrying light
pulses
high-speed operation:
high-speed point-to-point
transmission (e.g., 10s-
100s Gps)
8/24/2011
Introduction (SSL) 1-32
broadband:
multiple channels on
cable
HFC
bidirectional
1-32
low error rate: repeaters
spaced far apart ; immune to
electromagnetic noise
17
Physical media: radio
signal carried in
electromagnetic
spectrum
Radio link types:
terrestrial microwave
e.g. up to 45 Mbps channels
spectrum
no physical wire
can be omnidirectional
propagation
environment effects:
reflection
LAN (e.g., Wi Fi)
11Mbps, 54 Mbps
wide-area (e.g., cellular)
3G cellular: ~ 1 Mbps
satellite
Kbps to 45Mbps channel (or
obstruction by objects
interference
8/24/2011
Introduction (SSL) 1-33
Kbps to 45Mbps channel (or
multiple smaller channels)
geosynchronous versus low
altitude
270 msec end-end delay for
geosynchronous
Chapter 1: roadmap
1.1 What is the Internet?
1 2 Network edge 1.2 Network edge
end systems, access networks, links
1.3 Network core
circuit switching, packet switching, network structure
1.4 Delay, loss and throughput in packet-switched
networks
1 5 P l l i d l 1.5 Protocol layers, service models
1.6 Networks under attack: security
1.7 History
8/24/2011
Introduction (SSL) 1-34
18
The Network Core
mesh of interconnected
routers routers
the fundamental
question: how is data
transferred through net?
circuit switching:
dedicated circuit per
call: telephone net call: telephone net
packet-switching: data
sent thru net in
discrete chunks
8/24/2011
Introduction (SSL) 1-35
Network Core: Circuit Switching
End-to-end resources
reserved for call reserved for call
link bandwidth, switch
capacity
dedicated resources:
no sharing
end-to-end circuit-like
(guaranteed)
performance
call setup required
8/24/2011
Introduction (SSL) 1-36
19
Network Core: Circuit Switching
network resources
(e.g., bandwidth)
dividing link bandwidth
into pieces
divided into pieces
pieces allocated to calls
resource piece idle if
not used by owning call
(no sharing)
frequency division
time division
8/24/2011
Introduction (SSL) 1-37
Circuit Switching: FDM and TDM
FDM
4 users
Example:
frequency
time
TDM
8/24/2011
Introduction (SSL) 1-38
frequency
time
20
Numerical example
How long does it take to send a file of
640 000 bits from host A to host B over a 640,000 bits from host A to host B over a
circuit-switched network?
all links are 1.536 Mbps
each link uses TDM with 24 slots/sec (i.e., one
slot per circuit)
500 msec to establish end-to-end circuit
Lets work it out!
8/24/2011
Introduction (SSL) 1-39
Packet Switching: Statistical Multiplexing
A
C
100 Mb/s
Ethernet statistical multiplexing
B
1.5 Mb/s
D
E
queue of packets
waiting for output
link
Sequence of A & B packets does not have fixed pattern
bandwidth shared on demand statistical multiplexing
queueing delay, packet loss
also called asynchronous time division multiplexing (ATDM)
8/24/2011
Introduction (SSL) 1-40
E
21
Network Core: Packet Switching
each end-end data stream
divided into packets
k f d ff
resource contention:
aggregate resource
d d d packets of different users
share network resources
each packet uses full link
bandwidth
resources used as needed
demand can exceed
amount available
congestion: packets
queue, wait for link use
store and forward:
packets move one hop
8/24/2011
Introduction (SSL) 1-41
p p
at a time
Node receives complete
packet before forwarding
Bandwidth division into pieces
Dedicated allocation
Resource reservation
Disadvantage of store-and-forward
R R R
L
takes L/R seconds to
transmit (push out) a
packet of L bits on to
link at R bps
store and forward:
entire packet must
Example:
L = 7.5 Mbits
R = 1.5 Mbps
End-to-end delay more
than 15 seconds
A fil /m ss l
p m
arrive at router before
it can be transmitted
on next link
A file/message larger
than maximum packet
size is transmitted as
multiple packets
8/24/2011
Introduction (SSL) 1-42
22
Circuit
vs. Message
vs. Packet
Switching
8/24/2011
Introduction (S. S. Lam) 1-43
Packet Switching versus Message Switching
Advantages of packet switching
Smaller end-to-end delay from pipelining
Less data loss from transmission errors
Disadvantages of packet switching
8/24/2011
Introduction (SSL) 1-44
More header bits
Additional work to do segmentation
and reassembly
23
Packet switching versus circuit switching
1 Mb/s link
Packet switching allows more users to use network!
Mb/s l nk
each user:
100 kb/s when active
active 10% of time (a
bursty user)
circuit-switching:
10 s s
N users
1 Mbps link
10 users
packet switching:
with 35 users,
probability > 10 active
at same time is less
than .0004
8/24/2011
Introduction (SSL) 1-45
Q: how did we get value 0.0004?
Packet switching versus circuit switching
great for bursty data
Is packet switching a slam dunk winner?
great for bursty data
resource sharing
simpler, no call setup
excessive congestion -> packet delay and loss
protocols needed for reliable data transfer,
congestion control
Q: How to provide circuit-like behavior?
bandwidth guarantees needed for audio/video apps
solution may impact network neutrality
8/24/2011
Introduction (SSL) 1-46
24
Network Taxonomy
Telecommunication
networks
Circuit-switched
networks
FDM
TDM
Packet-switched
networks
Networks
with VCs
Datagram
Networks
8/24/2011
Introduction (SSL) 1-47
Note: Internet is a datagram network. However its
transport layer provides both
connection-oriented (TCP) and connectionless services (UDP).
Internet structure: network of networks
roughly hierarchical
at center: small # of well-connected large networks
tier-1 commercial ISPs (e.g., Verizon, Sprint, AT&T, Qwest,
Level3), national & international coverage
large content distributors (Google, Akamai, Microsoft)
treat each other as equals (no charges)
Large Content
Distributor
Large Content
IXP IXP
Tier 1 ISP
Tier-1 ISPs &
Content
8/24/2011
Introduction (SSL) 1-48
Tier 1 ISP
Tier 1 ISP
Introduction 1-48
Distributor
(e.g., Google)
g
Distributor
(e.g., Akamai)
Tier 1 ISP
Distributors,
interconnect
(peer) privately
or at Internet
Exchange Points
IXPs
25
Tier-1 ISP: e.g., Sprint
POP: point-of-presence

to/from customers
peering
to/from backbone

8/24/2011
Introduction (SSL) 1-49
Internet structure: network of networks
tier-2 ISPs: smaller (often regional) ISPs
connect to one or more tier-1 (provider) ISPs
each tier-1 has many tier-2 customer nets
Tier 2
ISP
L C t t
IXP IXP
Ti 1 I P
tier 2 pays tier 1 provider
tier-2 nets sometimes peer directly with each other
(bypassing tier 1) , or at IXP
Tier 2
ISP
Tier 2
ISP
8/24/2011
Introduction (SSL) 1-50
Introduction 1-50
Tier 1 ISP
Tier 1 ISP
Large Content
Distributor
(e.g., Google)
Large Content
Distributor
(e.g., Akamai)
Tier 1 ISP
Tier 2
ISP
Tier 2
ISP
Tier 2
ISP
Tier 2
ISP
Tier 2
ISP
Tier 2
ISP
26
Internet structure: network of networks
Tier-3 ISPs, local ISPs
customers of tier 1 or tier 2 network
last hop (access) network (closest to end systems)
Tier 2
ISP
Large Content
Distributor
( G l )
Large Content
Distributor
IXP IXP
Tier 1 ISP
Tier 2
ISP
Tier 2
ISP
last hop ( access ) network (closest to end systems)
8/24/2011
Introduction (SSL) 1-51
Introduction 1-51
Tier 1 ISP
Tier 1 ISP
(e.g., Google)
(e.g., Akamai)
Tier 2
ISP
Tier 2
ISP
Tier 2
ISP
Tier 2
ISP
Tier 2
ISP
Tier 2
ISP
Internet structure: network of networks
a packet passes through many networks from source
host to destination host
Tier 2
ISP
Large Content
Distributor
( G l )
Large Content
Distributor
IXP IXP
Tier 1 ISP
Tier 2
ISP
Tier 2
ISP
8/24/2011
Introduction (SSL) 1-52
Introduction 1-52
Tier 1 ISP
Tier 1 ISP
(e.g., Google)
(e.g., Akamai)
Tier 2
ISP
Tier 2
ISP
Tier 2
ISP
Tier 2
ISP
Tier 2
ISP
Tier 2
ISP
27
Chapter 1: roadmap
1.1 What is the Internet?
1 2 Network edge 1.2 Network edge
end systems, access networks, links
1.3 Network core
circuit switching, packet switching, network structure
1.4 Delay, loss and throughput in packet-switched
networks
1 5 P l l i d l 1.5 Protocol layers, service models
1.6 Networks under attack: security
1.7 History
8/24/2011
Introduction (SSL) 1-53
How do loss and delay occur?
packets queue in router buffers
packet arrival rate to link exceeds output link p p
capacity
packets queue, wait for turn
A
packet being transmitted (delay)
8/24/2011
Introduction (SSL) 1-54
B
packets queueing (delay)
free (available) buffers: arriving packets
dropped (loss) if no free buffers
28
Four sources of packet delay
1. nodal processing:
check bit errors
2. queueing
time waiting at output check bit errors
determine output link
A
propagation
transmission
time waiting at output
link for transmission
depends on congestion
level of router
8/24/2011
Introduction (SSL) 1-55
B
propagation
nodal
processing queueing
Delay in packet-switched networks
3. Transmission delay:
R=link bandwidth (bps)
4. Propagation delay:
d = length of physical link
L=packet length (bits)
time to send bits into
link = L/R
s = propagation speed in
medium (~2x10
8
m/sec)
propagation delay = d/s
t smissi
Note: s and R are very
different quantities!
8/24/2011
Introduction (SSL) 1-56
A
B
propagation
transmission
nodal
processing queueing
29
End-to-End Delay
Nodal delay (from when last bit of packet arrives at this node
to when last bit arrives at next node)
d
nodal
= d
proc
+ d
queue
+ d
trans
+ d
prop
d
nodal
d
proc
d
queue
d
trans
d
prop
End-to-end delay over N identical nodes/links
from client c to server s (from when last bit of packet
leaves client to when last bit arrives at server)
d
c-s
= d
prop
+ Nd
nodal
Round trip time (RTT)
RTT = d
c-s
+ d
s-c
+ t
server
where t
server
is server processing time
8/24/2011
Introduction (SSL) 1-57
Implications of end-to-end delay
Relative importance of bandwidth and distance
for a small message (e g 1 byte) distance for a small message (e.g. 1 byte), distance
(1 ms vs. 100 ms propagation time) is more
important than bandwidth (1 Mbps vs. 100 Mbps)
for a large message (e.g., 25 Mbyte),
bandwidth is more important than distance
Delay x Bandwidth product
E l Example:
for 100 ms end to end delay and 45 Mbps bandwidth,
there can be up to 560 Kbyte of data in flight
8/24/2011
Introduction (SSL) 1-58
30
Real Internet delays and routes
What do real Internet delay & loss look like?
traceroute program: provides delay measurement
from source to router along end end Internet path from source to router along end-end Internet path
towards destination.
For all i:
sends three packets that will reach router i on path
towards destination
router i will return packets to sender
sender times interval between transmission and reply sender times interval between transmission and reply.
8/24/2011
Introduction (SSL) 1-59
3 probes
3 probes
3 probes
Real Internet delays and routes
traceroute: gaia.cs.umass.edu to www.eurecom.fr
Three delay measurements from
gaia.cs.umass.edu to cs-gw.cs.umass.edu
1 cs-gw (128.119.240.254) 1 ms 1 ms 2 ms
2 border1-rt-fa5-1-0.gw.umass.edu (128.119.3.145) 1 ms 1 ms 2 ms
3 cht-vbns.gw.umass.edu (128.119.3.130) 6 ms 5 ms 5 ms
4 jn1-at1-0-0-19.wor.vbns.net (204.147.132.129) 16 ms 11 ms 13 ms
5 jn1-so7-0-0-0.wae.vbns.net (204.147.136.136) 21 ms 18 ms 18 ms
6 abilene-vbns.abilene.ucaid.edu (198.32.11.9) 22 ms 18 ms 22 ms
7 nycm-wash.abilene.ucaid.edu (198.32.8.46) 22 ms 22 ms 22 ms
8 62.40.103.253 (62.40.103.253) 104 ms 109 ms 106 ms
9 de2-1.de1.de.geant.net (62.40.96.129) 109 ms 102 ms 104 ms
10 de.fr1.fr.geant.net (62.40.96.50) 113 ms 121 ms 114 ms
11 renater-gw.fr1.fr.geant.net (62.40.103.54) 112 ms 114 ms 112 ms
12 nio n2 cssi renater fr (193 51 206 13) 111 ms 114 ms 116 ms
g m g m
trans-oceanic
link
8/24/2011
Introduction (SSL) 1-60
12 nio-n2.cssi.renater.fr (193.51.206.13) 111 ms 114 ms 116 ms
13 nice.cssi.renater.fr (195.220.98.102) 123 ms 125 ms 124 ms
14 r3t2-nice.cssi.renater.fr (195.220.98.110) 126 ms 126 ms 124 ms
15 eurecom-valbonne.r3t2.ft.net (193.48.50.54) 135 ms 128 ms 133 ms
16 194.214.211.25 (194.214.211.25) 126 ms 128 ms 126 ms
17 * * *
18 * * *
19 fantasia.eurecom.fr (193.55.113.142) 132 ms 128 ms 136 ms
* means no response (probe lost, router not replying)
31
Queueing delay (revisited)
R=link bandwidth (bps)
L=packet length (bits)
average
queueing delay
p g ( )
a=average packet
arrival rate
traffic intensity =
arrival rate/service rate = La/R
La/R ~ 0: average queueing delay small
1
La/R
8/24/2011
Introduction (SSL) 1-61
La/R 0: average queueing delay small
La/R -> 1: delays become large
La/R > 1: more work arriving than can be
served, average delay infinite!
In reality, buffer overflow when La/R -> 1
Packet loss
buffer preceding link in router has finite
capacity capacity
packet arriving to full buffer dropped (i.e. lost)
lost packet may be retransmitted by previous
node, by source end system, or not at all
A
packet being transmitted
buffer
(waiting area)
8/24/2011
Introduction (SSL) 1-62
A
B
packet arriving to
full buffer is lost
( g )
32
Throughput
throughput: rate (bits/time unit) at which
bits transferred between sender/receiver
instantaneous: rate at given point in time
average: rate over longer period of time
8/24/2011
Introduction (SSL) 1-63
server, with
file of F bits
to send to clientt
link capacity
R
s
bits/sec
link capacity
R
c
bits/sec
pipe that can carry
fluid at rate
R
s
bits/sec
pipe that can carry
fluid at rate
R
c
bits/sec
server sends bits
(fluid) into pipe
Throughput (more)
R
s
< R
c
What is average end-end throughput?
R
s
bits/sec R
c
bits/sec
R
s
> R
c
What is average end-end throughput?
R bits/s
R bit /
8/24/2011
Introduction (SSL) 1-64
R
s
bits/sec
R
c
bits/sec
link on end-end path that constrains end-end throughput
bottleneck link
33
Throughput: Internet scenario
per-connection
end-to-end
throughput is
R
s
throughput is
min(R
c
,R
s
,R/10) in
ideal case
In practice: R
c
or
R
s
is often
bottleneck
R
s
R
s
R
s
R
c
R
c
R
or the server is
the bottleneck
8/24/2011
Introduction (SSL) 1-65
10 connections (fairly) share
backbone bottleneck link R bits/sec
R
c
Littles law and a useful
queueing delay formula
8/24/2011
Introduction (SSL) 1-66
34
Littles Law
Average population

N
1
average delay delay
g p p
= (average delay) x
(throughput rate)
=

=
=
where N is number of departures
where T is duration of experiment
1
average delay delay
i N
i 1
throughput rate N/T
average population
8/24/2011
Introduction (SSL) 1-67
average population
(to be defined)
i
n

s
y
s
t
e
m

n
(
t
)
Time t
N
u
m
b
e
r

8/24/2011
Introduction (SSL) 1-68
0
where is duration of the experiment
1
average population ( ) n t dt
t
t
t
=
}
35
random variable x
samples x
1
, x
2
, ..., x
n
mean (average) x =
1
x
i
n
( g )
n
i
i =1

second moment x
2
=
1
n
(x
i
i =1
n
)
2
> ( x)
2
mean residual life =
x
2
2x
>
x
2
8/24/2011
Introduction (SSL) 1-69
2 2
) (
life residual mean
) (
constant a is : case Special
2
2 2
x
x
x
x x
x
= =
=
random variable x
with discrete values x
1
, x
2
, , x
m
let p
i
= probability [x = x
i
] for i = 1, 2, , m
by definition
mean
m
i i
m
i
p x x

=
=1
8/24/2011
Introduction (SSL) 1-70
second moment
2 2
1
m
i
i
i
x x p
=
=

36
Single-Server Queue

queue server queue server

average service time, in seconds
service rate, in jobs/second ( = 1/ )
arrival rate, in jobs/second
utilization of server
x
x

8/24/2011
Introduction (SSL) 1-71
Conservation of flow
x

= =
=
M/G/1 queue
Single server
does not idle when there is work, no overhead, i.e.,
it performs 1 second of work per second it performs 1 second of work per second
FIFO service
Arrivals according to a Poisson process at
rate jobs/second
Service times of arrivals are x
1
, x
2
, , x
i

which are independent, identically which are independent, identically
distributed (with a general distribution)
Average service time is , average wait is W,
average delay is T = W +
8/24/2011
Introduction (S. S. Lam) 1-72
x
x
37
Let be the unfinished work at time t ( ) U t
( ) U t
2
1
1
x
2
1
2
1
2 2
x w
3 3
x w
8/24/2011
Introduction (S. S. Lam) 1-73
time
0
1
2
x
2
2
1
2
x
2
3
1
2
x
1 2 3 1 2 3 4 5
arrivals and departures
Derivation of W (by S. S. Lam)
Time average of unfinished work is
0
( )
1
U U t dt
t
t
}
=
2
1 1
2
1
2
1
where
2
1
i i i i
n n
i i i
i i
i i i
x w x w
n
x x w
x x w
t
t
= =
=
| |
= +

|
\ .
| |
= +
|
\ .
For Poisson arrivals, the average wait is equal
to from the Poisson arrivals see time
average (PASTA) Theorem
8/24/2011
Introduction (S. S. Lam) 1-74
U
38
Derivation of W (cont.)
We then have
2
1
2
W x xW
| |
= +
|
\ .
2
2
2
(1 )
2
x
W
x
W

|
\ .
=
=
Th b tt t
8/24/2011
Introduction (S. S. Lam) 1-75
2
2(1 )
2(1 )
W
x
T x W x

= + = +

The bottom two

equations are known
as Pollaczek-Khinchin
(P-K) mean value
formulas
T
P i
M/G/1 queue
Markovian
General
Poisson
0 1.0

x
Another derivation:
( )
2
2
1 x
| |
8/24/2011
Introduction (S. S. Lam) 1-76
( )
2
2
1
2 2
where is average queue size and
/ is mean residual life of service time
x
W W x x xW
x
W
x x

| |
= + = +
|
\ .
same as previous slide
39
Special Cases
1. Service times have an
exponential distribution
(M/M/1) We then have

10
10
T decreases as
increases
(M/M/1). We then have
2 2
2 2
2( )
(2)( ) ( ) ( )
2(1 ) 1 1
x x
x x x
W
T W x


=
= = =

= +

= =
10
10
T
8/24/2011
Introduction (S. S. Lam) 1-77
1 1
1
1 1
x x x x
x
x

+
= + =

= =

0 1.0
x
0.1x
2. Service times are constant (deterministic)
M/D/1
2 2
2
( )
( )
2(1 ) 2(1 )
(2 )
1
x x
x x
W
T W x
T



=
= =

= +

=
T d
8/24/2011
Introduction (S. S. Lam) 1-78
( )
1
2(1 )
T


=

T decreases as
increases
40
60 jobs/sec
100 jobs/sec
Two Servers and Two Queues:
100 jobs/sec
60 jobs/sec
100 jobs/sec
Single Higher Speed Server:
8/24/2011
Introduction (S. S. Lam) 1-79
120 jobs/sec
200 jobs/sec
g g p
Chapter 1: roadmap
1.1 What is the Internet?
1 2 Network edge 1.2 Network edge
end systems, access networks, links
1.3 Network core
circuit switching, packet switching, network structure
1.4 Delay, loss and throughput in packet-switched
networks
1 5 P l l i d l 1.5 Protocol layers, service models
1.6 Networks under attack: security
1.7 History
8/24/2011
Introduction (SSL) 1-80
41
Protocol Layers
Networks are complex!
many pieces:
hosts
routers
links of various
media
applications
protocols
Question:
Is there any hope of
organizing structure of
network?
Or at least our discussion protocols
hardware,
software
Or at least our discussion
of networks?
8/24/2011
Introduction (SSL) 1-81
Layered architecture
Use abstraction to hide
complexity
E h l
Application programs
Each layer
provides a service via its own
internal actions as well as relying
on service provided by layer
below
is a network of processes
Can have alternative
abstractions at each
Process-to-process channels
Host-to-host connectivity
Hardware
Application programs
Request/reply Message
abstractions at each
layer (resulting in
protocol graph rather
than protocol stack)
8/24/2011
Introduction (SSL) 1-82
Request/reply
channel
Message
stream channel
Host-to-host connectivity
Hardware
42
Why layering?
layered architecture as reference model for
protocol design by community effort protocol design by community effort
decompose a large system into smaller pieces which
can be designed and implemented by different
people/teams
modularity eases maintenance and evolution of
system
allows change in implementation method so long as API
h d ff E h remains the same, e.g., different Ethernets
strict layering often violated for efficient
protocol implementation
8/24/2011
Introduction (SSL) 1-83
Each protocol
involves two or more peers
two interfaces defined
service interface: operations a
local user can perform on a
protocol entity and get results
peer-peer interface: form and
meaning of messages exchanged
by protocol entities (also called
peers) to provide protocol
service
High-level
entity
High-level
entity
Protocol
entity
Protocol
entity
Service
interface
Peer-to-peer
i f
Host 1 Host 2
term protocol generally used to
refer to peer-peer spec
8/24/2011
Introduction (SSL) 1-84
interface
43
Internet protocol stack
application: supporting network
applications
FTP, SMTP, HTTP
application
transport: process-process data
transfer
TCP, UDP
network: routing of datagrams from
source to destination
IP, routing protocols
pp
transport
network
link
IP, routing protocols
link: data transfer between
neighboring network elements
PPP, Ethernet
physical: bits on the wire
8/24/2011
Introduction (SSL) 1-85
physical
ISO/OSI reference model
presentation: allow applications to
interpret meaning of data, e.g.,
ti i hi
application
encryption, compression, machine-
specific conventions
session: synchronization,
checkpointing, recovery of data
exchange
Internet stack missing these
presentation
session
transport
network
link
layers!
these services, if needed, must
be implemented in application
needed?
8/24/2011
Introduction (SSL) 1-86
link
physical
44
Internet Architecture
Internet Engineering
Task Force (IETF)
FTP HTTP NV TFTP
( )
application protocols
support applications
multiplexing and
demultiplexing
hourglass shape (only
IP in network layer)
TCP UDP
IP
NET
1
NET
2
NET
n
. . .
best effort service =>
any delivery service can
be used by IP
limitation of hourglass
8/24/2011
Introduction (SSL) 1-87
TCP UDP
IP
Network
Application
Encapsulation
Protocol peers provide
a data delivery
Host 2
User
User
Host 1
a data delivery
service
How do protocol peers
in different machines
exchange protocol
messages between
themselves?
Upper
layer
Lower
layer
Data
Data
Upper
layer
Lower
layer
Data
H
U
Data H
U
themselves?
In protocol header
encapsulated and
decapsulated
8/24/2011
Introduction (SSL) 1-88
H
L
H
U
Data
45
Logical communication between peers
E.g.: transport
accept data from
applicati n
application
transport
network
data
transport
application
add addressing,
reliability check
info to form a
message
send message to
peer via a delivery
service
link
physical
application
transport
network
link
physical
application application
network
link
physical
data
ack
data
service
wait for peers
reply (ack)
8/24/2011
Introduction (SSL) 1-89
application
transport
network
link
physical
application
transport
network
link
physical
transport
Physical path of data
Each layer takes data (service data unit) from above
adds header to create its own protocol data unit
passes protocol data unit to layer below passes protocol data unit to layer below
network
link
physical
network
link
physical
application
transport
network
link
physical
message
segment
datagram
frame
M
M H
4
M H
4
H
3
M H
4
H
3
H
2
T
2
bits
application
transport
network
link
physical
...
8/24/2011
Introduction (SSL) 1-90
p y p y
source
host
destination
host
bits
p y
router
router protocol data
units
More terminology: A switch is a relay with two layers (physical and
link). A repeater is a relay with only the physical layer.
46
source
application
transport
network
link
physical
H
t
H
n
M
segment H
t
datagram
H
t
H
n
H
l
M
Router vs. Switch
message M
H
t
M
H
n
frame
destination
network
link
physical
H
t
H
n
M
switch
application
transport
network
link
physical
H
t
H
n
H
l
M
H
t
H
n
M
H
t
M
M
link
physical
H
t
H
n
H
l
M
H
t
H
n
M
router
8/24/2011
Introduction (SSL) 1-91
Chapter 1: roadmap
1.1 What is the Internet?
1 2 Network edge 1.2 Network edge
end systems, access networks, links
1.3 Network core
circuit switching, packet switching, network structure
1.4 Delay, loss and throughput in packet-switched
networks
1 5 P l l i d l 1.5 Protocol layers, service models
1.6 Networks under attack: security
1.7 History
8/24/2011
Introduction (SSL) 1-92
47
Network Security
The field of network security is about:
how bad guys can attack computer networks y p
how we can defend networks against attacks
how to design architectures that are immune to
attacks
Internet not originally designed with
(much) security in mind
original vision: a group of mutually trusting
users attached to a transparent network -
Internet protocol designers playing catch-up
Security considerations in all layers!
8/24/2011
Introduction (SSL) 1-93
Bad guys can put malware into
hosts via Internet
Malware can get in host from a virus, worm, or
trojan horse.
Spyware malware can record keystrokes, web
sites visited, upload info to collection site.
Infected host can be enrolled in a botnet, used
for spam and DDoS attacks. p
Malware is often self-replicating: from an
infected host, seeks entry into other hosts
8/24/2011
Introduction (SSL) 1-94
48
Bad guys can put malware into
hosts via Internet
Trojan horse
Hidden part of some
Worm:
infection by passively
otherwise useful
software
Today often on a Web
page (Active-X, plugin)
Virus
infection by receiving
object (e g e-mail
y p y
receiving object that gets
itself executed
self- replicating: propagates
to other hosts, users
Sapphire Worm: aggregate scans/sec
in first 5 minutes of outbreak (CAIDA, UWisc data)
object (e.g., e mail
attachment), actively
executing
self-replicating:
propagates itself to
other hosts, users
8/24/2011
Introduction (SSL) 1-95
Bad guys can attack servers and
network infrastructure
Denial of service (DoS): attackers make resources
(server, bandwidth) unavailable to legitimate traffic g
by overwhelming resource with bogus traffic
1. select target
2. break into hosts
around the network
(see botnet)
d k t t d
8/24/2011
Introduction (SSL) 1-96
3. send packets toward
target from
compromised hosts
target
49
The bad guys can sniff packets
Packet sniffing:
broadcast media (shared Ethernet, wireless)
promiscuous network interface reads/records all
packets (e.g., including passwords!) passing by
A C
8/24/2011
Introduction (SSL) 1-97
B
src:B dest:A payload
Wireshark software used for end-of-chapter
labs is a (free) packet-sniffer
The bad guys can use false source
addresses
IP spoofing: send packet with false source address
A
B
C
src:B dest:A payload
8/24/2011
Introduction (SSL) 1-98
50
The bad guys can record and
playback
record-and-playback: sniff sensitive info (e.g.,
d) d l t password), and use later
password holder is the user from system point of
view
A
C
8/24/2011
Introduction (SSL) 1-99
B
src:B dest:A user: B; password: foo
Chapter 1: roadmap
1.1 What is the Internet?
1 2 Network edge 1.2 Network edge
end systems, access networks, links
1.3 Network core
circuit switching, packet switching, network structure
1.4 Delay, loss and throughput in packet-switched
networks
1 5 P l l i d l 1.5 Protocol layers, service models
1.6 Networks under attack: security
1.7 History please read on your own
8/24/2011
Introduction (SSL) 1-100
51
Introduction: Summary
Covered a ton of material!
Internet overview
h l?
You now have:
context, overview,
whats a protocol?
network edge, core, access
network
packet-switching versus
circuit-switching
Internet structure
f l d l
context, o er ew,
feel of networking
more depth, detail to
follow!
performance: loss, delay,
throughput
layering, service models
security
history
8/24/2011
Introduction (SSL) 1-101
End of Chapter 1
8/24/2011
Introduction (SSL) 1-102