Intro

CSCI 449
Introduction to Computer
Networks
Chapter 1: Introduction
Dr. Jiang Li
(Adapted from “Computer Networking: A Top Down Approach Featuring the Internet”,
6th edition. Copyrighted by Jim Kurose, Keith Ross)
EECS, Howard Univ. Jiang Li
1
Chapter 1: Introduction
Our goal: Overview:
q Get “feel” and q What’s the Internet?
terminology q What’s a protocol?
q More depth, detail later q Network edge: hosts, access net,
in course physical media
q Approach: q Network core: packet/circuit
q Use Internet as switching, Internet structure
example q Performance: loss, delay,
throughput
q Security
q Protocol layers, service models
q History
2
Chapter 1: Roadmap
1.1 What is the Internet?
1.2 Network edge
q End systems, access networks, links
1.3 Network core
q Circuit switching, packet switching, network
structure
1.4 Delay, loss and throughput in packet-
switched networks
1.5 Protocol layers, service models
1.6 Networks under attack: security
1.7 History
3
The Internet: a “services” view
q Communication infrastructure
enables distributed applications:
q Web, streaming video, mobile network
multimedia teleconferencing, national or global ISP
email, games, e-commerce,

social media, inter-connected Streaming
appliances, … Skype video
q Communication services provided to local or

regional
apps: ISP
home network
q Reliable data delivery from
content
provider
HTTP network
source to destination datacenter
network
q “Best effort” (unreliable) data

delivery enterprise
network
q Applications access the service on
hosts via API

4
The Internet: a “nuts and bolts”
view
Billions of connected mobile network
computing devices:
national or global ISP
§ hosts = end systems
§ running network apps at
Internet’s “edge”
Packet switches: forward

local or
packets (chunks of data) Internet
regional
ISP
§ routers, switches
home network content
Communication links provider
network datacenter
§ fiber, copper, radio, satellite network
§ transmission rate: bandwidth
Networks enterprise
§ collection of devices, routers, network
links: managed by an
organization

5
“Fun” 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
mattress
Gaming devices
Others?
Internet phones Fitbit

6
Types of Connections

7
Categories of Topology

8
A Star Topology Connecting
Four Stations
A set of point-to-point connections

9
A Bus Topology Connecting Three
Stations

10
A Ring Topology
Connecting Six Stations

11
A Fully Connected Mesh Topology

12
A Hybrid Topology: A Star Backbone
with Three Bus Networks

13
LANs and WANs
q LAN
q Local Area Network
q Network in a building or of an institution
q WAN
q Wide Area Network
q Network over a large area (e.g. across multiple cities)

14
An Isolated LAN Connecting 12
Computers to A Hub in A Closet

15
WANs: A Switched WAN
and A Point-to-Point WAN

16
A Heterogeneous Network
Made of 4 WANs and 2 LANs

17
The Internet: a “nuts and bolts”
view
mobile network
q Internet: “network of networks” 4G
q Interconnected ISPs
Streaming
q protocols are everywhere Skype
IP
video
q control sending, receiving
local or
of messages regional
ISP
q e.g., HTTP (Web), home network content
streaming video, Skype, HTTP
provider
network datacenter
TCP, IP, WiFi, 4G, Ethernet Ethernet
network
q Internet standards TCP

q RFC: Request for
enterprise
network
Comments WiFi
q IETF: Internet Engineering Much of this course
Task Force is about protocols
19
What’s a protocol?
Human protocols: Network protocols:
q “what’s the time?” q Computer rather than
q “I have a question” humans
q Introductions q All communication
activity in Internet
Rules for governed by protocols
… specific msgs sent
… specific actions taken Protocols define format, order
when msgs received, of msgs sent and received
or other events among network entities, and
actions taken on msg
Protocol: transmission, receipt
A set of rules regulating
interaction
20
What’s a protocol?
A human protocol and a computer network protocol:
Hi
TCP connection
request
Hi
TCP connection
Got the response
time? Get http://www.awl.com/kurose-ross
2:00
<file>
time
Q: Other human protocols?

21
Chapter 1: Roadmap
1.2 Network edge
q Hosts, access networks, physical media
1.3 Network core
structure
switched networks
1.7 History
22
A closer look at Internet structure
mobile network
Network edge:
qhosts: clients and servers
qservers often in data centers
local or
regional
ISP
provider
network datacenter
network
enterprise
network

Introduction: 1-23
23
mobile network
Network edge:
local or
Access networks, physical regional

ISP
media: home network content

provider
network
qwired, wireless communication links datacenter
network
enterprise
network

Introduction: 1-24
24
mobile network
Network edge: national or global ISP

local or
Access networks, physical media: regional
ISP
qwired, wireless home network content

provider
communication links network datacenter
network
Network core:
§ interconnected routers enterprise
§ network of networks network

Introduction: 1-25
25
Access networks and physical media
Q: How to connect end systems mobile network
to edge router? national or global ISP
q residential access nets

q institutional access networks (school,
company)
q mobile access networks (WiFi, 4G/5G) local or
regional
ISP
provider
network datacenter
network
enterprise
network

Introduction: 1-26
26
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

27
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
28
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
q HFC: hybrid fiber coax

q Asymmetric: up to 40 Mbps – 1.2 Gbps downstream transmission rate, 30-100 Mbps
upstream transmission rate
q Network of cable, fiber attaches homes to ISP router
q Homes share access network to cable headend
q Unlike DSL which is dedicated

29
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,450 Mbps)
wired Ethernet (1Gbps)

30
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 (4G cellular networks)
§ 802.11b/g/n (WiFi): 11, 54, 450 § 20 Gps (5G cellular networks)
Mbps transmission rate
to Internet
to Internet

31
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

32
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
provider
network datacenter
network
Courtesy: Massachusetts Green High Performance Computing enterprise

Center (mghpcc.org) network

33
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)

34
Links: physical media
§ bit: propagates between
transmitter/receiver pairs Twisted pair (TP)
§ physical link: what lies § two insulated copper wires
between transmitter & • Category 5: 100 Mbps, 1 Gbps Ethernet
receiver • Category 6: 10Gbps Ethernet
§ guided media:
• signals propagate in solid
media: copper, fiber, coax
§ unguided media:
• signals propagate freely,
e.g., radio

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

36
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

37
Chapter 1: Roadmap
1.2 Network edge
q Hosts, access networks, physical media
1.3 Network core
q Circuit switching, packet switching, internet
structure
switched networks
1.7 History
38
The network core
mobile network
q mesh of interconnected national or global ISP
routers
q packet-switching: hosts break
application-layer messages local or
into packets regional

ISP
home network
q network forwards packets from content
provider
one router to the next, across network datacenter
network
links on path from source to

destination
enterprise
network

39
Two key network-core functions
routing
algorithm Routing:
§ global action:
Forwarding: local forwarding table
header value output link determine source-
q aka “switching” 0100
0101
3
2 destination paths
q local action: move 0111
1001
2
1 taken by packets
arriving packets
from router’s input § routing algorithms
1
link to appropriate
router output link 3 2
11
01
destination address in arriving

packet’s header

40
routing

41
forwarding
forwarding

42
Packet-switching: store-and-forward
L bits
per packet
32 1
source destination
R bps R bps
q 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
q store and forward: entire packet must arrive § one-hop transmission delay
= 0.1 msec
at router before it can be transmitted on next
link

43
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:

44
Alternative: Circuit Switching
End-end resources allocated
to, reserved for “call”
between source & dest:
q In diagram, each link has four
circuits.
q Call gets 2nd circuit in top link
and 1st circuit in right link.
q Dedicated resources: no sharing
q Circuit-like (guaranteed)
performance
q Circuit segment idle if not used by
call (no sharing)
q Commonly used in traditional
telephone networks
45
Circuit switching: FDM and TDM
Frequency Division
Multiplexing (FDM) 4 users
q optical, electromagnetic
frequency
frequencies divided into (narrow)
frequency bands
q each call allocated its own band,
can transmit at max rate of that time
narrow band
Time Division Multiplexing
frequency
(TDM)
q time divided into slots
q each call allocated periodic

slot(s), can transmit at maximum time
rate of (wider) frequency band
(only) during its time slot(s)

46
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 *
Q: what if > 35 users
* Check out the online interactive exercises for more examples: http://gaia.cs.umass.edu/kurose_ross/interactive

48
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)?

49
Datagram Network

50
Virtual Circuit Network

51
Network Taxonomy
Telecommunication
networks
Circuit-switched Packet-switched
networks networks
FDM Networks Datagram

TDM
with VCs Networks
•Can’t simply say datagram network is connectionless

•Internet provides both connection-oriented (TCP) and
connectionless services (UDP) to apps.

52
Internet structure:
a “network of networks”
mobile network
q hosts connect to Internet via access national or global ISP
Internet Service Providers (ISPs)
q access ISPs in turn must be
interconnected
• so that any two hosts
local or
(anywhere!) can send packets to regional
ISP
each other home network content
q resulting network of networks is very provider
network
complex datacenter
network
• evolution driven by economics, enterprise

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

53
Internet structure:
Question: given millions of access ISPs, how to connect them together?
… access
net
access
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

54
Internet structure:
Question: given millions of access ISPs, how to connect them together?
… access
net
access
net …
access
net
access
access
net
… … net
access
access net
net
connecting each access ISP to

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

55
Internet structure:
Option: connect each access ISP to one global transit ISP?
Customer and provider ISPs have economic agreement.
… access
net
access
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

56
Internet structure:
But if one global ISP is viable business, there will be competitors ….
… access
net
access
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

57
Internet structure:
But if one global ISP is viable business, there will be competitors …. who will
want to be connected
Internet exchange point
… access
net
access
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

58
Internet structure:
… and regional networks may arise to connect access nets to ISPs
… access
net
access
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

59
Internet structure:
… and content provider networks (e.g., Google, Microsoft, Akamai) may
run their own network, to bring services, content close to end users
… … access
net
access
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

60
Internet structure:
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

61
Chapter 1: Roadmap
1.2 Network edge
q Hosts, access networks, links
1.3 Network core
structure
switched networks
1.7 History
63
How do packet delay and loss occur?
q packets queue in router buffers, waiting for turn for
transmission
§ queue length grows when arrival rate to link (temporarily)
exceeds output link capacity
q 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

64
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

65
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

66
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

67
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

68
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

service ~ link transmission
§ toll booth takes 12 sec to service
car (bit transmission time)
§ “propagate” at 100 km/hr
§ Q: How long until caravan is lined
up before 3rd toll booth?

69
Queueing Delay (Revisited)
q R=link bandwidth (bps)
q L=packet length (bits)
q a=average packet arrival
rate
L .a arrival rate of bits “traffic
:
R service rate of bits intensity”
q La/R ~ 0: average queueing delay
small
La/R ~ 0
q La/R ® 1: average queueing delay
large
q La/R > 1: more “work” arriving than
can be serviced, average delay
infinite!
EECS, Howard Univ. La/R Jiang
-> 1 Li
70
“Real” Internet delays and routes
q what do “real” Internet delay & loss look like?
q traceroute program: provides delay measurement from source
to router along end-end Internet path towards destination. For
all i:
q sends three packets that will reach router i on path towards
destination (with time-to-live field value of i)
q router i will return packets to sender
q sender measures time interval between transmission and
reply
3 probes 3 probes
3 probes

71
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

72
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
• How many retransmissions on average? (Geometric distribution)
buffer
(waiting area) packet being transmitted
A
packet arriving to
B full buffer is lost
* Check out the Java applet for an interactive animation (on publisher’s website) of queuing and loss

73
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

74
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

75
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

76
Chapter 1: Roadmap
1.2 Network edge
q hosts, access networks, links
1.3 Network core
q circuit switching, packet switching, network
structure
switched networks
1.6 Security
1.7 History
77
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

78
Layering
q Layers: each layer implements a service
q Via its own internal-layer actions
q Relying on services provided by layer below
q More (logically) complex tasks are done at upper levels
q Lowest layer only takes care of signal transmission
q Highest layer sends semantically complicated messages over
multiple hops from (Internet) edge to edge
q The combination of the stack (of multiple layers)
does the complete job

79
Layering of The Philosopher-
Translator-Secretary Architecture

80
Network Software Protocol Hierarchies
Layers, protocols, and interfaces.

81
Services to Protocols Relationship

82
Why Layering?
Approach to designing/discussing complex
systems:
q Explicit structure allows identification, relationship of
complex system’s pieces
q Layered reference model for discussion
q Modularization eases maintenance, updating of system
q change of implementation of layer’s service
transparent to rest of system
q e.g., change in translator doesn’t affect rest of
system
q Layering considered harmful?

83
The OSI Reference Model

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

85
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 application-
network
layer message, M, with transport layer-layer
header Ht to create a transport-layer segment
link • Ht used by transport layer protocol to link
implement its service
physical physical
source destination

86
Encapsulation
M
application application
Ht M
transport Transport-layer protocol transfers M (e.g., reliably) transport
from 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
link layer services link
§ network-layer protocol encapsulates transport-layer
segment [Ht | M] with network layer-layer header Hn
physical to create a network-layer datagram physical
• Hn used by network layer protocol to implement its
service
source destination

87
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
link layer
Hl H n Ht services
M link
Link-layer protocol transfers datagram [Hn| [Ht |M]
from host to neighboring host, using network-layer
physical services physical
§ link-layer protocol encapsulates network datagram
[Hn| [Ht |M], with link-layer header Hl to create a
source link-layer frame destination

88
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

89
source Encapsulation:
message
segment H t
M
M
application
transport
an end-end view
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

90
Impacts of Segmentation
q Example:
q Message size: 10K bytes
q Header size: 20 bytes
q Transmission rate: 1 Mbps
q Transmission delay if no loss

q Average transmission delay if lossy
q Loss rate: 0.00002

91
Chapter 1: Roadmap
1.2 Network edge
q hosts, access networks, links
1.3 Network core
q circuit switching, packet switching, network
structure
switched networks
1.6 Security
1.7 History
92
Network security
§ Internet not originally designed with (much) security in
mind
• original vision: “a group of mutually trusting users attached
to a transparent network” J
• 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

93
Network security
§ Internet not originally designed with (much) security in

mind
• original vision: “a group of mutually trusting users attached to a
transparent network” J
• 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

94
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

95
Bad guys: fake identity
IP spoofing: injection of packet with false source address
A C
src:B dest:A
payload
B

96
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

97
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
… lots more on security (throughout, Chapter 8)

98

Intro

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Intro

Uploaded by

Copyright:

Available Formats

CSCI 449

multimedia teleconferencing, national or global ISP

email, games, e-commerce,

q Communication services provided to local or

q “Best effort” (unreliable) data

EECS, Howard Univ. Jiang Li

Packet switches: forward

§ transmission rate: bandwidth

EECS, Howard Univ. Jiang Li

Pacemaker & Monitor

Amazon Echo Web-enabled toaster +

EECS, Howard Univ. Jiang Li

EECS, Howard Univ. Jiang Li

EECS, Howard Univ. Jiang Li

A set of point-to-point connections

EECS, Howard Univ. Jiang Li

EECS, Howard Univ. Jiang Li

EECS, Howard Univ. Jiang Li

EECS, Howard Univ. Jiang Li

EECS, Howard Univ. Jiang Li

EECS, Howard Univ. Jiang Li

EECS, Howard Univ. Jiang Li

EECS, Howard Univ. Jiang Li

q Internet standards TCP

Q: Other human protocols?

EECS, Howard Univ. Jiang Li

Access networks, physical regional

media: home network content

EECS, Howard Univ. Jiang Li

Network edge: national or global ISP

qhosts: clients and servers

qwired, wireless home network content

EECS, Howard Univ. Jiang Li

Q: How to connect end systems mobile network

to edge router? national or global ISP

q residential access nets

EECS, Howard Univ. Jiang Li

voice, data transmitted ISP

§ use existing telephone line to central office DSLAM

EECS, Howard Univ. Jiang Li

frequency division multiplexing: different channels transmitted

cable splitter cable modem

data, TV transmitted at different

q HFC: hybrid fiber coax

EECS, Howard Univ. Jiang Li

cable or DSL modem

wireless access router, firewall, NAT

EECS, Howard Univ. Jiang Li

Shared wireless access network connects end system to router

Wireless local area networks Wide-area cellular access networks

EECS, Howard Univ. Jiang Li

§ companies, universities, etc.

EECS, Howard Univ. Jiang Li

Courtesy: Massachusetts Green High Performance Computing enterprise

EECS, Howard Univ. Jiang Li

host sending function:

§ transmits packet into access

• link transmission rate, aka link host

packet time needed to L (bits)

EECS, Howard Univ. Jiang Li

EECS, Howard Univ. Jiang Li

EECS, Howard Univ. Jiang Li

Wireless radio Radio link types:

EECS, Howard Univ. Jiang Li