Chapter 1
Chapter 1
Chapter 1
our goal: overview:
Introduction v get “feel” and v what’s the Internet?
terminology v what’s a protocol?
v network edge; hosts, access net,
v more depth, detail
physical media
A note on the use of these ppt slides: later in course v network core: packet/circuit
Computer
v approach:
We’re making these slides freely available to all (faculty, students, readers).
switching, Internet structure
They’re in PowerPoint form so you see the animations; and can add, modify,
and delete slides (including this one) and slide content to suit your needs. Networking: A Top
§ use Internet as v performance: loss, delay,
They obviously represent a lot of work on our part. In return for use, we only
ask the following: Down Approach throughput
v If you use these slides (e.g., in a class) that you mention their source
(after all, we’d like people to use our book!)
6th edition example
v If you post any slides on a www site, that you note that they are adapted Jim Kurose, Keith Ross v security
from (or perhaps identical to) our slides, and note our copyright of this Addison-Wesley v protocol layers, service models
material.
March 2012
Thanks and enjoy! JFK/KWR v history
All material copyright 1996-2012
J.F Kurose and K.W. Ross, All Rights Reserved
Slingbox: watch,
control cable TV remotely
institutional
Internet network
refrigerator Internet phones
cable splitter
DSL splitter modem
modem DSLAM
ISP
voice, data transmitted
at different frequencies over DSL access
dedicated line to central office multiplexer 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
v use existing telephone line to central office DSLAM E
O
E
O
E
O
E
O
E
O
E
O
T
A
T
A
O
L
Channels
§ voice over DSL phone line goes to telephone net
v < 2.5 Mbps upstream transmission rate (typically < 1 Mbps) frequency division multiplexing: different channels transmitted
v < 24 Mbps downstream transmission rate (typically < 10 Mbps) in different frequency bands
Introduction 1-13 Introduction 1-14
coaxial cable: fiber optic cable: v signal carried in radio link types:
v two concentric copper v glass fiber carrying light electromagnetic spectrum v terrestrial microwave
conductors pulses, each pulse a bit v no physical “wire” § e.g. up to 45 Mbps channels
v bidirectional v high-speed operation: v bidirectional v LAN (e.g., WiFi)
v broadband: § high-speed point-to-point v propagation environment § 11Mbps, 54 Mbps
§ multiple channels on cable transmission (e.g., 10’s-100’s effects: v wide-area (e.g., cellular)
Gpbs transmission rate) § 3G cellular: ~ few Mbps
§ HFC § reflection
v low error rate: satellite
§ obstruction by objects v
§ repeaters spaced far apart § Kbps to 45Mbps channel (or
§ immune to electromagnetic § interference multiple smaller channels)
noise § 270 msec end-end delay
§ geosynchronous versus low
altitude
R = 100 Mb/s C
L bits
A
per packet
D
3 2 1 R = 1.5 Mb/s
source destination B
R bps R bps queue of packets E
waiting for output link
v takes L/R seconds to one-hop numerical example:
transmit (push out) L-bit
packet into link at R bps § L = 7.5 Mbits queuing and loss:
v store and forward: entire § R = 1.5 Mbps v If arrival rate (in bits) to link exceeds transmission rate of
packet must arrive at router § one-hop transmission link for a period of time:
before it can be transmitted delay = 5 sec § packets will queue, wait to be transmitted on link
on next link § packets can be dropped (lost) if memory (buffer) fills up
v end-end delay = 2L/R (assuming
zero propagation delay) more on delay shortly …
Introduction 1-25 Introduction 1-26
…..
users
• 100 kb/s when “active”
• active 10% of time 1 Mbps link
time
TDM
v circuit-switching:
§ 10 users
v packet switching: Q: how did we get value 0.0004?
frequency
§ with 35 users, probability >
10 active at same time is less Q: what happens if > 35 users ?
than .0004 *
time
Introduction 1-29 * Check out the online interactive exercises for more examples Introduction 1-30
v Q: How to provide circuit-like behavior? v Let’s take a stepwise approach to describe current Internet
§ bandwidth guarantees needed for audio/video apps structure
§ still an unsolved problem (chapter 7)
access access
access net access net
net net
…
…
…
to each other directly doesn’t
…
access access access access
…
net net net net
access access
net net
access access
net net
access access
net net
access access
…
net net
… access
net access
access
net
… … access
net access
access
net
…
net net
…
…
…
global
access
net
ISP access
net
access
net ISP B
access
net
access access
ISP C
net net
access access
net net
access access
net net
access access
net net
… access
net access
access
net
… … access
net access
access
net
…
net net
Internet structure: network of networks Internet structure: network of networks
But if one global ISP is viable business, there will be … and regional networks may arise to connect access nets to
competitors …. which must be interconnected ISPS
Internet exchange point
…
access access
net net … … access
net
access
net …
access access
net net
access access
access net access net
net net
access
IXP access
access
IXP access
net net
net
ISP A net
ISP A
…
…
…
…
access IXP access access IXP access
net ISP B net net ISP B net
access
ISP C access
ISP C
net net
access access
net net
access
access
net IXP IXP IXP
net
access
IXP access
net
net
ISP A
Regional ISP Regional ISP
Content provider network
…
average queueing
ten-car toll toll v R: link bandwidth (bps)
delay
caravan booth booth v L: packet length (bits)
v a: average packet arrival
v suppose cars now “propagate” at 1000 km/hr rate
v and suppose toll booth now takes one min to service a car
traffic intensity
v Q: Will cars arrive to 2nd booth before all cars serviced at first = La/R
booth?
v La/R ~ 0: avg. queueing delay small La/R ~ 0
§ A: Yes! after 7 min, 1st car arrives at second booth; three v La/R -> 1: avg. queueing delay large
cars still at 1st booth.
v 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-47 Introduction 1-48
“Real” Internet delays and routes “Real” Internet delays, routes
v what do “real” Internet delay & loss look like? traceroute: gaia.cs.umass.edu to www.eurecom.fr
v traceroute program: provides delay 3 delay measurements from
gaia.cs.umass.edu to cs-gw.cs.umass.edu
measurement from source to router along end- 1 cs-gw (128.119.240.254) 1 ms 1 ms 2 ms
end Internet path towards destination. For all i: 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
§ sends three packets that will reach router i on path 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
towards destination 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
§ router i will return packets to sender 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
§ sender times interval between transmission and reply. 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
3 probes 3 probes 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 * * *
3 probes 18 * * * * means no response (probe lost, router not replying)
19 fantasia.eurecom.fr (193.55.113.142) 132 ms 128 ms 136 ms
buffer
packet being transmitted
A (waiting area)
server,
server withbits
sends linkpipe
capacity
that can carry linkpipe
capacity
that can carry
B file of F
(fluid) intobitspipe Rs bits/sec
fluid at rate Rc bits/sec
fluid at rate
packet arriving to to send to client Rs bits/sec) Rc bits/sec)
full buffer is lost
* Check out the Java applet for an interactive animation on queuing and loss Introduction 1-51 Introduction 1-52
Throughput (more) Throughput: Internet scenario
bottleneck link
link on end-end path that constrains end-end throughput 10 connections (fairly) share
backbone bottleneck link R bits/sec
Introduction 1-53 Introduction 1-54
airplane routing airplane routing airplane routing airplane routing airplane routing
runway takeoff runway landing
departure intermediate air-traffic arrival
airport control centers airport
airplane routing airplane routing
airplane routing layers: each layer implements a service
§ via its own internal-layer actions
v a series of steps § relying on services provided by layer below
Bad guys can sniff packets Bad guys can use fake addresses
packet “sniffing”:
§ broadcast media (shared ethernet, wireless) IP spoofing: send packet with false source address
§ promiscuous network interface reads/records all packets
(e.g., including passwords!) passing by A C
v wireshark software used for end-of-chapter labs is a … lots more on security (throughout, Chapter 8)
(free) packet-sniffer
Introduction 1-67 Introduction 1-68
Chapter 1: roadmap Internet history
1961-1972: Early packet-switching principles
1.1 what is the Internet?
v 1961: Kleinrock - v 1972:
1.2 network edge queueing theory shows § ARPAnet public demo
§ end systems, access networks, links effectiveness of packet- § NCP (Network Control
switching Protocol) first host-host
1.3 network core
v 1964: Baran - packet- protocol
§ packet switching, circuit switching, network structure switching in military nets § first e-mail program
1.4 delay, loss, throughput in networks v 1967: ARPAnet § ARPAnet has 15 nodes
conceived by Advanced
1.5 protocol layers, service models Research Projects
1.6 networks under attack: security Agency
1.7 history v 1969: first ARPAnet
node operational
Introduction: summary
covered a “ton” of material! you now have:
v Internet overview v context, overview, “feel”
v what’s a protocol? of networking
v network edge, core, access v more depth, detail to
network follow!
§ packet-switching versus
circuit-switching
§ Internet structure
v performance: loss, delay,
throughput
v layering, service models
v security
v history
Introduction 1-75