Chapter 1

Introduction
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-2020 Pearson, 2020
J.F Kurose and K.W. Ross, All Rights Reserved 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
2
How do packet loss and delay occur?
packets queue in router buffers
▪ packets queue, wait for turn
▪ arrival rate to link (temporarily) exceeds output link capacity: packet loss

packet being transmitted (transmission delay)

B
packets in buffers (queueing delay)
free (available) buffers: arriving packets
dropped (loss) if no free buffers
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 transmission
▪ determine output link ▪ depends on congestion level of router
▪ typically < msec
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 * Check out the online interactive exercises:
[Link]
very different 5
 Packet queueing delay (revisited)

average queueing delay

ρL
▪ R: link bandwidth (bps)
(1− ρ)R
▪ L: packet length (bits)
▪ a: average packet arrival rate

▪ =  Traffic Intensity
traffic intensity = ρ 1

▪ ≈ 0: avg. queueing delay small La/R ~ 0

▪ → 1: avg. queueing delay large

▪ > 1: “work” arriving is more than can
be serviced - average delay infinite!
𝑅
La/R -> 1
𝜌
𝜌
𝜌
𝜌
6
𝐿
𝑎
“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

7
Real Internet delays and routes
traceroute: [Link] to [Link]
3 delay measurements from
[Link] to [Link]
1 cs-gw ([Link]) 1 ms 1 ms 2 ms 3 delay measurements
2 [Link] ([Link]) 1 ms 1 ms 2 ms
3 [Link] ([Link]) 6 ms 5 ms 5 ms to [Link]
4 [Link] ([Link]) 16 ms 11 ms 13 ms
5 [Link] ([Link]) 21 ms 18 ms 18 ms
6 [Link] ([Link]) 22 ms 18 ms 22 ms
7 [Link] ([Link]) 22 ms 22 ms 22 ms trans-oceanic link
8 [Link] ([Link]) 104 ms 109 ms 106 ms
9 [Link] ([Link]) 109 ms 102 ms 104 ms
10 [Link] ([Link]) 113 ms 121 ms 114 ms
11 [Link] ([Link]) 112 ms 114 ms 112 ms looks like delays
12 [Link] ([Link]) 111 ms 114 ms 116 ms decrease! Why?
13 [Link] ([Link]) 123 ms 125 ms 124 ms
14 [Link] ([Link]) 126 ms 126 ms 124 ms
15 [Link] ([Link]) 135 ms 128 ms 133 ms
16 [Link] ([Link]) 126 ms 128 ms 126 ms
17 * * *
18 * * * * means no response (probe lost, router not replying)
19 [Link] ([Link]) 132 ms 128 ms 136 ms

* Do some traceroutes from exotic countries at [Link]

8
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 queuing and loss
9
 A B
R
Active Learning
❖ A is an HTTP client, B is a web server (more in the next chapter). A sends a GET
packet to receive a file of size 1000 bytes and the GET packet is 50 bytes. The
transmission rate of the links is 8 Kbit/sec. The router has a random processing/
queuing delay uniformly distributed in the interval [0, 200msec]. The router uses
S&F switching. Find the minimum and maximum delays to fetch the file. What is the
average delay? Ignore the propagation delay.
A R B
50 × 8 1000 × 8 GET
T1 = = 50 msec T2 = = 1000 msec T1
8 × 103 8 × 103
Δ1 GET
min Δ1 = min Δ2 = 0 max Δ1 = max Δ2 = 200 msec

FILE T2
dmin = 50 + 50 + 1000 + 1000 = 2100 msec
Δ2
dmax = 50 + 50 + 1000 + 1000 + 200 + 200 = 2500 msec
FILE
E[d] = 50 + 50 + 1000 + 1000 + 100 + 100 = 2300 msec
10
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 capacity
pipe that can carry linkthat
pipe capacity
can carry
serverserver,
sends bits Rsfluid
bits/sec
at rate Rfluid at rate
c bits/sec
with
(fluid)file
into
ofpipe
F bits (Rs bits/sec) (Rc bits/sec)
to send to client
11
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
12
 Active Learning
▪ In which model packets are
more likely to be lost in the Rs bits/sec Rc bits/sec
network? (a)
▪ (a)
▪ (b)
Rs bits/sec Rc bits/sec

(b)
▪ What are the desired
charactristics of model (a)?
Congestion moved outside the network

13
Throughput: network scenario
▪ per-connection end-end
Rs throughput:

( 10 )
Rs Rs
min , ,
R
Rc Rc
▪ in practice: Rc or Rs is often
Rc bottleneck

10 connections (fairly) share * Check out the online interactive exercises for more examples: http://
backbone bottleneck link R bits/sec [Link]/kurose_ross/
𝑐
𝑠
𝑅
𝑅
𝑅
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
15
Protocol “layers” and reference models
Networks are complex,
with many “pieces”: Question:
▪ hosts is there any hope of
▪ routers organizing structure of
▪ links of various media network?
▪ applications
▪ protocols
▪ hardware, software Yes, organize tasks into layers

16
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 in layer's service implementation: transparent to rest of
system
• e.g., change in gate procedure doesn’t affect rest of system

17
Internet protocol stack
▪ application: supporting network applications
• IMAP, SMTP, HTTP application
▪ transport: process-process data transfer
• TCP, UDP transport
▪ network: routing of datagrams from source to network
destination
• IP, routing protocols link
▪ link: data transfer between neighboring physical
network elements
• Ethernet, 802.11 (WiFi), PPP
▪ physical: bits “on the wire”
18
 ISO/OSI reference model
Two layers not found in Internet
protocol stack! application
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 The seven layer OSI/ISO
implemented in application reference model
• needed?
19
 source Encapsulation
message M application
segment Ht
H t
M transport
datagram Hn Ht M network
frame Hl Hn Ht M Tl link
physical
maybe 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

20