CS 382: Network-Centric Computing

Packets

Dr. Zafar Ayyub Qazi

Spring 2023

ACK: Slides use some material from Scott Shenker (UC Berkeley) and Jim Kurose (UMass)
Name your favourite restaurant in Lahore

2
3
 Recap: Previous Lecture
l Network(ed) applications:
l End-systems exchange messages with other end-systems

l Core task of the Internet

l Delivers packets between programs (applications) on different end-systems

l Important problems Internet is solving:

• Routing data to destination • Mapping names to addresses
• Reliable data transfer • Secure communication
• Congestion control • Routing with autonomous control

4
 Recap: Packets
l Packets are bags of bits with:
l Header: meaningful to network (and network stack)
l Can be more than one header!
l Body: meaningful only to application

Header Body

Used By Network Used By App

l Body can be bits in a file, image, email, etc.

l Header contains destination address, port, etc.
5
 Recap: Discussion from the last class
l Why not reserve a path for all data between two end-systems?
l Won’t have to treat data packets independently

l Why not reserve a constant bandwidth between two end-systems?

l Can potentially provide better application performance

6
 Agenda for Today’s Class

l Why packets?
l Q: How to share network resources among multiple communication sessions?

l Packet Switching vs. Circuit Switching

l Packet dynamics
l Delay, loss, and throughput

7
Why Packets?

8
Links/Switches are Shared
shared link and
switch resources

9
 Approaches to Sharing
l Reservations:
l Communication resources reserved for the duration of the communication
session between the end-systems
l Must reserve for their peak bandwidth to full satisfy demand

l On-demand: (also know as “best effort”)

l Send packets when you have them
l Hope for the best

10
 Two Approaches to Sharing
l Reservation

l On-demand

How are these implemented in networks?

11
 Implementation of these Approaches
l Reservation à circuit switching
l Before data can be sent, the network must establish a dedicated end-end
connection, also called “circuit”, between the end systems
l When the circuit is established, the network reserves a constant
transmission rate in the network links

l On demand à packet switching

l Service each packet independently on demand
l No reservation of network resources

12
 Circuit Switching

10Mb/s?
✔
src 10Mb/s?
✔
dst
10Mb/s?
✔

(1) src sends a reservation request for 10Mbps to dst

(2) Switches “establish a circuit”
(3) src starts sending data
(4) src sends a “teardown circuit” message
 Circuit Switching

14

Figure from the book, “Computer Networking: A Top Down Networking (8th Edition) ” by Jim Kurose et al.
 Two kinds of ”Circuits”
l Time Divison Multiplexing (TDM)
l Divide time in frames of fixed duration
l Frames have a fixed number of time slots
l Separate time slot per circuit

l Frequency Division Multiplexing (FDM)

l Divide frequency spectrum into frequency bands
l Separate frequency band per circuit

15

Figures from the book, “Computer Networking: A Top Down Networking (8th Edition) ” by Jim Kurose et al.
 Circuit Switching and Failures
Circuit is established Must establish new circuit
Link Fails along path

Circuit switching doesn’t “route around failures”

 Packet Switching
switch

dst

Each packet treated independently

17
 Store-and-forward Transmission

The packet switch must receive the entire packet before it begins
to transmit the first bit of the packet onto the outbound link

18

Figure from the book, “Computer Networking: A Top Down Networking (8th Edition) ” by Jim Kurose et al.
 Buffers in Packet Switches
l Switches have multiple links attached to them

l Each attached link has an output buffer (also called output queue)
l Which stores the packets that the switch is about to send in to that link

l If an arriving packet needs to be transmitted onto a link but finds

the link is busy with the transmission of another packet
l The arriving packet must wait in the output buffer

19
 Buffers in Packet Switches

20

Figure from the book, “Computer Networking: A Top Down Networking (8th Edition) ” by Jim Kurose et al.
 Packet Switching and Failures
Link Fails along path Route recomputed on the fly

Packet switching does “route around failures”

Which is better: Circuits or Packets?

22
 Which is better: Circuits or Packets?
l What are the pros and cons of each scheme?

23
 Example: Three constant sources
l Total bandwidth 30Mbps
l Mbps = megabits per second

l Demands: Each source needs a constant rate of 10Mbps

l Reservation and on-demand would give same result

l Every source gets what they need
l No wasted bandwidth
l ….

24
 Bottleneck Bottleneck
link of link of
Rs

Example: Bursty Sources

capacity R Rs capacity R
Server 10 Servers
Server 10 Servers

36AND CHAPTER
COMPUTER NETWORKS THE
R
INTERNET
1 • COMPUTER NETWORKS AND THE INTERNET
Bottleneck Rc Bottleneck
c
link of link of
Rs capacity R capacity R
Rs

A B
Client 10 Clients Client 10 Clients
A Rc A
Bottleneck
Switch 2 a. Rc b.
Switch 1
a. b. Bottleneck
link of
B (a) Client
Figure 1.20 ! End-to-end throughput: capacity a
downloads
from 4 Mbps
R file B Figure 1.20 ! End-to-end throughput: (a) Client f
link of
downloads
capacity Ra

C server; (b) 10 clients downloading with 10 servers D

server; (b) 10 clients downloading with 10 serv

Client 10 Clients Client to destination is again the minimum10

from source to destination Propagation is again the minimum of Rs and Rc, that is, throughput Propagation
= from source ofClients
Rs and Rc, that is
a.
min{R s ,RcRc}. Therefore, the constraining b. factor for throughput in today’s Internet is a.
min{R Rsc, Rc}. Therefore, the constraining b. factor for throughput in toda
Nodal Queueing Transmission Nodal Queueing Transmission
typically
Figurefor the
1.20 access network. throughput: (a) Client downloads a file from
! End-to-end typically
Figure 1.20 the access network.
! End-to-end throughput: (a) Client downloads a f
processing (waiting processing (waiting for
transmission) E
For a final example, server;consider
(b) 10 clients Figure 1.20(b)
downloading
10 clients connected to the core of the computer network. In this example, there are
in which withthere10are
transmission)
10 servers and
servers For a final example,
F server; consider
(b) 10 clientsFiguredownloading
1.20(b) in which
10 clients connected to the core of the computer network. In this exam
with there
10 are
serv1
10 simultaneous downloads taking place, involving 10 client-server p
Figure 1.16 ! The nodal 10 delay
from
simultaneous downloads taking place, involving 10 client-server pairs. Suppose
at router
Client
source AFigure 1.16 ! The10 nodal
Rs and delay
Clients at throughput
router A=
that these 10 to destination
downloads areisthe again only thetraffic
minimum in theofnetwork Ratc,the
thatcurrent
is, time. As that these
from source
Client 10todownloads
destinationare is the
again onlythetraffic
minimum in the
10 network
Rs and Rat
ofClients the cu
c, that is
a.
min{R link b.
shown ins, R thec}.figure,
Therefore, therethe is aconstraining in the core factorthatforisthroughput
traversed by inall
today’s Internet is
10 downloads. shown
min{R
a. sin
, R the
c }. figure,
Therefore,there theis a link in
constraining
b. the core
factor that
for is traversed
throughput by
in all
toda 1
typically
Denote
Figure R for the
1.20 access
the !
network. rate
transmission
End-to-end of this link(a)
throughput: Let’s suppose
R.Client downloads that all server
a file from access Denote Rthe
typically for access
the transmission
network. rate of this link R. Let’s suppose that al
For a final
links have the sameserver; example,
rate Rconsider
, all clientFigure access1.20(b)
links in which
have the there
same are 10
rate Rservers
, and and
the Figure
linksFor
have a1.20
final ! End-to-end throughput: (a) Client downloads a f
the same rate consider
example, Rs, all client Figure access links
1.20(b) in have
whichthe same
there arera1
s(b) 10 clients downloading with 10 serversc
10 clients connected to the core of the computer
transmission rates of all the links in the core—except the one common link of rate network. In this example, there are transmission
10 clients connected ratesserver;
oftoallthe (b)
thecore 10ofclients
links inthethe downloading
core—except
computer network. with
the one
In 10 serv
comm
this exam
packet suffers from several types
10 of
simultaneous delays at
downloads packet
each node
takingsuffers
along
place, from
the path.
several
involving
R—are much larger than Rs, Rc, and R. Now we ask, what are the throughputs of the 10 The types
most
client-server of delays
pairs. at
Suppose each node along the path. The most 10 much larger
simultaneous
R—are than Rs, Rtaking
downloads c, and place,
R. Now we ask, 10
involving what are the throp
client-server
that
important of these delays are thefrom these
downloads? source
nodal processing10 downloads
to destination
Clearly, if the are
important
rateis
delay, the
again
of theonly the
queuingtraffic
ofcommon minimum in
these delay, the
delays of network
R and
link, R, istransmis-
are Rat , the
that
thec nodal
s large—say
current
is, time.
throughput
processing
a hundred As
times= delay, queuing delay, transmis- downloads?
that
from these
source 10Clearly,
todownloadsif theare
destination rate
is the of only
again thethecommon
traffic
minimum inlink,
the
ofR, Rsisand
large—say
network Rat the cua
c, that is
shown
min{R
larger than in
, R the }.
both figure,
Therefore,
R andthere
R is
the
—then a link
constraining
the in the core
factor
throughput that
for is traversed
throughput
each download byin all 10
today’s
will downloads.
onceInternet
again is larger
min{Rthan
shown in the both Rs and
figure, thereRthe—then
a linkthe in throughput
is constraining the factor
core that foristhroughput
each download
traversed by allw1
sion delay, and propagation delay;
Denote
stogether,
c
for theBut
s these sion
transmission delay,
c delays accumulate
and linkpropagationto give adelay;
total together, these delays accumulate to give a total s , R c }. Therefore, c for in toda
be min{RRs,the
typically Rc}. access network.
what if therate rateofofthis the common R. Let’s link suppose
is of the thatsame
all server
order access
as Rs be min{R
Denote
typically , Raccess
sfor
Rthe }. But
cthe what if the
transmission
network. rate
rate of ofthisthe common
link R. Let’slink is of the
suppose thatsam
al
nodal delay. The performance ofRmany
links have
For a final Internet
the same
example, nodal
rate Rconsider delay.
applications—such
s, all client Figure The
inaccess performance
1.20(b) as insearch,
links have
which Web
of
thethere
same many
arerate
10 Internet
at Rac,specific
servers theapplications—such as search, Web
and and and
linksFor ?
Rhave What the will
same the
ratethroughput
, all clientbe in this case? Let’s take a look
and c? What will the throughput be this case? Let’s take a look c a final example, consider R s Figure 1.20(b) in which there arera1
access links have the same
browsing, email, maps, instanttransmission
10messaging,
clients connected ratesand of tovoice-over-IP—are
browsing,
all thecore
the linksofinthe email,
thecomputer maps,
greatly
core—except instant
network. affected
the one messaging,
In this common
example, and
linkthere
of rate voice-over-IP—are greatly affected
are transmission
10 clients connected to the core of thethe
rates of all the links in core—except
computer network. the In
one comm
this exam
R—are
10 much
simultaneous
by network delays. In order to acquire a deep understanding larger than
downloads R , R
by network of ,
takingand R.
place,Now
delays.
packetwe ask,
involving what
Inswitching10 are
order to acquire the
client-server throughputs
pairs. of
Suppose the
and a deep understanding of packet switching and R—are much larger
10 simultaneous downloads than R , R , and R. Now we ask, what are the throp
s c s taking
c place, involving 10 client-server
downloads?
that these 10Clearly, downloads if theare ratethe of only
the common
traffic inlink,the R, is large—say
network a hundred
at the current times
time. As downloads? Clearly, if the rate of the common
that these 10 downloads are the only traffic in the network at the cu link, R, is large—say a
computer networks, we must understand
larger
shownthan in the the
both nature
Rs and
figure, computer
there and
Rc—then importance
is a link networks,
theinthroughput of
the core that we
these must
foriseach delays.
understand
download
traversed by allwill the
oncenature
10 downloads.again and importance of these delays. larger than both
shown in the figure, R s therec is a link in the core that is traversed by allw
and R —then the throughput for each download 1
be min{R
Denote Rsfor, Rcthe }. But what if therate
transmission rateofof thisthelink
common
R. Let’slink is of the
suppose thatsame orderaccess
all server as Rs be min{R , R }. But
Denote R sfor cthe transmissionwhat if the rate
rate of ofthisthe common
link R. Let’slink is of the
suppose thatsam
al
and
linksRchave? What the will
samethe throughput
rate Rs, all client be in this case?
access Let’s the
links have takesame a lookrateatRac,specific
and the and c? What
linksRhave the will
samethe ratethroughput
Rs, all client be in this case?
access links haveLet’sthe takesame
a look
ra
Types of Delay Types of Delay
transmission rates of all the links in the core—except the one common link of rate transmission rates of all the links in the core—except the one comm
R—are much larger than Rs, Rc, and R. Now we ask, what are the throughputs of the R—are much larger than Rs, Rc, and R. Now we ask, what are the thro
Let’s explore these delays in the contextClearly,
downloads? of Figure ifLet’s
the rate1.16.
explore
of theAscommonpart
these oflink,
delays
its R, end-to-end
is in the context
large—say a hundred of Figure
times 1.16. As part of its end-to-end
downloads? Clearly, if the rate of the common link, R, is large—say a
route between source and destination,
larger than both a packet
Rs androute Ris sent
between from source the upstream and destination,
node a packet is sent from the upstream node 25
c—then the throughput for each download will once again larger than both Rs and Rc—then the throughput for each download w
through router A to router B. Our goal sis to
be min{R , R c characterize
}. But through the
what if the router
rate nodal
of A todelay
the router
common at B. router
link OurA.
is of thegoal is to characterize
same order as Rs the nodal delay at router A. be min{Rs, Rc}. But what if the rate of the common link is of the sam
and Rc? What will the throughput be in this case? Let’s take a look at a specific
Note that router A has an outbound link leading to
Note
router
thatB.router
This A
link
hasisan
preceded
outbound
by link leading to router B. This link is preceded by and Rc? What will the throughput be in this case? Let’s take a look
 Bottleneck Bottleneck
link of link of
Rs

Example: Bursty Sources

capacity R Rs capacity R
Server 10 Servers
Server 10 Servers

36AND CHAPTER
COMPUTER NETWORKS THE
R
INTERNET
1 • COMPUTER NETWORKS AND THE INTERNET
Bottleneck Rc Bottleneck
c
link of link of
Rs capacity R capacity R
Rs

A B
Client 10 Clients Client 10 Clients
A Rc A
Bottleneck
Switch 2
a. Rc b.
Switch 1
a. b. Bottleneck
link of
Figure 1.20 ! B (a) Client
End-to-end throughput: capacity a
downloads
from 4 Mbps
R file B Figure 1.20 ! End-to-end throughput: (a) Client f
link of
downloads
capacity Ra

C
server; (b) 10 clients downloading with 10 servers D
server; (b) 10 clients downloading with 10 serv

Client 10 Clients Client to destination is again the minimum10

from source to destination Propagation is again the minimum of Rs and Rc, that is, throughput Propagation
= from source ofClients
Rs and Rc, that is
a.
min{R s ,RcRc}. Therefore, the constraining b. factor for throughput in today’s Internet is a.
min{R Rsc, Rc}. Therefore, the constraining b. factor for throughput in toda
Nodal Queueing Transmission Nodal Queueing Transmission
typically the access network.
typically
Figurefor
processing (waiting
the
1.20 access network. throughput: (a) Client downloads a file from
! End-to-end
processing (waiting for AàB Figure 1.20 ! End-to-end throughput: (a) Client downloads a f
transmission) E
For a final example, server;consider
(b) 10 clients Figure 1.20(b)
downloading
10 clients connected to the core of the computer network. In this example, there are
in which withthere10are
transmission)
10 servers and
servers For a final example,
F server; consider
(b) 10 clientsFiguredownloading
1.20(b) in which
10 clients connected to the core of the computer network. In this exam
with there
10 are
serv1

Figure 1.16 ! The nodal 10 delay

from
that these
at router
Client
source 10 to destination
downloads areisthe again only 2 Mbps
simultaneous downloads taking place, involving 10 client-server pairs. Suppose
AFigure 1.16
thetraffic ! The10
minimum nodal
Rs and delay
Clients
in theofnetwork Ratc,the at throughput
thatcurrent
is, router A=
time. As
10 simultaneous downloads taking place, involving 10 client-server p
that these
from source
Client 10todownloads
destinationare is the
again onlythetraffic
minimum in the network
Rs and Rat
ofClients
10 the cu
c, that is
a.
min{R link b.
shown ins, R thec}.figure,
Therefore, therethe is aconstraining in the core factorthatforisthroughput
traversed by inall
today’s Internet is
10 downloads. shown
min{R
a. sin
, R the
c }. figure,
Therefore,there theis a link in
constraining
b. the core
factor that
for is traversed
throughput by
in all
toda 1
typically
Denote
Figure R for the
1.20 access
the !
network. rate
transmission
End-to-end of this link(a)
throughput: Let’s suppose
R.Client downloads that all server
a file from access Denote Rthe
typically for access
the transmission
network. rate of this link R. Let’s suppose that al
For a final
links have the sameserver; example,
rate Rconsider
, all clientFigure access1.20(b)
links in which
have the there
same are 10
rate Rservers
, and and
the Figure
linksFor
have a1.20
final ! End-to-end throughput: (a) Client downloads a f
the same rate consider
example, Rs, all client Figure access links
1.20(b) in have
whichthe same
there arera1
s(b) 10 clients downloading with 10 serversc
10 clients connected to the core of the computer
transmission rates of all the links in the core—except the one common link of rate network. In this example, there are transmission
10 clients connected ratesserver;
oftoallthe (b)
thecore 10ofclients
links inthethe downloading
core—except
computer network. with
the one
In 10 serv
comm
this exam
packet suffers from several types of delays at packet
each node suffers
along from
the path.
several The types
most of delays at each node along the path. The most
10
that
important of these delays are thefrom
simultaneous
these
source
nodal processing
downloads? 10
downloads
downloads
to destination
Clearly, if the are is
delay,
important
rate
taking
the
again
of theonly
place,
the
queuingtraffic
involving
R—are much larger than Rs, Rc, and R. Now we ask, what are the throughputs of the
minimum in
these delay,
ofcommon the
delays of
10
network
R and
link, R, istransmis-
are Rat
s large—say ,CàD
client-server
the
that
thec nodal
pairs.
current
is,
Suppose
time.
throughput
a hundred As
times= delay, queuing delay, transmis-
processing
10
downloads?
that
from these
much larger
simultaneous
R—are
source 10Clearly,
than Rs, Rtaking
downloads
todownloadsif theare
destination rate
is the
c, and place,
of only
again
R. Now
thethecommon
traffic
minimum
we ask, 10
involving
inlink,
the
ofR,
what
Rsisand
are the throp
client-server
large—say
network Rat the cua
c, that is
shown
min{R in
, R the }. figure,
Therefore, there is
the a link
constrainingin the core
factor that is traversed
throughput byin all 10
today’s downloads.
Internet is
larger
sion delay, and propagation delay; than both
stogether,
c R and
s these R
sion—then
delay,
c delays
Demand
the throughput
accumulate
and link for
propagation each
to give download
adelay;
total will
2 Mbps
once
together, again
these delays accumulate to give a total larger
min{Rthan
shown
s
in
, R the
c
both
}. Rs and
figure,
Therefore,thereRthe
c —then
a linkthe in throughput
is constraining the factor
core that foristhroughput
for each download
traversed by
in allw1
toda
Assume you only have information
Denote
be min{RRs,the
typically for
Rc}. theBut
accesstransmission
network.
what if therate rateofofthis the common R. Let’s link suppose
is of the thatsame
all server
order access
as Rs be min{R
Denote
typically , Raccess
sfor
Rthe }. But
cthe what if the
transmission
network. rate
rate of ofthisthe common
link R. Let’slink is of the
suppose thatsam
al
nodal delay. The performance ofRmany
links have
For a final Internet
the same
example, nodal
rate Rconsider delay.
applications—such
s, all client Figure The
inaccess performance
1.20(b) as insearch,
links have
which Web
of
thethere
same many
arerate
10 Internet
at Rac,specific
servers theapplications—such as search, Web
and and and
linksFor ?
Rhave What the will
same the
ratethroughput
, all clientbe in this case? Let’s take a look
and c? What will the throughput be this case? Let’s take a look c a final example, consider R Figure 1.20(b) in which there arera1
access links have the same
1 Mbps
s
browsing, email, maps, instanttransmission
messaging, and voice-over-IP—are
browsing, email, maps,
greatly instant
affected messaging, and voice-over-IP—are greatly affected
about the peak demand
10 clients connected rates of toall thecore
the linksofinthe thecomputer
core—except network. the one
In this common
example, linkthere
of rateare transmission
10 clients connected to the core of thethe
rates of all the links in core—except
computer network. the In
one comm
this exam
R—are
10 much
simultaneous
by network delays. In order to acquire a deep understanding larger than
downloads R , R
by network of ,
takingand R.
place,Now
delays.
packetwe ask,
involving what
Inswitching10 are
order to acquire the
client-server throughputs
pairs. of
Suppose the
and a deep understanding of packet switching and R—are much larger
10 simultaneous downloads than R , R , and R. Now we ask, what are the throp
s c s taking
c place, involving 10 client-server
downloads?
that these 10Clearly, downloads if theare ratethe of only
the common
traffic inlink,the R, is large—say
network a hundred
at the current times
time. As downloads? Clearly, if the rate of the common
that these 10 downloads are the only traffic in the network at the cu link, R, is large—say a
computer networks, we must understand
larger
shownthan in the the
both nature
Rs and
figure, computer
there and
Rc—then importance
is a link networks,
theinthroughput of
the core that we
these must
foriseach delays.
understand
download
traversed by allwill the
oncenature
10 downloads.again and importance of these delays. larger than both R s therec is a link in the core that is traversed by allw
and R —then the throughput for each download
be min{R
Denote Rsfor, Rcthe }. But what if therate
transmission rateofof thisthelink
common
R. Let’slink is of the
suppose EàF
thatsame orderaccess
all server as Rs
shown in the figure,
be min{R , R }. But
Denote R sfor cthe transmissionwhat if the rate
rate of ofthisthe common
link R. Let’slink is of the
suppose thatsam
al
1
and
linksRchave? What the will
samethe throughput
rate Rs, all client be in this case?
access Let’s the
links have takesame a lookrateatRac,specific
and the
2 Mbps
and c? What
linksRhave the will
samethe ratethroughput
Rs, all client be in this case?
access links haveLet’sthe takesame
a look
ra
Types of Delay Types of Delay
transmission rates of all the links in the core—except the one common link of rate transmission rates of all the links in the core—except the one comm
R—are much larger than Rs, Rc, and R. Now we ask, what are the throughputs of the R—are much larger than Rs, Rc, and R. Now we ask, what are the thro
Let’s explore these delays in the contextClearly, of Figure ifLet’s 1.16.
explore Ascommonpart
these oflink,
delays
its R, end-to-end
is in the context of Figure 1.16. As part of its end-to-end
downloads?
route between source and destination,
larger than both a packet
Rs androute
the rate
Ris sent
1 Mbps
of the
between from source the upstream
large—say
and destination,
node
a hundred times
a packet is sent from the upstream node
downloads? Clearly, if the rate of the common link, R, is large—say a
26
c—then the throughput for each download will once again larger than both Rs and Rc—then the throughput for each download w
through router A to router B. Our goal sis to
be min{R , R c characterize
}. But through the
what if the router
rate nodal
of A todelay
the
and Rc? What will the throughput be in this case? Let’s take a look at a specific
0
router
common at B. router
link
Timeby
OurA.
is of thegoal is to characterize
same order as Rs the nodal delay at router A. be min{Rs, Rc}. But what if the rate of the common link is of the sam
Note that router A has an outbound link leading to
Note
router
thatB.router
This A
link
hasisan
preceded
outbound
by link leading to router B. This link is preceded and Rc? What will the throughput be in this case? Let’s take a look
 Peak vs. Average Rate
l For each communication session, define:
l P = peak rate
l A = average rate

l Reservations must reserve P:

l But communication sessions only use A (on average)
l Level of utilization is A/P

l On-demand:
l Can achieve higher utilizations
l Depends on degree of sharing, burstiness of flows
27
 Smooth vs Bursty Applications
l Some apps have relatively small P/A ratios
l Voice might have a ratio of 3:1 or so

l Data applications tend to be rather bursty

l Ratios of 100 or greater are common

l That’s why the phone network used reservations

l And the Internet does not….
 Summary so far …
l Q. How to share network resources among multiple
communication sessions?

l Reservation à circuit switching

l Dedicated network resources à better service guarantees

l On-demand à packet switching

l Better utilization of network resources
l Can route around failures

29
 How to decide which approach to pick?
l Some important considerations

l Are applications bursty?

l Look at their peak/average traffic rate, a higher value shows more burstiness
l If circuit switching used, then more bursty the app, more wastage of resources

l Do applications have stringent performance requirements?

l Reserving resources may provide better performance guarantees

l Do we want applications to be resilient to network failures?

l Packet switching can help route around network failures 30
 Which approach is used where?
l Internetà packet switching
l Many applications are bursty
l Network failures are common and designers wanted apps to be resilent to
network failures

l Telephone networks, 2G, Voice in 3G à Circuit switching

l Mainly voice traffic which is less bursty
l Needed a minimum guarantee

l Data apps in 3G, 4G/LTE, 5G à packet switching

l Many applications are bursty
31
Questions?

32
 Packet Dynamics
l Delay

l Loss

l Throughput
 Delay
l How long does it take to send a packet from its source to destination?
 Loss
l What fraction of the packets sent to a destination are dropped?
 Throughput
l At what rate is the destination receiving data from the source?
 A network link
l Link bandwidth (Transmission capacity)
l Number of bits sent per unit time (bits/sec or bps)
l Propagation delay
l Time for one bit to move through the link (seconds)
l Bandwidth-Delay Product (BDP)
l Number of bits “in flight” at any time (sent, not received)
l BDP = bandwidth × propagation delay

bandwidth delay x bandwidth

Propagation delay
 Examples of BDP
l Same city over a slow link:
l Bandwidth: ~100Mbps
l Propagation delay: ~0.1msec
l BDP: 10,000bits

l Between cities over fast link:

l Bandwidth: ~10Gbps
l Propagation delay: ~10msec
l BDP: 108bits
 Delay
l Consists of four components
l Transmission delay
due to link properties
l Propagation delay
l Processing delay
due to node internals and
l Queueing delay traffic mix

Figure from the book, “Computer Networking: A Top Down Networking (8th Edition) ” by Jim Kurose et al.
 Transmission Delay
l Q: How long does it take to push all the bits of a packet into a link?

l A: Packet size / Transmission capacity of the link

l Example: Packet = 1kb, Rate = 100Mbps

l 1000 bits / 100 Mbits per sec = 10-5 sec = 10μsec

40
 Propagation Delay
l Q: How long does it take to move one bit from one end of a link
to the other?

l A: Link length / Propagation speed of link

l Propagation speed ~ some fraction of speed of light
l Typically, between 2x108 m/s and 3x108 m/s

l Example: Length = 30 kilometers

l 30 kilometers/3x108 meters per sec = 10-4 sec = 100μsec

41
Questions?

42
End of Class Questions

43
44
45
 Next Lecture
l We will ask a more practical question
l Q: How long does it take for a packet to travel from A to B?

l Internet design principles

46