Cs457 Computer Networks
Introduction
1-1
The Internet
 A global network of




computers
who runs it?
who pays for it?
who invented the
internet?
How do the computer’s
communicate?

There are many levels of
abstraction, just like
speech
router
server
workstation
mobile
local ISP
regional ISP
UVa
network
Introduction
1-2
What’s a protocol?
Hi
TCP connection
request
Hi
TCP connection
response
Got the
time?
Get http://www.awl.com/kurose-ross
2:00
<file>
time
Introduction
1-3
What’s a protocol?
protocols define format,
order of msgs sent and
received among network
entities, and actions
taken on msg
transmission, receipt
Introduction
1-4
A closer look at network structure:
 network edge:
applications and
hosts
 network core:
routers
 network of
networks

 access networks,
physical media:
communication links
Introduction
1-5
Distributed Applications
 end systems (hosts):



run application programs
e.g. Web, email
at “edge of network”
 client/server model


client host requests, receives
service from always-on server
e.g. Web browser/server;
email client/server
 peer-peer model:


minimal (or no) use of
dedicated servers
e.g. Skype, BitTorrent, KaZaA
Introduction
1-6
Connection-oriented Vs
Connectionless Services
 TCP: supports connection oriented services
 UDP: supports connectionless services
 what's the difference?
 Reliability
 What’s needed to make this difference?
 flow control: slows down when receiver is slow
 congestion control: slows down when network is
slow
 Trade-off?
 UDP is faster
Introduction
1-7
Connnection vs Connectionless services
App’s using TCP:
 HTTP (Web), FTP (file
transfer), Telnet
(remote login), SMTP
(email)
App’s using UDP:
 streaming media,
teleconferencing, DNS,
Internet telephony
Introduction
1-8
The Network Core
 mesh of interconnected
links
Introduction
1-9
Switching
 How to transfer data
between these four
nodes?
 Reserved bandwidth
 On-demand bandwidth
Introduction
1-10
Circuit Switching
End-end resources
reserved for “call”
 dedicated resources:
no sharing
 circuit-like
(guaranteed)
performance
 call setup required
Introduction
1-11
Circuit Switching: FDM and TDM
network resources (e.g., bandwidth) divided into “pieces”
FDM
4 users
frequency
time
TDM
frequency
time
Introduction
1-12
Numerical example
 How long does it take to send a file of
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
 500 msec to establish end-to-end circuit

1,536,000/24 = 64000
640,000/64,000=10 seconds
10 + .5 = 1-.5seconds
Introduction
1-13
Packet Switching
each end-end data stream
divided into packets
 user A, B packets share
network resources
 each packet uses full link
bandwidth
 resources used as needed
disadvantages:
 aggregate resource
demand can exceed
amount available
 store and forward
delay: packets move
one hop at a time

Bandwidth division into “pieces”
Dedicated allocation
Resource reservation
Node receives complete
packet before forwarding
 Queue delay: must wait
for link use
Introduction
1-14
Packet Switching vs TDM
100 Mb/s
Ethernet
A
B
statistical multiplexing
C
1.5 Mb/s
queue of packets
waiting for output
link
D
E
Sequence of A & B packets does not have fixed pattern,
shared on demand  statistical multiplexing.
TDM: each host gets same slot in revolving TDM frame.
Introduction
1-15
Propagation delay
L
R
 Do we need to receive
R
entire packet before
forwarding?
 Takes L/R seconds to
transmit (push out) packet
of L bits on to link or R bps
 Entire packet must arrive
at router before it can be
transmitted on next link:
store and forward
 delay = 3L/R (assuming zero
propagation delay)
R
Example:
 L = 640,000 bits
 R = 1.5 Mbps
 delay =
3*640,000/1.5=1.28s
Introduction
1-16
Propagation delay
L
R
R
R
 1.28 is much faster
than 10.5 seconds for
circuit switched
routing
 What if there were
other users??
 --revisit this question
later
Introduction
1-17
Packet switching versus circuit switching
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
 still an unsolved problem (chapter 7)

Q: human analogies of reserved resources (circuit
switching) versus on-demand allocation (packet-switching)?
Introduction
1-18
Chapter 1: roadmap
1.1 What is the Internet?
1.2 Distributed applications
1.3 Routing
1.4 Physical media
1.5 Internet structure
1.6 Delay & loss
1.7 Protocol layers
1.8 History
Introduction
1-19
Access networks and physical media
Q: How to connect end
systems together?
Introduction
1-20
Home networks
Typical home network components:
 ADSL or cable modem
 router/firewall/NAT
 Ethernet
 wireless access
point
to/from
cable
headend
cable
modem
router/
firewall
Ethernet
wireless
laptops
wireless
access
point
Introduction
1-21
Physical Media
 Bit: propagates between
transmitter/rcvr pairs
 physical link: what lies
between transmitter &
receiver
 guided media:

signals propagate in solid
media: copper, fiber, coax
Twisted Pair (TP)
 two insulated copper
wires


Category 3: traditional
phone wires, 10 Mbps
Ethernet
Category 5:
100Mbps Ethernet
 unguided media:
 signals propagate freely,
e.g., radio
Introduction
1-22
Sharing the Medium
packet
Ethernet protocol:
1. Listen
2. If channel is clear, send
3. If collision, back off
1 234567
cable headend
cable distribution
network (simplified)
home
Introduction
1-23
Getting more data on the wire
FDM:
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
C
O
N
T
R
O
L
1
2
3
4
5
6
7
8
9
Channels
cable headend
cable distribution
network
home
Introduction
1-24
Chapter 1: roadmap
1.1 What is the Internet?
1.2 Distributed Applications
1.3 Routing
1.4 Physical media
1.5 Internet structure
1.6 Delay & loss
1.7 Protocol layers
1.8 History
Introduction
1-25
Internet structure: network of networks
 roughly hierarchical
 at center: “tier-1” ISPs (e.g., MCI, Sprint, AT&T, Cable
and Wireless), national/international coverage
 treat each other as equals
Tier-1
providers
interconnect
(peer)
privately
Tier 1 ISP
Tier 1 ISP
NAP
Tier-1 providers
also interconnect
at public network
access points
(NAPs)
Tier 1 ISP
Introduction
1-26
Tier-1 ISP: e.g., Sprint
Sprint US backbone network
Seattle
Tacoma
DS3 (45 Mbps)
OC3 (155 Mbps)
OC12 (622 Mbps)
OC48 (2.4 Gbps)
POP: point-of-presence
to/from backbone
Stockton
…
…
Kansas City
.
…
Anaheim
peering
…
…
San Jose
Cheyenne
New York
Pennsauken
Relay
Wash. DC
Chicago
Roachdale
Atlanta
to/from customers
Fort Worth
Orlando
Introduction
1-27
Internet structure: network of networks
 “Tier-2” ISPs: smaller (often regional) ISPs
 Connect to one or more tier-1 ISPs, possibly other tier-2 ISPs
Tier-2 ISP pays
tier-1 ISP for
connectivity to
rest of Internet
 tier-2 ISP is
customer of
tier-1 provider
Tier-2 ISP
Tier-2 ISP
Tier 1 ISP
Tier 1 ISP
Tier-2 ISP
NAP
Tier 1 ISP
Tier-2 ISPs
also peer
privately with
each other,
interconnect
at NAP
Tier-2 ISP
Tier-2 ISP
Introduction
1-28
Internet structure: network of networks
 “Tier-3” ISPs and local ISPs
 last hop (“access”) network (closest to end systems)
local
ISP
Local and tier3 ISPs are
customers of
higher tier
ISPs
connecting
them to rest
of Internet
Tier 3
ISP
Tier-2 ISP
local
ISP
local
ISP
local
ISP
Tier-2 ISP
Tier 1 ISP
Tier 1 ISP
Tier-2 ISP
local
local
ISP
ISP
NAP
Tier 1 ISP
Tier-2 ISP
local
ISP
Tier-2 ISP
local
ISP
Introduction
1-29
Internet structure: network of networks
 a packet passes through many networks!
local
ISP
Tier 3
ISP
Tier-2 ISP
local
ISP
local
ISP
local
ISP
Tier-2 ISP
Tier 1 ISP
Tier 1 ISP
Tier-2 ISP
local
local
ISP
ISP
NAP
Tier 1 ISP
Tier-2 ISP
local
ISP
Tier-2 ISP
local
ISP
Introduction
1-30
Review
 Transport Layer
 Connection-oriented
 Connectionless
 The Internet
 Network Layer
 Circuit switching
 Packet switching
 Link Layer
 Ethernet
 FDM
Introduction
1-31
Transport Layer Review
 Connection-oriented (TCP)
 Acknowledgements (can have retries)
 Flow control
 Congestion control
 Better for most protocols
 Connectionless (UDP)
 No acknowledgements
 Send as fast as needed
 Some packets will get lost
 Better for video, telephony, etc
 Human speech?
Introduction
1-32
Network Layer Review
 Circuit-switching
Divide resources into “slots”
 Reserve all end-to-end resources (a “circuit”)
 Provides known latency
 Better for phones networks, etc

 Packet switching
 Divide resources into “packets”
 Send a packet whenever needed
 Maximizes throughput
 Better for random traffic, eg. internet, etc
Introduction
1-33
Packet Switching
 Virtual Circuit Networks
Initialize: tell each router it is on the circuit
 Send each packet with the Virtual Circuit ID

 Datagram Networks
 No initialization
 Send each packet with the destination address
 Trade offs?
VC networks minimize routing tables
 Datagram networks minimize setup time

Introduction
1-34
Network Layer Taxonomy
Introduction
1-35
Link Layer
 Physical media
 Ethernet
 Fiber optics
 DSL
 Cable
 Sharing techniques
 FDM
 TDM
 Ethernet protocol
 Etc.
 Human sharing protocols?
Introduction
1-36
Transport Layer
TCP
UDP
Connectionoriented
Connectionless
Network Layer
IP
Link Layer
Ethernet
Cable
FDMA
Wireless
TDMA
CSMA
DSL
Fiber
CDMA
Introduction
1-37
Chapter 1: roadmap
1.1 What is the Internet?
1.2 Network edge
1.3 Network core
1.4 Network access and physical media
1.5 Internet structure and ISPs
1.6 Delay & loss in packet-switched networks
1.7 Protocol layers, service models
1.8 History
Introduction
1-38
Four sources of packet delay
 1. nodal processing:
 check bit errors
 determine output link
 2. queueing
 time waiting at output
link for transmission
 depends on congestion
level of router
A
B
nodal
processing
queueing
Introduction
1-39
Delay in packet-switched networks
3. Transmission delay:
 R=link bandwidth (bps)
 L=packet length (bits)
 time to send bits into
link = L/R
transmission
A
4. Propagation delay:
 d = length of physical link
 s = propagation speed in
medium (~2x108 m/sec)
 propagation delay = d/s
Note: s and R are very
different quantities!
propagation
B
nodal
processing
queueing
Introduction
1-40
Caravan analogy
100 km
ten-car
caravan
toll
booth
 Cars “propagate” at
100 km/hr
 Toll booth takes 12 sec to
service a car
(transmission time)
 car~bit; caravan ~ packet
 Q: How long until caravan
is lined up before 2nd toll
booth?
100 km
toll
booth
 Time to “push” entire
caravan through toll
booth onto highway =
12*10 = 120 sec
 Time for last car to
propagate from 1st to
2nd toll both:
100km/(100km/hr)= 1 hr
 A: 62 minutes
Introduction
1-41
Caravan analogy (more)
100 km
ten-car
caravan
toll
booth
 Cars now “propagate” at
1000 km/hr
 Toll booth now takes 1
min to service a car
 Total transmit time is:
10*1+.1 = 10.1 minutes
 Which scenario is more
like internet routers?
100 km
toll
booth
1st bit of packet can arrive
at 2nd router before
packet is fully transmitted
at 1st router!
Introduction
1-42
Nodal delay
d nodal  d proc  d queue  d trans  d prop
 dproc = processing delay
 typically a few microsecs or less
 dqueue = queuing delay
 depends on congestion
 dtrans = transmission delay
 = L/R, significant for low-speed links
 dprop = propagation delay
 a few microsecs to hundreds of msecs
Introduction
1-43
Queueing delay (revisited)
 R=link bandwidth (bps)
 L=packet length (bits)
 a=average packet
arrival rate
traffic intensity = La/R
Output Rate
 La/R ~ 0: average queueing delay small
 La/R -> 1: delays become large
 La/R > 1: more “work” arriving than can be
serviced, average delay infinite!
Introduction
1-44
How does loss occur?
 packet arrival rate to link exceeds output link capacity
 Queue grows
 When no more space in queue, packets are lost
 lost packet may be retransmitted by previous node, by
source end system, or not retransmitted at all
A
B
packets queueing (delay)
free (available) buffers: arriving packets
dropped (loss) if no free buffers
Introduction
1-45
“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
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.
3 probes
3 probes
3 probes
Introduction
1-46
“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 trans-oceanic
8 62.40.103.253 (62.40.103.253) 104 ms 109 ms 106 ms
link
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
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 * * *
* means no response (probe lost, router not replying)
18 * * *
19 fantasia.eurecom.fr (193.55.113.142) 132 ms 128 ms 136 ms
Introduction
1-47
Chapter 1: roadmap
1.1 What is the Internet?
1.2 Network edge
1.3 Network core
1.4 Network access and physical media
1.5 Internet structure and ISPs
1.6 Delay & loss in packet-switched networks
1.7 Protocol layers, service models
1.8 History
Introduction
1-48
Protocol “Layers”
Networks are complex!
 many “pieces”:
 hosts
 routers
 links of various
media
 applications
 protocols
 hardware,
software
Question:
How do they all fit
together?
Introduction
1-49
Organization of air travel
ticket (purchase)
ticket (complain)
baggage (check)
baggage (claim)
gates (load)
gates (unload)
runway takeoff
runway landing
airplane routing
airplane routing
airplane routing
Introduction
1-50
Layering of airline functionality
ticket (purchase)
ticket (complain)
ticket
baggage (check)
baggage (claim
baggage
gates (load)
gates (unload)
gate
runway (takeoff)
runway (land)
takeoff/landing
airplane routing
airplane routing
airplane routing
departure
airport
airplane routing
airplane routing
intermediate air-traffic
control centers
arrival
airport
Layers: each layer implements a service
 Providing an interface to higher layers
 And relying on services provided by layer below
Introduction
1-51
Why layering?
Dealing with complex systems:
 modularization eases maintenance, updating of
system
 change of implementation of layer’s service
transparent to rest of system
 e.g., change in gate procedure doesn’t affect
rest of system
 layering considered harmful?
Introduction
1-52
Internet protocol stack
 application: supporting network
applications

FTP, SMTP, HTTP
 transport: process-process data
transfer

TCP, UDP
 network: routing of datagrams from
source to destination

IP, routing protocols
 link: data transfer between
application
transport
network
link
physical
neighboring network elements

PPP, Ethernet
 physical: bits “on the wire”
Introduction
1-53
Encapsulation
source
message
segment
M
Ht
M
datagram Hn Ht
M
frame Hl Hn Ht
M
application
transport
network
link
physical
link
physical
switch
destination
M
Ht
M
Hn Ht
Hl Hn Ht
M
M
application
transport
network
link
physical
Hn Ht
Hl Hn Ht
M
M
network
link
physical
Hn Ht
M
router
Introduction
1-54
Chapter 1: roadmap
1.1 What is the Internet?
1.2 Network edge
1.3 Network core
1.4 Network access and physical media
1.5 Internet structure and ISPs
1.6 Delay & loss in packet-switched networks
1.7 Protocol layers, service models
1.8 History
Introduction
1-55
Internet History
1961-1972: Early packet-switching principles
 1961: Kleinrock - queueing
theory shows
effectiveness of packetswitching
 1964: Baran - packetswitching in military nets
 1967: ARPAnet conceived
by Advanced Research
Projects Agency
 1969: first ARPAnet node
operational
 1972:




ARPAnet public demonstration
NCP (Network Control Protocol)
first host-host protocol
first e-mail program
ARPAnet has 15 nodes
Introduction
1-56
Internet History
1972-1980: Internetworking, new and proprietary nets
 1970: ALOHAnet satellite





network in Hawaii
1974: Cerf and Kahn architecture for
interconnecting networks
1976: Ethernet at Xerox
PARC
ate70’s: proprietary
architectures: DECnet, SNA,
XNA
late 70’s: switching fixed
length packets (ATM
precursor)
1979: ARPAnet has 200 nodes
Cerf and Kahn’s internetworking
principles:
 minimalism, autonomy - no
internal changes required
to interconnect networks
 best effort service model
 stateless routers
 decentralized control
define today’s Internet
architecture
Introduction
1-57
Internet History
1980-1990: new protocols, a proliferation of networks
 1983: deployment of




TCP/IP
1982: smtp e-mail
protocol defined
1983: DNS defined
for name-to-IPaddress translation
1985: ftp protocol
defined
1988: TCP congestion
control
 new national networks:
Csnet, BITnet,
NSFnet, Minitel
 100,000 hosts
connected to
confederation of
networks
Introduction
1-58
Internet History
1990, 2000’s: commercialization, the Web, new apps
 Early 1990’s: ARPAnet
decommissioned
 1991: NSF lifts restrictions on
commercial use of NSFnet
(decommissioned, 1995)
 early 1990s: Web
 hypertext [Bush 1945, Nelson
1960’s]
 HTML, HTTP: Berners-Lee
 1994: Mosaic, later Netscape
 late 1990’s:
commercialization of the Web
Late 1990’s – 2000’s:
 more killer apps: instant
messaging, P2P file sharing
 network security to
forefront
 est. 50 million host, 100
million+ users
 backbone links running at
Gbps
Introduction
1-59
Introduction: Summary
Course in a nutshell
 Internet overview
 what’s a protocol?
 network edge, core, access
network
 packet-switching versus
circuit-switching
 Internet/ISP structure
 performance: loss, delay
 layering and service
models
 history
Rest of course:
 Ch 2: applications
 Ch 3: transport
 Ch 4: network
 Ch 5: link
 Ch 6: wireless
 Ch 8: security
Introduction
1-60