Chapter 1: outline

Chapter 1 1.1. Basic concepts

Introduction 1.1.1. The Internet
1.1.2. Protocol
1.1.3. The network edge: access networks, physical media
A note on the use of these PowerPoint slides:
We’re making these slides freely available to all (faculty,
1.1.4. The network core: packet switching, circuit switching,
students, readers). They’re in PowerPoint form so you see the
animations; and can add, modify, and delete slides (including
internet structure
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 1.2. Delay, Packet loss and Throughput
the following:
 If you use these slides (e.g., in a class) that you mention 1.3. Protocol layers and Service models
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
Computer Networking: A 1.3.1. Layered architecture
are adapted from (or perhaps identical to) our slides, and
note our copyright of this material. Top-Down Approach 1.3.2. Data encapsulation
8th edition
For a revision history, see the slide note for this page. Jim Kurose, Keith Ross 1.4. Network security
Thanks and enjoy! JFK/KWR
Pearson, 2020
1.5. History
All material copyright 1996-2023
J.F Kurose and K.W. Ross, All Rights Reserved

1-2

The Internet Several internet appliances

PC  billionsof connected mobile network
server computing devices:
wireless  hosts = end systems national/global ISP
laptop
 running network
smartphone Slingbox: watch,
applications Tweet-a-watt:
home control cable TV Web-enabled
network Internet phones remotely monitor
toaster +
 Communication links local/regional ISP energy use
weather
wireless
links
 fiber, copper, radio, forecaster

wired
satellite
links  transmission rate:
bandwidth

 Packet switches: forward IP picture frame

router
packets (chunks of data) enterprise
cars [Link] Security Camera
 routers and switches network
switch Internet
refrigerator
1-3 1-4
The Internet The Internet
mobile network
mobile network  Infrastructure that provides
 Internet: “network of networks” services to applications: national/global ISP
 Interconnected ISPs national/global ISP  Web, VoIP, email, games,
 protocols control sending, e-commerce, social
receiving of messages home
home networks, inter-connected network
 e.g., TCP, IP, HTTP, Skype, network appliances,… local/regional ISP
local/regional ISP
802.11
 provides programming
 Internet standards interface to applications
 RFC: Request for comments  allow sending and receiving
 IETF: Internet Engineering Task application programs to
Force connect to Internet
 provides service options for enterprise
enterprise network
network sending and receiving of
messages
1-5 1-6

Protocol Protocol

human protocols: network protocols: a human protocol and a computer network protocol:
 “what’s the time?”  computers (devices)
 “I have a question” rather than humans
 introductions  all communication activity Hi TCP connection
in Internet governed by request
protocols Hi TCP connection
response
Rules for: Got the
protocols define format, order of time? Get [Link]
… specific msgs sent
messages sent and received 2:00
… specific actions taken <file>
when message among network entities, and
time
received, or other actions taken on message
events transmission, receipt
Q: other human protocols?
1-7 1-8
Chapter 1: outline Look at network structure
mobile network
1.1. Basic concepts
1.1.1. The Internet  network edge:
national/global ISP
1.1.2. Protocol  hosts: clients and servers
1.1.3. The network edge: access networks, physical media  servers often in data
1.1.4. The network core: packet switching, circuit switching, centers home
network
internet structure local/regional ISP
 access networks, physical
1.2. Delay, Packet loss and Throughput media: wired, wireless
1.3. Protocol layers and Service models communication links
1.3.1. Layered architecture
1.3.2. Data encapsulation  network core:
1.4. Network security  interconnected routers

1.5. History  network of networks enterprise

network

1-9 1-10

Access networks and physical media Access network: digital subscriber line (DSL)

central office telephone

Q: How to connect end network
systems to edge router?
 residential access nets DSL splitter
modem DSLAM
 enterprise access networks
(school, company) ISP
voice, data transmitted
 mobile access networks at different frequencies over DSL access
dedicated line to central office multiplexer
(WiFi, 4G/5G)
Keep in mind:  use existing telephone line to central office DSLAM
 bandwidth (bits per second)  data over DSL phone line goes to Internet
of access network?  voice over DSL phone line goes to telephone network
 shared or dedicated?  24-52 Mbps dedicated downstream transmission rate
 3.5-16 Mbps dedicated upstream transmission rate
1-11 1-12
 Access network: cable-based access Access network: cable-based access

cable headend cable headend

… …

cable splitter cable splitter cable modem

modem modem CMTS termination system

data, TV transmitted at different

frequencies over shared cable ISP
distribution network
C
O
V V V V V V N
I I I I I I D D T
D
E
D
E
D
E
D
E
D
E
D
E
A
T
A R
T O
 HFC: hybrid fiber coax
O O O O O O A A L
 asymmetric: up to 40 Mbps – 1.2 Gbps downstream transmission
5 6 7 8 9
1 2 3 4
rate, 30-100 Mbps upstream transmission rate
Channels
 network of cable, fiber attaches homes to ISP router
frequency division multiplexing: different channels  homes share access network to cable headend
transmitted in different frequency bands  unlike DSL, which has dedicated access to central office
1-13 1-14

Access networks: home networks Access networks: Enterprise networks

Wireless and wired
devices

Enterprise link to
ISP (Internet)
Enterprise router
to/from headend or
central office Ethernet Enterprise mail,
often combined switch
in single box web servers

cable or DSL modem  typically used in companies, universities, etc.

WiFi wireless access router, firewall, NAT  mix of wired, wireless link technologies, connecting a mix of
point (54, 450 Mbps) switches and routers:
wired Ethernet (1 Gbps)
 Ethernet: wired access at 100Mbps, 1Gbps, 10Gbps
 WiFi: wireless access points at 11, 54, 450 Mbps
1-15 1-16
Wireless access networks Host: sends packets of data
 shared wireless access network connects end system to router host sending function:
 via base station aka “access point”  takes application message
 breaks into smaller two packets,
wireless LANs: wide-area wireless access chunks, known as L bits each
 within building (100 ft)  provided by mobile, cellular packets, of length L bits
 802.11b/g/n (WiFi): 11, 54, network operator (10 km)
450 Mbps transmission rate
 transmits packet into
 10 Mbps 2 1
access network at
 4G, 5G cellular networks R: link transmission rate
transmission rate R
host
 link transmission rate, aka
link capacity, aka link
bandwidth

to Internet packet time needed to L (bits)

transmission = transmit L-bit =
delay packet into link R (bits/sec)
to Internet
1-17 1-18

Links: Physical media Links: Physical media

coaxial cable: fiber optic cable:

 bit: propagates between twisted pair (TP)
transmitter/receiver pairs  two concentric copper  glass fiber carrying light pulses,
 two insulated copper
conductors each pulse a bit
 physical link: what lies wires
between transmitter &  bidirectional  high-speed operation:
 Category 5: 100 Mbps, 1
receiver Gpbs Ethernet  broadband:  high-speed point-to-point
transmission (e.g., 10-100 Gpbs
 guided media:  Category 6: 10Gbps  multiple frequency
transmission rate)
channels on cable
 signals propagate in solid  low error rate:
media: copper, fiber, coax  HFC
 repeaters spaced far apart
 unguided media:  immune to electromagnetic noise
 signals propagate freely, e.g.,
radio

1-19 1-20
Links: Physical media Chapter 1: outline

Wireless radio radio link types: 1.1. Basic concepts

 terrestrial microwave 1.1.1. The Internet
 signal carried in
 point-to-point; 45 Mbps channels 1.1.2. Protocol
electromagnetic spectrum
 no physical “wire”
 Wireless LAN (WiFi) 1.1.3. The network edge: access networks, physical media
 10-100 Mbps; 10 meters 1.1.4. The network core: packet switching, circuit switching,
 broadcast, “half-duplex”
(sender to receiver)  wide-area (e.g., 4G/5G cellular) internet structure
 10’s Mbps (4G) over ~10 Km
 propagation environment 1.2. Delay, Packet loss and Throughput
 Bluetooth: cable replacement
effects: 1.3. Protocol layers and Service models
• short distances, limited rates
 reflection 1.3.1. Layered architecture
 satellite
 obstruction by objects 1.3.2. Data encapsulation
• up to < 100 Mbps (Starlink) downlink
 interference 1.4. Network security
• 270 msec end-end delay
(geostationary) 1.5. History

1-21 1-22

The network core Packet-switching: store-and-forward

 mesh of interconnected
national/global ISP
routers
 packet-switching: hosts
break application-layer
messages into packets
 forward packets from one  takes L/R seconds to transmit one-hop numerical
router to the next, across local/ (push out) L-bit packet into link example:
regional ISP
links on path from source at R bps  L = 10 Kbits
to destination  store and forward: entire packet  R = 100 Mbps
must arrive at router before it  one-hop transmission
 each packet transmitted at
can be transmitted on next link delay = 0.1 msec
full link capacity
 end-end delay = 2L/R (assuming
zero propagation delay)
1-23 1-24
Packet-switching: queueing delay, loss Packet-switching: queueing delay, loss

R = 100 Mb/s C R = 100 Mb/s C

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

queuing and loss:

Queueing occurs when work arrives faster than it can be serviced:
 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

1-25 1-26

Two key network-core functions Alternative to packet switching: circuit switching

routing: determines source- Forwarding (aka switching):

end-end resources allocated to,
destination route taken by move packets from router’s reserved for “call” between
packets input to appropriate router source & destination:
 routing algorithms output  In diagram, each link has four
circuits.
 call gets 2nd circuit in top link
routing algorithm and 1st circuit in right link.
 dedicated resources: no sharing
local forwarding table
 circuit-like (guaranteed)
header value output link
0100 3 1 performance
0101 2
 circuit segment idle if not used by
0111 2 3 2
1001 1 call (no sharing)
 Commonly used in traditional
telephone networks
dest address in arriving
packet’s header
1-27 1-28
Circuit switching: FDM and TDM Circuit switching: FDM and TDM

Example: Example:
FDM
4 users TDM 4 users

frequency
frequency

time
time
Frequency Division Multiplexing (FDM)
Time Division Multiplexing (TDM)
 optical, electromagnetic frequencies divided into
(narrow) frequency bands  time divided into slots
 each call allocated its own band, can transmit at max  each call allocated periodic slot(s), can transmit at
rate of that narrow band maximum rate of (wider) frequency band (only) during
its time slot(s)
1-29 1-30

Packet switching versus circuit switching Packet switching versus circuit switching
packet switching allows more users to use network! is packet switching a “winner?”
 great for bursty data
example:  resource sharing
 1 Mb/s link  simpler, no call setup
N
 each user: users  excessive congestion possible: packet delay and loss due to
• 100 kb/s when “active” 1 Mbps link buffer overflow
• active 10% of time  protocols needed for reliable data transfer, congestion control
 circuit-switching:  Q: How to provide circuit-like behavior with packet-switching?
 10 users  bandwidth guarantees needed for audio/video apps
 packet switching: Q: how did we get value 0.0004?  still an unsolved problem
 with 35 users, probability >
Q: what happens if > 35 users ? Q: human analogies of reserved resources (circuit switching)
10 active at same time is
less than .0004 * versus on-demand allocation (packet-switching)?

1-31 1-32
Internet structure: network of networks Internet structure: network of networks
Question: given millions of access ISPs, how to connect them
 End systems connect to Internet via access ISPs together?
(Internet Service Providers) access access
net net
 Residential, company and university ISPs access
net
access

 Access ISPs in turn must be interconnected. access

net
net

access
 So that any two hosts can send packets to each other access
net
net

 Resulting network of networks is very complex

 Evolution was driven by economics and national policies access access
net net

 Let’s take a stepwise approach to describe current

Internet structure access
net
access
net

access
net
access
net
access access
net access net
net

Internet structure: network of networks Internet structure: network of networks

Option: connect each access ISP to every other access ISP? Option: connect each access ISP to a global transit ISP?
Customer and provider ISPs have economic agreement.
access access access access
net net net net
access access
net net
access access
access net access net
net net
access access
access net access net
net net

connecting each access ISP

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

access access
net net
access access
net net

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

access
access
net access
IXP access
net
net
ISP A net
ISP A

access access access IXP access

net ISP B net net ISP B net

access
ISP C access
ISP C
net net
access access
net net

access access peering link

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

Internet structure: network of networks Internet structure: network of networks

… and regional networks may arise to connect access networks … and content provider networks (e.g., Google, Microsoft, Akamai )
to ISPs may run their own network, to bring services, content close to end users

access access access access

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

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

access
ISP C access
ISP B
net net
access access
net net

access
net regional net access
net regional net
access access
net net
access access access access
net access net net access net
net net
 Internet structure: network of networks An example of Tier-1 ISP: Sprint

Tier 1 ISP Tier 1 ISP Google POP: point-of-presence

to/from backbone
IXP IXP IXP
peering
… …
Regional ISP Regional ISP

…
…

…
to/from customers
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 1-41
1-42

Chapter 1: outline How do packet delay and loss occur?

 packets queue in router buffers, waiting for turn for
1.1. Basic concepts
transmission
1.1.1. The Internet
 queue length grows when arrival rate to link (temporarily) exceeds
1.1.2. Protocol output link capacity
1.1.3. The network edge: access networks, physical media  packets loss occur when memory to hold queued packets fills
1.1.4. The network core: packet switching, circuit switching, up
internet structure packet being transmitted (delay)
1.2. Delay, Packet loss and Throughput
1.3. Protocol layers and Service models A
1.3.1. Layered architecture
1.3.2. Data encapsulation B
1.4. Network security packets queueing (delay)
1.5. History free (available) buffers: arriving packets
dropped (loss) if no free buffers

1-43 1-44
Four sources of packet delay Four sources of packet delay
transmission transmission
A propagation A propagation

B B
nodal nodal
processing queueing processing queueing

dnodal = dproc + dqueue + dtrans + dprop dnodal = dproc + dqueue + dtrans + dprop

dproc: nodal processing dqueue: queueing delay dtrans: transmission delay: dprop: propagation delay:
 check bit errors  time waiting at output link for  L: packet length (bits)  d: length of physical link
 determine output link transmission  R: link bandwidth (bps)  s: propagation speed in medium
 typically < msec  depends on congestion level  dtrans = L/R (~2x108 m/sec)
of router dtrans and dprop  dprop = d/s
very different
1-45 1-46

Caravan analogy Caravan analogy (cont.)

100 km 100 km 100 km 100 km

ten-car ten-car toll toll
toll toll
caravan caravan booth booth
booth booth

 cars “propagate” at  time to “push” entire  suppose cars now “propagate” at 1000 km/hr
100 km/hr caravan through toll booth  and suppose toll booth now takes one min to service a car
 toll booth takes 12 sec to onto highway = 12*10 =
 Q: Will cars arrive to 2nd booth before all cars serviced at first
service car (bit transmission 120 sec
booth?
time)  time for last car to
 car~bit; caravan ~ packet propagate from 1st to 2nd  A: Yes! after 7 min, 1st car arrives at second booth; three
 Q: How long until caravan is toll both: cars still at 1st booth.
lined up before 2nd toll 100km/(100km/hr)= 1 hr
booth?  A: 62 minutes

1-47 1-48
Packet queueing delay (revisited) Real Internet delays and routes

what do “real” Internet delay & loss look like?

average queueing

 R: link bandwidth (bps)  traceroute program: provides delay measurement

delay
 L: packet length (bits) from source to router along end-end Internet path
 a: average packet arrival towards destination. For all i:
rate  sends three packets that will reach router i on path
towards destination
traffic intensity
= La/R  router i will return packets to sender
 La/R ~ 0: avg. queueing delay small La/R ~ 0
 sender times interval between transmission and reply.
 La/R -> 1: avg. queueing delay large
 La/R > 1: more “work” arriving 3 probes 3 probes
than can be serviced, average delay infinite!
3 probes

La/R -> 1
1-50

Real Internet delays and routes Packet loss

traceroute: [Link] to [Link]  queue (aka buffer) preceding link in buffer has finite
3 delay measurements from capacity
[Link] to [Link]
1 cs-gw ([Link]) 1 ms 1 ms 2 ms  packet arriving to full queue dropped (aka lost)
2 [Link] ([Link]) 1 ms 1 ms 2 ms
3 [Link] ([Link]) 6 ms 5 ms 5 ms  lost packet may be retransmitted by previous node, by
4 [Link] ([Link]) 16 ms 11 ms 13 ms
5 [Link] ([Link]) 21 ms 18 ms 18 ms source end system, or not at all
6 [Link] ([Link]) 22 ms 18 ms 22 ms
7 [Link] ([Link]) 22 ms 22 ms 22 ms trans-oceanic
8 [Link] ([Link]) 104 ms 109 ms 106 ms
9 [Link] ([Link]) 109 ms 102 ms 104 ms link
10 [Link] ([Link]) 113 ms 121 ms 114 ms buffer
11 [Link] ([Link]) 112 ms 114 ms 112 ms packet being transmitted
12 [Link] ([Link]) 111 ms 114 ms 116 ms A (waiting area)
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 * * * B
18 * * * * means no response (probe lost, router not replying) packet arriving to
19 [Link] ([Link]) 132 ms 128 ms 136 ms full buffer is lost
* Do some traceroutes from exotic countries at [Link] 1-51 1-52
Throughput Throughput

 throughput: rate (bits/time unit) at which bits  Rs < Rc What is average end-end throughput?
transferred between sender/receiver
 instantaneous: rate at given point in time
Rs bits/sec Rc bits/sec
 average: rate over longer period of time

 Rs > Rc What is average end-end throughput?

Rs bits/sec Rc bits/sec

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 bottleneck link
to send to client Rs bits/sec) Rc bits/sec)
link on end-end path that constrains end-end throughput

1-53 1-54

Throughput: Internet scenario Chapter 1: outline

1.1. Basic concepts
 per-connection end- 1.1.1. The Internet
end throughput: Rs 1.1.2. Protocol
min(Rc,Rs,R/10) Rs Rs 1.1.3. The network edge: access networks, physical media
 in practice: Rc or Rs is 1.1.4. The network core: packet switching, circuit switching,
often bottleneck internet structure
R
1.2. Delay, Packet loss and Throughput
Rc Rc 1.3. Protocol layers and Service models
1.3.1. Layered architecture
Rc
1.3.2. Data encapsulation
1.4. Network security
10 connections (fairly) share 1.5. History
backbone bottleneck link R bits/sec
1-55 1-56
Protocol “layers” Example: organization of air travel

Networks are complex, end-to-end transfer of person plus baggage

with many “pieces”: ticket (purchase) ticket (complain)
 hosts Question: baggage (check) baggage (claim)
 routers is there any hope of
organizing structure of gates (load) gates (unload)
 links of various
media network?
runway takeoff runway landing
 applications
…. or at least our discussion airplane routing airplane routing
 protocols
 hardware, software of networks? airplane routing

How would you define/discuss the system of airline travel?

 a series of steps, involving many services

1-57 1-58

Example: Layering of airline functionality Why layering?

Approad to dealing with complex systems:

ticket (purchase) ticket (complain) ticket
 explicit structure allows identification, relationship of
baggage (check) baggage (claim baggage
complex system’s pieces
gates (load) gates (unload) gate

runway (takeoff) runway (land) takeoff/landing

 layered reference model for discussion
airplane routing airplane routing airplane routing airplane routing airplane routing  modularization eases maintenance, updating of
departure intermediate air-traffic arrival
system
airport control centers airport
 change of implementation of layer’s service
transparent to rest of system
layers: each layer implements a service
 e.g., change in gate procedure doesn’t affect rest of
 via its own internal-layer actions
system
 relying on services provided by layer below

1-59 1-60
 Layered Internet protocol stack ISO/OSI reference model

 application: supporting network  presentation: allow applications to

applications interpret meaning of data, e.g.,
application application
 FTP, SMTP, HTTP encryption, compression, machine-
 transport: process-process data specific conventions presentation
transport
transfer  session: synchronization, session
 TCP, UDP checkpointing, recovery of data
network exchange transport
 network: routing of datagrams from
source to destination  Internet stack “missing” these network
link layers!
 IP, routing protocols link
 link: data transfer between neighboring  these services, if needed, must
physical be implemented in application physical
network elements
 Ethernet, 802.11 (WiFi), PPP  needed?
 physical: bits “on the wire”
1-61 1-62

source Encapsulation
message M application
Chapter 1: outline
segment Ht M transport
datagram Hn Ht M network 1.1. Basic concepts
frame Hl Hn Ht M link
1.1.1. The Internet
physical
1.1.2. Protocol
link
physical
1.1.3. The network edge: access networks, physical media
1.1.4. The network core: packet switching, circuit switching,
switch
internet structure
1.2. Delay, Packet loss and Throughput
destination Hn Ht M network
1.3. Protocol layers and Service models
Hl Hn Ht M link 1.3.1. Layered architecture
M application Hn Ht M
Ht M transport physical 1.3.2. Data encapsulation
Hn Ht M network 1.4. Network security
Hl Hn Ht M link router
1.5. History
physical

1-63 1-64
Network security Bad guys: put malware into hosts via Internet

 Internet not originally designed with (much) security  malware can get in host from:
in mind  virus: self-replicating infection by
 original vision: “a group of mutually trusting users receiving/executing object (e.g., e-mail
attached to a transparent network”  attachment)
 Internet protocol designers playing “catch-up”  worm: self-replicating infection by passively
 security considerations in all layers! receiving object that gets itself executed
 We now need to think about :  spyware malware can record keystrokes, web sites
 how bad guys can attack computer networks visited, upload info to collection site
 how we can defend networks against attacks  infected host can be enrolled in botnet, used for
 how to design architectures that are immune to attacks spam. DDoS attacks.

1-65 1-66

Bad guys: attack server, network infrastructure Bad guys can sniff packets
Denial of Service (DoS): attackers make resources packet “sniffing”:
(server, bandwidth) unavailable to legitimate traffic by
 broadcast media (shared ethernet, wireless)
overwhelming resource with bogus traffic
 promiscuous network interface reads/records all packets
(e.g., including passwords!) passing by
1. select target
2. break into hosts around A C
the network (see
botnet)
3. send packets to target src:B dest:A payload
target
from compromised hosts B

 wireshark software used for end-of-chapter labs is a

(free) packet-sniffer
1-67 1-68
Bad guys can use fake addresses Lines of defense

 Authentication: proving you are who you say you are

IP spoofing: send packet with false source address • cellular networks provides hardware identity via SIM
card; no such hardware assist in traditional Internet
A C  Confidentiality: via encryption
 Integrity checks: digital signatures prevent/detect
tampering
src:B dest:A payload
 Access restrictions: password-protected VPNs
B
 Firewalls: specialized “middle boxes” in access and core
networks:
 off-by-default: filter incoming packets to restrict
senders, receivers, applications
 detecting/reacting to DOS attacks

1-69 1-70

Chapter 1: outline Internet history

1961-1972: Early packet-switching principles
1.1. Basic concepts
1.1.1. The Internet  1961: Kleinrock -  1972:
1.1.2. Protocol queueing theory shows  ARPAnet public demo
1.1.3. The network edge: access networks, physical media effectiveness of packet-  NCP (Network Control
1.1.4. The network core: packet switching, circuit switching, switching Protocol) first host-host protocol
internet structure  1964: Baran - packet-  first e-mail program
1.2. Delay, Packet loss and Throughput switching in military nets
 ARPAnet has 15 nodes
1.3. Protocol layers and Service models  1967: ARPAnet
conceived by Advanced
1.3.1. Layered architecture
Research Projects
1.3.2. Data encapsulation
Agency
1.4. Network security  1969: first ARPAnet
1.5. History node operational

1-71 1-72
Internet history Internet history
1972-1980: Internetworking, new and proprietary nets 1980-1990: new protocols, a proliferation of networks

 1970: ALOHAnet satellite  1983: deployment of  new national networks:

network in Hawaii Cerf and Kahn’s TCP/IP Csnet, BITnet, NSFnet,
 1974: Cerf and Kahn - internetworking principles:  1982: SMTP e-mail Minitel
architecture for interconnecting  minimalism, autonomy - protocol defined  100,000 hosts connected
networks no internal changes to confederation of
required to interconnect
 1983: DNS defined for
 1976: Ethernet at Xerox PARC name-to-IP-address networks
networks
 late70’s: proprietary translation
 best effort service model
architectures: DECnet, SNA,
 stateless routers  1985: FTP protocol defined
XNA
 decentralized control  1988: TCP congestion
 late 70’s: switching fixed length
define today’s Internet control
packets (ATM precursor)
architecture
 1979: ARPAnet has 200 nodes

1-73 1-74

Internet history Internet history

1990, 2000’s: commercialization, the Web, new apps 2005-present: scale, SDN, mobility, cloud
 aggressive deployment of broadband home access (10-100 Mbps)
 early 1990’s: ARPAnet late 1990’s – 2000’s:  2008: software-defined networking (SDN)
decommissioned  more killer apps: instant  increasing ubiquity of high-speed wireless access: 4G/5G, WiFi
 1991: NSF lifts restrictions on messaging, P2P file  service providers (Google, FB, Microsoft) create their own networks
commercial use of NSFnet sharing • bypass commercial Internet to connect “close” to end user,
(decommissioned, 1995)  network security to providing “instantaneous” access to social media, search, video
 early 1990s: Web forefront content, …
 hypertext [Bush 1945, Nelson  est. 50 million host, 100  enterprises run their services in “cloud” (e.g., Amazon Web Services,
1960’s] million+ users Microsoft Azure)
 HTML, HTTP: Berners-Lee  backbone links running at  rise of smartphones: more mobile than fixed devices on Internet
 1994: Mosaic, later Netscape Gbps (2017)
 ~15B devices attached to Internet (2023, [Link])
 late 1990’s:
commercialization of the Web
1-75 1-76
Vietnam’s Internet history Introduction: summary
 1991: Attempts to connect to the Internet failed. We’ve covered a “ton” of you now have:
 1996: Solve obstacles; prepare Internet infrastructure material!  context, overview, “feel”
 ISP: VNPT  Internet overview of networking
 Speed: 64kbps. There is an international connection with several  what’s a protocol?  more depth, detail to
users.  network edge, core, access follow!
 1997: Vietnam officially connects to the Internet. network
 1 IXP: VNPT  packet-switching versus
circuit-switching
 4 ISP: VNPT, Netnam (IOT), FPT, SPT
 Internet structure
 2007: “10 years of Vietnam’s Internet”  performance: loss, delay,
 20 ISP, 4 IXP throughput
 19 million Internet users, accounting for 22.04% of the population
 layering, service models
 2022: “25 years of Vietnam’s Internet”: 70% of population are  security
Internet users.
 history
1-77 1-78

References

 Jim Kurose, Keith Ross, “Computer Networking: A Top-

Down Approach” 8th edition, Pearson, 2020.

1-79