LHU COMP 200
Chapter 1 ( 1 B )
Introduction
These slides are not a substitute for
reading the text. Slides drawn from: Computer
Networking: A Top Down
Approach
7th edition.
Jim Kurose, Keith Ross
Pearson/Addison Wesley
Introduction 1-1
Chapter 1: roadmap
1.1 what is the Internet?
1.2 network edge
end systems, access networks, links
1.3 network core
packet switching, circuit switching, network structure
1.4 *** delay, loss, throughput in networks ***
1.5 protocol layers, service models
1.6 networks under attack: security
1.7 history
Introduction 1-2
How do loss and delay occur?
packets queue in router buffers
packet arrival rate to link (temporarily) exceeds output link
capacity
packets queue, wait for turn
packet being transmitted (delay)
B
packets queueing (delay)
free (available) buffers: arriving packets p 37
dropped (loss) if no free buffers
Introduction 1-3
Four sources of packet delay
transmission
A propagation
B
nodal
processing queueing
dnodal = dproc + dqueue + dtrans + dprop
dproc: nodal processing dqueue: queueing delay
check bit errors time waiting at output link
determine output link for transmission
typically < msec depends on congestion
level of router p 36-38
Introduction 1-4
Four sources of packet delay
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 bandwidth (bps) s: propagation speed (~2x108 m/sec)
dtrans = L/R dtrans and dprop dprop = d/s
very different
* Check out the online interactive exercises for more examples: http://gaia.cs.umass.edu/kurose_ross/interactive/
* Check out the Java applet for an interactive animation on trans vs. prop delay Introduction 1-5
Caravan analogy
100 km 100 km
ten-car toll toll
caravan booth booth
cars “propagate” at time to “push” entire
100 km/hr caravan through toll
toll booth takes 12 sec to booth onto highway =
service car (bit transmission 12*10 = 120 sec
time) time for last car to
car ~ bit ; caravan ~ packet propagate from 1st to
Q: How long until caravan is 2nd toll both:
lined up before 2nd toll 100km/(100km/hr)= 1
booth? hr
p 38
A: 62 minutes
Introduction 1-6
Caravan analogy (more)
100 km 100 km
ten-car toll toll
caravan booth booth
suppose cars now “propagate” at 1000 km/hr
and now suppose toll booth 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
• First bit of packet can arrive at 2nd router before packet is
fully transmitted at 1st router!
Introduction 1-7
Queueing delay (revisited)
average queueing
R: link bandwidth (bps)
delay
L: packet length (bits)
a: average packet arrival
rate
L*a/R =traffic intensity traffic intensity
= La/R
La/R ~ 0: avg. queueing delay small La/R ~ 0
La/R -> 1: avg. queueing delay large
La/R > 1: more “work” arriving
than can be serviced, average delay infinite!
p 40
La/R -> 1
* Check online interactive animation on queuing and loss
Introduction 1-8
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
buffer
(waiting area) packet being transmitted
A
B
packet arriving to
full buffer is lost
Introduction 1-9
“Real” Internet delays and routes
what do “real” Internet delay & loss look like?
traceroute program: measures delay 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.
Try it from terminal window or windows command prompt:
tracert google.com
3 probes 3 probes
3 probes
p 42
Introduction 1-10
“Real” Internet delays, routes
traceroute: gaia.cs.umass.edu to www.eurecom.fr
3 delay measurements from
gaia.cs.umass.edu to cs-gw.cs.umass.edu
1 cs-gw (128.119.240.254) 1 ms 1 ms 2 ms
2 border1-rt-fa5-1-0.gw.umass.edu (128.119.3.145) 1 ms 1 ms 2 ms
3 cht-vbns.gw.umass.edu (128.119.3.130) 6 ms 5 ms 5 ms
4 jn1-at1-0-0-19.wor.vbns.net (204.147.132.129) 16 ms 11 ms 13 ms
5 jn1-so7-0-0-0.wae.vbns.net (204.147.136.136) 21 ms 18 ms 18 ms
6 abilene-vbns.abilene.ucaid.edu (198.32.11.9) 22 ms 18 ms 22 ms
7 nycm-wash.abilene.ucaid.edu (198.32.8.46) 22 ms 22 ms 22 ms trans-oceanic
8 62.40.103.253 (62.40.103.253) 104 ms 109 ms 106 ms
9 de2-1.de1.de.geant.net (62.40.96.129) 109 ms 102 ms 104 ms link
10 de.fr1.fr.geant.net (62.40.96.50) 113 ms 121 ms 114 ms
11 renater-gw.fr1.fr.geant.net (62.40.103.54) 112 ms 114 ms 112 ms
12 nio-n2.cssi.renater.fr (193.51.206.13) 111 ms 114 ms 116 ms
13 nice.cssi.renater.fr (195.220.98.102) 123 ms 125 ms 124 ms
14 r3t2-nice.cssi.renater.fr (195.220.98.110) 126 ms 126 ms 124 ms
15 eurecom-valbonne.r3t2.ft.net (193.48.50.54) 135 ms 128 ms 133 ms
16 194.214.211.25 (194.214.211.25) 126 ms 128 ms 126 ms
17 * * *
18 * * * * means no response (probe lost, router not replying)
19 fantasia.eurecom.fr (193.55.113.142) 132 ms 128 ms 136 ms
* Do some traceroutes from exotic countries at www.traceroute.org
Introduction 1-11
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 withbits
sends linkpipe
capacity
that can carry linkpipe
capacity
that can carry
file of into
(fluid) F bitspipe Rs bits/sec
fluid at rate Rc bits/sec
fluid at rate
to send to client Rs bits/sec) Rc bits/sec)
Introduction 1-12
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
p 44
bottleneck link
link on end-end path that constrains end-end throughput
Introduction 1-13
Throughput: Internet scenario
per-connection end-
end throughput: Rs
min(Rc,Rs,R/10) Rs Rs
in practice: Rc or Rs R
is often bottleneck
Rc Rc
Rc
p 45-6
10 connections (fairly) share
backbone bottleneck link R bits/sec
Introduction 1-14
Delay / Loss Summary
4 main delays of packets in a node along path:
Processing delay (examine header)
Queuing delay (waiting in buffer)
Transmission delay (push all bits into link)
Propagation delay (a bit to cross the link)
Introduction 1-15
Delay / Loss Summary
Processing delay (examine header)
When a node (router) receives a packet, it inspects
the packet header to determine the next node to
send.
Error checking may take place
Can be very fast (micro seconds)
37
Introduction 1-16
Delay / Loss Summary
Queuing delay (“waiting in line” in buffer)
Waiting to be pushed onto the (next) link
Possibly zero
Depends on overall traffic at the node
if the queue becomes very large, the packet switch’s
buffer may become exhausted, causing packets to be
dropped or “lost.”
Typically micro seconds – milli seconds
38
Introduction 1-17
Delay / Loss Summary
Transmission delay = L / R
Time to push packet onto the link
Larger the packet longer the transmission delay(all
other things being equal).
The transmission delay for a link is equal to the
number of bits in the packet ( L ) divided by the
transmission rate of the link ( R ).
Typcially micro seconds – milli seconds
38
Introduction 1-18
Delay / Loss Summary
The propagation delay (d / s) over a link is the time it
takes a bit to travel from one end of the link to the other.
Longer the length of the link, the longer the Propagation
delay (all other things being equal).
It is equal to the length of the link divided by the propagation
speed of the link’s physical medium
38
Introduction 1-19
Delay / Loss Summary
The total delay across a link is = transmission
delay + propagation delay.
38
Introduction 1-20
Chapter 1: roadmap
1.1 what is the Internet?
1.2 network edge
end systems, access networks, links
1.3 network core
packet switching, circuit switching, network structure
1.4 delay, loss, throughput in networks
1.5 ** protocol layers, service models **
1.6 networks under attack: security
1.7 history
Introduction 1-21
Protocol “layers”
Networks are complex,
with many “pieces”:
hosts
routers
links of various
media
applications
protocols
hardware,
software
p 47
Introduction 1-22
Organization of air travel
ticket (purchase) ticket (complain)
baggage (check) baggage (claim)
gates (load) gates (unload)
runway takeoff runway landing
airplane routing airplane routing
airplane routing
a series of steps
p 47
Introduction 1-23
Layering of airline functionality
ticket (purchase) ticket (complain) ticket
baggage (check) baggage (claim baggage
gates (load) gates (unload) gate
runway (takeoff) runway (land) takeoff/landing
airplane routing airplane routing airplane routing airplane routing airplane routing
departure intermediate air-traffic arrival
airport control centers airport
layers: each layer implements a service
via its own internal-layer actions p 48
relying on services provided by layer below
Introduction 1-24
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
p 49
Introduction 1-25
Internet protocol stack
application: supporting network
applications
• FTP, SMTP, HTTP application
transport: process-process data
transfer transport
• TCP, UDP
network
network: routing of datagrams from
source to destination
link
• IP, routing protocols
link: data transfer between physical
neighboring network elements
• Ethernet, 802.111 (WiFi), PPP p 50
physical: bits “on the wire”
Introduction 1-26
ISO/OSI reference model
More detail at application level
presentation: allow applications application
to interpret meaning of data, presentation
e.g., encryption, compression,
machine-specific conventions session
session: synchronization, transport
checkpointing, recovery of data network
exchange
link
Internet stack “missing” these
layers! physical
• these services, if needed, must be
implemented in application p 52
Introduction 1-27
message M
source
application
Encapsulation
segment Ht M transport
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
p 53
Introduction 1-28
Chapter 1: roadmap
1.1 what is the Internet?
1.2 network edge
end systems, access networks, links
1.3 network core
packet switching, circuit switching, network structure
1.4 delay, loss, throughput in networks
1.5 protocol layers, service models
1.6 ** networks under attack: security **
1.7 history
Introduction 1-29
Network security
field of network security:
• how bad guys can attack computer networks
• how we can defend networks against attacks
• how to design architectures that are immune to attacks
Internet not originally designed with (much)
security in mind
• original vision: “a group of mutually trusting users
attached to a transparent network”
• Internet protocol designers playing “catch-up”
• security considerations in all layers!
p 55
Introduction 1-30
Bad guys: put malware into hosts via Internet
malware can get in host from:
• virus: self-replicating infection by receiving/executing
object (e.g., e-mail attachment)
• worm: self-replicating infection by passively receiving
object that gets itself executed
spyware malware can record keystrokes
(keylogging), web sites visited, upload info to
collection site
infected host can be enrolled in botnet, used for
spam. DDoS attacks. (host dubbed a “zombie”)
p 56
Introduction 1-31
Bad guys: attack server, network infrastructure
Denial of Service (DoS): attackers make resources
(server, bandwidth) unavailable to legitimate traffic
by overwhelming resource with bogus traffic
1. select target
2. break into hosts around
the network (see botnet)
3. send packets to target from
compromised hosts
target
Introduction 1-32
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 p 58
Introduction 1-33
Overview of Packet Capture
(Wireshark is one packet capture tool)
application
(www browser,
packet
email client)
analyzer
application
OS
packet Transport (TCP/UDP)
Network (IP)
capture copy of all
Ethernet Link (Ethernet)
(pcap) frames
sent/receive Physical
d
Bad guys can use fake addresses
IP spoofing: send packet with false source address
A C
src:B dest:A payload
… lots more on security (LHU COMP 412 & Chapter 8)
Introduction 1-35
Chapter 1: roadmap
1.1 what is the Internet?
1.2 network edge
end systems, access networks, links
1.3 network core
packet switching, circuit switching, network structure
1.4 delay, loss, throughput in networks
1.5 protocol layers, service models
1.6 networks under attack: security
1.7 history **
Introduction 1-36
Internet history
1961-1972: Early packet-switching principles
1961: Kleinrock - 1972:
queueing theory shows • ARPAnet public demo
effectiveness of packet- • NCP (Network Control
switching Protocol) first host-host
1964: Baran - packet- protocol
switching in military nets • first e-mail program
1967: ARPAnet • ARPAnet has 15 nodes
conceived by Advanced
Research Projects
Agency
1969: first ARPAnet node
operational
p 59
Introduction 1-37
Internet history
1972-1980: Internetworking, new and proprietary nets
1970: ALOHAnet satellite
network in Hawaii Cerf and Kahn’s
1974: Cerf and Kahn - internetworking principles:
architecture for interconnecting • minimalism, autonomy - no
networks internal changes required to
1976: Ethernet at Xerox PARC interconnect networks
• best effort service model
late 70’s: switching fixed length
packets (ATM precursor) • stateless routers
• decentralized control
1979: ARPAnet has 200 nodes
define today’s Internet
architecture
Introduction 1-38
Internet history
1980-1990: new protocols, a proliferation of networks
1983: deployment of TCP/IP
1982: smtp e-mail protocol defined
1983: DNS defined for name-to-IP-address
translation
1985: ftp protocol defined
1988: TCP congestion control
Introduction 1-39
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 messaging, P2P file sharing
on commercial use of network security to
NSFnet (decommissioned, forefront
1995)
est. 50 million host, 100
early 1990s: Web million+ users
• hypertext [Bush 1945, backbone links running at
Nelson 1960’s] Gbps
• HTML, HTTP: Berners-Lee
• 1994: Mosaic, later Netscape
• late 1990’s:
commercialization of the Web
Introduction 1-40
Internet history
2005-present
~5B devices attached to Internet (2016)
• smartphones and tablets
aggressive deployment of broadband access
increasing ubiquity of high-speed wireless access
emergence of online social networks:
e-commerce, universities, enterprises running their
services in “cloud” (e.g., Amazon EC2)
voice, video over IP- YouTube, Skype , VoIP
P2P applications: BitTorrent (file sharing)
Introduction 1-41
Introduction: summary
covered a “ton” of material! you now have:
Internet overview context, overview, “feel”
what’s a protocol? of networking
network edge, core, access more depth, detail to
network follow!
• packet-switching versus
circuit-switching
• Internet structure
performance: loss, delay,
throughput
layering, service models
security
history
Introduction 1-42
