ET4230

MẠNG MÁY TÍNH

INTRODUCTION

HANOI UNIVERSITY OF SCIENCE AND TECHNOLOGY Smart Applications & Network System Laboratory
Add : Room 618, Ta Quang Buu Library
No.1 Dai Co Viet Road, Hanoi, Vietnam
TRAN QUANG VINH Mobile : (+84) 912 636 939
Email : vinh.tranquang1@hust.edu.vn
Ph.D., Assoc. Prof., Senior Lecturer m706501@shibaura-it.ac.jp
School of Electrical and Electronic Engineering Website : https://sanslab.vn
 Internet-connected devices

Tweet-a-watt:
monitor energy use

bikes

Pacemaker & Monitor

Amazon Echo Web-enabled toaster +

IP picture frame
weather forecaster
Internet
refrigerator
Slingbox: remote cars
control cable TV
Security Camera AR devices
sensorized, scooters
bed

Others?
mattress

Gaming devices
Internet phones Fitbit

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 2

 Chapter 1: roadmap
 What is Computer Network?
 Network edge
• End systems, access networks, links
 Network core
• Packet switching, circuit switching, network structure
 Delay, loss, throughput in networks
 Protocol layers, service models
 Networks under attack: security
 History

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 3

 ĐỊNH NGHĨA
 Mạng máy tính:
• thiết bị mạng (host, server, network devices)
• phương tiện truyền dẫn vật lý (transmission medium)
• kiến trúc mạng (network architecture)
̶ cấu trúc mạng (Topology)
̶ giao thức mạng (Protocols)

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 4

What’s the Internet: a component view
Billions of connected
computing devices: mobile network
 hosts = end systems national or global ISP
 running network
apps at Internet’s
“edge”

Packet switches: forward

packets (chunks of data) local or
 routers, switches Internet
regional ISP

Communication links
home network content
 fiber, copper, radio, provider
satellite network datacenter
network
 transmission rate:
bandwidth

Networks
enterprise
 collection of devices, network
routers, links: managed
by an organization

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 5

 What’s the Internet: a protocol view

mobile network
 Internet: “network of networks” 4G
national or global ISP
• Interconnected ISPs

 protocols are everywhere IP

Streaming
Skype video
• control sending, receiving of
messages local or
• e.g., HTTP (Web), streaming regional ISP
video, Skype, TCP, IP, WiFi, 4G,
Ethernet home network content
provider
HTTP network datacenter

 Internet standards Ethernet

network

• RFC: Request for Comments

TCP
• IETF: Internet Engineering enterprise
Task Force network

WiFi

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 6

 The Internet: a “services” view

 Infrastructure that provides

services to applications:
• Web, streaming video, multimedia mobile network

teleconferencing, email, games, e- national or global ISP

commerce, social media, inter-

connected appliances, … Streaming
Skype video

 provides programming interface to local or

regional
distributed applications: ISP
home network
• “hooks” allowing sending/receiving content
provider
apps to “connect” to, use Internet HTTP network datacenter
network
transport service
• provides service options, analogous to
postal service enterprise
network

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST

 What’s the Internet: goal
 Chia sẻ tài nguyên dùng chung
 Nâng cao độ tin cậy
 Môi trường giao tiếp người – máy
 Giảm chi phí đầu tư phần cứng
 Bảo đảm các tiêu chuẩn thống nhất về tính bảo mật, an toàn
dữ liệu

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 8

 Topology
 Kiểu điểm - điểm (Point to Point)

Các mạng có cấu trúc điểm - điểm (Star, Ring, Tree)

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 9

 Topology
 Kiểu đa điểm hay quảng bá (Point to Multipoint, Broadcasting)

Các mạng có cấu trúc quảng bá (Bus, Ring, and Satellite)

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 10

 What’s a protocol?

Human protocols: Network protocols:

 “what’s the time?”  computers (devices) rather than humans
 “I have a question”  all communication activity in Internet
governed by protocols
 introductions

Rules for:
… specific messages sent Protocols define the format, order of
… specific actions taken
messages sent and received among
when message received, network entities, and actions taken on
or other events message transmission, receipt

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST

 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://gaia.cs.umass.edu/kurose_ross
2:00
<file>
time

Q: other human protocols?

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST

 What’s a protocol?
 Chức năng giao thức
• Encapsulation
• Fragmentation
• Connection control
• Monitoring
• Flow control
• Error control
• Synchronization
• Addressing

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 13

 Chapter 1: roadmap
 What is Computer Network?
 Network edge
• End systems, access networks, links
 Network core
• Packet switching, circuit switching, network structure
 Delay, loss, throughput in networks
 Protocol layers, service models
 Networks under attack: security
 History

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 14

 A closer look at Internet structure
Network edge:
 hosts: clients and servers
 servers often in data centers
mobile network
national or global ISP

local or
regional
ISP
home network content
provider
network datacenter
network

enterprise
network

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 15

 A closer look at Internet structure
Network edge:
 hosts: clients and servers
 servers often in data centers
mobile network
national or global ISP

Access networks, physical

media:
wired, wireless communication
links local or
regional
ISP
home network content
provider
network datacenter
network

enterprise
network

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 16

 A closer look at Internet structure
Network edge:
 hosts: clients and servers
 servers often in data centers
mobile network
national or global ISP

Access networks, physical

media:
wired, wireless communication
links local or
regional
ISP
home network content
Network core: provider
network datacenter
network
 interconnected routers
 network of networks
enterprise
network

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 17

 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?

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 18

 Access networks: digital subscriber line (DSL)

central office telephone

network

DSL splitter
modem DSLAM

voice, data transmitted ISP

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
 24-52 Mbps dedicated downstream transmission rate
 3.5-16 Mbps dedicated upstream transmission rate

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 19

Access networks: cable-based access

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 (FDM): different channels transmitted in

different frequency bands

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 20

 Access networks: cable-based access

cable headend

cable splitter cable modem

modem CMTS termination system
data, TV transmitted at different
frequencies over shared cable ISP
distribution network

 HFC: hybrid fiber coax

• asymmetric: up to 40 Mbps – 1.2 Gbps downstream transmission rate, 30-100 Mbps
upstream transmission rate
 network of cable, fiber attaches homes to ISP router
• homes share access network to cable headend

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 21

 Access networks: home networks

Wireless and wired

devices

to/from headend or
central office
often combined
in single box

cable or DSL modem

WiFi wireless access router, firewall, NAT

point (54, 450
Mbps) wired Ethernet (1 Gbps)

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 22

 Wireless access networks

Shared wireless access network connects end system to router

 via base station aka “access point”

Wireless local area networks Wide-area cellular access networks

(WLANs)  provided by mobile, cellular network
 typically within or around operator (10’s km)
building (~100 ft)  10’s Mbps
 802.11b/g/n (WiFi): 11, 54, 450  4G cellular networks (5G coming)
Mbps transmission rate

to Internet
to Internet

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 23

 Access networks: enterprise networks

Enterprise link to
ISP (Internet)
institutional router
Ethernet institutional mail,
switch web servers

 companies, universities, etc.

 mix of wired, wireless link technologies, connecting a mix of switches
and routers (we’ll cover differences shortly)
 Ethernet: wired access at 100Mbps, 1Gbps, 10Gbps
 WiFi: wireless access points at 11, 54, 450 Mbps

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 24

 Access networks: data center networks
mobile network
 high-bandwidth links (10s to 100s national or global ISP
Gbps) connect hundreds to thousands
of servers together, and to Internet

local or
regional
ISP
home network content
provider
network datacenter
network

Courtesy: Massachusetts Green High Performance Computing enterprise

Center (mghpcc.org) network

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 25

 Host: sends packets of data

host sending function:

 takes application message
 breaks into smaller chunks, two packets,
known as packets, of length L bits L bits each

 transmits packet into access

network at transmission rate R 2 1

• link transmission rate, aka link host

capacity, aka link bandwidth R: link transmission rate

packet time needed to L (bits)

transmission = transmit L-bit =
delay packet into link R (bits/sec)

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 26

 Links: physical media

 bit: propagates between Twisted pair (TP)

transmitter/receiver pairs
 two insulated copper wires
 physical link: what lies • Category 5: 100 Mbps, 1 Gbps Ethernet
between transmitter & • Category 6: 10Gbps Ethernet
receiver
 guided media:
• signals propagate in solid
media: copper, fiber, coax
 unguided media:
• signals propagate freely,
e.g., radio

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 27

 Links: physical media

Coaxial cable: Fiber optic cable:

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

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 28

 Links: physical media

Wireless radio Radio link types:

 signal carried in various  Wireless LAN (WiFi)
“bands” in electromagnetic • 10-100’s Mbps; 10’s of meters
spectrum  wide-area (e.g., 4G cellular)
 no physical “wire” • 10’s Mbps over ~10 Km
 broadcast, “half-duplex”  Bluetooth: cable replacement
(sender to receiver) • short distances, limited rates
 propagation environment  terrestrial microwave
effects:
• point-to-point; 45 Mbps channels
• reflection
• obstruction by objects  satellite
• Interference/noise • up to 45 Mbps per channel
• 270 msec end-end delay

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 29

 Chapter 1: roadmap
 What is Computer Network?
 Network edge
• End systems, access networks, links
 Network core
• Packet switching, circuit switching, network structure
 Delay, loss, throughput in networks
 Protocol layers, service models
 Networks under attack: security
 History

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 30

 The network core
mobile network
 mesh of interconnected routers national or global ISP

 packet-switching: hosts break

application-layer messages into
packets
• network forwards packets from local or
regional
ISP
one router to the next, across links home network content
on path from source to destination provider
network datacenter
network

enterprise
network

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 31

 Two key network-core functions

routing Routing:
algorithm
Forwarding: local forwarding table
 global action:
 aka “switching” header output determine source-
 local action: move value
0100
0101
3 link
2 destination paths
arriving packets 0111 2
taken by packets
from router’s input 1001 1

link to appropriate  routing algorithms

router output link
1

3 2

destination address in arriving

packet’s header

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 32

Two key network-core functions

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 33

 Two key network-core functions

forwarding
forwarding

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 34

 Packet-switching: store-and-forward

L bits
per packet
3 2 1
source destination
R bps R bps

 packet transmission delay: takes L/R One-hop numerical example:

seconds to transmit (push out) L-bit packet  L = 10 Kbits
into link at R bps  R = 100 Mbps
 store and forward: entire packet must arrive  one-hop transmission delay
= 0.1 msec
at router before it can be transmitted on next
link

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 35

 Packet-switching: queueing

R = 100 Mb/s
A C

D
B R = 1.5 Mb/s
E
queue of packets
waiting for transmission
over output link

Queueing occurs when work arrives faster than it can be serviced:

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 36

 Packet-switching: queueing

R = 100 Mb/s
A C

D
B R = 1.5 Mb/s
E
queue of packets
waiting for transmission
over output link

Packet queuing and loss: if arrival rate (in bps) to link

exceeds transmission rate (bps) of link for some period of
time:
 packets will queue, waiting to be transmitted on output link
 packets can be dropped (lost) if memory (buffer) in router
fills up

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 37

 Alternative to packet switching: circuit switching
end-end resources allocated to,
reserved for “call” between source and
destination
 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

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 38

 Circuit switching: FDM and TDM

Frequency Division
4 users
Multiplexing (FDM)

frequency
 optical, electromagnetic
frequencies divided into (narrow)
frequency bands
 each call allocated its own band, can time
transmit at max rate of that narrow
band
Time Division Multiplexing (TDM)

frequency
 time divided into slots
 each call allocated periodic slot(s),
can transmit at maximum rate of time
(wider) frequency band (only) during
its time slot(s)

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 39

 Packet switching versus circuit switching

example:
 1 Gb/s link
N
 each user: users 1 Gbps link
• 100 Mb/s when “active”
• active 10% of time

Q: how many users can use this network under circuit-switching and packet switching?

 circuit-switching: 10 users
 packet switching: with 35 users, Q: how did we get value 0.0004?
probability > 10 active at same time
is less than .0004 *
A: HW problem (for those with
course in probability only)

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 40

 Packet switching versus circuit switching

Is packet switching a “slam dunk winner”?

 great for “bursty” data – sometimes has data to send, but at other times not
• resource sharing
• simpler, no call setup
 excessive congestion possible: packet delay and loss due to buffer overflow
• protocols needed for reliable data transfer, congestion control
 Q: How to provide circuit-like behavior with packet-switching?
• “It’s complicated.” We’ll study various techniques that try to make packet
switching as “circuit-like” as possible.

Q: human analogies of reserved resources (circuit switching) versus

on-demand allocation (packet switching)?

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 41

 Phân loại mạng máy tính
 Theo khoảng cách
• Mạng cục bộ LAN (Local Area Networks)

Cấu trúc mạng hình BUS

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 42
 Phân loại mạng máy tính
 Theo khoảng cách
• Mạng cục bộ LAN (Local Area Networks)

Cấu trúc mạng hình RING

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 43

 Phân loại mạng máy tính
 Theo khoảng cách
• Mạng cục bộ LAN (Local Area Networks)

Cấu trúc mạng hình sao

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 44

 Phân loại mạng máy tính
 Theo khoảng cách
• Mạng đô thị MAN (Metropolitan Area Networks)

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 45

 Phân loại mạng máy tính
 Theo khoảng cách
• Mạng diện rộng WAN (Wide Area Networks)

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 46

 Phân loại mạng máy tính
 Phân loại theo cơ chế chuyển mạch
• Mạng chuyển mạch kênh (Circuit Switched Networks)

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 47

 Phân loại mạng máy tính
 Phân loại theo cơ chế chuyển mạch
• Mạng chuyển mạch thông báo (message-switched network)

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 48

 Phân loại mạng máy tính
 Phân loại theo cơ chế chuyển mạch
• Mạng chuyển mạch gói (Packet Switched Networks)

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 49

 Phân loại mạng máy tính
 Phân loại theo cơ chế chuyển mạch
• Mạng chuyển mạch gói (Packet Switched Networks)

t1
A s

t 2 “Store-and-Forward” at each Router

s

R1
t1 t3
min(d e 2 e ) = ∑i =1 (t pi + t si )
n
p
s

R2
t2
p
t4
s

R3
t3
B
p

t p4

ts1
A tq1

ts2
R1
d e 2 e = ∑i =1 (t pi + t si + t qi )
tp1
tq2
ts3 n
R2
tp2 ts4
R3
tp3
B Trong điều kiện tải cao, các gói đi vào nút
tp4 mạng phải đợi trong hàng đợi trước khi được
gửi ra đầu ra
Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 50
 Phân loại mạng máy tính
 Phân loại theo cơ chế chuyển mạch
• So sánh các cơ chế chuyển mạch (bài tập)

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 51

 Phân loại mạng máy tính
 Phân loại theo mô hình xử lý dữ liệu
• Mô hình Client-Server

Mô hình chủ /khách (Client / Server)

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 52

 Phân loại mạng máy tính
 Phân loại theo mô hình xử lý dữ liệu
• Mô hình Client-Server

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 53

 Phân loại mạng máy tính
 Phân loại theo mô hình xử lý dữ liệu
• Mô hình Client-Server

Mô hình Client-Server nhiều lớp

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 54

 Phân loại mạng máy tính
 Phân loại theo mô hình xử lý dữ liệu
• Mô hình ngang hàng (Peer-to-Peer)

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 55

 Kích cỡ mạng

WAN
3GPP 3G, LTE
IEEE 802.20
ATM

MAN ETSI HIPERMAN

IEEE 802.4,6,16 & HIPER ACCESS

IEEE LAN ETSI

802.3,5,11 HIPERLAN

PAN (<10m)
(IEEE802.15,
ETSI HIPER PAN)

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 56

 Một số mạng điển hình

 IEEE 802
• IEEE 802.3: Chuẩn mạng LAN/MAN – Ethernet
• IEEE 802.4: Chuẩn mạng LAN – Token Bus, chủ yếu được sử
dụng trong công nghiệp)

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 57

 Một số mạng điển hình

 IEEE 802
• IEEE 802.5: chuẩn mạng LAN – Token Ring được phát triển bởi
IBM
• IEEE 802.6: chuẩn mạng MAN – DQDB (Distributed Queue Dual
Bus) với tốc độ 150Mbit/s trên khoảng cách 160km

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 58

 Một số mạng điển hình

 IEEE 802
• IEEE 802.11: chuẩn mạng LAN không dây
• IEEE 802.15: chuẩn mạng cá nhân không dây (Wireless Personal Area
Network - WPAN)
̶ IEEE 802.15.1: BlueTooth
̶ IEEE 802.15.3: High rate WPAN (11 – 55Mbit/s): sử dụng cho các ứng dụng
multimedia
̶ IEEE 802.15.4: Low rate WPAN/ZigBee: cho các ứng dụng tiêu thụ ít năng lượng,
tốc độ thấp (Wireless Sensor Network)

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 59

 Một số mạng điển hình

 IEEE 802
• IEEE 802.16: Chuẩn mạng WMAN – WiMAX
̶ IEEE 802.16-2004: WiMAX cố định
̶ IEEE 802.16e-2005: WiMAX di động
• IEEE 802.20: WWAN – Mobile Broadband Wireless Access
(MBWA), tầm phủ sóng lớn hơn WiMAX (< 15km)

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 60

 Một số mạng điển hình

 3GPP
• 3G/HSPA (High Speed Packet Access)
• LTE (Long Term Evolution)
 ATM Forum
• ATM

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 61

 Internet structure: a “network of networks”
mobile network
 hosts connect to Internet via national or global ISP
access Internet Service Providers
(ISPs)
 access ISPs in turn must be
interconnected local or
regional
ISP
̶ so that any two hosts (anywhere!)
can send packets to each other home network content
provider
 resulting network of networks is network datacenter
network

very complex enterprise

̶ evolution driven by economics, network

national policies

Let’s take a stepwise approach to describe current Internet structure

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 62

 Internet structure: a “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

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 63

 Internet structure: a “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

connecting each access ISP to

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

access
net
access
net

access
net
access
net
access access
net access net
net

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 64

Internet structure: a “network of networks”
Option: connect each access ISP to one 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

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 65

Internet structure: a “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

ISP A
access net
net

access
net
ISP B access
net

access ISP C
net
access
net

access
net
access
net
access access
net access net
net

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 66

Internet structure: a “network of networks”

But if one global ISP is viable business, there will be competitors …. who will
want to be connected
Internet exchange point
access access
net net
access
net
access
access net
net
IXP access

ISP A
access net
net

access
net
IXP ISP B access
net

access ISP C
net
access
net

access
net
peering link
access
net
access access
net access net
net

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 67

Internet structure: a “network of networks”

… and regional networks may arise to connect access nets to ISPs

access access
net net
access
net
access
access net
net
IXP access

ISP A
access net
net

access
net
IXP ISP B access
net

access ISP C
net
access
net

access
net regional ISP access
net
access access
net access net
net

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 68

 Internet structure: a “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
IXP access

ISP A
access net
net

Content provider network

access
net
IXP ISP B access
net

access ISP C
net
access
net

access
net regional ISP access
net
access access
net access net
net

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 69

 Internet structure: a “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 networks (e.g., Google, Facebook): private network that connects its
data centers to Internet, often bypassing tier-1, regional ISPs

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 70

 Chapter 1: roadmap
 What is Computer Network?
 Network edge
• End systems, access networks, links
 Network core
• Packet switching, circuit switching, network structure
 Delay, loss, throughput in networks
 Protocol layers, service models
 Networks under attack: security
 History

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 71

 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

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 72

 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

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 73

 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

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 74

 Caravan analogy

100 km 100 km

ten-car caravan toll booth toll booth toll booth

(aka 10-bit (aka link)
packet)
 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

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 75

 Caravan analogy

100 km 100 km

ten-car caravan toll booth toll booth

(aka 10-bit (aka router)
packet)

 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

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 76

 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

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 77

 “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

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 78

 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 looks like delays
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 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

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 79

 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

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 80

 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
Rsfluid
bits/sec
at rate Rfluid
c bits/sec
at rate
serverserver,
sendswith
bits
(fluid) (Rs bits/sec) (Rc bits/sec)
fileinto
of Fpipe
bits
to send to client

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 81

 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

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 82

 Throughput: network scenario

 per-connection end-
Rs end 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

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 83

 Chapter 1: roadmap
 What is Computer Network?
 Network edge
• End systems, access networks, links
 Network core
• Packet switching, circuit switching, network structure
 Delay, loss, throughput in networks
 Protocol layers, service models
 Networks under attack: security
 History

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 84

 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

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 85

 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

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 86

 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

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 87

 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

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 88

 OSI Model
 ISO (International standard Organization) tổ chức tiêu chuẩn
hóa Quốc tế đề xuất mô hình tham chiếu cho việc kết nối các
hệ thống mở (Open System Interconnection -OSI model)
(It was first introduced in the late 1970s).
 An open system is a model that allows any two different
systems to communicate regardless of their underlying
architecture (hardware or software).
 The OSI model is not a protocol; it is model for understanding
and designing a network architecture that is flexible, robust
and interoperable.

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 89

 OSI Model
 The OSI model is a layered framework for the design of network
systems that allows for communication across all types of computer
systems.
 The OSI model is built of seven ordered layers:
• (layer 1) physical layer
• (layer 2) data link
• (layer 3) network layer
• (layer 4) transport layer
• (layer 5) session layer
• (layer 6) presentation layer
• (layer 7) application layer

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 90

 OSI Model
• Layer x on one machine communicates with layer x on another
machine - called Peer-to-Peer Processes.
• Interfaces between Layers
Each interface defines what information and services a layer must
provide for the layer above it
• Organizations of the layers
 Network support layers : Layers 1, 2, 3
 User support layer : Layer 5, 6, 7
 It allows interoperability among unrelated software systems
 Transport layer (Layer 4) : links the two subgroups

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 91

 OSI Model

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 92

 OSI Model
 The data portion of a packet at level N-1 carries the whole packet
from level N. – The concept is called encapsulation

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 93

 Physical Layer
 The physical layer coordinates the functions required to transmit a
bit stream over a physical medium. It also defines the procedures
and functions that physical devices and interfaces have to perform
for transmission occur

The physical layer is responsible for transmitting individual bits from one node to the
next.

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 94

 Physical Layer
 Physical characteristics of interfaces and media:
• defines the characteristics of the interface between devices and the
transmission media, including its type.
 Representation of the bits:
• consist of a stream of bits without any interpretation. To be transmitted,
bits must be encoded into signals – electrical or optical-. The physical
layer defines the type of encoding.
 Data rate:
• defines the transmission rate, the number of bits sent each second.
 Line configuration:
• concerned with the connection of devices to the medium.
 Physical topology
 Transmission Mode

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 95

 Data Link Layer
 The data link layer transforms the physical layer, a raw transmission
facility, to a reliable link and is responsible for node-to-node delivery.
It makes the physical layer appear error free to the upper layer
(network layer)

The data link layer is responsible for reliable transmitting

frames from one hop (node) to the next

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 96

 Data Link Layer

Hop-to-hop (node-to-node) delivery

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 97

 Data Link Layer: Functions
 Framing
• The data link layer divides the stream of bits received from the network
layer into data units called frames.
 Physical addressing
• If frames are to be distributed to different systems on the network, the
data link layer adds a header to the frame to define the physical address
of the sender (source address) and/or receiver (destination address) of
the frame.
• If the frame is intended for a system outside the sender’s network, the
receiver address is the address of the device that connects one network
to the next

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 98

 Data Link Layer: Functions
 Flow Control
• If the rate at which the data are absorbed by the receiver is less than the
rate produced in the sender, the data link layer imposes a flow control
mechanism to prevent overwhelming the receiver.
 Error control
• The data link layer adds reliability to the physical layer by adding
mechanisms to detect and retransmit damaged or lost frames. Error
control is normally achieved through a trailer to the end of the frame.
 Access Control
• When two or more devices are connected to the same link, data link layer
protocols are necessary to determine which device has control over the
link at any time

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 99

 Network Layer
 The Network layer is responsible for the source-to-destination
delivery of a packet possible across multiple networks.
 If two systems are connected to the same link, there is usually no
need for a network layer. However, if the two systems are attached
to different networks, there is often a need for the network layer to
accomplish source-to-destination delivery

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 100

 Network Layer

Source-to-destination delivery: The network layer is responsible for the delivery of

packets from the original source to the final destination.

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 101

 Network Layer: Functions
 Logical addressing
• The physical addressing implemented by the data link layer handles the
addressing problem locally.
• The network layer adds a header to the packet coming from the upper
layer, among other things, includes the logical address of the sender and
receiver
 Routing
• When independent networks or links are connected together to create an
internetwork (a network of networks) or a large network, the connecting
devices (called routers or gateways) route or switch the packets to their
final destination

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 102

 Transport Layer
 The transport layer is responsible for process-to-process delivery of
the entire message
• The network layer oversees host-to-destination delivery of individual
packets, it does not recognize any relationship between those packets
• ensures that the whole message arrives intact and in order, overseeing
both error control and flow control at the process-to-process level

The transport layer is responsible for delivery of a message from

one process to another
Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 103
 Transport Layer: Functions
 Port addressing
• computer often run several processes (running programs) at the same
time. Process-to-process delivery means delivery from a specific process
on one computer to a specific process on the other
• The transport layer header include a type of address called port address
• The network layer gets each packet to the correct computer; the
transport layer gets the entire message to the correct process on that
computer

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 104

 Transport Layer: Functions
 Segmentation and reassembly
• a message is divided into transmittable segments, each having a
sequence number. These numbers enable the transport layer to
reassemble the message correctly upon arrival at the destination.
 Connection control
• The transport layer can be either connectionless or connection-oriented
• A connectionless transport layer treats each segment as an independent
packet and delivers it to the transport layer at the destination machine.
• A connection-oriented transport layer makes a connection with the
transport layer at the destination machine first before delivering the
packets. After all the data are transferred, the connection is terminated
 Flow control
• the transport layer performs a flow control end to end. The data link layer
performs flow control across a single link.
 Error control
• the transport layer performs error control end to end. The data link layer
performs control across a single link

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 105

 Session Layer
 The session layer is the network dialog controller. It was designed
to establish, maintain, and synchronize the interaction between
communicating devices

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 106

 Presentation Layer
 The presentation layer was designed to handle the syntax and
semantics of the information exchanged between the two systems.
It was designed for data translation, encryption, decryption, and
compression

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 107

 Application Layer
 The application layer enables the user to access the network. It
provides user interfaces and support for services such electronic
email, remote file access, WWW, and so on.

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 108

Internet Model (TCP/IP)

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 109

 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
network
• IP, routing protocols
link
 link: data transfer between neighboring
network elements physical
• Ethernet, 802.11 (WiFi), PPP
 physical: bits “on the wire”

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 110

 Services, Layering and Encapsulation

M
application Application exchanges messages to implement some application
application service using services of transport layer
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
link transport layer-layer header Ht to create a link
transport-layer segment
• Ht used by transport layer protocol to
physical implement its service physical

source destination

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 111

 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
network Hn Ht M network
Network-layer protocol transfers transport-layer segment
[Ht | M] from one host to another, using link layer services
link link
 network-layer protocol encapsulates
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

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 112

 Services, Layering and Encapsulation

M
application application
Ht M
transport transport

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

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 113

 Services, Layering and Encapsulation

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

link Hl Hn Ht M Hl Hn Ht M
link
frame

physical physical

source destination

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 114

 Encapsulation: an end-end view

source
message M applicatio
segment Ht M n
datagram Hn Ht M transport
frame Hl Hn Ht M network
link
physical
link
physical

switch

destination Hn Ht M network
M applicatio Hl Hn Ht M link Hn Ht M
Ht M n physical
Hn Ht M transport
Hl Hn Ht M network router
link
physical

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 115

Summary of Layer’s Duties

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 116

 IEEE 802

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 117

 Chapter 1: roadmap
 What is Computer Network?
 Network edge
• End systems, access networks, links
 Network core
• Packet switching, circuit switching, network structure
 Delay, loss, throughput in networks
 Protocol layers, service models
 Networks under attack: security
 History

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 118

 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

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 119

 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

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 120

 Bad guys: fake identity
IP spoofing: injection of packet with false source address

A C

src:B dest:A
payload
B

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 121

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

from compromised
hosts

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 122

 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

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 123

 Chapter 1: roadmap
 What is Computer Network?
 Network edge
• End systems, access networks, links
 Network core
• Packet switching, circuit switching, network structure
 Delay, loss, throughput in networks
 Protocol layers, service models
 Networks under attack: security
 History

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 124

 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

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 125

 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

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 126

 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

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 127

 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]
• HTML, HTTP: Berners-Lee  backbone links running at Gbps
• 1994: Mosaic, later Netscape
• late 1990s: commercialization of the
Web

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 128

 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)
 ~18B devices attached to Internet (2017)

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 129

 Internet history
 Phát triển Internet ở Việt Nam

https://vi.wikipedia.org/wiki/Internet_tại_Việt_Nam

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 130

 Internet history
 Thị phần thuê bao dịch vụ truy cập Internet của các doanh
nghiệp (tính đến tháng 12/2010)

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 131

 Chapter 1: summary
We’ve covered a “ton” of material!
 Internet overview
 what’s a protocol? You now have:
 network edge, access network, core
• packet-switching versus circuit-  context, overview,
switching vocabulary, “feel”
• Internet structure of networking
 performance: loss, delay, throughput
 more depth,
 layering, service models detail, and fun to
 security follow!
 history

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 132

 Wireshark

application
(www browser,
packet
email client)
analyzer
application

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

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 133

 Bài tập
Bài tập 1
Cần gửi một bản tin x bits qua một đường truyền gồm k chặng qua
mạng chuyển mạch kênh và mạng chuyển mạch gói (trong điều kiện tải
nhẹ). Thời gian chuyển mạch là s giây, trễ truyền lan là d giây mỗi
chặng, kích thước gói tin: p bits, tốc độ truyền dữ liệu: b (bps).
a) So sánh thời gian trễ tối thiểu trong 2 trường hợp chuyển mạch kênh
và chuyển mạch gói?
b) Trong điều kiện nào thì mạng chuyển mạch gói có độ trễ nhỏ hơn?

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 134

 Bài tập
Bài tập 2
Suppose that x bits of user data are to be transmitted over a k-hop
path in a packet-switched network as a series of packets, each
containing p data bits and h header bits, with x >> (p + h). The bit rate
of the lines is b bps and the propagation delay is negligible. What
value of p minimizes the total delay?

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 136

 Introduction and Fundamentals

1. Host A cần truyền một file có kích thước lớn đến host B. Đường truyền từ A đến B đi qua 3
chặng có tốc độ lần lượt là R1=100 kbps, R2=1 Mbps, R3=5 Mbps. Giả thiết không có lưu
lượng nào khác trên mạng, tính thông lượng của quá trình truyền file.
A) 1 Mbps
B) 100 kbps
C) 5 Mbps
D) không đáp án nào thỏa mãn
2. Khi đi qua các nút mạng, các gói tin có thể bị thay đổi kích thước vì:
A) mỗi mạng riêng biệt có một gói kích thước tối thiểu
B) mỗi mạng riêng biệt có một gói kích thước tối đa
C) một gói tin phải đi qua ít nhất 10 mạng
D) một số lượng nhất định các gói tin phải đi qua mỗi mạng
3. Loại hình kết nối truyền thông nào yêu cầu tầm nhìn thẳng và không ngắt quãng ?
A) cáp sợi quang
B) truyền thông hồng ngoại
C) truyền thông vô tuyến
D) kết nối token-ring

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 137

 Introduction and Fundamentals

4. Trong các loại trễ sau, trễ nào phụ thuộc vào kích thước gói ?
A) Trễ lan truyền
B) Trễ hàng đợi
C) Trễ phục vụ gói
D) Trễ xử lý header gói
5. Trong các loại trễ sau, trễ nào phụ thuộc vào kích thước mạng ?
A) Trễ lan truyền
B) Trễ hàng đợi
C) Trễ phục vụ gói
D) Trễ xử lý header gói
6. Trong mạng Ethernet, làm thế nào để một thiết bị xác định được một frame không phải được
gửi đến cho nó ?
A) Thiết bị đọc frame thu được
B) Mỗi thiết bị chỉ có khả năng đọc được frame gửi riêng cho nó
C) Mỗi thiết bị được cung cấp một mã mã hóa cho phép nó đọc các frame được gửi riêng cho nó
D) Thiết bị chỉ đọc các frame có địa chỉ đích trùng với địa chỉ của nó và bỏ qua các frame khác

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 138

 Introduction and Fundamentals

7. Xét hai host A và B cách nhau m mét, được kết nối với nhau bởi một link có tốc độ R (bps), tốc độ truyền lan
trên link là s (m/s), host A cần gửi một gói tin có kích thước L bít đến host B. Giả thiết host A bắt đầu truyền gói
tin đi tại thời điểm t=0, tại thời điểm t=d_trans bít cuối cùng của gói tin đang ở đâu?
A) Vẫn ở host A
B) Vừa rời host A
C) Vừa đến host B
D) Vẫn trên đường truyền
8. Xét hai host A và B cách nhau m mét, được kết nối với nhau bởi một link có tốc độ R (bps), tốc độ truyền lan
trên link là s (m/s), host A cần gửi một gói tin có kích thước L bít đến host B. Giả thiết dprop lớn hơn dtrans, Tại
thời điểm t= d_trans, bít đầu tiên của gói tin nằm ở đâu?
A) Vẫn ở host A
B) Vừa rời host A
C) Vừa đến host B
D) Vẫn trên đường truyền
9. Xét hai host A và B cách nhau m mét, được kết nối với nhau bởi một link có tốc độ R (bps), tốc độ truyền lan
trên link là s (m/s), host A cần gửi một gói tin có kích thước L bít đến host B. Giả thiết dprop nhỏ hơn dtrans,
Tại thời điểm t= d_trans, bít đầu tiên của gói tin nằm ở đâu?
A) Vẫn ở host A
B) Vừa rời host A
C) Vừa đến host B
D) Vẫn trên đường truyền

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 139

 Protocol and Topology

Để vận chuyển một bản tin đến đúng ứng dụng trên một host, địa chỉ nào sau đây được sử dụng
?
A) địa chỉ cổng
B) địa chỉ logic
C) địa chỉ vật lý
D) không đáp án nào thỏa mãn
Khái niệm ______ chỉ sự sắp xếp vật lý của một mạng.
A) Data flow
B) Mode of operation
C) Topology
D) None of the above
Khái niệm _______ để chỉ hai tính chất: khi nào dữ liệu có thể được truyền đi và tốc độ mà nó có
thể được truyền.
A) Semantics
B) Syntax
C) Timing
D) none of the above

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 140

 Protocol and Topology
Khái niệm ________ là một tập hợp các quy tắc điều chỉnh việc giao tiếp dữ liệu.
A) forum
B) protocol
C) standard
D) none of the above

Khái niệm nào sau đây chỉ bộ các quy tắc cho phép trao đổi thông tin có thứ tự?
A) Network
B) Hardware
C) Operating System
D) Protocol

Khái niệm nào sau đây định nghĩa khuôn dạng và thứ tự các bản tin trao đổi giữa 2 thiết bị truyền thông?
A) Frame
B) Packet
C) Protocol
D) Header

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 141

 Protocol and Topology
Khi gói dữ liệu chuyển từ lớp dưới lên lớp trên, phần tiêu đề được _______.
A) Added
B) Removed
C) Rearranged
D) Modified

Khi gói dữ liệu chuyển từ lớp trên xuống lớp dưới, phần tiêu đề được _______.
A) Added
B) Removed
C) Rearranged
D) Modified

Khi một host trong mạng A gửi một bản tin đến một host trong mạng B, địa chỉ nào router cần dùng đến ?
A) đia chỉ cổng
B) địa chỉ logic
C) địa chỉ vật lý
D) không đáp án nào thỏa mãn

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 142

 Protocol and Topology

What service is provided by the Link layer to the Network layer?

A) Next hop delivery
B) Framing
C) Error Control
D) Flow Control

When data are transmitted from device A to device B, the header from A's layer 4 is read by B's _______
layer.
A) Physical
B) Transport
C) Application
D) None of the above

When data are transmitted from device A to device B, the header from A's layer 4 is read by B's _______
layer.
A) Physical
B) Transport
C) Application
D) None of the above

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 143

 OSI and Internet Models

Các giao thức nào sau đây phải thiết lập kết nối trước khi truyền dữ liệu
A) Giao thức lớp liên kết dữ liệu
B) Giao thức lớp mạng
C) Giao thức tầng giao vận
D) Giao thức định tuyến

Dịch vụ nào được cung cấp bởi Link layer cho Network layer?
A) Next hop delivery
B) Framing
C) Error Control
D) Flow Control

Dữ liệu được chuyển thành các đoạn (segment) tại lớp nào dưới đây?
A) Ứng dụng
B) Truyền tải
C) Mạng
D) Liên kết dữ liệu

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 144

 OSI and Internet Models

Đâu là thứ tự đúng của đơn vị dữ liệu trong bộ giao thức TCP/IP khi chuyển từ lớp 1 lên lớp 7
theo mô hình OSI?
A) bits, segments, frames, packets, data;
B) bits, frames, packets, segments, data;
C) bits, frames, segments, packets, data;
D) bits, packets, frames, segments, data.

Để chuyển một bản tin đến đúng một trình ứng dụng đang chạy trên một host, địa chỉ ______
phải được sử dụng.
A) port
B) IP
C) physical
D) none of the above

HTTP thuộc lớp nào trong mô hình OSI?

A) Transfort layer
B) Application layer
C) Data link layer
D) Network layer

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 145

 OSI and Internet Models

Lớp _______ là lớp gần nhất với môi trường truyền dẫn.
A) Physical
B) Data link
C) Network
D) Transport

Lớp _________ chịu trách nhiệm vận chuyển một bản tin từ tiến trình này đến tiến trình khác.
A) physical
B) transport
C) network
D) none of the above

Lớp nào chịu trách nhiệm vận chuyển các frames từ một nút (hop) đến nút tiếp theo (next hop)?
A) physical
B) data link
C) transport
D) không đáp án nào thỏa mãn

Computer Network @ 2024 TRAN-QUANG VINH ◦ HUST 146