Chapter 1

Introductio
n
A note on the use of these PowerPoint slides:
We’re making these slides freely available to all (faculty, students,
readers). They’re in PowerPoint form so you see the animations; and
can add, modify, and delete slides (including this one) and slide content
to suit your needs. They obviously represent a lot of work on our part.
In return for use, we only ask the following:
 If you use these slides (e.g., in a class) that you mention their source
(after all, we’d like people to use our book!)
 If you post any slides on a www site, that you note that they are
adapted from (or perhaps identical to) our slides, and note our
copyright of this material.
Computer Networking: A
For a revision history, see the slide note for this page.
Top-Down Approach
Thanks and enjoy! JFK/KWR 8th edition
Jim Kurose, Keith Ross
All material copyright 1996-2023
J.F Kurose and K.W. Ross, All Rights Reserved Pearson, 2020
Introduction: 1-1
Chapter 1: roadmap
 What is the Internet?
 What is a protocol?
 Network edge: hosts, access
network, physical media
 Network core: packet/circuit
switching, internet structure
 Performance: loss, delay, throughput
 Security
 Protocol layers, service models
 History
Introduction: 1-2
How do packet delay and loss occur?
 packets queue in router buffers, waiting for turn for transmission
 queue length grows when arrival rate to link (temporarily) exceeds output link
capacity
 packet loss occurs when memory to hold queued packets fills up
packet being transmitted (transmission delay)

B
packets in buffers (queueing delay)
free (available) buffers: arriving packets
dropped (loss) if no free buffers
Introduction: 1-3
Packet delay: four sources
transmission
A propagation

B
nodal
processing queueing

dnodal = dproc + dqueue + dtrans + dprop

dproc: nodal processing dqueue: queueing delay

 check bit errors  time waiting at output link for
 determine output link transmission
 typically < microsecs  depends on congestion level of
router
Introduction: 1-4
Packet delay: four sources
transmission
A propagation

B
nodal
processing queueing

dnodal = dproc + dqueue + dtrans + dprop

dtrans: transmission delay: dprop: propagation delay:
 L: packet length (bits)  d: length of physical link
 R: link transmission rate (bps)  s: propagation speed (~2x108 m/sec)
 dtrans = L/R  dprop = d/s
dtrans and dprop
very different Introduction: 1-5
Caravan analogy
100 km 100 km

ten-car caravan toll booth toll booth toll booth

(aka 10-bit packet) (aka link)

 car ~ bit; caravan ~ packet; toll  time to “push” entire caravan

service ~ link transmission through toll booth onto
 toll booth takes 12 sec to service highway = 12*10 = 120 sec
car (bit transmission time)  time for last car to propagate
 “propagate” at 100 km/hr from 1st to 2nd toll both:
100km/(100km/hr) = 1 hr
 Q: How long until caravan is lined
up before 2nd toll booth?  A: 62 minutes

Introduction: 1-6
Caravan analogy
100 km 100 km

ten-car caravan toll booth toll booth

(aka 10-bit packet) (aka router)

 suppose cars now “propagate” at 1000 km/hr

 and suppose toll booth now takes one min to service a car
 Q: Will cars arrive to 2nd booth before all cars serviced at first booth?
A: Yes! after 7 min, first car arrives at second booth; three cars still at
first booth

Introduction: 1-7
Packet queueing delay (revisited)
 a: average packet arrival rate

average queueing delay

 L: packet length (bits)
 R: link bandwidth (bit transmission rate)

L .a arrival rate of bits “traffic

:
R service rate of bits intensity” traffic intensity = La/R 1

 La/R ~ 0: avg. queueing delay small La/R ~ 0

 La/R -> 1: avg. queueing delay large

 La/R > 1: more “work” arriving is
more than can be serviced - average
delay infinite!
La/R -> 1
Introduction: 1-8
“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 (with time-to-live field value of i)
• router i will return packets to sender
• sender measures time interval between transmission and reply

3 probes 3 probes

3 probes

Introduction: 1-9
Real Internet delays and routes
traceroute: gaia.cs.umass.edu to www.eurecom.fr
3 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 3 delay measurements
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 to border1-rt-fa5-1-0.gw.umass.edu
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 link
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 looks like delays
12 nio-n2.cssi.renater.fr (193.51.206.13) 111 ms 114 ms 116 ms decrease! Why?
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 * * * * means no response (probe lost, router not replying)
19 fantasia.eurecom.fr (193.55.113.142) 132 ms 128 ms 136 ms

* Do some traceroutes from exotic countries at www.traceroute.org

Introduction: 1-10
Packet loss
 queue (aka buffer) preceding link in buffer has finite capacity
 packet arriving to full queue dropped (aka lost)
 lost packet may be retransmitted by previous node, by source end
system, or not at all
buffer
(waiting area) packet being transmitted
A

B
packet arriving to
full buffer is lost

* Check out the Java applet for an interactive animation (on publisher’s website) of queuing and loss
Introduction: 1-11
 Throughput
 throughput: rate (bits/time unit) at which bits are being sent from
sender to receiver
• instantaneous: rate at given point in time
• average: rate over longer period of time

link
pipecapacity
that can carry linkthat
pipe capacity
can carry
serverserver,
sends with
bits Rsfluid at rate
bits/sec Rfluid
c
at rate
bits/sec
(fluid)
fileinto
of Fpipe
bits (Rs bits/sec) (Rc bits/sec)
to send to client
Introduction: 1-12
Throughput
Rs < Rc What is average end-end throughput?

Rs bits/sec Rc bits/sec

Rs > Rc What is average end-end throughput?

Rs bits/sec Rc bits/sec

bottleneck link
link on end-end path that constrains end-end throughput
Introduction: 1-13
Throughput: network scenario
 per-connection end-end
Rs throughput:
Rs Rs min(Rc,Rs,R/10)
 in practice: Rc or Rs is
R
often bottleneck
Rc Rc
Rc
* Check out the online interactive exercises for more
examples: http://gaia.cs.umass.edu/kurose_ross/

10 connections (fairly) share

backbone bottleneck link R bits/sec
Introduction: 1-14
Chapter 1: roadmap
 What is the Internet?
 What is a protocol?
 Network edge: hosts, access
network, physical media
 Network core: packet/circuit
switching, internet structure
 Performance: loss, delay, throughput
 Security
 Protocol layers, service models
 History
Introduction: 1-15
Network security
 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!
 We now need to think about:
• how bad guys can attack computer networks
• how we can defend networks against attacks
• how to design architectures that are immune to attacks
Introduction: 1-16
Network security
 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!
 We now need to think about:
• how bad guys can attack computer networks
• how we can defend networks against attacks
• how to design architectures that are immune to attacks
Introduction: 1-17
Bad guys: packet interception
packet “sniffing”:
 broadcast media (shared Ethernet, wireless)
 promiscuous network interface reads/records all packets (e.g.,
including passwords!) passing by

A C

src:B dest:A payload

B

Wireshark software used for our end-of-chapter labs is a (free) packet-sniffer

Introduction: 1-18
Bad guys: fake identity
IP spoofing: injection of packet with false source address

A C

src:B dest:A payload

Introduction: 1-19
Bad guys: denial of service
Denial of Service (DoS): attackers make resources (server,
bandwidth) unavailable to legitimate traffic by
overwhelming resource with bogus traffic

1. select target
2. break into hosts
around the network
(see botnet)
target
3. send packets to target
from compromised
hosts
Introduction: 1-20
Lines of defense:
 authentication: proving you are who you say you are
• cellular networks provides hardware identity via SIM card; no such
hardware assist in traditional Internet
 confidentiality: via encryption
 integrity checks: digital signatures prevent/detect tampering
 access restrictions: password-protected VPNs
 firewalls: specialized “middleboxes” in access and core
networks:
 off-by-default: filter incoming packets to restrict senders, receivers,
applications
 detecting/reacting to DOS attacks
… lots more on security (throughout, Chapter 8) Introduction: 1-21
Chapter 1: roadmap
 What is the Internet?
 What is a protocol?
 Network edge: hosts, access
network, physical media
 Network core: packet/circuit
switching, internet structure
 Performance: loss, delay, throughput
 Security
 Protocol layers, service models
 History
Introduction: 1-22
Protocol “layers” and reference models

Networks are complex, Question: is there any

with many “pieces”: hope of organizing
 hosts structure of network?
 routers  and/or our discussion
 links of various media of networks?
 applications
 protocols
 hardware, software

Introduction: 1-23
Example: organization of air travel

end-to-end transfer of person plus baggage

ticket (purchase) ticket (complain)
baggage (check) baggage (claim)
gates (load) gates (unload)
runway takeoff runway landing
airplane routing airplane routing
airplane routing

How would you define/discuss the system of airline travel?

 a series of steps, involving many services
Introduction: 1-24
Example: organization of air travel

ticket (purchase) ticketing service ticket (complain)

baggage (check) baggage service baggage (claim)
gates (load) gate service gates (unload)
runway takeoff runway service runway landing
airplane routing routing service
airplane routing airplane routing

layers: each layer implements a service

 via its own internal-layer actions
 relying on services provided by layer below
Introduction: 1-25
Why layering?
Approach to designing/discussing complex systems:
 explicit structure allows identification,
relationship of system’s pieces
• layered reference model for discussion
 modularization eases maintenance,
updating of system
• change in layer's service implementation:
transparent to rest of system
• e.g., change in gate procedure doesn’t
affect rest of system

Introduction: 1-26
Layered Internet protocol stack
 application: supporting network applications
• HTTP, IMAP, SMTP, DNS
application
application
 transport: process-process data transfer
• TCP, UDP transport
transport
 network: routing of datagrams from source to
destination network
• IP, routing protocols
link
 link: data transfer between neighboring
network elements physical
• Ethernet, 802.11 (WiFi), PPP
 physical: bits “on the wire”
Introduction: 1-27
 Services, Layering and Encapsulation
M
Application exchanges messages to implement some
application application service using services of transport layer application
Ht M
transport Transport-layer protocol transfers M (e.g., reliably) from transport
one process to another, using services of network layer

network  transport-layer protocol encapsulates network

application-layer message, M, with
transport layer-layer header Ht to create a link
link
transport-layer segment
• Ht used by transport layer protocol to
physical implement its service physical

source destination

Introduction: 1-28
 Services, Layering and Encapsulation
M

application application
Ht M
transport Transport-layer protocol transfers M (e.g., reliably) from transport
one process to another, using services of network layer
Hn Ht M
network Network-layer protocol transfers transport-layer segment
network
[Ht | M] from one host to another, using link layer services
link  network-layer protocol encapsulates link
transport-layer segment [Ht | M] with
physical network layer-layer header Hn to create a physical
network-layer datagram
source • Hn used by network layer protocol to destination
implement its service
Introduction: 1-29
 Services, Layering and Encapsulation
M

application application
Ht M
transport transport
Hn Ht M
network Network-layer protocol transfers transport-layer segment
network
[Ht | M] from one host to another, using link layer services
Hl Hn Ht
link M
link
Link-layer protocol transfers datagram [Hn| [Ht |M] from
host to neighboring host, using network-layer services
physical  link-layer protocol encapsulates network physical
datagram [Hn| [Ht |M], with link-layer header
source Hl to create a link-layer frame destination

Introduction: 1-30
 Encapsulation
Matryoshka dolls (stacking dolls)

message segment datagram frame

Credit: https://dribbble.com/shots/7182188-Babushka-Boi Introduction: 1-31

 Services, Layering and Encapsulation

message M
application M application

segment Ht M
transport Ht M
transport
datagram Hn Ht M Hn Ht M
network network

frame Hl Hn Ht M Hl Hn Ht M
link link

physical physical

source destination

Introduction: 1-32
 source Encapsulation:
message
segment Htt
M
M
application
transport
an end-end
datagram Hn Ht M network view
frame Hl Hn Ht M link
physical
link
physical

switch

destination Hn Ht M network
M application Hl Hn Ht M link Hn Ht M
Ht M transport physical
Hn Ht M network
Hl Hn Ht M link router
physical
Introduction: 1-33
Chapter 1: roadmap
 What is the Internet?
 What is a protocol?
 Network edge: hosts, access
network, physical media
 Network core: packet/circuit
switching, internet structure
 Performance: loss, delay, throughput
 Security
 Protocol layers, service models
 History
Introduction: 1-34
Internet history
1961-1972: Early packet-switching principles
 1961: Kleinrock - queueing  1972:
theory shows effectiveness of • ARPAnet public demo
packet-switching • NCP (Network Control Protocol)
 1964: Baran - packet-switching first host-host protocol
in military nets • first e-mail program
 1967: ARPAnet conceived by • ARPAnet has 15 nodes
Advanced Research Projects
Agency
 1969: first ARPAnet node
operational
Internet history
1972-1980: Internetworking, new and proprietary networks
 1970: ALOHAnet satellite
Cerf and Kahn’s internetworking
network in Hawaii principles:
 1974: Cerf and Kahn -  minimalism, autonomy - no
architecture for interconnecting internal changes required to
networks interconnect networks
 best-effort service model
 1976: Ethernet at Xerox PARC
 stateless routing
 late70’s: proprietary  decentralized control
architectures: DECnet, SNA, XNA define today’s Internet architecture
 1979: ARPAnet has 200 nodes

Introduction: 1-36
Internet history
1980-1990: new protocols, a proliferation of networks
 1983: deployment of TCP/IP  new national networks: CSnet,
 1982: smtp e-mail protocol BITnet, NSFnet, Minitel
defined  100,000 hosts connected to
 1983: DNS defined for name- confederation of networks
to-IP-address translation
 1985: ftp protocol defined
 1988: TCP congestion control

Introduction: 1-37
Internet history
1990, 2000s: commercialization, the Web, new applications
 early 1990s: ARPAnet late 1990s – 2000s:
decommissioned  more killer apps: instant
 1991: NSF lifts restrictions on messaging, P2P file sharing
commercial use of NSFnet  network security to forefront
(decommissioned, 1995)
 est. 50 million host, 100 million+
 early 1990s: Web
users
• hypertext [Bush 1945, Nelson 1960’s]
 backbone links running at Gbps
• HTML, HTTP: Berners-Lee
• 1994: Mosaic, later Netscape
• late 1990s: commercialization of the
Web
Introduction: 1-38
Internet history
2005-present: scale, SDN, mobility, cloud
 aggressive deployment of broadband home access (10-100’s Mbps)
 2008: software-defined networking (SDN)
 increasing ubiquity of high-speed wireless access: 4G/5G, WiFi
 service providers (Google, FB, Microsoft) create their own networks
• bypass commercial Internet to connect “close” to end user, providing
“instantaneous” access to social media, search, video content, …
 enterprises run their services in “cloud” (e.g., Amazon Web Services,
Microsoft Azure)
 rise of smartphones: more mobile than fixed devices on Internet (2017)
 ~15B devices attached to Internet (2023, statista.com)
Introduction: 1-39
Chapter 1: summary
We’ve covered a “ton” of material!
 Internet overview
 what’s a protocol? You now have:
 network edge, access network, core  context, overview,
• packet-switching versus circuit-
switching vocabulary, “feel”
• Internet structure of networking
 performance: loss, delay, throughput  more depth,
 layering, service models detail, and fun to
 security follow!
 history
Introduction: 1-40
Additional Chapter 1 slides

Introduction: 1-41
 ISO/OSI reference model
Two layers not found in Internet
application
protocol stack!
presentation
 presentation: allow applications to
interpret meaning of data, e.g., encryption, session
compression, machine-specific conventions transport
 session: synchronization, checkpointing, network
recovery of data exchange link
 Internet stack “missing” these layers!
physical
• these services, if needed, must be
implemented in application The seven layer OSI/ISO
reference model
• needed?
Introduction: 1-42
 Services, Layering and Encapsulation
M

application M application
message
Ht M
transport Ht M
transport
segment
Hn Ht M Hn Ht M
network network
datagram

Hl Hn Ht Hl Hn Ht M
link M
link
frame

physical physical

source destination

Introduction: 1-43
Wireshark
application
(www browser,
packet
email client)
analyzer
application

OS
packet Transport (TCP/UDP)
capture copy of all Network (IP)
Ethernet frames
Link (Ethernet)
(pcap) sent/received
Physical

Introduction: 1-44