Chapter 1: roadmap

 What is the Internet?

 What is a protocol?
 Network edge: hosts, access network,
physical media
 Network core: packet/circuit
switching, internet structure
 Performance: loss, delay, throughput
 Security
 Protocol layers, service models
 History
Introduction: 1-1
packet loss in Packet switching,
 Packet loss describes
• lost packets of data not reaching their destination after being transmitted
across a network.
 Packet loss occurs when
• network congestion,
• hardware issues,
• software bugs, and
• a number of other factors cause dropped packets during data transmission.
packet loss
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

* Check out the Java applet for an interactive animation on queuing and loss
Introduction: 1-4
How do packet loss and delay occur?
packets queue in router buffers
 packets queue, wait for turn
 arrival rate to link (temporarily) exceeds output link capacity: packet loss

packet being transmitted (transmission delay)

B
packets in buffers (queueing delay)
free (available) buffers: arriving packets
dropped (loss) if no free buffers
Introduction: 1-5
Delays:
 the time for which
• the processing of a particular
packet takes place

Introduction: 1-6
Transmission Delay:
 The time taken
• to transmit a packet from the host
to the transmission medium is
called Transmission delay.

Introduction: 1-7
Propagation delay
 After the packet is transmitted to the transmission medium, it has
to go through the medium to reach the destination.
 the time taken
• by the last bit of the packet to reach the destination is called propagation
delay.

Introduction: 1-8
Propagation delay

Introduction: 1-9
Queuing delay:
 Let the packet is received by the destination, the packet will not be
processed by the destination immediately.
 It has to wait in a queue in something called a buffer.
 So the amount of time
• it waits in queue before being processed is called queueing delay.
 delay depends upon the following factors:
• If the size of the queue is large,
• the queuing delay will be huge.
• If the queue is empty
• there will be less or no delay.
• If more packets are arriving in a short or no time interval,
• queuing delay will be large.
• The less the number of servers/links,
• the greater is the queuing delay.

Introduction: 1-10
Processing delay:
 Time is taken
• to process the data packet by the processor
 time required by intermediate routers to decide
• where to forward the packet,
• update TTL,
• perform header checksum calculations.

• Note: Both queuing delay and processing delay doesn’t have any formula
because they depend on the speed of the processor

Introduction: 1-11
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 transmission
 determine output link  depends on congestion level of router
 typically < msec
Introduction: 1-12
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 * Check out the online interactive exercises:
http://gaia.cs.umass.edu/kurose_ross
very different
Introduction: 1-13
Introduction: 1-14
Propagation Delay Example
 distance(d) between sender and receiver
• (if both of them are far apart then propagation delay is high)
 speed of data line(v)
 Propagation delay can be calculated as follows −
• Propagation delay = distance / transmission speed

Introduction: 1-15
Introduction: 1-16
Introduction: 1-17
Introduction: 1-18
 Example
 What is the transmission delay?
• The transmission delay = L/R = 16000 bits / 1000000000 bps = 1.60E-5 seconds

What is the maximum number of packets per second that can be transmitted
by this link?
The number of packets that can be transmitted in a
second into the link = R / L = 1000000000 bps / 16000 bits = 62500 packets

Introduction: 1-19
Introduction: 1-20
Packet queueing delay (revisited)

average queueing delay

 R: link bandwidth (bps)
 L: packet length (bits)
 a: average packet arrival rate
traffic intensity = La/R 1
 La/R ~ 0: avg. queueing delay small
 La/R -> 1: avg. queueing delay large La/R ~ 0

 La/R > 1: more “work” arriving is

more than can be serviced - average
delay infinite!
La/R -> 1
Introduction: 1-21
Introduction: 1-22
Questions
 What is the transmission delay of link 1?
 What is the propagation delay of link 1?
 What is the total delay of link 1?
 What is the transmission delay of link 2?
 What is the propagation delay of link 2?
 What is the total delay of link 2?
 What is the transmission delay of link 3?
 What is the propagation delay of link 3?
 What is the total delay of link 3?

 What is the total delay?

Introduction: 1-23
 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,
sends with
bits
(fluid) into pipe (Rs bits/sec) (Rc bits/sec)
file of F bits
to send to client
Introduction: 1-24
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
Introduction: 1-25
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
Introduction: 1-26
END TO END THROUGHPUT AND BOTTLENECK
LINKS
 Consider the scenario shown below, with four
different servers connected to four different
clients over four three-hop paths.
 The four pairs share a common middle hop with
a transmission capacity of R = 400 Mbps.
 The four links from the servers to the shared
link have a transmission capacity of RS = 30
Mbps.
 Each of the four links from the shared middle
link to a client has a transmission capacity of
RC = 40 Mbps.

Introduction: 1-27
1. What is the maximum achievable end-end throughput (in Mbps) for each of four
client-to-server pairs,
2. assuming that the middle link is fairly shared (divides its transmission rate
equally)?

3. Which link is the bottleneck link? Format as Rc, Rs, or R

4. Assuming that the servers are sending at the maximum rate possible,
5. what are the link utilizations for the server links (RS)? Answer as a decimal

6. Assuming that the servers are sending at the maximum rate possible,
7. what are the link utilizations for the client links (RC)? Answer as a decimal

8. Assuming that the servers are sending at the maximum rate possible,
9. what is the link utilizations for the shared link (R)? Answer as a decimal

Introduction: 1-28
Introduction: 1-29
“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 (with time-to-live field value of i)
• router i will return packets to sender
• sender measures time interval between transmission and reply

3 probes 3 probes

3 probes

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

Introduction: 1-31
Caravan analogy
100 km 100 km

ten-car caravan toll booth toll booth

(aka 10-bit packet) (aka router)

 cars “propagate” at 100 km/hr  time to “push” entire caravan

 toll booth takes 12 sec to service through toll booth onto
car (bit transmission time) highway = 12*10 = 120 sec
 car ~ bit; caravan ~ packet  time for last car to propagate
from 1st to 2nd toll both:
 Q: How long until caravan is lined 100km/(100km/hr) = 1 hr
up before 2nd toll booth?
 A: 62 minutes

Introduction: 1-32
Caravan analogy
100 km 100 km

ten-car caravan toll booth toll booth

(aka 10-bit packet) (aka router)

 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

Introduction: 1-33
Chapter 1: roadmap
 What is the Internet?
 What is a protocol?
 Network edge: hosts, access network,
physical media
 Network core: packet/circuit
switching, internet structure
 Performance: loss, delay, throughput
 Security
 Protocol layers, service models
 History
Introduction: 1-34
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!
Introduction: 1-35
Bad guys: malware
 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, web sites visited, upload
info to collection site
 infected host can be enrolled in botnet, used for spam or
distributed denial of service (DDoS) attacks

Introduction: 1-36
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
Introduction: 1-37
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

Introduction: 1-38
Bad guys: fake identity

IP spoofing: send packet with false source address

A C

src:B dest:A payload

… lots more on security (throughout, Chapter 8)

Introduction: 1-39
Chapter 1: roadmap
 What is the Internet?
 What is a protocol?
 Network edge: hosts, access network,
physical media
 Network core: packet/circuit
switching, internet structure
 Performance: loss, delay, throughput
 Security
 Protocol layers, service models
 History
Introduction: 1-40
Internet history
1961-1972: Early packet-switching principles
 1961: Kleinrock - queueing  1972:
theory shows effectiveness of • ARPAnet public demo
packet-switching • NCP (Network Control Protocol)
 1964: Baran - packet-switching first host-host protocol
in military nets • first e-mail program
 1967: ARPAnet conceived by • ARPAnet has 15 nodes
Advanced Research Projects
Agency
 1969: first ARPAnet node
operational
Introduction: 1-41
Internet history
1972-1980: Internetworking, new and proprietary nets
 1970: ALOHAnet satellite network
in Hawaii Cerf and Kahn’s internetworking
principles:
 1974: Cerf and Kahn - architecture  minimalism, autonomy - no
for interconnecting networks internal changes required to
 1976: Ethernet at Xerox PARC interconnect networks
 best-effort service model
 late70’s: proprietary architectures:
DECnet, SNA, XNA  stateless routing
 decentralized control
 late 70’s: switching fixed length
packets (ATM precursor) define today’s Internet architecture

 1979: ARPAnet has 200 nodes

Introduction: 1-42
Internet history
1980-1990: new protocols, a proliferation of networks
 1983: deployment of TCP/IP  new national networks: CSnet,
 1982: smtp e-mail protocol BITnet, NSFnet, Minitel
defined  100,000 hosts connected to
 1983: DNS defined for name- confederation of networks
to-IP-address translation
 1985: ftp protocol defined
 1988: TCP congestion control

Introduction: 1-43
Internet history
1990, 2000s: commercialization, the Web, new applications
 early 1990s: ARPAnet late 1990s – 2000s:
decommissioned  more killer apps: instant
 1991: NSF lifts restrictions on messaging, P2P file sharing
commercial use of NSFnet  network security to forefront
(decommissioned, 1995)
 est. 50 million host, 100 million+
 early 1990s: Web users
• hypertext [Bush 1945, Nelson 1960’s]
• HTML, HTTP: Berners-Lee
 backbone links running at Gbps
• 1994: Mosaic, later Netscape
• late 1990s: commercialization of the
Web
Introduction: 1-44
Internet history
2005-present: more new applications, Internet is “everywhere”
 ~18B devices attached to Internet (2017)
• rise of smartphones (iPhone: 2007)
 aggressive deployment of broadband access
 increasing ubiquity of high-speed wireless access: 4G/5G, WiFi
 emergence of online social networks:
• Facebook: ~ 2.5 billion users
 service providers (Google, FB, Microsoft) create their own networks
• bypass commercial Internet to connect “close” to end user, providing
“instantaneous” access to search, video content, …
 enterprises run their services in “cloud” (e.g., Amazon Web Services,
Microsoft Azure)
Introduction: 1-45
Chapter 1: summary
We’ve covered a “ton” of material!
 Internet overview
 what’s a protocol? You now have:
 network edge, access network, core  context, overview,
• packet-switching versus circuit-
switching vocabulary, “feel”
• Internet structure of networking
 performance: loss, delay, throughput  more depth,
 layering, service models detail, and fun to
 security follow!
 history
Introduction: 1-46
Additional Chapter 1 slides

Introduction: 1-47
Wireshark
application
(www browser,
packet
email client)
analyzer
application

OS
packet Transport (TCP/UDP)
Network (IP)
capture copy of all
Ethernet frames Link (Ethernet)
(pcap) sent/received
Physical

Introduction: 1-48