0% found this document useful (0 votes)
7 views82 pages

Chapter1 5th April2009

Chapter 1 introduces the Internet, covering its definition, protocols, network structure, and performance metrics such as delay, loss, and throughput. It discusses the network edge, core, and various access technologies, including DSL, cable modems, and wireless networks. The chapter also outlines the importance of protocols in communication and provides an overview of the Internet's historical context and security concerns.

Uploaded by

thuwngmaithanh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
7 views82 pages

Chapter1 5th April2009

Chapter 1 introduces the Internet, covering its definition, protocols, network structure, and performance metrics such as delay, loss, and throughput. It discusses the network edge, core, and various access technologies, including DSL, cable modems, and wireless networks. The chapter also outlines the importance of protocols in communication and provides an overview of the Internet's historical context and security concerns.

Uploaded by

thuwngmaithanh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 82

Chapter 1

Introduction

A note on the use of these ppt slides:


We’re making these slides freely available to all (faculty, students, readers).
They’re in PowerPoint form so you can add, modify, and delete slides Computer
(including this one) and slide content to suit your needs. They obviously Networking: A Top
represent a lot of work on our part. In return for use, we only ask the
following: Down Approach ,
❑ If you use these slides (e.g., in a class) in substantially unaltered form, 5th edition.
that you mention their source (after all, we’d like people to use our book!)
❑ If you post any slides in substantially unaltered form on a www site, that Jim Kurose, Keith Ross
you note that they are adapted from (or perhaps identical to) our slides, and Addison-Wesley, April
note our copyright of this material.
2009.
Thanks and enjoy! JFK/KWR

All material copyright 1996-2009


J.F Kurose and K.W. Ross, All Rights Reserved
Introduction 1-1
Chapter 1: Introduction
Our goal: Overview:
❑ get “feel” and ❑ what’s the Internet?
terminology
❑ what’s a protocol?
❑ more depth, detail
later in course ❑ network edge; hosts, access
❑ approach: net, physical media
❖ use Internet as ❑ network core: packet/circuit
example switching, Internet structure
❑ performance: loss, delay,
throughput
❑ security
❑ protocol layers, service
models
❑ history Introduction 1-2
Chapter 1: roadmap
1.1 What is the Internet?
1.2 Network edge
❑ end systems, access networks, links
1.3 Network core
❑ 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

Introduction 1-3
What’s the Internet: “nuts and bolts”
view
P ❑
millions of Mobile
C network
serve connected Global
r
wireles computing devices: ISP
s
laptop hosts = end systems
cellular
handhel ❖ running network Home
d network
apps Regional
❑ communication ISP
links
access
points
❖ fiber, copper, Institutional
wire
d radio, satellite network
links
❖ transmission
rate =forward
❑ routers:
route bandwidth
packets (chunks of
r
data)
Introduction 1-4
“Cool” internet appliances

Web-enabled toaster +
weather forecaster

IP picture frame
http://www.ceiva.com/

World’s smallest web server


http://www-ccs.cs.umass.edu/~shri/iPic.html Internet phones

Introduction 1-5
What’s the Internet: “nuts and bolts”
view
❑ protocols control Mobile
network
sending, receiving of Global
msgs ISP
❖ e.g., TCP, IP, HTTP, Skype,
Ethernet Home
network
❑ Internet: “network of Regional
ISP
networks”
❖ loosely hierarchical
Institutional
❖ public Internet versus network
private intranet
❑ Internet standards
❖ RFC: Request for
comments
❖ IETF: Internet Engineering
Task Force Introduction 1-6
What’s the Internet: a service view
❑ communication
infrastructure enables
distributed applications:
❖ Web, VoIP, email,
games, e-commerce,
file sharing
❑ communication services
provided to apps:
❖ reliable data delivery
from source to
destination
❖ “best effort”
(unreliable) data
delivery Introduction 1-7
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
… specific msgs sent governed by
protocols
… specific actions protocols define format,
taken when msgs order of msgs sent and
received, or other received among
events network entities, and
actions taken on msg
transmission, receipt
Introduction 1-8
What’s a protocol?
a human protocol and a computer network
protocol:

Hi
TCP
connection
Hi request
TCP
Got connection
the response
Get http://www.awl.com/kurose-ross
time?
2:0
0 <file
tim >
e
Q: Other human protocols?
Introduction 1-9
Chapter 1: roadmap
1.1 What is the Internet?
1.2 Network edge
❑ end systems, access networks, links
1.3 Network core
❑ 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

Introduction 1-10
A closer look at network
structure:
❑ network edge:
applications and
hosts
❑ access networks,
physical media:
wired, wireless
communication
❑links
network core:
❖ interconnected
routers
❖ network of
networks
Introduction 1-11
The network edge:
❑ end systems (hosts):
❖ run application programs
❖ e.g. Web, email
❖ at “edge of network” peer-
peer
❑ client/server model
❖ client host requests,
receives service from
always-on server client/
❖ e.g. Web browser/server; server
❑ peer-peer model:
email client/server
❖ minimal (or no) use of
dedicated servers
❖ e.g. Skype, BitTorrent

Introduction 1-12
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? Introduction 1-13
Dial-up Modem
central
office
telephone
network Internet

home ISP
home
dial-up modem
PC
modem (e.g., AOL)

❖ Uses existing telephony infrastructure


❖ Home is connected to central office
❖ up to 56Kbps direct access to router (often less)
❖ Can’t surf and phone at same time: not “always
on”
Digital Subscriber Line (DSL)
Existing phone line: Internet
0-4KHz phone; 4-50KHz
home upstream data; 50KHz-1MHz
phone downstream data

DSLAM

telephone
splitter network

DSL
modem central
office
home
PC

❖ Also uses existing telephone infrastruture


❖ up to 1 Mbps upstream (today typically < 256
kbps)
❖ up to 8 Mbps downstream (today typically < 1
Mbps)
Residential access: cable modems

❑ Does not use telephone infrastructure


❖ Instead uses cable TV infrastructure
❑ HFC: hybrid fiber coax
❖ asymmetric: up to 30Mbps downstream,
2 Mbps upstream
❑ network of cable and fiber attaches homes
to ISP router
❖ homes share access to router
❖ unlike DSL, which has dedicated access

Introduction 1-16
Residential access: cable modems

Diagram: Introduction 1-17


http://www.cabledatacomnews.com/cmic/diagram.html
Cable Network Architecture: Overview

Typically 500 to 5,000


homes

cable
headend
home
cable distribution
network (simplified)

Introduction 1-18
Cable Network Architecture: Overview

server(s)

cable
headend
home
cable
distribution
network
Introduction 1-19
Cable Network Architecture: Overview

cable
headend
home
cable distribution
network (simplified)

Introduction 1-20
Cable Network Architecture: Overview

FDM (more
shortly): 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

Channel
s

cable
headend
home
cable
distribution
network
Introduction 1-21
Fiber to the Home
O
N
T
Internet optical
fibers
O
N
optical
O fiber
T

LT
optical
central office splitter
O
N
T
❑ Optical links from central office to the home
❑ Two competing optical technologies:
❖ Passive Optical network (PON)
❖ Active Optical Network (PAN)
❑ Much higher Internet rates; fiber also carries
television and phone services
Ethernet Internet access
100 Mbps Institutional
router
Ethernet To Institution’s
switch ISP

100 Mbps

1 Gbps
100 Mbps

server

❑ Typically used in companies, universities, etc


❑ 10 Mbs, 100Mbps, 1Gbps, 10Gbps Ethernet
❑ Today, end systems typically connect into
Ethernet switch
Wireless access networks
❑ shared wireless access
network connects end
system to router route
❖ via base station aka “access r
point”
base
❑ wireless LANs: statio
❖ 802.11b/g (WiFi): 11 or 54 n
Mbps
❑ wider-area wireless access
❖ provided by telco operator
❖ ~1Mbps over cellular system mobil
(EVDO, HSDPA) e
❖ next up (?): WiMAX (10’s hosts
Mbps) over wide area
Introduction 1-24
Home networks
Typical home network components:
❑ DSL or cable modem
❑ router/firewall/NAT
❑ Ethernet
❑ wireless access
point
wireles
to/from s
cable router/ laptops
cable
mode firewal
headen
m l wireles
d
s
Etherne access
t point
Introduction 1-25
Physical Media
Twisted Pair (TP)
❑ Bit: propagates between ❑ two insulated copper
transmitter/rcvr pairs wires
❑ physical link: what lies ❖ Category 3: traditional
between transmitter & phone wires, 10 Mbps
receiver Ethernet
❖ Category 5:
❑ guided media:
100Mbps Ethernet
❖ signals propagate in solid
media: copper, fiber, coax
❑ unguided media:
❖ signals propagate freely,
e.g., radio

Introduction 1-26
Physical Media: coax, fiber
Coaxial cable: Fiber optic cable:
❑ two concentric copper ❑ glass fiber carrying light
conductors pulses, each pulse a bit
❑ bidirectional ❑ high-speed operation:
❑ baseband: ❖ high-speed point-to-point
❖ single channel on cable transmission (e.g., 10’s-
❖ legacy Ethernet 100’s Gps)
❑ broadband: ❑ low error rate:
❖ multiple channels on repeaters spaced far
cable apart ; immune to
❖ HFC electromagnetic noise

Introduction 1-27
Physical media: radio
❑ signal carried in Radio link types:
electromagnetic ❑ terrestrial microwave
spectrum ❖ e.g. up to 45 Mbps
❑ no physical “wire” channels

❑ bidirectional ❑ LAN (e.g., Wifi)


❖ 11Mbps, 54 Mbps
❑ propagation
❑ wide-area (e.g., cellular)
environment effects:
❖ 3G cellular: ~ 1 Mbps
❖ reflection
❖ obstruction by objects ❑ satellite
❖ interference ❖ Kbps to 45Mbps channel
(or multiple smaller
channels)
❖ 270 msec end-end delay
❖ geosynchronous versus low
Introduction 1-28
altitude
Chapter 1: roadmap
1.1 What is the Internet?
1.2 Network edge
❑ end systems, access networks, links
1.3 Network core
❑ 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

Introduction 1-29
The Network Core
❑ mesh of interconnected
routers
❑ the fundamental
question: how is data
transferred through
net?
❖ circuit switching:
dedicated circuit per
call: telephone net
❖ packet-switching:
data sent thru net in
discrete “chunks”
Introduction 1-30
Network Core: Circuit Switching

End-end resources
reserved for “call”
❑ link bandwidth,
switch capacity
❑ dedicated resources:
no sharing
❑ circuit-like
(guaranteed)
performance
❑ call setup required

Introduction 1-31
Network Core: Circuit Switching
network resources ❑ dividing link
(e.g., bandwidth) bandwidth into
divided into “pieces”
“pieces” ❖ frequency division
❑ pieces allocated to ❖ time division
calls
❑ resource piece idle if
not used by owning
call (no sharing)

Introduction 1-32
Circuit Switching: FDM and TDM
Example:
FDM
4 users

frequency

time
TDM

frequency

time
Introduction 1-33
Numerical example
❑ How long does it take to send a file of
640,000 bits from host A to host B over
a circuit-switched network?
❖ All links are 1.536 Mbps
❖ Each link uses TDM with 24 slots/sec
❖ 500 msec to establish end-to-end circuit

Let’s work it out!

Introduction 1-34
Network Core: Packet Switching
each end-end data stream resource contention:
divided into packets ❑ aggregate resource
❑ user A, B packets share demand can exceed
network resources amount available
❑ each packet uses full ❑ congestion: packets
link bandwidth queue, wait for link
❑ resources used as use
needed ❑ store and forward:
packets move one
Bandwidth division into hop at a time
“pieces” ❖ Node receives complete
Dedicated allocation packet before forwarding
Resource reservation
Introduction 1-35
Packet Switching: Statistical
Multiplexing
100
A Mb/s statistical C
Ethernet multiplexing
1.5
B Mb/s
queue of
packets
waiting for
output
link
D E

Sequence of A & B packets does not have fixed


pattern, bandwidth shared on demand  statistical
multiplexing.
TDM: each host gets same slot in revolving TDM frame.
Introduction 1-36
Packet-switching: store-and-
forward
L
R R R

❑ takes L/R seconds to Example:


transmit (push out) ❑ L = 7.5 Mbits
packet of L bits on to ❑ R = 1.5 Mbps
link at R bps
❑ transmission delay =
❑ store and forward: 15 sec
entire packet must
arrive at router
before it can be
transmitted on next
link
more on delay shortly
❑ delay = 3L/R …
(assuming zero
propagation delay) Introduction 1-37
Packet switching versus circuit
switching
Packet switching allows more users to use
network!
❑ 1 Mb/s link
❑ each user:
❖ 100 kb/s when
“active”
❖ active 10% of time
N
users 1 Mbps
❑ circuit-switching:
❖ 10 users link
❑ packet switching:
❖ with 35 users, Q: how did we get value
probability > 10 0.0004?
active at same time is
less than .0004 Introduction 1-38
Packet switching versus circuit
switching
Is packet switching a “slam dunk winner?”
❑ great for bursty data
❖ resource sharing
❖ simpler, no call setup
❑ excessive congestion: 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)
Q: human analogies of reserved resources (circuit
switching) versus on-demand allocation (packet- Introduction 1-39
switching)?
Internet structure: network of
networks
❑ roughly hierarchical
❑ at center: “tier-1” ISPs (e.g., Verizon, Sprint, AT&T,
Cable and Wireless), national/international
coverage
❖ treat each other as equals

Tier-1 Tier 1
providers ISP
interconnec
t (peer)
privately Tier 1 Tier 1
ISP ISP

Introduction 1-40
Tier-1 ISP: e.g., Sprint
POP: point-of-
presence
to/from backbone

peerin
… g…
.


to/from customers

Introduction 1-41
Internet structure: network of
networks
❑ “Tier-2” ISPs: smaller (often regional) ISPs
❖ Connect to one or more tier-1 ISPs, possibly other tier-2
ISPs

Tier-2 ISPs
Tier-2 ISP pays Tier-2 ISP also peer
Tier-2 ISP privately with
tier-1 ISP for Tier 1 each other.
connectivity to
rest of Internet
ISP
❑ tier-2 ISP is
customer of
tier-1 provider Tier 1 Tier 1
ISP Tier-2 ISP
ISP
Tier-2 ISP Tier-2 ISP

Introduction 1-42
Internet structure: network of
networks
❑ “Tier-3” ISPs and local ISPs
❖ last hop (“access”) network (closest to end systems)

loca
l Tier 3 loca
loca loca
ISP ISP l
l l
Local and ISP
Tier-2 ISP ISP Tier-2 ISP ISP
tier- 3 ISPs
are
Tier 1
customers of ISP
higher tier
ISPs
connecting Tier 1 Tier 1
ISP Tier-2 ISP
them to rest ISP
of Internet loca
Tier-2 ISP Tier-2 ISP
l
loca loca loca ISP
l l l Introduction 1-43
ISP ISP ISP
Internet structure: network of
networks
❑ a packet passes through many networks!

loca
l Tier 3 loca
loca loca
ISP ISP l
l l
ISP
Tier-2 ISP ISP Tier-2 ISP ISP
Tier 1
ISP

Tier 1 Tier 1
ISP Tier-2 ISP
ISP
loca
Tier-2 ISP Tier-2 ISP
l
loca loca loca ISP
l l l Introduction 1-44
ISP ISP ISP
Chapter 1: roadmap
1.1 What is the Internet?
1.2 Network edge
❑ end systems, access networks, links
1.3 Network core
❑ 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

Introduction 1-45
How do loss and delay occur?
packets queue in router buffers
❑ packet arrival rate to link exceeds output link
capacity
❑ packets queue, wait for turn
packet being transmitted
(delay)

B
packets queueing
(delay)
free (available) buffers: arriving
packets
Introduction 1-46
dropped (loss) if no free buffers
Four sources of packet delay
❑ 1. nodal processing: ❑ 2. queueing
❖ check bit errors ❖ time waiting at output
❖ determine output link link for transmission
❖ depends on
congestion level of
router

transmission
A propagatio
n

B
nodal
processin queuei
g ng
Introduction 1-47
Delay in packet-switched
networks
3. Transmission delay: 4. Propagation delay:
❑ R=link bandwidth ❑ d = length of physical
(bps) link
❑ L=packet length ❑ s = propagation speed
(bits) in medium (~2x108
❑ time to send bits into m/sec)
link = L/R ❑ propagation
Note: delay
s and R are =
very
d/s
different quantities!
transmissio
A n
propagatio
n

B
nodal
processin queuei
Introduction 1-48
g ng
Caravan analogy
100 100
km km
ten-car toll toll
carava boot boot
n h h
❑ cars “propagate” at ❑ Time to “push” entire
100 km/hr caravan through toll
❑ toll booth takes 12 sec booth onto highway =
to service car 12*10 = 120 sec
(transmission time) ❑ Time for last car to
❑ car~bit; caravan ~ propagate from 1st to
packet 2nd toll both:
100km/(100km/hr)= 1
❑ Q: How long until
hr
caravan is lined up
before 2nd toll booth? ❑ A: 62 minutes
Introduction 1-49
Caravan analogy (more)
100 100
km km
ten-car toll toll
carava boot boot
n h h
❑ Yes! After 7 min, 1st car
❑ Cars now “propagate” at 2nd booth and 3 cars
at still at 1st booth.
1000 km/hr ❑ 1st bit of packet can
❑ Toll booth now takes 1 arrive at 2nd router
min to service a car before packet is fully
❑ Q: Will cars arrive to transmitted at 1st
2nd booth before all router!
cars serviced at 1st ❖ See Ethernet applet at
booth? AWL Web site
Introduction 1-50
Nodal delay

❑ dproc = processing delay


❖ typically a few microsecs or less
❑ dqueue = queuing delay
❖ depends on congestion
❑ dtrans = transmission delay
❖ = L/R, significant for low-speed links
❑ dprop = propagation delay
❖ a few microsecs to hundreds of msecs

Introduction 1-51
Queueing delay (revisited)

❑ R=link bandwidth
(bps)
❑ L=packet length
(bits)
❑ a=average packet
traffic intensity
arrival rate = La/R

❑ La/R ~ 0: average queueing delay small


❑ La/R -> 1: delays become large
❑ La/R > 1: more “work” arriving than can
be serviced, average delay infinite!
Introduction 1-52
“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
3
probes probes
3
probes

Introduction 1-53
“Real” Internet delays and
routes
traceroute: gaia.cs.umass.edu to www.eurecom.fr
Three 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-
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 oceanic
10 de.fr1.fr.geant.net (62.40.96.50) 113 ms 121 ms 114 ms link
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
19 fantasia.eurecom.frreplying)
(193.55.113.142) 132 ms 128 ms 136 ms

Introduction 1-54
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,buffer
by source end system, or
packet being
not A
at all (waiting
transmitted
area)

B
packet arriving
to
full buffer is lost
Introduction 1-55
Throughput
❑ throughput: rate (bits/time unit) at
which bits transferred between
sender/receiver
❖ instantaneous: rate at given point in time
❖ average: rate over longer period of time

server,
server with
sends linkcan carry
pipe that link can carry
pipe that
filebits
of F bits capacity
fluid at rate capacity
fluid at rate
to send
(fluid) to
into pipe R
Rs bits/sec
bits/sec) RcRbits/sec
bits/sec)
s c
client
Introduction 1-56
Throughput (more)
❑ Rs < Rc What is average end-end
throughput?
Rs bits/sec Rc bits/sec

❑ Rs > Rc What is average end-end


throughput?
Rs bits/sec Rc bits/sec

bottleneck link
link on end-end path that constrains end-end
throughput
Introduction 1-57
Throughput: Internet
scenario
Rs
❑ per-connection
Rs Rs
end-end
throughput:
R
min(Rc,Rs,R/10)
❑ in practice: Rc or Rc Rc
Rs is often Rc
bottleneck
10 connections (fairly) share
backbone bottleneck link R
bits/sec Introduction 1-58
Chapter 1: roadmap
1.1 What is the Internet?
1.2 Network edge
❑ end systems, access networks, links
1.3 Network core
❑ 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

Introduction 1-59
Protocol “Layers”
Networks are
complex!
❑ many “pieces”:
Question:
❖ hosts
Is there any hope of
❖ routers organizing structure
❖ links of various of network?
media
❖ applications Or at least our
❖ protocols discussion of
❖ hardware, networks?
software

Introduction 1-60
Organization of air travel

ticket ticket
(purchase) (complain)

baggage baggage
(check) (claim)

gates (load) gates (unload)

runway takeoff runway landing


airplane
airplane routing airplane
routing
routing

❑ a series of steps

Introduction 1-61
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
departur intermediate air- arrival
e traffic airpor
airport control centers t

Layers: each layer implements a service


❖ via its own internal-layer actions
❖ relying on services provided by layer below

Introduction 1-62
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-63
Internet protocol stack
❑ application: supporting network
applications applicatio
❖ FTP, SMTP, HTTP
n
❑ 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
❖ PPP, Ethernet
❑ physical: bits “on the wire”
Introduction 1-64
ISO/OSI reference model
❑ presentation: allow applications
to interpret meaning of data, application
e.g., encryption, compression,
presentatio
machine-specific conventions n
❑ session: synchronization,
session
checkpointing, recovery of data
exchange transport
❑ Internet stack “missing” these network
layers!
link
❖ these services, if needed, must
be implemented in application physical
❖ needed?
Introduction 1-65
sourc
messag M e
applicatio
Encapsulation
H
e
segmen H M
t
n
t
datagra Hn Ht M transport
m
fram Hl
H
Ht M network
n

e link
physical link
physical

switc
h

H H
destinatio M network
H H
n H
t H H
M napplicatio M link M
H l n t n t
M n physical
H H
t

H H H
M transport
n t
M network rout
l n t er
link
physical
Introduction 1-66
Chapter 1: roadmap
1.1 What is the Internet?
1.2 Network edge
❑ end systems, access networks, links
1.3 Network core
❑ 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

Introduction 1-67
Network Security
❑ The field of network security is about:
❖ 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” Introduction 1-68
Bad guys can put malware into
hosts via Internet
❑ Malware can get in host from a virus, worm, or
trojan horse.

❑ Spyware malware can record keystrokes, web


sites visited, upload info to collection site.

❑ Infected host can be enrolled in a botnet, used


for spam and DDoS attacks.

❑ Malware is often self-replicating: from an


infected host, seeks entry into other hosts

Introduction 1-69
Bad guys can put malware into
hosts via Internet
❑ Trojan horse ❑ Worm:
❖ Hidden part of some ❖ infection by passively
otherwise useful receiving object that gets
software itself executed
❖ Today often on a Web ❖ self- replicating:
page (Active-X, plugin) propagates to other hosts,
❑ Virus users
Sapphire Worm: aggregate scans/sec
❖ infection by receiving in first 5 minutes of outbreak (CAIDA, UWisc
data)
object (e.g., e-mail
attachment), actively
executing
❖ self-replicating:
propagate itself to
other hosts, users
Introduction 1-70
Bad guys can attack servers and
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 toward
target from targe
compromised hosts t

Introduction 1-71
The 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-72
The bad guys can use false
source addresses
❑ IP spoofing: send packet with false source
address
A C

src:B dest:A payload

Introduction 1-73
The bad guys can record and
playback
❑ record-and-playback: sniff sensitive info (e.g.,
password), and use later
❖ password holder is that user from system
point of view

C
A

src:B dest:A user: B; password: foo

Introduction 1-74
Network Security
❑ more throughout this course
❑ chapter 8: focus on security
❑ crypographic techniques: obvious uses
and not so obvious uses

Introduction 1-75
Chapter 1: roadmap
1.1 What is the Internet?
1.2 Network edge
❑ end systems, access networks, links
1.3 Network core
❑ 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

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

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

Introduction 1-78
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-79
Internet History
1990, 2000’s: commercialization, the Web, new
apps
❑ Early 1990’s: ARPAnet Late 1990’s – 2000’s:
decommissioned ❑ more killer apps: instant
❑ 1991: NSF lifts restrictions on messaging, P2P file
commercial use of NSFnet sharing
(decommissioned, 1995) ❑ network security to
❑ early 1990s: Web forefront
❖ hypertext [Bush 1945, ❑ est. 50 million host, 100
Nelson 1960’s] million+ users
❖ HTML, HTTP: Berners-Lee ❑ backbone links running at
❖ 1994: Mosaic, later Gbps
Netscape
❖ late 1990’s:
commercialization of the
Web
Introduction 1-80
Internet History

2007:
❑ ~500 million hosts
❑ Voice, Video over IP
❑ P2P applications: BitTorrent
(file sharing) Skype (VoIP),
PPLive (video)
❑ more applications:
YouTube, gaming
❑ wireless, mobility

Introduction 1-81
Introduction: Summary
Covered a “ton” of
material! You now have:
❑ Internet overview ❑ context, 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
Introduction 1-82

You might also like