21/08/2022

 

Lecturer: Nguyễn Thị Thanh Vân – FIT - HCMUTE

 History of computer network

 Computer network
 Network topology
 Network protocol
 Network Components
 Internet
 Data transmission: Switching Techniques
 Packet-Switched Networks problems:
o Delay, Loss, and Throughput in
 Protocol Layers and Their Service Models
 OSI model
 TCP/IP model

21/08/2022 2

1
 21/08/2022

 The switching technique will decide the best route for data
transmission.

21/08/2022 3

Circuit Switching Packet Switching

Message Switching

21/08/2022 4

2
 21/08/2022

21/08/2022 5

 FDM (frequency-division multiplexing): the

frequency spectrum of a link is divided up
among the connections established across
the link (with analog signals)
o Ex: In telephone/tivi networks, FDM=4 kHz
(4,000 cycles/s) => bandwidth

 TDM (time-division multiplexing): time is

divided into frames of fixed duration, and
each frame is divided into a fixed number
of time slots (with analog & digital signals)
o TDM is efficient, has low conflict
o Ex: the link transmits 8,000 frames/s and
each slot consists of 8 bits, then the
transmission rate of a circuit is 64 kbps
(8000x8)

21/08/2022 6

3
 21/08/2022

TDM Statistical TDM

 Ex, How long does it take to send a file of 640,000 bits from host A to host B
over a circuit- switched network (TDM)?
1 circuit has transmission rate:
o All links are 1.536 Mbps (link rate)
(1.536 Mbps)/24 = 64 kbps
o Each link uses TDM with 24 slots/sec
Transmission time:
o 500 msec to establish end-to-end circuit
Ref:
(640,000 bits)/(64 kbps) = 10 seconds
to transmit the file
https://www.youtube.com/watch?v=fIZhDl35_XY
add the circuit establishment time,
21/08/2022 => 10.5 seconds to send the file 7

 The message splits into packets that are given a unique number to identify their
order at the receiving end.
 Every packet contains some information in its headers such as source address,
destination address and sequence numbe
 Sequence of A & B packets does not have fixed pattern,
bandwidth shared on demand => statistical multiplexing.
 TDM: each host gets same slot in revolving TDM frame

21/08/2022 8

4
 21/08/2022

 store and forward: entire packet must arrive at router before it can be
transmitted on next link
 a packet of L bits (size) over a link with transmission rate R bits/sec, then
the time to transmit the packet is L/R seconds (1 packet on 1 link)
L link
T=
R
 Example: time (source -> des)
o L = 7.5 Mbits
o R = 1.5 Mbps
o time to transmit 1pkt/1link: 5s
o transmission delay (2links, 1 pkts): 2L/R
o 3pkts: 4L/R

 the general case of sending one packet from source to destination over a
path consisting of N links each of rate R (using N-1 router) between source
and destination
𝐿
𝑑𝑒𝑛𝑑−𝑡𝑜−𝑒𝑛𝑑 = 𝑁
21/08/2022 𝑅 9

 The switching technique will decide the best route for data
transmission.

21/08/2022 10

5
 21/08/2022

 History of computer network

 Computer network
 Network topology
 Network protocol
 Network Components
 Internet
 Packet-Switched Networks problems
o Delay, Loss, and Throughput in
 Protocol Layers and Their Service Models
 OSI model
 TCP/IP model

21/08/2022 11

 Store and forward:

o entire packet must arrive at router before it can be transmitted on next
link
 Ideally,
o Internet services need to move as much data as we want between
any two end systems, instantaneously, without any loss of data.
 But:
o computer networks necessarily constraints throughput (the amount of
data per second that can be transferred) between end systems,
introduce delays between end systems, and can actually lose packets
 Problems: Delay, Loss, and Throughput

21/08/2022 12

6
 21/08/2022

 Packets experience delay on end-to-end path

 Four sources of delay at each hop

1. Processing delay: 2. Queueing delay

– The time waiting to be transmitted
– The time to examine the packet’s
onto the link
header and determine where to
– Depends on congestion level of
direct the packet
router

13

3. Transmission Delay: T 4. Propagation Delay: dprop

The time required to transmit all of the The time required to propagate from the
packet’s bits into the link beginning of the link to router
R = Link bandwidth (bps) d = Length of physical link
L = Packet length (bits)
s = propagation speed in medium
T = L/R (~2×108 m/sec)
Note: s and R are very different quantities dprop = d/s
Fiber: v= velocity of light =3x108m/s
velocity of fib: s = v x 70%speed

Ex:
R=1kbps, L=1Kbyte (?bit)
T=?
d=20km, dprop ? 14

7
 21/08/2022

 dqueue is the time it takes for the packet

to be transmitted onto the link
 the length of this time is defined by the
number of packets that was added to
the queue prior to this packet

R = Link bandwidth (bps)

L = Packet length (bits)
a = Average packet arrival rate
Traffic intensity = La/R

 La/R ~ 0: Average queueing delay small

 La/R → 1: Delays become large
 La/R > 1: More “work” arriving than can be serviced, average delay
15
infinite!

 dproc = processing delay: typically a few microsecs or less

 dqueue = queuing delay: depends on congestion
dproc and dqueue depend on the speed of processor
speed of processor is very high, dqueue and dproc are less

 dtrans = transmission delay: significant for low-speed links

 dprop = propagation delay: a few microsecs to hundreds of msecs

21/08/2022 16

8
 21/08/2022

traceroute (or tracert): Routers, round-trip delays on source-dest path

Also: pingplotter, various Windows programs

17

 queue (aka buffer) preceding link in buffer has finite capacity

o a packet can arrive to find a full queue.
o With no place to store such a packet, a router will drop that packet;
that is, the packet will be lost
 lost packet may be retransmitted by previous node, by
source end system, or not at all

21/08/2022 18

9
 21/08/2022

 throughput: rate bits transferred between sender/receiver

o instantaneous: rate at given point in time
o average: rate over longer period of time

 What is average end-end throughput?

o Rs < Rc
o Rs > Rc

 link on end-end path that constrains end-end throughput

21/08/2022 19

 Let’s suppose all Rs have the same rate, Rc

have the same rate, and the transmission rates
of all the links in the core except the one
common link of rate R are much larger than Rs,
Rc, and R
 Ex: 10 connections (fairly) share
backbone bottleneck link R bits/sec
o per-connection end-end throughput:
min(Rc,Rs,R/10)

 Ex:
o Rs = 2 Mbps, Rc = 1 Mbps, R = 5 Mbps, and the
common link divides its transmission rate equally
among the 10 downloads
o the end-to-end throughput for each download (Rs to
Rc) is now reduced to…?

21/08/2022 20

10
 21/08/2022

 Latency – The time taken for a packet to be transferred across a network. You
can measure this as one-way to its destination or as a round trip.
 Throughput – The quantity of data being sent and received within a unit of time
 The bandwidth of a network specifies the maximum number of conversations
that the network can support

time
21/08/2022 21

 The more routers a packet has to travel through the more latency there
is because each router has to process the packet
 Throughput is a good way to measure the performance of the network
connection because it tells you how many messages are arriving at their
destination successfully
 Both network latency and throughput are important because they have
an effect on how well your network is performing.
 The bandwidth of your network is limited to the standard of your internet
connection and the capabilities of your network devices
 Tools for Measuring Network Throughput, BW
o SolarWinds Flow Tool Bundle
o speedtest

21/08/2022 22

11
 21/08/2022

 1.
o How long does it take a packet of length 1,000 bytes to propagate over a link of
distance 2,500 km, propagation speed 2.5 x 108 m/s, and transmission rate 2
Mbps?
o More generally, how long does it take a packet of length L to propagate over a link of
distance d, propagation speed s, and transmission rate R bps?
o Does this delay depend on packet length?
o Does this delay depend on transmission rate?

 2. Suppose Host A wants to send a large file to Host B. The path from
Host A to Host B has three links, of rates R1 = 500 kbps, R2 = 2 Mbps,
and R3 = 1 Mbps.
o a. Assuming no other traffic in the network, what is the throughput for the file
transfer?
o b. Suppose the file is 4 million bytes. Dividing the file size by the
throughput, roughly how long will it take to transfer the file to Host B?
o c. Repeat (a) and (b), but now with R2 reduced to 100 kbps.
21/08/2022 23

12