Download Introduction

Document related concepts

Net neutrality wikipedia , lookup

Wireless security wikipedia , lookup

Asynchronous Transfer Mode wikipedia , lookup

Distributed firewall wikipedia , lookup

Internet protocol suite wikipedia , lookup

Zero-configuration networking wikipedia , lookup

Peering wikipedia , lookup

Net neutrality law wikipedia , lookup

Wake-on-LAN wikipedia , lookup

Computer network wikipedia , lookup

Network tap wikipedia , lookup

Airborne Networking wikipedia , lookup

Recursive InterNetwork Architecture (RINA) wikipedia , lookup

IEEE 1355 wikipedia , lookup

Deep packet inspection wikipedia , lookup

Cracking of wireless networks wikipedia , lookup

Packet switching wikipedia , lookup

Net bias wikipedia , lookup

Piggybacking (Internet access) wikipedia , lookup

Transcript
Chapter 1
Introduction
Computer
Networking: A Top
Down Approach
6th edition
Jim Kurose, Keith Ross
Addison-Wesley
March 2012
Slides are adopted from slides by J.F Kurose and
K.W. Ross
All material copyright 1996-2012
J.F Kurose and K.W. Ross, All Rights Reserved
Introduction
1-1
Chapter 1: Introduction
Our goal:
q  get “feel” and
terminology
q  more depth, detail
later in course
q  approach:
v  use Internet as
example
Overview:
q  what’s the Internet?
q  what’s a protocol?
q  network edge; hosts, access
net, physical media
q  network core: packet/circuit
switching, Internet structure
q  performance: loss, delay,
throughput
q  protocol layers, service models
q  history
Introduction
1-2
A communication network built
2000 yrs ago
q  Scale: >1,200 watchtowers
and blockhouses, span
>3100 miles
q  Protocol: "if enemies are
100-500, then set off the
smoke for one time with
one shot of fire gun; if
500-1000, two times of
smoke with two shots of
fire gun…"
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 History
Introduction
1-4
What’s the Internet: “nuts and bolts”
view
q  millions of connected
PC
computing devices:
_____________
v  running net apps
server
wireless
laptop
cellular
handheld
q  communication
access
points
wired
links
links
v  Ex:_________
Mobile network
Global ISP
Home network
Regional ISP
Institutional network
q  routers:
v  _________
router
Introduction
1-5
“Cool” internet appliances
Web-enabled toaster +
weather forecaster
IP picture frame
Internet phones
Google powermeter
http://www.google.org/powermeter
Introduction
1-6
What’s the Internet: “nuts and bolts”
view
q  protocols control sending,
Mobile network
receiving of msgs
v 
Ex:____________
q  Internet: “network of
networks”
v 
v 
Global ISP
loosely hierarchical
public Internet versus
private intranet
q  Internet standards
v  RFC: Request for comments
v  IETF: Internet Engineering
Task Force
Home network
Regional ISP
Institutional network
Introduction
1-7
What’s a protocol?
human protocols:
q  Ex?
… specific msgs sent
… specific actions taken
when msgs received,
or other events
network protocols:
q  machines rather than
humans
q  all communication
activity in Internet
governed by protocols
protocols define_____, _____of msgs sent and
received among network entities, and actions
taken on msg ______, _________
Introduction
1-8
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
Introduction
1-9
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 History
Introduction
1-10
A closer look at network structure:
q  network edge:
v  ____________
v  ____________
q  access networks,
physical media:
wired, wireless
communication links
q  network core:
v  ___________
Introduction
1-11
The network edge:
q  end systems (hosts):
v 
v 
v 
run application programs
e.g. Web, email
at “edge of network”
peer-peer
q  client/server model
v 
v 
client host requests, receives
service from always-on server
Ex:___________________ client/server
q  peer-peer model:
v 
v 
minimal (or no) use of
dedicated servers
Ex:________________
Introduction
1-12
Access networks and physical media
Q: How to connect end
systems to edge router?
q  ______________
q  ______________
q  ______________
Keep in mind:
q  bandwidth (bits per
second) of access
network?
q  shared or dedicated?
Introduction
1-13
Dial-up Modem
central
office
home
PC
v 
v 
v 
home
dial-up
modem
telephone
network
Internet
ISP
modem
(e.g., AOL)
Uses existing telephony infrastructure
v  Home is connected to central office
up to____Kbps direct access to router (often less)
Can’t surf and phone at same time: not “always on”
Digital Subscriber Line (DSL)
Existing phone line:
0-4KHz phone; 4-50KHz
upstream data; 50KHz-1MHz
downstream data
home
phone
Internet
DSLAM
telephone
network
splitter
DSL
modem
home
PC
v  Also
central
office
uses existing telephone infrastruture
v  up to 2.5 Mbps upstream
v  up to 24 Mbps downstream
v  dedicated physical line to telephone central office
Residential access: cable modems
q  Does not use telephone infrastructure
v  Instead uses cable TV infrastructure
q  HFC: hybrid fiber coax
v  asymmetric:
up to 30Mbps downstream, 2
Mbps upstream
q  network of cable and fiber attaches homes to
ISP router
v  homes share access to router
v  unlike DSL, which has dedicated access
Introduction
1-16
Ethernet Internet access
router
100 Mbps
switch
To Institution’s
ISP
100 Mbps
1 Gbps
100 Mbps
server
q  Typically used in companies, universities, etc
q  10 Mbs, 100Mbps, 1Gbps, 10Gbps Ethernet
q  Today, end systems typically connect into Ethernet
switch
Wireless access networks
wireless access network
connects end system to router
q  shared
v 
router
via base station aka “________”
q  wireless LANs:
v  802.11a/b/g/n (WiFi): ___ (b) __ (a/g)
____(n) Mbps
q  wider-area wireless access
v  provided by telco operator
v  3G: ~1Mbps over cellular system
(EVDO, HSDPA)
v  4G: WiMAX, LTE (10’s Mbps)
switch
mobile
hosts
Check out MSU wireless network deployment at:
http://wireless.msu.edu/maps/
Introduction
1-18
Physical Media
q  Bit: propagates between
transmitter/rcvr pairs
q  physical link: what lies
between transmitter &
receiver
q  guided media:
v 
signals propagate in solid media,
e.g., _________________
Twisted Pair (TP)
q  two insulated copper
wires
v 
v 
Category 3: traditional
phone wires, 10 Mbps
Ethernet
Category 5:
100Mbps Ethernet
q  unguided media:
v  signals propagate freely, e.g.,
radio, satellite
Introduction
1-19
Physical Media: coax, fiber
Coaxial cable:
Fiber optic cable:
conductors
q  bidirectional
q  baseband:
pulses, each pulse a bit
q  high-speed operation:
q  two concentric copper
v 
v 
single channel on cable
legacy Ethernet
q  broadband:
v  multiple channels on
cable
q  glass fiber carrying light
v 
high-speed point-to-point
transmission (e.g.,
10’s-100’s Gps)
q  low error rate: repeaters
spaced far apart ; immune
to electromagnetic noise
Introduction
1-20
Physical media: radio
q  signal carried in
electromagnetic
spectrum
q  no physical “wire”
q  bidirectional
q  propagation
environment effects:
v 
v 
v 
obstruction by objects
________
________
Radio link types:
q  terrestrial microwave
v  e.g. up to 45 Mbps channels
q  LAN (e.g., Wifi)
v  11Mbps, 54 Mbps
q  wide-area (e.g., cellular)
v  3G cellular: ~ 1 Mbps
q  satellite
v  Kbps to 45Mbps channel (or
multiple smaller channels)
v  270 msec end-end delay
v  geosynchronous versus low
altitude
Introduction
1-21
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 History
Introduction
1-22
The Network Core
q  mesh of interconnected
routers
q  the fundamental
question: how is data
transferred through net?
v  _______________:
dedicated circuit per
call: telephone net
v  _______________:
data sent thru net in
discrete “chunks”
Introduction
1-23
Network Core: Circuit Switching
End-end resources
reserved for “call”
q  link bandwidth, switch
capacity
q  dedicated resources:
no sharing
q  circuit-like
(guaranteed)
performance
q  call setup required
Introduction
1-24
Network Core: Circuit Switching
network resources
(e.g., bandwidth)
divided into “pieces”
q  dividing link bandwidth
into “pieces”
v  _____________
q  pieces allocated to calls
idle if
not used by owning call
(no sharing)
q  resource piece
v  _____________
Introduction
1-25
Circuit Switching: FDM and TDM
Example: 4 users
FDM
frequency
time
TDM
frequency
time
Introduction
1-26
Numerical example
q  How long does it take to send a file of
640,000 bits from host A to host B over a
circuit-switched network?
v  All
links are 1.536 Mbps
v  Each link uses TDM with 24 slots/sec
v  500 msec to establish end-to-end circuit
Introduction
1-27
Network Core: Packet Switching
each end-end data stream
divided into packets
q  user A, B packets share
network resources
q  each packet uses full link
bandwidth
q  resources used as needed
Bandwidth division into “pieces”
Dedicated allocation
Resource reservation
resource contention:
q  aggregate resource
demand can exceed
amount available
q  _________: packets
queue, wait for link use
q  _______________:
packets move one hop
at a time
v 
Node receives complete
packet before forwarding
Introduction
1-28
Packet Switching: Statistical Multiplexing
100 Mbps
Ethernet
A
B
C
1.5 Mbps
queue of packets
waiting for output
link
D
E
TDM: each host gets same slot in revolving TDM frame.
Introduction
1-29
Packet-switching: store-and-forward
L
R
q  takes __________
R
seconds to transmit
(push out) packet of L
bits on to link at R bps
q  store and forward:
entire packet must
arrive at router before
it can be transmitted
on next link
q  delay = __________
(assuming zero
propagation delay)
R
Example:
q  L = 7.5 Mbits
q  R = 1.5 Mbps
q  transmission delay = 15 sec
more on delay shortly …
Introduction
1-30
Packet switching versus circuit switching
Packet switching allows more users to use network!
q  1 Mbps link
q  each user:
v  100 kbps when “active”
v  active 10% of time
N users
q  circuit-switching:
v  support_______ users
q  packet switching:
v  with 35 users,
probability > 10 active
at same time is less
than .0004
1 Mbps link
Q: how did we get value 0.0004?
Introduction
1-31
Packet switching versus circuit switching
Is packet switching a “slam dunk winner?”
q  great for bursty data
v  resource
sharing
v  simpler, no call setup
q  excessive congestion: packet delay and loss
v  protocols needed for reliable data transfer,
congestion control
q  Q: How to provide circuit-like behavior?
v  bandwidth guarantees needed for audio/video apps
v  still an unsolved problem (chapter 7)
Introduction
1-32
Internet structure: network of networks
q  “Tier-1”, “Tier-2”, and “Tier-3” ISPs and local ISPs
v  Tier-3: last hop (“access”) network (closest to end systems)
local
ISP
Local and tier3 ISPs are
customers of
higher tier
ISPs
connecting
them to rest
of Internet
Tier 3
ISP
Tier-2 ISP
local
ISP
local
ISP
local
ISP
Tier-2 ISP
Tier 1 ISP
Tier 1 ISP
Tier-2 ISP
local
local
ISP
ISP
Tier 1 ISP
Tier-2 ISP
local
ISP
Tier-2 ISP
local
ISP
Introduction
1-33
Internet structure: network of networks
q  a packet passes through many networks!
local
ISP
Tier 3
ISP
Tier-2 ISP
local
ISP
local
ISP
local
ISP
Tier-2 ISP
Tier 1 ISP
Tier 1 ISP
Tier-2 ISP
local
local
ISP
ISP
Tier 1 ISP
Tier-2 ISP
local
ISP
Tier-2 ISP
local
ISP
Introduction
1-34
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 History
Introduction
1-35
Four sources of packet delay
q  1. nodal processing:
v  check bit errors
v  determine output link
q  2. queueing
v  time waiting at output
link for transmission
v  depends on congestion
level of router
A
B
Introduction
1-36
Delay in packet-switched networks
3. Transmission delay:
q  R=link bandwidth (bps)
q  L=packet length (bits)
q  time to send bits into
link = L/R
4. Propagation delay:
q  d = length of physical link
q  s = propagation speed in
medium (~2x108 m/sec)
q  propagation delay = d/s
Note: s and R are very
different quantities!
A
B
Introduction
1-37
Nodal delay
d nodal = d proc + d queue + d trans + d prop
q  dproc = processing delay
v  typically a few microsecs or less
q  dqueue = queuing delay
v  depends on congestion
q  dtrans = transmission delay
v  = L/R, significant for low-speed links
q  dprop = propagation delay
v  a few microsecs to hundreds of msecs
Introduction
1-38
Caravan analogy
100 km
ten-car
caravan
toll
booth
q  cars “propagate” at
100 km/hr
q  toll booth takes 12 sec to
service car (transmission
time)
q  car~bit; caravan ~ packet
q  Q: How long until caravan
is lined up before 2nd toll
booth?
100 km
toll
booth
q  Time to “push” entire
caravan through toll
booth onto highway =
_________ sec
q  Time for last car to
propagate from 1st to
2nd toll both:
___________________
q  A: ________ minutes
Introduction
1-39
Caravan analogy (more)
100 km
ten-car
caravan
toll
booth
q  Cars now “propagate”
at
1000 km/hr
q  Toll booth now takes 1
min to service a car
q  Q: Will cars arrive to
2nd booth before all
cars serviced at 1st
booth?
100 km
toll
booth
q  Yes! After _____ min, 1st
car at 2nd booth and 3
cars still at 1st booth.
q  1st bit of packet can
arrive at 2nd router
before packet is fully
transmitted at 1st router!
Introduction
1-40
“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:
v 
v 
v 
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-41
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
Introduction
1-42
Protocol “Layers”
Networks are complex!
q  many “pieces”:
v  hosts
v  routers
v  links of various
media
v  applications
v  protocols
v  hardware,
software
Question:
Is there any hope of
organizing structure of
network?
Or at least our discussion
of networks?
Introduction
1-43
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
q  a series of steps
Introduction
1-44
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
departure
airport
airplane routing
airplane routing
intermediate air-traffic
control centers
arrival
airport
Layers: each layer implements a service
v  via its own internal-layer actions
v  relying on services provided by layer below
Introduction
1-45
Why layering?
Dealing with complex systems:
q  explicit structure allows identification,
relationship of complex system’s pieces
v  layered reference model for discussion
q  modularization eases maintenance, updating of
system
v  change of implementation of layer’s service
transparent to rest of system
v  e.g., change in gate procedure doesn’t affect
rest of system
q  layering considered harmful?
Introduction
1-46
Internet protocol stack
q  _________: supporting network
applications
v 
Ex:________________
q  _________: process-process data
transfer
v 
Ex:__________________
q  _________: routing of datagrams
from source to destination
v 
Ex:_______________
q  _________: data transfer between
neighboring network elements
v 
Ex:______________
q  _________: bits “on the wire”
Introduction
1-47
ISO/OSI reference model
q  presentation: allow applications to
interpret meaning of data, e.g.,
encryption, compression, machinespecific conventions
q  session: synchronization,
checkpointing, recovery of data
exchange
q  Internet stack “missing” these
layers!
v  these services, if needed, must
be implemented in application
v  needed?
application
presentation
session
transport
network
link
physical
Introduction
1-48
source
message
segment Ht
M
datagram Hn Ht
M
frame Hl Hn Ht
M
M
application
transport
network
link
physical
Encapsulation
switch
destination
M
Ht
M
Hn Ht
Hl Hn Ht
M
M
application
transport
network
link
physical
Hn Ht
M
router
Introduction
1-49
Internet History
1961-1972: Early packet-switching principles
q  1961: Kleinrock - queueing
theory shows
effectiveness of packetswitching
q  1964: Baran - packetswitching in military nets
q  1967: ARPAnet conceived
by Advanced Research
Projects Agency
q  1969: first ARPAnet node
operational
q  1972:
v 
v 
v 
v 
ARPAnet public demonstration
NCP (Network Control Protocol)
first host-host protocol
first e-mail program
ARPAnet has 15 nodes
Introduction
1-50
Internet History
1972-1980: Internetworking, new and proprietary nets
q  1970: ALOHAnet satellite
q 
q 
q 
q 
q 
network in Hawaii
1974: Cerf and Kahn architecture for
interconnecting networks
1976: Ethernet at Xerox
PARC
late70’s: proprietary
architectures: DECnet, SNA,
XNA
late 70’s: switching fixed
length packets (ATM
precursor)
1979: ARPAnet has 200 nodes
Cerf and Kahn’s internetworking
principles:
v  minimalism, autonomy - no
internal changes required
to interconnect networks
v  best effort service model
v  stateless routers
v  decentralized control
define today’s Internet
architecture
Introduction
1-51
Internet History
1980-1990: new protocols, a proliferation of networks
q  1983: deployment of
TCP/IP
q  1982: smtp e-mail
protocol defined
q  1983: DNS defined for
name-to-IP-address
translation
q  1985: ftp protocol
defined
q  1988: TCP congestion
control
q  new national networks:
Csnet, BITnet,
NSFnet, Minitel
q  100,000 hosts
connected to
confederation of
networks
Introduction
1-52
Internet History
1990, 2000’s: commercialization, the Web, new apps
q  Early 1990’s: ARPAnet
decommissioned
q  1991: NSF lifts restrictions on
commercial use of NSFnet
(decommissioned, 1995)
q  early 1990s: Web
v  hypertext [Bush 1945, Nelson
1960’s]
v  HTML, HTTP: Berners-Lee
v  1994: Mosaic, later Netscape
v  late 1990’s:
commercialization of the Web
Late 1990’s – 2000’s:
q  more killer apps: instant
messaging, P2P file sharing
q  network security to
forefront
q  est. 50 million host, 100
million+ users
q  backbone links running at
Gbps
Introduction
1-53
Internet History
2007:
q  ~500 million hosts
q  Voice, Video over IP
q  P2P applications: BitTorrent
(file sharing) Skype (VoIP),
PPLive (video)
q  more applications: YouTube,
gaming
q  wireless, mobility
2020: ??
Introduction
1-54
Introduction: Summary
Covered a “ton” of material!
q  Internet overview
q  what’s a protocol?
q  network edge, core, access
network
v  packet-switching versus
circuit-switching
v  Internet structure
q  performance: loss, delay,
throughput
q  layering, service models
q  history
You now have:
q  context, overview,
“feel” of networking
q  more depth, detail to
follow!
Introduction
1-55