TNK108

Datornät /Computer Networking

Fall 2019

Introduction 1-1
 Course Information – basics
Literature

• Textbook: J. Kurose and K. Ross, Computer Networking – A Top

Down Approach, 7th edition
• Lecture notes/slides and lab assignments:
• Supplement material, if needed, will be specified on the course page /
handed out

Course Staff

• Vangelis Angelakis <[email protected]> (Lectures /

Examiner)
• Ina Eriksson / Lina Fredriksson (Labs / Seminars)

Course Page
• http://weber.itn.liu.se/~vanan11/TNK108/
• Or just Google: “tnk108”

Introduction 1-2
 Course Information – grading

Examination and grading

A single exam covering the entire scope of the course

• Closed-book written exam (3 credits)

• 90% -100% = 5 (ECTS A)
• 75% -89% = 4 (ECTS B)
• 60% -74% = 3 (ECTS C)
• 0 -59% = fail (ECTS F)
•Coursegrade = exam grade, IF the result of ALL lab
assignments is pass

Re-examination
 Re-examination periods, not responsible for the times ¯\_( ツ )_/¯

Introduction 1-3
 Course Information – labs
Two lab sessions per week – two lab groups
Three sets of assignments
1) Basic Networking
2) Understanding Network Addressing and Routing
3) Socket Programming and protocol performance

Each lab session in the course calendar is used to

a) Provide a roadmap to the upcoming assignment
b) Evaluate the previous assignment
Evaluation is done through
b.i: A lab report you hand in on the date indicated on each
assignment
- b.ii: An sampling oral examination

Lab sessions content:

1. Basic Networking
2. Addressing/Routing
3. Network Programming

Introduction 1-4
Course Information – labs
v.47
19/11: is now 13-15 should become: 10-12
21/11: is now 8-10 should become: 15-17
v. 48
*26/11: is now 13-15 should become: 10-12
!29/11!: was 28/11 … should become: 8-10 on
29/11
v.49
3/12: is now 13-15 should become 15-17
5/12: is now 8-10 should become 15-17
v.50
*10/12: is now 15-17 should become 8-10
12/12: is now 8-12 should become 10-12

Introduction 1-5
Chapter 1: introduction
our goal: overview:
 get “feel” and  what’s the Internet?
terminology  what’s a protocol?
 more depth,
 network edge; hosts, access
net, physical media
detail later in  network core: packet/circuit
course switching, Internet structure
 approach:  performance: loss, delay,
 use Internet throughput
 security
as example  protocol layers, service
models
 history

Introduction 1-6
Chapter 1: roadmap
1.1 what is the Internet?
1.2 network edge
 end systems, access networks, links
1.3 network core
 packet switching, circuit switching, network
structure
1.4 delay, loss, throughput in networks
1.5 protocol layers, service models
1.6 networks under attack: security
1.7 history

Introduction 1-7
 What’s the Internet: “nuts and
bolts” view
PC  millions of connected mobile network
server computing devices:
 hosts = end systems global ISP
wireless
laptop  running network apps
smartphone
home
 communication network
regional ISP
links
…everything  fiber, copper,
radio, satellite
 transmission
rate: bandwidth
wireless
links  Packet switches:
wired
links
forward packets institutional
network
(chunks of data)
 routers and switches
router Introduction 1-8
What’s the Internet: “nuts and bolts” view

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

institutional
network

Introduction 1-9
What’s the Internet: a service view
 Infrastructure that
mobile network
provides services to
applications:
 Web, VoIP, email, games, e- global ISP
commerce, social nets, …
 provides programming home
interface to apps network
regional ISP
 hooks that allow sending
and receiving app
programs to “connect” to
Internet
 provides service options,
analogous to postal service

institutional
network

Introduction 1-10
What’s a protocol?
human protocols: network protocols:
 “what’s the time?”  machines rather
 “I have a question” than humans
 introductions  all communication
activity in Internet
governed by
… specific msgs sent protocols
… specific actions
taken when msgs protocols define format,
received, or other order of msgs sent and
events received among
network entities, and
actions taken on msg
transmission, receipt
Introduction 1-11
What’s a protocol?
a human protocol and a computer network protocol:

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

Q: other human protocols?

Introduction 1-12
Chapter 1: roadmap
1.1 what is the Internet?
1.2 network edge
 end systems, access networks, links
1.3 network core
 packet switching, circuit switching, network
structure
1.4 delay, loss, throughput in networks
1.5 protocol layers, service models
1.6 networks under attack: security
1.7 history

Introduction 1-13
A closer look at network
structure:
 network edge: mobile network
 hosts: clients and servers
 servers often in data centers global ISP

home
 access networks, network
regional ISP
physical media:
wired, wireless
communication links

 network core:
 interconnected routers
 network of networks
institutional
network

Introduction 1-14
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-15
 The network edge:
 end systems (hosts):
 run application programs
 e.g. Web, email
 at “edge of network”

 client/server model
 client host requests, receives
service from always-on server
 e.g. Web browser/server;
email client/server
 peer-peer model:
 minimal (or no) use of
dedicated servers
 e.g. Skype, BitTorrent
Introduction 1-16
Access net: digital subscriber line
(DSL)
central office telephone
network

DSL splitter
modem DSLAM

ISP
voice, data transmitted
at different frequencies over DSL access
dedicated line to central office multiplexer

 use existing telephone line to central office DSLAM

 data over DSL phone line goes to Internet
 voice over DSL phone line goes to telephone net
 < 2.5 Mbps upstream transmission rate (typically <
1 Mbps)
 < 24 Mbps downstream transmission rate (typically
Introduction 1-17
Access net: cable network
cable headend

cable splitter
modem

C
O
V V V V V V N
I I I I I I D D T
D D D D D D A A R
E E E E E E T T O
O O O O O O A A L

1 2 3 4 5 6 7 8 9

Channels

frequency division multiplexing: different channels

transmitted
in different frequency bands
Introduction 1-18
Access net: cable network
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 30Mbps downstream transmission
rate, 2 Mbps upstream transmission rate
 network of cable, fiber attaches homes to ISP router
 homes share access network to cable headend
 unlike DSL, which has dedicated access to central office
Introduction 1-19
 Access net: home network

wireless
devices

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

cable or DSL modem

wireless access router, firewall, NAT

point (54 Mbps)
wired Ethernet (100 Mbps)

Introduction 1-20
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-21
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 (WiFi): 11, 54 operator, 10’s km
Mbps transmission rate  between 1 and 10 Mbps …
and Gbps in 5G
 3G, 4G: LTE

to Internet

to Internet

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

packet time needed to L (bits)

transmission = transmit L-bit =
delay packet into link R (bits/sec)
1-23
Physical media
 bit: propagates between
transmitter/receiver pairs
twisted pair (TP)
 physical link: what lies  two insulated copper
between transmitter & wires
receiver  Category 5: 100
Mbps, 1 Gpbs
 guided media: Ethernet
 signals propagate in  Category 6: 10Gbps
solid media: copper,
fiber, coax
 unguided media:
 signals propagate freely,
e.g., wireless radio, VLC

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

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

Introduction 1-26
Chapter 1: roadmap
1.1 what is the Internet?
1.2 network edge
 end systems, access networks, links
1.3 network core
 packet switching, circuit switching, network
structure
1.4 delay, loss, throughput in networks
1.5 protocol layers, service models
1.6 networks under attack: security
1.7 history

Introduction 1-27
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-28
Packet-switching: store-and-
forward
L bits
per packet

3 2 1
source destination
R bps R bps

 takes L/R seconds to one-hop numerical

transmit (push out) L- example:
bit packet into link at R  L = 7.5 Mbits
bps
 R = 1.5 Gbps
 store and forward:  one-hop transmission
entire packet must
arrive at router before delay = 5 msec
 end-end
it can bedelay = 2L/R
transmitted
(assuming zero propagation
on next link more on delay shortly …
delay) Introduction 1-29
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-30
Two key network-core
functions
routing: determines forwarding: move
source-destination route packets from router’s
taken by packets 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
1 1
01

dest address in arriving

packet’s header
Network Layer 4-31
 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-32
Circuit switching: FDM versus
TDM
Example:
FDM
4 users

frequency

time
TDM

frequency

time
Introduction 1-33
Packet switching versus circuit
switching
packet switching allows more users to use network!

example:
 1 Mb/s link
 each user: N

…..
users
• 100 kb/s when “active”
• active 10% of time 1 Mbps link

 circuit-switching:
 10 users
 packet switching: Q: how did we get value 0.0004?
 with 35 users,
probability > 10 activeQ: what happens if > 35 users ?
at same time is less
than .0004 *
* Check out the online interactive exercises for more examples Introduction 1-34
Packet switching versus circuit switching

is packet switching the “slam dunk winner?”

 great for bursty data
 resource sharing
 simpler, no call setup
 excessive congestion possible: packet delay and
loss
 protocols needed for reliable data transfer,
congestion control
 Q: How to provide circuit-like behavior?
 bandwidth guarantees needed for audio/video
apps
 still an unsolved problem (chapter 7)

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

access
… access
net
access
net …
net
access
access net
net
access
access net
net
…

…
access access
net net

access
net
access
net

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

access
… access
net
access
net …
net
access
access
net
… … net

access
access net
net

connecting each access ISP

…

…
to each other directly doesn’t

…
access access
…

net
scale: O(N2) connections. net

access
net
access
net

access
net
access
…

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

access
… access
net
access
net …
net
access
access net
net
access
access net
net
…

…
global
access
net ISP access
net

access
net
access
net

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

access
… access
net
access
net …
net
access
access net
net
access
access net
net
ISP A
…

…
access access
net ISP B net

access
ISP C
net
access
net

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

access
IXP access
net
net
ISP A
…

…
access IXP access
net ISP B net

access
ISP C
net
access
net

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

access
… access
net
access
net …
net
access
access net
net

access
IXP access
net
net
ISP A
…

…
access IXP access
net ISP B net

access
ISP C
net
access
net

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

access
… access
net
access
net …
net
access
access net
net

access
IXP access
net
net
ISP A
…

…
Content provider network
access IXP access
net ISP B net

access
ISP B
net
access
net

access
net regional net
access
… net
access access …
net access net
net
 Internet structure: network of
networks
Tier 1 ISP Tier 1 ISP Google

IX IX IX
P P P
Regional ISP Regional ISP

access access access access access access access access

ISP ISP ISP ISP ISP ISP ISP ISP
 at center: small # of well-connected large networks
 “tier-1” commercial ISPs (e.g., Level 3, Sprint, AT&T, NTT),
national & international coverage
 content provider network (e.g, Google): private network
that connects it data centers to Internet, often bypassing
tier-1, regional ISPs Introduction 1-44
Chapter 1: roadmap
1.1 what is the Internet?
1.2 network edge
 end systems, access networks, links
1.3 network core
 packet switching, circuit switching, network
structure
1.4 delay, loss, throughput in networks
1.5 protocol layers, service models
1.6 networks under attack: security
1.7 history

Introduction 1-45
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-46
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
 determine output link link for transmission
 depends on congestion
 typically < msec level of router

Introduction 1-47
Four sources of packet delay
transmission
A propagation

B
nodal
processing queueing

dnodal = dproc + dqueue + dtrans + dprop

dtrans: transmission dprop: propagation delay:

delay:  d: length of physical link
 L: packet length (bits)  s: propagation speed in
 R: link bandwidth (bps) medium (~2x108 m/sec)
 dtrans = L/R dtrans and dprop  dprop = d/s
very different
* Check out the Java applet for an interactive animation on trans vs. prop delay Introduction 1-48
Queueing delay (revisited)

average queueing delay

 R: link bandwidth (bps)
 L: packet length (bits)
 a: average packet
arrival rate

traffic intensity
= La/R

 La/R ~ 0: avg. queueing delay small La/R ~ 0

 La/R -> 1: avg. queueing delay large
 La/R > 1: more “work” arriving
than can be serviced, average delay
infinite!
* Check out the Java applet for an interactive animation on queuing and loss La/R -> 1
Introduction 1-49
“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-50
“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-51
Packet loss
 queue (aka buffer) preceding link in buffer
has finite capacity
 packet arriving to full queue dropped (ie
lost)
 A 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-52
 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, with
server sends link capacity
pipe that can carry link capacity
pipe that can carry
file ofbits
F bits fluid at rate
Rs bits/sec fluid at rate
Rc bits/sec
to(fluid)
send into
to client
pipe Rs bits/sec) Rc bits/sec)

Introduction 1-53
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 1-54 Introduction
Throughput: Internet
scenario
 per-connection
end-end Rs
throughput: Rs Rs
min(Rc,Rs,R/10)
 in practice: Rc or
R
Rs is often
bottleneck Rc Rc

Rc

10 connections (fairly) share

backbone bottleneck link R bits/sec
Introduction 1-55
Chapter 1: roadmap
1.1 what is the Internet?
1.2 network edge
 end systems, access networks, links
1.3 network core
 packet switching, circuit switching, network
structure
1.4 delay, loss, throughput in networks
1.5 protocol layers, service models
1.6 networks under attack: security
1.7 history

Introduction 1-56
Protocol “layers”
Networks are
complex,
with many
“pieces”: Question:
 hosts is there any hope of
organizing structure of
 routers network?
 links of various
media …. or at least our
 applications discussion of networks?
 protocols
 hardware,
software

Introduction 1-57
Organization of air travel
ticket (purchase) ticket (complain)

baggage (check) baggage (claim)

gates (load) gates (unload)

runway takeoff runway landing

airplane routing airplane routing

airplane routing

 a series of steps

Introduction 1-58
Layering of airline
functionality
ticket (purchase) ticket (complain) ticket

baggage (check) baggage (claim baggage

gates (load) gates (unload) gate

runway (takeoff) runway (land) takeoff/landing

airplane routing airplane routing airplane routing airplane routing airplane routing

departure intermediate air-traffic arrival

airport control centers airport

layers: each layer implements a service

 via its own internal-layer actions
 relying on services provided by layer
below
Introduction 1-59
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-60
Internet protocol stack
 application: supporting
network applications
 FTP, SMTP, HTTP application
 transport: process-process
data transfer transport
 TCP, UDP
 network: routing of datagrams network
from source to destination
 IP, routing protocols link
 link: data transfer between
neighboring network elements physical
 Ethernet, 802.111 (WiFi), PPP
 physical: bits “on the wire”

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

Introduction 1-62
 source Encapsulatio
message
segment Ht
M
M
application
transport
n
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 Hn Ht M link router
physical

Introduction 1-63
Chapter 1: roadmap
1.1 what is the Internet?
1.2 network edge
 end systems, access networks, links
1.3 network core
 packet switching, circuit switching, network
structure
1.4 delay, loss, throughput in networks
1.5 protocol layers, service models
1.6 networks under attack: security
1.7 history

Introduction 1-64
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-65
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-66
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 target
hosts

Introduction 1-67
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
 wireshark software used for end-of-chapter
labs is a (free) packet-sniffer
Introduction 1-68
 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-69
Chapter 1: roadmap
1.1 what is the Internet?
1.2 network edge
 end systems, access networks, links
1.3 network core
 packet switching, circuit switching, network
structure
1.4 delay, loss, throughput in networks
1.5 protocol layers, service models
1.6 networks under attack: security
1.7 history

Introduction 1-70
Internet history
1961-1972: Early packet-switching principles
 1961: Kleinrock -  1972:
queueing theory  ARPAnet public demo
shows effectiveness  NCP (Network Control
of packet-switching Protocol) first host-host
 1964: Baran - protocol
packet-switching in  first e-mail program
military nets
 ARPAnet has 15 nodes
 1967: ARPAnet
conceived by
Advanced Research
Projects Agency
 1969: first ARPAnet
node operational

Introduction 1-71
Internet history
1972-1980: Internetworking, new and proprietary nets
 1970: ALOHAnet satellite
network in Hawaii
 1974: Cerf and Kahn - Cerf and Kahn’s
architecture for internetworking
interconnecting networks principles:
 1976: Ethernet at Xerox PARC  minimalism, autonomy - no
internal changes required
 late70’s: proprietary to interconnect networks
architectures: DECnet, SNA,  best effort service model
XNA  stateless routers
 late 70’s: switching fixed  decentralized control
length packets (ATM
precursor) define today’s Internet
architecture
 1979: ARPAnet has 200 nodes

Introduction 1-72
Internet history
1980-1990: new protocols, a proliferation of networks
 1983: deployment of  new national
TCP/IP networks: Csnet,
 1982: smtp e-mail BITnet, NSFnet,
protocol defined Minitel
 1983: DNS defined  100,000 hosts
for name-to-IP- connected to
address translation confederation of
 1985: ftp protocol networks
defined
 1988: TCP
congestion control

Introduction 1-73
Internet history
1990, 2000’s: commercialization, the Web, new apps
 early 1990’s: ARPAnet late 1990’s – 2000’s:
decommissioned  more killer apps:
 1991: NSF lifts restrictions
instant messaging,
on commercial use of NSFnet P2P file sharing
(decommissioned, 1995)
 network security to
 early 1990s: Web
 hypertext [Bush 1945,
forefront
Nelson 1960’s]  est. 50 million host,
 HTML, HTTP: Berners-Lee 100 million+ users
 1994: Mosaic, later  backbone links
Netscape running at Gbps
 late 1990’s:
commercialization of the
Web

Introduction 1-74
Internet history
2005-present
 ~750 million hosts
 Smartphones and tablets
 Aggressive deployment of broadband access
 Increasing ubiquity of high-speed wireless access
 Emergence of online social networks:
 Facebook: soon one billion users
 Service providers (Google, Microsoft) create their
own networks
 Bypass Internet, providing “instantaneous”
access to search, emai, etc.
 E-commerce, universities, enterprises running
their services in “cloud” (eg, Amazon EC2)

Introduction 1-75
Introduction: summary
covered a “ton” of you now have:
material!  context, overview,
 Internet overview “feel” of networking
 what’s a protocol?  more depth, detail
 network edge, core, to follow!
access network
 packet-switching
versus circuit-
switching
 Internet structure
 performance: loss, delay,
throughput
 layering, service models
 security
 history Introduction 1-76