COMPSCI 453 Computer Networks

Professor Jim Kurose

Chapter 1
College of Information and Computer Sciences
University of Massachusetts

Introduction
Class textbook:
Computer Networking: A Top-
Down Approach (8th ed.)
A note on the use of these Powerpoint slides: J.F. Kurose, K.W. Ross
We’re making these slides freely available to all (faculty, students, readers). Pearson, 2020
They’re in PowerPoint form so you see the animations; and can add, modify, http://gaia.cs.umass.edu/kurose_ross
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.

Thanks and enjoy! JFK/KWR

All material copyright 1996-2020

J.F Kurose and K.W. Ross, All Rights Reserved

Introduction 1-1
Chapter 1: Roadmap
1.1 What is the Internet?
1.2 Network edge
 End systems, access networks, links
1.3 Network core
 Packet switching, circuit switching, network structure
1.4 Delay, loss, throughput in networks
1.5 Protocol layers, service models

Introduction 1-2
 What’s the Internet: “nuts and bolts” view
PC  Millions of connected computing mobile network
server devices:
 Hosts = End systems global ISP
wireless
laptop  Running network apps
smartphone
home
network
 Communication Links regional ISP
wireless  Fiber, copper, radio.
links  Transmission rate:
wired
links bandwidth (bps)
bps

switch
 Routers and Switches
 Forward packets (chunks
of data) institutional
network
router

ISP: Internet Service Provider Introduction 1-3

Message versus Packet

Packet

Message

Introduction 1-4
 Hub Switch Router
(Layer 1) (Layer 2) (Layer 3)

Introduction 2-5
What’s a Protocol?

Human protocol vs. Computer network protocol

Hi TCP connection
Client request
Hi TCP connection
response Server
Got the
time? Get http://www.awl.com/kurose-ross
2:00
<file>
time

Introduction 1-6
Chapter 1: Roadmap
1.1 What is the Internet?
1.2 Network edge
 End systems, access networks, links
1.3 Network core
 Packet switching, Circuit switching, Network Structure
1.4 Delay, loss, throughput in networks
1.5 Protocol layers, service models

Introduction 1-7
A closer look at network structure

 Network edge: mobile network

 Hosts: Clients and Servers
 Servers often in data centers global ISP

home
 Access networks, physical media: network
Wired, wireless communication regional ISP
links

 Network core:
 Interconnected routers
 Network of networks
institutional
network

Introduction 1-8
Access Net: Digital Subscriber Line (DSL) 1
Central office Telephone
network

DSL splitter
modem DSLAM

ISP
voice, data transmitted
at different frequencies over DSL access
dedicated line to central office multiplexer
DSLAM: Digital Subscriber Line Access Multiplexer

 Use existing telephone line to central office DSLAM

 Data over DSL phone line goes to Internet
 Voice over DSL phone line goes to telephone net
 < 2.5 Mbps upstream transmission rate (typically < 1 Mbps)
 < 24 Mbps downstream transmission rate (typically < 10 Mbps)
Introduction 1-9
Access Net: Cable Network 2
Cable headend

Cable splitter
modem

C
O
V V V V V V N
I I I I I I D D T
D D D D D D A A R
E E E E E E T T O
O O O O O O A A L

1 2 3 4 5 6 7 8 9

Channels

Frequency Division Multiplexing: Different channels transmitted in different

frequency bands

Introduction 1-10
Access Net: Cable Network 2
Cable headend

cable splitter cable modem

modem CMTS termination system

data, TV transmitted at different

frequencies over shared cable ISP
distribution network

CMTS: Cable Modem Termination System (Cisco)

 HFC: Hybrid Fiber Coax

 Asymmetric: Up to 30Mbps downstream transmission rate, 2 Mbps
upstream transmission rate
 Network of cable, fiber attaches homes to ISP router
 Homes share access network to cable headend
 Unlike DSL, which has dedicated access to central office
Introduction 1-11
Access Networks and Physical Media

Q: How to connect end-systems to edge-

router?
1. Mobile access networks
2. Residential access nets
3. Institutional access networks
(school, company)

keep in mind:
 Bandwidth (bits per second)

 Shared or dedicated?

Cable DSL

Introduction 1-12
 LTE: Long-Term Evolution

I. Mobile Access Networks

 Shared wireless access network connects end system to router
 Via base station aka “Access Point”
Wireless LANs: Wireless WANs
 Local Area Network  Wide Area Network
 Within building (100 ft  30 m)  Provided by telco (cellular)
 IEEE 802.11 b/g (WiFi): 11, 54 Mbps operator, 10’s km
transmission rate  Between 1 and 10 Mbps
 4G, 5G

to Internet

to Internet
Introduction 1-13
 II. Residential Network
Wireless
Devices

to/from headend (cable)

or central office (DSL)
often combined
in single box

cable or DSL modem

wireless access router, firewall, NAT

point (54 Mbps)
wired Ethernet (100 Mbps)

Introduction 1-14
III. Institutional Access Networks

institutional link to
ISP (Internet)
institutional router

Ethernet institutional mail,

switch web servers

 Typically used in companies, universities, etc

 10 Mbps, 100Mbps, 1Gbps, 10Gbps transmission rates
 Today, end systems typically connect into Ethernet switch

Introduction 1-15
Physical Media: Guided vs Unguided

Physical Media

Unguided Media
Guided Media
(Free
(Solid Media)
Propagation

Twisted Pair Coaxial Fiber optics Radio

Introduction 1-16
 I. Guided Media: Twisted Pair, Coax and Fiber
I. Twisted Pair (TP) III. Fiber optic cable:
II. Coaxial cable:

Two insulated copper  Glass fiber carrying light

  Two concentric pulses, each pulse is a bit
wires copper conductors (photons)
 Category 5:
 Speed of light=3 x 108m/s
• 100 Mbps, 1 Gbps  Bidirectional  High-speed operation:
 Category 6:  High-speed point-to-
• 10Gbps  Broadband: point transmission
 Multiple channels (e.g., 10’s-100’s Gbps
on cable transmission rate)
 HFC  Low error rate:
 Repeaters spaced far
apart
 Immune to
electromagnetic
noise

Introduction 1-17
II. Unguided Media: Radio

 Signal carried in electromagnetic Radio link types:

spectrum  Terrestrial microwave
 E.g. up to 45 Mbps channels
 No physical “wire”
 LAN (e.g., WiFi)
 Bidirectional  11Mbps, 54 Mbps

 Propagation environment effects:  Wide-area (e.g., cellular)

 Reflection  5G cellular: ~ few Mbps
 Obstruction by objects
 Interference  Satellite
 Kbps to 45Mbps channel (or
multiple smaller channels)
 270 msec end-end delay

Introduction 1-18
Chapter 1: Roadmap

1.1 What is the Internet?

1.2 Network edge
 End systems, access networks, links
1.3 Network core
 Packet switching, circuit switching, network structure
1.4 Delay, loss, throughput in networks
1.5 Protocol layers, service models

Introduction 1-19
Core Nodes

Core Nodes

Packet Circuit
Switching Switching
(Unit: Packet) (Unit: Message)

Introduction 1-20
 I. Packet Switching

 Mesh of interconnected routers

 Packet-switching: Hosts break
application-layer messages into packets
 Forward packets from one router to
the next, across links on path from
source to destination
 Each packet is transmitted at full link
capacity

Introduction 1-21
Topologies

Introduction 1-22
Fully Connected Topology

N * ( N  1)
L
2
Introduction 2-23
 Two Key Network-Core Functions

Routing: Determines source- Forwarding: Moves packets from router’s

destination route taken by packets input to appropriate router’s output

Routing Algorithms

Routing Algorithm

Local Forwarding Table

Header Value Output Link
0100 3 1
0101 2
0111 2 3 2
1001 1

Dest address in arriving

packet’s header Introduction 4-24
II. Circuit Switching
End-end resources allocated to, reserved for “call” between source & dest:

 In diagram, each link has four circuits.

 Call gets 2nd circuit in top link and 1st circuit in right link.
 Dedicated resources: No sharing
 Circuit-like (guaranteed) performance
 Circuit segment idle if not used by call (no sharing)Low Utilization 
 Commonly used in traditional telephone networks

Characteristics
 Call setup
 Low Utilization

Introduction 1-25
 Circuit Switching: FDM versus TDM
Example:

FDM 4 users

frequency

time

TDM

frequency

time
FDM: Frequency Division Multiplexing
Introduction 1-26
TDM: Time Division Multiplexing
 1.536 Mbps

24 slots
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= 1.536x106 bps bits
Time   sec
 Each link uses TDM with 24 slots bits / sec
 500 msec to establish end-to-end circuit
Answer

• L=640,000 bits
• Rper_slot =1.536Mbps/24 = 64,000bps
• Rper_slot=64,000bps

• End to End delay =𝐓𝐫𝐚𝐧𝐬𝐦𝐢𝐬𝐬𝐢𝐨𝐧 𝐓𝐢𝐦𝐞 + 𝐂𝐚𝐥𝐥 𝐒𝐞𝐭𝐮𝐩 𝐭𝐢𝐦𝐞

𝑳
• Transmission Time= =640,000bits/64,000bps=10 sec
𝑹
• Call Setup Time=500msec=500*10-3sec=0.5 sec

End to End delay =10+0.5=10.5 sec Introduction 2-27

Recall
Prefix Analog value Digital value
y (yokto) 10-24 -
z (zepto) 10-21 -
a (atto) 10-18 -
f (femto) 10-15 -
p (pico) 10-12 -
n (nano) 10-9 -
µ (micro) 10-6 -
m (milli) 10-3 -
k (kilo) 103 210
M (Mega) 106 220
G (Giga) 109 230
T (Tera) 1012 240
P (Peta) 1015 250
E (Exa) 1018 260
Z (Zetta) 1021 270
Y (Yotta) 1024 280
Introduction 2-28
Chapter 1: Roadmap
1.1 What is the Internet?
1.2 Network Edge
 End systems, access networks, links
1.3 Network Core
 Packet switching, circuit switching, network structure
1.4 Delay, loss, throughput in networks
1.5 Protocol layers, service models

Introduction 1-29
FOUR sources of packet delay

dproc: Processing Delay dqueue: Queueing Delay

 Check bit errors
1  Determine the output link
 Time waiting at output link for
transmission 2
 Typically < msec  Depends on congestion level of
router

dtrans: Transmission Delay dprop: Propagation Delay distance

 L: Packet Length (bits)  d: Length of physical link (in meters)
3  R: Link bandwidth (bps)  s: Propagation speed in medium
 dtrans = bits/(bits/sec)=L/R (~2x108 m/sec)
 dprop = d/s=m/(m/sec)
4
dtrans and dprop
very different
Introduction 1-30
Transmission Delay vs. Propagation Delay

Transmission
Delay

Tx Rx
Propagation
Delay
Introduction 2-31
Caravan Analogy Scenario 1
100 km 100 km
ten-car toll toll
caravan booth booth 100km  1hr
100km  X
 Cars “propagate” at 100 km/hr X=1hr=60min
 Toll booth takes 12 sec to service car (bit transmission time)
 car~bit; caravan ~ packet

 Q: How long until caravan is lined up before 2nd 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-32
 Caravan Analogy Scenario 2
100 km 100 km
ten-car toll toll
caravan booth booth
1000km  1hr
 Suppose cars now “propagate” at 1000 km/hr 100km  X
X=0.1hr = 6min
 and suppose toll booth now takes one min to service a car

 Q: Will cars arrive to 2nd booth before all cars serviced at 1st booth?
 1000km 60 min
 100km  x
 X=(100km*60min)/1000km=6min

  Total time = 6 min (propagation time) + (1 min transmission time)

  Yes after 7 min, 1st car arrives at second booth; but three cars still
at 1st booth. Introduction 1-33
 Queuing delay (revisited)
 R: link bandwidth (bps)

Average Queueing
 L: packet length (bits)
 a: average packet arrival rate

Delay
Traffic Intensity
 La/R ~ 0: Avg. queueing delay small
 La/R  1: Avg. queueing delay large
 La/R > 1: More “work” arriving Traffic Intensity
than can be serviced, average delay infinite! = La/R
La/R ~ 0
L : bits/packe ts
a : packets/se c
R : bits/sec
bits packets
*
La packets sec bits / sec
Traffic Intensity  La/R     unitless
R bits bits / sec
sec
La/R -> 1
Introduction 1-34
Packet Loss
 Queue (aka buffer) preceding link in buffer has finite capacity

 Packet arriving to a full queue is dropped (aka lost)

 Lost packet may be retransmitted by:

1. Previous node,
2. Source end system, or
3. Not at all
Overflow
buffer
(waiting area) packet being transmitted
A

B
packet arriving to
full buffer is lost

Introduction 1-35
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

Server, with Link capacity Link capacity

file of F bits Rs bits/sec Rc bits/sec
to send to client
Server sends bits Pipe that can carry Pipe that can carry
(fluid) into pipe fluid at rate fluid at rate
(Rs bits/sec) (Rc bits/sec)

Introduction 1-36
Throughput (more)
 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-37
Throughput: Internet scenario

 Per-connection end-end throughput:

 min(Rc,Rs,R/10) Rs

Rs Rs
 In practice:
 Rc or Rs is often the bottleneck

 Eg:
 min(Rc,Rs,R/10) Rc
Rc Rc
 min(6,7,80/10)

10 connections (fairly) share backbone

bottleneck link R bits/sec
Introduction 1-38
Chapter 1: roadmap
1.1 What is the Internet?
1.2 Network edge
 end systems, access networks, links
1.3 Network core
 packet switching, circuit switching, network structure
1.4 Delay, loss, throughput in networks
1.5 Protocol layers, service models

Introduction 1-39
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 airplane routing airplane routing

departure intermediate air-traffic arrival

airport control centers airport

Layers: Each layer implements a service

 Via its own internal-layer actions
 Relying on services provided by layer below

Introduction 1-40
 Internet Protocol Stack
 Application: Supporting network applications Application 5
 FTP, SMTP, HTTP

 Transport: Process-process data transfer Transport 4

 TCP, UDP

 Network: Routing of datagrams from source to

destination Network 3
 IP, routing protocols

 Link: Data transfer between neighboring

network elements Link 2
 Ethernet, 802.11 (WiFi), PPP

 Physical: Bits “on the wire” Physical 1

FTP: File Transfer Protocol
SMTP: Simple Mail Transfer Protocol
HTTP: Hypertext Transfer Protocol
TCP: Transmission Control Protocol
UDP: User Datagram Protocol Introduction 1-41
ISO/OSI Reference Model

 Presentation: Allow applications to interpret

meaning of data, e.g., Encryption,
compression, machine-specific conventions Application 7

 Session: Synchronization, checkpointing,

Presentation 6
recovery of data exchange Session 5
 Internet stack “missing” these layers! Transport 4
 These services, if needed, must be
implemented in application Network 3
Link 2
Physical 1

Introduction 1-42
Internet Protocol Stack

Routing
P2P
Network Layer
Link Layer

3
2
1
A B

E2E
Transport Layer

Introduction 1-43
 Protocol Data Units
source
Encapsulation
Message M Application
Segment Ht M Transport
Datagram Hn H t M Network
Frame Hl Hn Ht M Link
Packet
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 H n Ht M Link router
Physical

Decapsulation Introduction 1-44

 Encapsulation Decapsulation
Application Layer Message Message

Message Message

Transport Layer HT Message HT Message

Segment Segment

Network Layer HN Segment HN Segment

Datagram Datagram

Link Layer HL Datagram HL Datagram

Frame Frame

Physical Layer HP Frame TP HP Frame TP

Packet Packet

Introduction 3-45