About Me

Chenxi Qiu
Assistant Professor in Computer Science and
Engineering
Office hours: 10 pm – 12 pm Friday (Discovery Park F228)

Home page: https://chenxiunt.github.io/

Policies

Policy on Grading
Grading Category Percentage of Final Grade Exam: remote, taken in Canvas
Assignments 27% Midterm exam: 120 minutes
2 Midterm exams 40%
Final exam: 120 minutes
Final exam 30%
Attendance 3%

A 90% - 100%
* There is a 10%-per-day-late B 80% - 89%
penalty for all assignments unless C 70% - 79%
you communicate with me D 60% - 69%
BEFORE the due dates. F 59% and below
Policies

Class mode: In person (attendance).

Computer Networking
- A Top-Down Approach
Topics to be covered
1. Introduction.
2. Application layer.
3. Transport layer.
4. Network layer – data plane.
5. Network layer – control plane.
6. Link layer.
7. Mobile network.
8. Network Security.
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
1.6 networks under attack: security

Introduction 1-5
What’s the Internet: “nuts and bolts” view
❖ millions of connected
PC mobile network
server computing devices:
wireless ▪ hosts = end systems global ISP
laptop
smartphone ▪ running network apps
home
❖ communication links network
regional ISP
wireless ▪ fiber, copper, radio,
links satellite
wired
links ▪ transmission rate:
bandwidth

❖ Packetswitches: forward
router packets (chunks of data) institutional
network
▪ routers and switches
Introduction 1-6
What’s the Internet: “nuts and bolts” view
mobile network
❖ Internet: “network of networks”
▪ Interconnected ISPs
global ISP

home
network
❖ protocols control sending, regional ISP
receiving of msgs
▪ e.g., TCP, IP, HTTP, Skype, 802.11

institutional
network

Introduction 1-7
What’s a protocol?
a human protocol and a computer network protocol:

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

Q: other human protocols?

Introduction 1-8
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
1.6 networks under attack: security
1.7 history

Introduction 1-9
A closer look at network structure:
❖ network edge: mobile network

▪ hosts: clients and servers

global ISP
▪ servers often in data
centers
home
❖ access networks, physical network
regional ISP
media: wired, wireless
communication links

❖ network core:
▪ interconnected routers
▪ network of networks institutional
network

Introduction 1-10
Access net: digital subscriber line (DSL)
central office telephone
network

DSL splitter
modem DSLAM

ISP
voice, data transmitted
at different frequencies over DSL access
dedicated line to central office 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-11
Access net: cable network
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-12
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
1.6 networks under attack: security
1.7 history

Introduction 1-13
The network core
❖ 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 transmitted at
full link capacity

Introduction 1-14
Host: sends packets of data
host sending function:
❖ takes application message
❖ breaks into smaller two packets,
chunks, known as packets, L bits each
of length L bits
❖ transmits packet into
access network at 2 1
transmission rate R R: link transmission rate
▪ link transmission rate, host
aka link capacity, aka
link bandwidth

packet time needed to L (bits)

transmission = transmit L-bit =
delay packet into link R (bits/sec)
1-15
Packet-switching: store-and-forward

L bits
per packet

3 2 1
source destination
R bps R bps

❖ takes L/R seconds to one-hop numerical example:

transmit (push out) L-bit
packet into link at R bps ▪ L = 7.5 Mbits
❖ store and forward: entire ▪ R = 1.5 Mbps
packet must arrive at router ▪ one-hop transmission
before it can be transmitted delay = 5 sec
on next link
❖ end-end delay = 2L/R (assuming
zero propagation delay) more on delay shortly …
Introduction 1-16
Packet Switching: queueing delay, loss

R = 100 Mb/s C
A
D
R = 1.5 Mb/s
B
queue of packets E
waiting for output link

queuing and loss:

❖ If arrival rate (in bits) to link exceeds transmission rate of
link for a period of time:
▪ packets will queue, wait to be transmitted on link
▪ packets can be dropped (lost) if memory (buffer) fills up

Introduction 1-17
Queueing delay (revisited)

average queueing
❖ R: link bandwidth (bps)

delay
❖ L: packet length (bits)
❖ a: average packet arrival
rate
traffic intensity
= La/R
❖ La/R ~ 0: avg. queueing delay small La/R ~ 0

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

❖ La/R > 1: more “work” arriving
than can be serviced, average delay infinite!

* Check out the Java applet for an interactive animation on queuing and loss La/R -> 1
Introduction 1-18
Four sources of packet delay
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
▪ determine output link for transmission
▪ typically < msec ▪ depends on congestion
level of router
Introduction 1-19
Four sources of packet delay
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 bandwidth (bps) ▪ s: propagation speed in medium
▪ dtrans = L/R (~2x108 m/sec)
dtrans and dprop ▪ dprop = d/s
very different
* Check out the Java applet for an interactive animation on trans vs. prop delay Introduction 1-20
Caravan analogy
100 km 100 km
ten-car toll toll
caravan booth booth

❖ cars “propagate” at ▪ time to “push” entire

100 km/hr caravan through toll
❖ toll booth takes 12 sec to booth onto highway =
service car (bit transmission 12*10 = 120 sec
time) ▪ time for last car to
❖ car~bit; caravan ~ packet propagate from 1st to
❖ Q: How long until caravan is 2nd toll both:
lined up before 2nd toll 100km/(100km/hr)= 1
booth? hr
▪ A: 62 minutes
Introduction 1-21
Caravan analogy (more)
100 km 100 km
ten-car toll toll
caravan booth booth

❖ 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?

Introduction 1-22
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,
server withbits
sends linkpipe
capacity
that can carry linkpipe
capacity
that can carry
file of into
(fluid) F bitspipe Rs bits/sec
fluid at rate Rc bits/sec
fluid at rate
to send to client Rs bits/sec) Rc bits/sec)

Introduction 1-23
Throughput (more)
❖ Rs < Rc What is average end-end throughput?

Rs bits/sec Rc bits/sec

L/Rs
L/Rs+L/Rc

2L/Rs 2L/Rs+L/Rc

mL/Rs mL/Rs+L/Rc
Introduction 1-24
Throughput (more)
❖ Rs > Rc What is average end-end throughput?

Rs bits/sec Rc bits/sec

L/Rs

2L/Rs
L/Rs+L/Rc

mL/Rs L/Rs+2L/Rc

L/Rs+mL/Rc
Introduction 1-25
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-26
Throughput: Internet scenario

❖ per-connection end-
end throughput: Rs
min(Rc,Rs,R/10) Rs Rs
❖ in practice: Rc or Rs
is often bottleneck
R

Rc Rc

Rc

10 connections (fairly) share

backbone bottleneck link R bits/sec
Introduction 1-27
Practice 2
Suppose there is exactly one packet switch between a sending host and a
receiving host. The transmission rates between the sending host and the
switch and between the switch and the receiving host are R1 and R2,
respectively. We assume that the switch uses store-and-forward packet
switching.
Question: what is the total end-to-end delay to send a packet of length L?
(Ignore queuing delay, propagation delay, and processing delay.)

Introduction 1-28
Practice

How long does it take a packet of length 1,000 bytes to propagate over a
link of distance 2,500 km, propagation speed 2.5*108 m/s, and
transmission rate 2 Mbps?

Propagation delay
= distance/propagation speed
= 2,500km/ 2.5*108 m/s
= 0.01 second

Introduction 1-29
Practice

More generally, how long does it take a packet of length L to propagate

over a link of distance d, propagation speed s, and transmission rate R
bps?
Propagation delay = distance/propagation speed = d/s
Does this delay depend on packet length?

Does this delay depend on transmission rate?

Introduction 1-30
Practice
R19. Suppose Host A wants to send a large file to Host B. The path from
Host A to Host B has three links, of rates R1=500 kbps, R2=2 Mbps, and
R3=1 Mbps.

a. Assuming no other traffic in the network, what is the throughput for

the file transfer?

Introduction 1-31
Practice
R19. Suppose Host A wants to send a large file to Host B. The path from
Host A to Host B has three links, of rates R1=500 kbps, R2=2 Mbps, and
R3=1 Mbps.

b. Suppose the file is 4 million bytes. Dividing the file size by the
throughput, roughly how long will it take to transfer the file to Host B?

time = file size/throughput

= 4 million bytes/500kbps
= 4*8*106 bits/500*103 bps
= 64 seconds

Introduction 1-32
Alternative core: 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)
❖ Commonly used in traditional
telephone networks
Introduction 1-33
Packet switching versus circuit switching
packet switching allows more users to use network!

example:
▪ 1 Mb/s link
▪ each user: N
users
• 100 kb/s when “active”
• active 10% of time 1 Mbps link

❖ circuit-switching:
▪ 10 users
❖ packet switching:
▪ with 35 users, probability >
10 active at same time is less
than .0004 *

* Check out the online interactive exercises for more examples Introduction 1-34
Packet switching versus circuit switching
packet switching allows more users to use network!

example: Q: how did we get value 0.0004?

▪ 1 Mb/s link
Q: what happens if > 35 users ?
▪ each user:
• 100 kb/s when “active”
• active 10% of time

❖ circuit-switching:
▪ 10 users
❖ packet switching:
▪ with 35 users, probability >
10 active at same time is less
than .0004 *

* Check out the online interactive exercises for more examples Introduction 1-35
Practice 1

Suppose users share a 2 Mbps link. Also suppose each user transmits
continuously at 1 Mbps when transmitting, but each user transmits
only 20 percent of the time. (See the discussion of statistical
multiplexing in Section 1.3 .)

a. When circuit switching is used, how many users can be supported?

Introduction 1-36
Practice 1

Suppose users share a 2 Mbps link. Also suppose each user transmits
continuously at 1 Mbps when transmitting, but each user transmits
only 20 percent of the time. (See the discussion of statistical
multiplexing in Section 1.3 .)

For the remainder of this problem, suppose packet switching is used.

b. Find the probability that a given user is transmitting.

Introduction 1-37
Practice 1

Suppose users share a 2 Mbps link. Also suppose each user transmits
continuously at 1 Mbps when transmitting, but each user transmits
only 20 percent of the time.

c. Suppose now there are three users. Find the probability that at any
given time, all three users are transmitting simultaneously. Find the
fraction of time during which the queue grows.

Introduction 1-38
Practice 1

Suppose users share a 2 Mbps link. Also suppose each user transmits
continuously at 1 Mbps when transmitting, but each user transmits
only 20 percent of the time.

d. Suppose now there are five users. Find the probability that at any
given time, more than two users are transmitting simultaneously. Find
the fraction of time during which the queue grows.

Introduction 1-39
Internet structure: network of networks
❖ End systems connect to Internet via access ISPs (Internet
Service Providers)
▪ Residential, company and university ISPs
❖ Access ISPs in turn must be interconnected.
❖ So that any two hosts can send packets to each other
❖ Resulting network of networks is very complex
❖ Evolution was driven by economics and national policies
❖ Let’s take a stepwise approach to describe current Internet
structure
Internet structure: network of networks
Question: given millions of access ISPs, how to connect them
together?
access access
net net
access
net
access
access net
net
access
access net
net

access access
net net

access
net
access
net

access
net
access
net
access access
net access net
net
Internet structure: network of networks
Option: connect each access ISP to every other access ISP?

access access
net net
access
net
access
access net
net
access
access net
net

connecting each access ISP

access
to each other directly doesn’t access
net
scale: O(N2) connections. net

access
net
access
net

access
net
access
net
access access
net access net
net
Internet structure: network of networks
Option: connect each access ISP to a global transit ISP? Customer
and provider ISPs have economic agreement.
access access
net net
access
net
access
access net
net
access
access net
net

global
access
net
ISP access
net

access
net
access
net

access
net
access
net
access access
net access net
net
Internet structure: network of networks
But if one global ISP is viable business, there will be competitors
….
access access
net net
access
net
access
access net
net
access
access net
net
ISP A

access access
net ISP B net

access
ISP C
net
access
net

access
net
access
net
access access
net access net
net
Internet structure: network of networks
But if one global ISP is viable business, there will be competitors
…. which must be interconnected
access access
Internet exchange point
net net
access
net
access
access net
net

access
IXP access
net
net
ISP A

access IXP access

net ISP B net

access
ISP C
net
access
net

access peering link

net
access
net
access access
net access net
net
Internet structure: network of networks
… and regional networks may arise to connect access nets to
ISPS
access access
net net
access
net
access
access net
net

access
IXP access
net
net
ISP A

access IXP access

net ISP B net

access
ISP C
net
access
net

access
net regional net
access
net
access access
net access net
net
Internet structure: network of networks
… and content provider networks (e.g., Google, Microsoft,
Akamai ) may run their own network, to bring services, content
close to end users
access access
net net
access
net
access
access net
net

access
IXP access
net
net
ISP A
Content provider network
access IXP access
net ISP B net

access
ISP B
net
access
net

access
net regional net
access
net
access access
net access net
net
 Internet structure: network of networks

Tier 1 ISP Tier 1 ISP Google

IXP IXP IXP

Regional ISP Regional ISP

access access access access access access access access

ISP ISP ISP ISP ISP ISP ISP ISP

❖ at center: small # of well-connected large networks

▪ “tier-1” commercial ISPs (e.g., Level 3, Sprint, AT&T, NTT), national &
international coverage
▪ content provider network (e.g, Google): private network that connects
it data centers to Internet, often bypassing tier-1, regional ISPs Introduction 1-48
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
1.6 networks under attack: security
1.7 history

Introduction 1-49
The OSI model
The OSI model
Why layering?
dealing with complex systems:
❖ explicit structure allows identification,
relationship of complex system’s pieces
▪ layered reference model for discussion
❖ 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

Introduction 1-52
Physical layer
❖ physical: bits “on the wire”
❑ Fundamental layer underlying any application
network
❑ Primarily consists of hardware transport
(unless virtual)
❑ Provides the basic communication network
channel that two network devices
(e.g., computers) use to send and link
receive messages
❑ Provides transmission & reception physical
hardware

Introduction 1-53
Link layer
❖ link: data transfer between
neighboring network elements
application
❑ Primarily implement in software
❑ may be embedded in physical devices transport
such as switches and network adapters
(firmware) network
❑ Responsible for transferring data
between two devices on the same link
network segment
❑ Data are transmitted in units of frames physical
which are groups of bits.

Introduction 1-54
Link layer
❖ link: data transfer between
neighboring network elements
application

transport

network

link

physical

Introduction 1-55
Network layer
❖ network: routing of datagrams
from source to destination
▪ IP, routing protocols application
❑ Each node must have a logical address in
transport
order to communicate
❑ Network layer uses logical IP Address;
addresses are assigned statistically or network
dynamically via server
❑ Link layer uses MAC address (Hardware link
address)
❑ Routing
physical
❑ Fragmentation and Re-Assembly
❑ Error Handling

Introduction 1-56
Transport layer
❖ transport: process-process data
transfer
▪ TCP, UDP application
❑ Provides end-to-end communications for
individual applications transport
❑ Connection-Oriented Protocols
Establish and maintain communications channels network
Ensure messages arrive in order
• Provide mechanisms for detecting delivery failure
• May automatically recover from dropped or duplicated link
messages at the Network Layer
❑ Connectionless Protocols physical
• Function like network layer datagrams
• Single messages that may arrive in any order

Introduction 1-57
Application layer
❖ application: supporting network
applications
▪ FTP, SMTP, HTTP application

❑ The application layer enables the user transport

to access the network.
❑ It provides user interface and support
for such services as: e-mail, remote file network
access and transfer, etc. Its
responsibilities include: link
o Network Virtual Terminal
o File transfer, access, and management physical
o Mail service
o Directory services

Introduction 1-58
Example

Client Server

Application Application

Transport Transport
Network Network

Data Link Data Link

Physical Physical
Example

Client Server

web browser web server

Application Application

Transport Transport
Network Network

Data Link Data Link

Physical Physical
Example

Client Server

web browser web server

Application Application

Transport Transport
Network Network

Data Link Data Link

Physical Physical
Example

Client Server

web browser web server

Application Application

Transport Transport
Network Network

Data Link Data Link

Physical Physical
Example

Client Server

web browser web server

Application Application
Transport Transport
Network Network

Data Link Data Link

Physical Physical
Example

Client Server

Application Application
Transport Transport
Network Network

Data Link Data Link

Physical Physical
Example

Client Server

Application Application

Transport Transport
Network Network

Data Link Data Link

Physical Physical
Example

Client Server

10.0.1.1 10.0.2.1
Port 7268 Port 80
Application Application
Transport Transport
Network Network
Data Link Data Link
Physical Physical
Example

Client Server

10.0.1.1 10.0.2.1
Port 7268 Port 80
Application Application

Transport Transport
Network Network
Data Link Data Link
Physical Physical
Example

Client Server

Application Application

Transport Transport
Network Network

Data Link Data Link

Physical Physical
Example

Client Server

Application Application
Transport Transport
Network Network

Data Link Data Link

Physical Physical
Example

Client Server

web browser web server

Application Application
Transport Transport
Network Network

Data Link Data Link

Physical Physical
Example

Client Server

web browser web server

Application Application

Transport Transport
Network Network

Data Link Data Link

Physical Physical
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
1.6 networks under attack: security
1.7 history

Introduction 1-72