Data Communication

Data Communication
1

Dr. Hatem Yousry

 Agenda
• Network Architecture & Performance Metrics.
• Round Trip Time and Throughput.

Dr. Hatem Yousry

Data Communication
File

Size/Bandwidth
Tt Latency (D) = Tq + Tt + Tp
Tq
Transmit (Tt)
Timing Diagram

Propagation (Tp )

Queue (Tq)

2
Distance/Speed
Tp
Network Architecture
• Network architecture is the design of a
communication network.
• It is a framework for the specification of a network's physical
components and their functional organization and
configuration, its operational principles and procedures, as
well as data formats use.

3
Network Elements

PC server switch bridge router

4
Unshielded Twisted Pairs (UTP)
Ethernet
 Network Architecture

Data Communication
5

Dr. Hatem Yousry

Hardware Building Blocks
• Nodes.
• Links.

Backbone

6
Layering Abstraction
• Layer: A set of functionalities encapsulated in an object that can be
used by other network components
• Example: The network layer implements the end-to-end packet
delivery
• Why layering? Think complexity and common services
• Layers consist of protocols

7
A simple layering example
• Two Internet hosts connected via
two routers and the corresponding
layers used at each hop.
• The application on each host
executes read and write operations
as if the processes were directly
connected to each other by some
kind of data pipe.
• Every other detail of the
communication is hidden from each
process.
• The underlying mechanisms that
transmit data between the host
computers are located in the lower
protocol layers. 8
The Internet Architecture TCP/IP

9
Network Protocols and Services
• Network protocols are formal standards and policies
comprised of rules, procedures and formats that define
communication between two or more devices over a
network. Network protocols govern the end-to-end processes
of timely, secure and managed data or network
communication.
• Network protocols incorporate all the processes,
requirements and constraints of initiating and
accomplishing communication between computers, servers,
routers and other network enabled devices.
• Network protocols must be confirmed and installed by the
sender and receiver to ensure network/data communication
and apply to software and hardware nodes that communicate
on a network. 10
Network Protocols and Services
• Networks are set up with a protocol hierarchy that divides the
communication task into several layers.
• A protocol is a set of rules for communication within a layer.

Dr. Hatem Yousry

Data Communication
• A service is what the layer provides to the layer above it through
an interface.
• An interface protocol is a specification that defines how data is
delivered and interpreted.

11
Network Protocols and Services
• Generally speaking, there are three types of protocols in
networking -- 1. Communication, such as Ethernet;
2. Management, such as Simple Mail Transfer Protocol

Dr. Hatem Yousry

Data Communication
(SMTP); and 3. Security, such as Secure Shell, or SSH.
• There are four types of network services: user management,
email, printing, and system administration. In a networked
environment, the desktops are known as client computers or
workstations.
• Network Services include IP addressing, Domain Name
System (DNS), primary domain email service, Internet access,
web content filtering, security products such as firewalls, VPN
termination and intrusion prevention systems (IPS),
12
Network Protocols and Services

13
Network Performance Metrics

Bandwidth

Error rate Throughput

14
Jitter Latency
Links
• The only other property of a link that we are interested in at
this stage is a very pragmatic one—how do you go about
getting one? The answer depends on how far the link needs to
reach, how much money you have to spend, and whether or
not you know how to operate earth-moving equipment.
• The following is a survey of different link types you might use
to build a computer network.

15
Direct Link Networks
• It is a mistake to look too far ahead.
Only one link in the chain of destiny can be handled at a time.
—Winston Churchill

• The simplest network possible is one in which two hosts are

directly connected by some physical medium.
• The medium be a length of wire, a piece of optical fiber, or a
medium (such as air or even free space) through which
electromagnetic radiation (e.g., radio waves) can be
transmitted.
• It may cover a small area (e.g., an office building) or a wide
area (e.g., transcontinental). 16
Media Access Control - MAC

Encoding.

Access. Framing.

MAC

Reliable Error
Delivery. Detection. 17
Media Access Control - MAC problem
• The first is encoding bits onto the transmission medium so that they
can be understood by a receiving host.
• Second is the matter of delineating the sequence of bits transmitted
over the link into complete messages that can be delivered to the end
node. This is called the framing problem, and the messages delivered
to the end hosts are often called frames.
• Third, because frames are sometimes corrupted during transmission,
it is necessary to detect these errors and take the appropriate action;
this is the error detection problem.
• The fourth issue is making a link appear reliable in spite of the fact
that it corrupts frames from time to time.
• Finally, in those cases where the link is shared by multiple hosts—as
opposed to a simple point-to-point link—it is necessary to mediate
access to this link.
• This is the Media Access Control problem. (Encoding, Framing, 18
Error Detection, Reliable Delivery, and Access Mediation).
MAC and Network Technologies
• We will consider these issues in the context of four specific
network technologies:
1. Point-to-point links.
2. Carrier sense multiple access (CSMA) networks (of which
Ethernet is the most famous example).
3. Token rings (of which IEEE Standard 802.5 and FDDI are the
most famous examples).
4. Wireless networks (for which 802.11 is the most widespread
standard1).
• The goal is simultaneously to survey the available network
technology and to explore these five fundamental issues.
Host A physical Link Host B 19
A Network Adaptor
• A network adaptor can be thought of as having two main
components: a bus interface that understands how to
communicate with the host and a link interface that
understands how to use the link.
• There must also be a communication path between these two
components, over which incoming and outgoing data is passed.

20
A Network Adaptor
• One of the most important issues in network adaptor design is how
bytes of data are transferred between the adaptor and the host
memory.
• There are two basic mechanisms: direct memory access (DMA) and
programmed I/O (PIO).
• With DMA, the adaptor directly reads and writes the host’s
memory without any CPU involvement; the host simply gives the
adaptor a memory address and the adaptor reads from (or writes to)
it.
• With PIO, the CPU is directly responsible for moving data
between the adaptor and the host memory: To send a frame, the
CPU executes a tight loop that first reads a word from host memory
and then writes it to the adaptor; to receive a frame, the CPU reads
words from the adaptor and writes them to memory. 21
Memory bandwidth on a modern PC-class
machine.
• This diagram shows the bandwidth available between various
components of a modern PC.
• While the I/O bus is fast enough to transfer frames between
the network adaptor and host memory at gigabit rates, there are
two potential problems.
• I/O bus speed.
• Memory/CPU bandwidth.

22
Links
• Since all electromagnetic waves travel at the speed of light,
that speed divided by the wave’s frequency is equal to its
wavelength.
• We have already seen the example of a voice-grade telephone
line, which carries continuous electromagnetic signals ranging
between 300 and 3,300 Hz; a 300-Hz wave traveling through
copper would have a wavelength of
• SpeedOfLightInCopper÷ Frequency
= 2/3×3×108 ÷ 300 = 667 ×103 meters
 Propagation delay - Links
 Transmission delay - Switches
23
 Total delay α Tt + TP
Throughput
• Throughput is the rate of production or the rate at which
something is processed.
• The throughput may be calculated from the efficiency

Dr. Hatem Yousry

Data Communication
• where the physical layer net bit rate (the wire bit rate) depends
on the Ethernet physical layer standard, and may be 10 Mbit/s,
100 Mbit/s, 1 Gbit/s or 10 Gbit/s.
• 10, 100, 1000, 10G, ... – the nominal, usable speed at the top of
the physical layer (no suffix = megabit/s, G = gigabit/s),
excluding line codes but including other physical layer 24
overhead .
Latency or Delay

Timing Diagram

25
Round Trip Time
• In telecommunications, the round-trip delay time (RTD) or
round-trip time (RTT) is the length of time it takes for a
signal to be sent plus the length of time it takes for an
acknowledgment of that signal to be received.
• This time delay therefore consists of the propagation times
between the two points of a signal.

C:\Ping 192.168.1.1
26

Timing Diagram
Round Trip Time and Throughput
• In data transmission, network throughput is the amount of data
moved successfully from one place to another in a given time
period, and typically measured in bits per second (bps), as in
megabits per second (Mbps) or gigabits per second (Gbps).

27
Latency
• The speed of light imposes a minimum propagation time on
all electromagnetic signals. It is not possible to reduce the
latency below

t=d/cm
• where d is the distance and cm is the speed of light in the
medium.
• This approximately means 1 extra millisecond RTT for
100km/62miles of distance between hosts.
• Other delays also occur in intermediate nodes.
• In packet switched networks delays can occur due to queueing.
28
Latency
• we could define the total latency as:
• Transmit (Tt) = Size/Bandwidth

• Propagation (Tp) = RTT/2 or Distance/Speed-of-Light

• Queue (Tq) = 2xRTT + Condition.

• Latency (D) = Tq + Tt + Tp

• where Distance is the length of the wire over which the data will travel,
Speed- Of Light is the effective speed of light over that wire, Size is the size
of the packet, and Bandwidth is the bandwidth at which the packet is
transmitted.
• Note that if the message contains only one bit and we are talking about a
single link (as opposed to a whole network), then the Transmit and Queue 29
terms are not relevant, and latency corresponds to the propagation delay only
Example (Latency (D))
• Calculate the total time required to transfer a 1.5MB file in the
following cases, assuming a RTT of 80 ms, a packet size of 1
KB data, and an initial 2×RTT of “handshaking” before data
is sent.
a) The bandwidth is 10Mbps, and data packets can be sent
continuously.
b) The bandwidth is 10Mbps, but after we finish sending each data
packet we must wait one RTT before sending the next.
c) The link allows infinitely fast transmit, but limits bandwidth
such that only 20 packets can be sent per RTT.
d) Zero transmit time as in (c), but during the first RTT we can
send one packet, during the second RTT we can send two
packets, during the third we can send four = 23−1, and so on. 30
 File

Size/Bandwidth

Tt
Tq
Timing Diagram

Distance/Speed
Tp

• Transmit (Tt) = Size/Bandwidth

• Propagation (Tp) = RTT/2 or Distance/Speed-of-Light 31
• Queue (Tq) = 2xRTT + Condition.
• Latency (D) = Tq + Tt + Tp
Example ( a )
• Transfer 1.5 MB file, assuming RTT of 80 ms, a packet size of 1-KB and an initial
“handshake” of 2xRTT. Bandwidth is 10 Mbps and data packets can be sent
continuously
• Transmit (Tt) = Size/Bandwidth. A B
• Propagation (Tp) = RTT/2. request
• Queue (Tq) = 2xRTT + Condition. RTT reply
• Latency (D) = Tq + Tt + Tp confirm
Ack
RTT = 80 ms. Tt
Tt = 1024x8 bits/107 bits/s = 0.8192 ms Tp
Tp = 40 ms
# of packets = 1536 = (1.5 x 1024) . . .
Condition = (1536-1)x Tt
D = 2xRTT + 1535xTt + Tt+ Tp 32
= 160 + 1258.29 + 40 ms
= 1.458 s Timing Diagram t
Example ( b )
• Transfer 1.5 MB file, assuming RTT of 80 ms, a packet size of 1-KB
and an initial “handshake” of 2xRTT
• After sending each packet must wait one RTT
• Transmit (Tt) = Size/Bandwidth.
A B
• Propagation (Tp) = RTT/2.
request
• Queue (Tq) = 2xRTT + Condition. RTT reply
• Latency (D) = Tq + Tt + Tp
confirm
Ack
RTT = 80 ms Tt
Tt = 1024x8 bits/107 bits/s = 0.8192 ms RTT
Tp = 40 ms
# of packets = 1536 = (1.5 x 1024)
. . .
Wait condition = (1536-1)x Tt + 1535x RTT
D = (2xRTT + 1535x(Tt +RTT) )+ Tt +Tp 33
= 160 + 124,057 + 0.8192 + 40 ms
= 124.258 s Timing Diagram t
Example ( c )
• Transfer 1.5 MB file, assuming RTT of 80 ms, a packet size of 1-KB
and an initial “handshake” of 2xRTT
• Only 20 packets can be send per RTT, but infinitely fast
• Transmit (Tt) = Size/Bandwidth.
A B
• Propagation (Tp) = RTT/2.
request
• Queue (Tq) = 2xRTT + Condition. RTT reply
• Latency (D) = Tq + Tt + Tp
confirm
RTT = 80 ms Ack
Tt = 0 ms
Tp = 40 ms RTT
# of packets = 1536 (1.5 x 1024)
Only 20 packets : 1536/20= 76.8 per RTT. . . .
D = 2xRTT + 76xRTT + 0 + Tp
= 160 + 6080 + 40 ms 34
= 6.28 s
Timing Diagram t
Example ( d )
• Transfer 1.5 MB file, assuming RTT of 80 ms, a packet size of 1-KB and an
initial “handshake” of 2xRTT, Zero transmit time as in (c), but during the
first RTT we can send one packet, during the second RTT we can send two
packets, during the third we can send four = 23−1, and so on.
• Transmit (Tt) = Size/Bandwidth.
• Propagation (Tp) = RTT/2. A B
• Queue (Tq) = 2xRTT + Condition. request
• Latency (D) = Tq + Tt + Tp RTT reply
RTT = 80 ms confirm
Tt = 0 ms Ack
Tp = 40 ms
# of packets = 1536 (1.5 x 1024) RTT
# of waits (1+2+…2n = 2n+1 -1) , 211 -1 =2047 packets,
n=11 gives 2047>1536 , So that n = 10 as 210 -1= 1023. . . .
Condition: 10xRTT 35
D = 2xRTT + 10xRTT + 0+ Tp
= 160 + 800 + 40 ms
Timing Diagram t
=1s
Delay × Bandwidth Product
• It is also useful to talk about the product of these two metrics,
often called the delay × bandwidth product.
• Intuitively, if we think of a channel between a pair of processes
as a hollow pipe, where the latency corresponds to the
length of the pipe and the bandwidth gives the diameter of
the pipe, then the delay × bandwidth product gives the volume
of the pipe —
• The maximum number of bits that could be in transit
through the pipe at any given instant.

36
Bandwidth x Delay Product
• The amount of data (bits or bytes) “in the pipe”
• Example: 100Mbps x 10ms = 1 Mbit

• The amount of data sent before first bit arrives

• Usually use RTT as delay: amount of data before a reply from a

receiver arrives to the sender

37
• To appreciate the significance of ever-increasing bandwidth in the
face of fixed latency, consider what is required to transmit a 1-MB
file over a 1-Mbps network versus over a 1-Gbps network, both
of which have an RTT of 100 ms.
• In the case of the 1-Mbps network, it takes 80 round-trip times to
transmit the file; during each RTT, 1.25%of the file is sent.
• In contrast, the same 1-MB file doesn’t even come close to filling 1
RTT’s worth of the 1-Gbps link, which has a delay × bandwidth
product of 12.5 MB.

38
Delay × Bandwidth Product
• Said another way, if latency (measured in time) corresponds to
the length of the pipe, then given the width of each bit (also
measured in time), you can calculate how many bits fit in the
pipe.
• For example, a transcontinental channel with a one-way
latency of 50 ms and a bandwidth of 45 Mbps is able to hold
or approximately 280 KB of data.
50×10−3 sec × 45×106 bits/sec
= 2.25 ×106 bits

39
 Data Communication
Dr. Hatem Yousry
Dr. Hatem Yousry
E-mail: Hyousry@nctu.edu.eg

40
 Data Communication
41

Dr. Hatem Yousry