Al-Hussein Bin Talal University

Faculty of Engineering
Computer Engineering Department

Summer 2023-2024
Computer Networks
Instructor: Dr. Khaled Matrouk

Resource: Book by James F. Kurose and Keith

W. Ross

Introduction 1-1

Chapter 1
Introduction

Computer Networking: A
Top-Down Approach
7th Edition, Global Edition
Jim Kurose, Keith Ross
Pearson
April 2017

Introduction 1-2
1
2
 What’s the Internet:
PC
 billions of connected mobile network
server computing devices:
wireless
laptop
• hosts = end systems global ISP

smartphone • running network apps

home
 communication links network
regional ISP
wireless • fiber, copper, radio,
links satellite
wired
links • transmission rate:
bandwidth

 packet switches: forward

router
packets (chunks of data) institutional
• routers and switches network

Introduction 1-3

What’s the Internet:

mobile network
 Internet: “network of networks”
• Interconnected ISPs
global ISP
 protocols control sending, receiving
of messages
• e.g., TCP, IP, HTTP, Skype, 802.11 home
network
 Internet standards regional ISP
• RFC: Request for comments
• IETF: Internet Engineering Task Force

institutional
network

Introduction 1-4
2
4
 What’s the Internet: a service view
mobile network
 infrastructure that provides
services to applications: global ISP

• Web, VoIP, email, games, e-

commerce, social nets, … home
 provides programming network
regional ISP
interface to apps
• hooks that allow sending
and receiving app programs
to “connect” to Internet
• provides service options,
analogous to postal service
institutional
network

Introduction 1-5

What’s a protocol?
human protocols: network protocols:
 “what’s the time?”  machines rather than
 “I have a question” humans
 introductions  all communication activity
in Internet governed by
protocols
… specific messages sent
… specific actions taken
when messages protocols define format, order of
received, or other
events messages sent and received
among network entities, and
actions taken on message
transmission, receipt
Introduction 1-6
3
6
 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

Introduction 1-7

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-8
4
8
 Access networks and physical media

Q: How to connect end

systems to edge router?
 residential access nets
 institutional access
networks (school, company)
 mobile access networks
keep in mind:
 bandwidth (bits per second)
of access network?
 shared or dedicated?

Introduction 1-9

Enterprise access networks (Ethernet)

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-10
5
10
 Wireless access networks
 shared wireless access network connects end system to router
• via base station aka “access point”

wireless LANs: wide-area wireless access

 within building (100 ft.)  provided by telco (cellular)
 802.11b/g/n (WiFi): 11, 54, 450 operator, 10’s km
Mbps transmission rate  between 1 and 10 Mbps
 3G, 4G: LTE

to Internet

to Internet

Introduction 1-11

11

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)
Introduction 1-12
6
12
 Physical media
 bit: propagates between
transmitter/receiver pairs
 physical link: what lies twisted pair (TP)
between transmitter &  two insulated copper
receiver wires
 guided media: • Category 5: 100 Mbps, 1
Gbps Ethernet
• signals propagate in solid • Category 6: 10Gbps
media: copper, fiber, coax
 unguided media:
• signals propagate freely,
e.g., radio

Introduction 1-13

13

Physical media: coax, fiber

coaxial cable: fiber optic cable:
 two concentric copper  glass fiber carrying light
conductors pulses, each pulse a bit
 bidirectional  high-speed operation:
 broadband: • high-speed point-to-point
• multiple channels on cable transmission (e.g., 10’s-100’s
Gbps transmission rate)
• HFC
 low error rate:
• repeaters spaced far apart
• immune to electromagnetic
noise

Introduction 1-14
7
14
 Physical media: radio
 signal carried in radio link types:
electromagnetic spectrum  terrestrial microwave
 no physical “wire” • e.g. up to 45 Mbps channels
 bidirectional  LAN (e.g., WiFi)
 propagation environment • 54 Mbps
effects:  wide-area (e.g., cellular)
• reflection • 4G cellular: ~ 10 Mbps
• obstruction by objects  satellite
• interference • Kbps to 45Mbps channel (or
multiple smaller channels)
• 270 msec end-end delay
• geosynchronous versus low
altitude

Introduction 1-15

15

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-16
8
16
 Packet-switching: store-and-forward

L bits
per packet

3 2 1
source destination
R bps R bps

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

(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-17

17

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-18
9
18
 Two key network-core functions
routing: determines source-
destination route taken by forwarding: move packets from
packets router’s input to appropriate
 routing algorithms router output

routing algorithm

local forwarding table

header value output link
0100 3 1
0101 2
0111 2 3 2
1001 1

destination address in arriving

packet’s header
Introduction 1-19

19

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-20
10
20
 Circuit switching: FDM versus TDM
Example:
FDM
4 users

frequency

time
TDM

frequency

time
Introduction 1-21

21

How do loss and delay occur?

packets queue in router buffers
 packet arrival rate to link (temporarily) exceeds output link
capacity
 packets queue, wait for turn
packet being transmitted (delay)

B
packets queueing (delay)
free (available) buffers: arriving packets
dropped (loss) if no free buffers

Introduction 1-22
11
22
 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-23

23

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 (~2x108 m/sec)
 dtrans = L/R dtrans and dprop  dprop = d/s
very different

Introduction 1-24
12
24
 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-25

25

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!

La/R -> 1
Introduction 1-26
13
26
 “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-27

27

“Real” Internet delays, 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
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
9 de2-1.de1.de.geant.net (62.40.96.129) 109 ms 102 ms 104 ms link
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 * * *
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-28
14
28
 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

Introduction 1-29

29

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-30
15
30
 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-31

31

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-32
16
32
 Protocol “layers”
Networks are complex,
with many “pieces”:
 hosts Question:
 routers is there any hope of
 links of various organizing structure of
media network?
 applications
 protocols …. or at least our
 hardware, discussion of networks?
software

Introduction 1-33

33

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
 layering considered harmful?

Introduction 1-34
17
34
 Internet protocol stack
 application: supporting network
applications
• FTP, SMTP, HTTP application
 transport: process-process data
transfer transport
• TCP, UDP
network
 network: routing of datagrams from
source to destination
link
• IP, routing protocols
 link: data transfer between physical
neighboring network elements
• Ethernet, 802.11 (WiFi), PPP
 physical: bits “on the wire”
Introduction 1-35

35

ISO/OSI reference model

 presentation: allow applications
to interpret meaning of data, application
e.g., encryption, compression,
machine-specific conventions presentation
 session: synchronization, session
checkpointing, recovery of data transport
exchange
network
 Internet stack “missing” these
layers! link
• these services, if needed, must be physical
implemented in application
• needed?

Introduction 1-36
18
36
 message M
source
application
Encapsulation
segment Ht M transport
datagram Hn Ht M network
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 H n Ht M link router
physical

Introduction 1-37

37

Network security
 field of network security:
• how bad guys can attack computer networks
• how we can defend networks against attacks
• how to design architectures that are immune to attacks
 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!

Introduction 1-38
19
38
 Bad guys: put malware into hosts via Internet
 malware can get in host from:
• virus: self-replicating infection by receiving/executing
object (e.g., e-mail attachment)
• worm: self-replicating infection by passively receiving
object that gets itself executed
 spyware malware can record keystrokes, web
sites visited, upload info to collection site
 infected host can be enrolled in botnet, used for
spam. DDoS attacks

Introduction 1-39

39

Bad guys: attack server, network infrastructure

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)
3. send packets to target from
compromised hosts
target

Introduction 1-40
20
40
 Bad guys can sniff packets
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

Introduction 1-41

41

Bad guys can use fake addresses

IP spoofing: send packet with false source address
A C

src:B dest:A payload

… lots more on security (throughout, Chapter 8)

Introduction 1-42
21
42