DataComm-chapter 3
DataComm-chapter 3
FACULTY OF ENGINEERING,
CYBERJAYA
YEAR 2008
ECP 2056 :
DATACOMMUNICATIONS AND COMPUTER NETWORKING
3
3.1 Transmission media – guided & unguided
4
3.1 Transmission media – guided & unguided
GUIDED MEDIA
Figure 3 Twisted-pair
8
3.1 Transmission media – guided & unguided
9
3.1 Transmission media – guided & unguided
Figure 6 Coaxial
10
3.1 Transmission media – guided & unguided
●Coaxial Cable
●Used primarily in bus networks
●Operating with either baseband or broadband
Baseband:
- all available bandwidth is used to derive a single
transmission channel
Broadband:
- available bandwidth is divided to derived a number of
lower bandwidth subchannels on one cable
11
3.1 Transmission media – guided & unguided
Figure 7 BNC
12
3.1 Transmission media – guided & unguided
13
3.1 Transmission media – guided & unguided
Figure 9 Optical
14
3.1 Transmission media – guided & unguided
Figure 10 Propagation
Figure 11 Modes
●Further classified by
reflective index profile of
their core
●They can be either step
index or graded index
●Three main types of fiber
are:
(a) Single mode fiber
(b)Multimode stepped index
(c)Multimode graded index
16
3.1 Transmission media – guided & unguided
Figure 12 Fiber
17
3.1 Transmission media – guided & unguided
18
3.1 Transmission media – guided & unguided
19
3.1 Transmission media – guided & unguided
20
3.1 Transmission media – guided & unguided
21
3.1 Transmission media – guided & unguided
Table 3 Bands
22
3.1 Transmission media – guided & unguided
23
3.1 Transmission media – guided & unguided
24
3.1 Transmission media – guided & unguided
Note
25
3.1 Transmission media – guided & unguided
Figure 16 Unidirectional
26
3.1 Transmission media – guided & unguided
27
3.1 Transmission media – guided & unguided
Note
28
3.1 Transmission media – guided & unguided
29
3.1 Transmission media – guided & unguided
Note
30
ECP 2056 :
DATACOMMUNICATIONS AND COMPUTER NETWORKING
32
3.2 Bandwidth utilization:
multiplexing – FDM, TDM & WDM
34
3.2 Bandwidth utilization:
multiplexing – FDM, TDM & WDM
Figure 2 Categories of
35
3.2 Bandwidth utilization:
multiplexing – FDM, TDM & WDM
Figure 3 Frequency-division
37
3.2 Bandwidth utilization:
multiplexing – FDM, TDM & WDM
Figure 4 FDM
38
3.2 Bandwidth utilization:
multiplexing – FDM, TDM & WDM
39
3.2 Bandwidth utilization:
multiplexing – FDM, TDM & WDM
FDM System
In Figure b, the
spectrum of signal mi is
shifted to centered at fi.
fi must be chosen so
that the BWs of various
signals do not
significantly overlap.
Example
1
Assume that a voice channel occupies a bandwidth of
4 kHz. We need to combine three voice channels into a
link with a bandwidth of 12 kHz, from 20 to 32 kHz.
Show the configuration, using the frequency domain.
Assume there are no guard bands.
Solution
We shift (modulate) each of the three voice channels to a
different bandwidth, as shown in Figure 6.6. We use the 20- to
24-kHz bandwidth for the first channel, the 24- to 28-kHz
bandwidth for the second channel, and the 28- to 32-kHz
bandwidth for the third one. Then we combine them as shown
in Figure 6.6.
41
Example
42
Example
2
Example 2
Five channels, each with a 100-KHz bandwidth, are to be
multiplexed together. What is the minimum bandwidth of
the link if there is a need for a guard band of 10 KHz
between the channels to prevent interference?
Solution
For five channels, we need at least four guard bands. This
means that the required bandwidth is at least
5 x 100 + 4 x 10
= 540 KHz,
as shown in Figure
43
Figure 6 Analog
44
3.2 Bandwidth utilization:
multiplexing – FDM, TDM & WDM
45
3.2 Bandwidth utilization:
multiplexing – FDM, TDM & WDM
46
3.2 Bandwidth utilization:
multiplexing – FDM, TDM & WDM
47
3.2 Bandwidth utilization:
multiplexing – FDM, TDM & WDM
48
3.2 Bandwidth utilization:
multiplexing – FDM, TDM & WDM
51
Example
4
Figure 8 shows synchronous TDM with a data stream
for each input and one data stream for the output. The
unit of data is 1 bit. Find (a) the input bit duration, (b)
the output bit duration, (c) the output bit rate, and (d)
the output frame rate.
Figure 8 Example 6
Solution
We can answer the questions as follows:
a. The input bit duration is the inverse of the bit rate:
1/1 Mbps = 1 μs.
b. The output bit duration is one-fourth of the input bit
52
duration, or ¼ μs.
Example 4
(continued)
c. The output bit rate is the inverse of the output bit duration or
1/(4μs) or 4 Mbps. This can also be deduced from the fact
that the output rate is 4 times as fast as any input rate; so the
output rate = 4 × 1 Mbps = 4 Mbps.
d. The frame rate is always the same as any input rate. So the
frame rate is 1,000,000 frames per second. Because we are
sending 4 bits in each frame, we can verify the result of the
previous question by multiplying the frame rate by the
number of bits per frame.
53
Example
5
Four 1-kbps connections are multiplexed together. A
unit is 1 bit. Find (a) the duration of 1 bit before
multiplexing, (b) the transmission rate of the link, (c)
the duration of a time slot, and (d) the duration of a
frame.
Solution
We can answer the questions as follows:
a. The duration of 1 bit before multiplexing is 1 / 1 kbps, or
0.001 s (1 ms).
54
Example 5
(continued)
55
3.2 Bandwidth utilization:
multiplexing – FDM, TDM & WDM
Figure 9
56
Example
6
Four channels are multiplexed using TDM. If each channel
sends 100 bytes /s and we multiplex 1 byte per channel, show
the frame traveling on the link, the size of the frame, the
duration of a frame, the frame rate, and the bit rate for the link.
Figure
10
Example
8
Solution
The multiplexer is shown in Figure 6.16. Each frame carries 1
byte from each channel; the size of each frame, therefore, is 4
bytes, or 32 bits. Because each channel is sending 100 bytes/s
and a frame carries 1 byte from each channel, the frame rate
must be 100 frames per second. The bit rate is 100 × 32, or
3200 bps. 57
Example
7
A multiplexer combines four 100-kbps channels using a time
slot of 2 bits. Show the output with four arbitrary inputs. What is
the frame rate? What is the frame duration? What is the bit
rate? What is the bit duration?
Figure 11 Example 9
Solution
Figure 6.17 shows the output for four arbitrary inputs. The link
carries 50,000 frames per second. The frame duration is therefore
1/50,000 s or 20 μs. The frame rate is 50,000 frames per second, and
each frame carries 8 bits; the bit rate is 50,000 × 8 = 400,000 bits or
400 kbps. The bit duration is 1/400,000 s, or 2.5 μs. 58
Pulse Stuffing
59
Framing
Figure 13 Framing
60
Example
8
We have four sources, each creating 250 characters
per second. If the interleaved unit is a character and 1
synchronizing bit is added to each frame, find (a) the
data rate of each source, (b) the duration of each
character in each source, (c) the frame rate, (d) the
duration of each frame, (e) the number of bits in each
frame, and (f) the data rate of the link.
Solution
We can answer the questions as follows:
a. The data rate of each source is 250 × 8 = 2000 bps = 2 kbps.
61
Example 8
(continued)
b. Each source sends 250 characters per second; therefore, the
duration of a character is 1/250 s, or
4 ms.
c. Each frame has one character from each source, which
means the link needs to send 250 frames per second to keep
the transmission rate of each source.
d. The duration of each frame is 1/250 s, or 4 ms. Note that the
duration of each frame is the same as the duration of each
character coming from each source.
e. Each frame carries 4 characters and 1 extra synchronizing
bit. This means that each frame is
4 × 8 + 1 = 33 bits.
62
3.2 Bandwidth utilization:
multiplexing – FDM, TDM & WDM
Example
9
Two channels, one with a bit rate of 100 kbps and
another with a bit rate of 200 kbps, are to be
multiplexed. How this can be achieved? What is the
frame rate? What is the frame duration? What is the bit
rate of the link?
Solution
We can allocate one slot to the first channel and two slots
to the second channel. Each frame carries 3 bits. The
frame rate is 100,000 frames per second because it carries
1 bit from the first channel. The bit rate is 100,000
frames/s × 3 bits per frame, or 300 kbps.
63
3.2 Bandwidth utilization:
multiplexing – FDM, TDM & WDM
Figure 14 Digital
64
3.2 Bandwidth utilization:
multiplexing – FDM, TDM & WDM
65
3.2 Bandwidth utilization:
multiplexing – FDM, TDM & WDM
66
3.2 Bandwidth utilization:
multiplexing – FDM, TDM & WDM
67
3.2 Bandwidth utilization:
multiplexing – FDM, TDM & WDM
68
3.2 Bandwidth utilization:
multiplexing – FDM, TDM & WDM
69
3.2 Bandwidth utilization:
multiplexing – FDM, TDM & WDM
Statistical TDM
• In Synchronous TDM many slots are wasted
• Statistical TDM allocates time slots dynamically
based on demand
• Multiplexer scans input lines and collects data until
frame full
• Data rate on the multiplexed line is less than the
sum of the data rates of the attached devices
3.2 Bandwidth utilization:
multiplexing – SPREAD SPECTRUM
SPREAD
SPECTRUM
In spread spectrum (SS), we combine signals from
different sources to fit into a larger bandwidth, but
our goals are to prevent eavesdropping and
jamming. To achieve these goals, spread spectrum
techniques add redundancy.
71
3.2 Bandwidth utilization:
multiplexing – SPREAD SPECTRUM
Figure 18 Spread
72
3.2 Bandwidth utilization:
multiplexing – SPREAD SPECTRUM
73
3.2 Bandwidth utilization:
multiplexing – SPREAD SPECTRUM
74
3.2 Bandwidth utilization:
multiplexing – SPREAD SPECTRUM
Figure 21 FHSS
75
3.2 Bandwidth utilization:
multiplexing – SPREAD SPECTRUM
Figure 22 Bandwidth
76
3.2 Bandwidth utilization:
multiplexing – SPREAD SPECTRUM
Figure 32 DSSS
77
3.2 Bandwidth utilization:
multiplexing – SPREAD SPECTRUM
Figure 23 DSSS
78
ECP 2056 :
DATACOMMUNICATIONS AND COMPUTER
NETWORKING
FACULTY OF ENGINEERING,
CYBERJAYA
YEAR 2008
ECP 2056 :
DATACOMMUNICATIONS AND COMPUTER NETWORKING
What is WAN?
− Covers large geographical areas (towns, cities, states,
countries,..) or usually across an area of multiple km radius.
− LAN depends on their own hardware or equipment but WANs may
use public, leased, or private communication equipments
(combined).
− Usually consists of several interconnected switching nodes
● The nodes provide a switching facility that will move the data from one
node to another until they reach their destination
CHAPTER 3 Characteristics of Data Communication Networks:
Packet-switched data networks & Circuit switched data
networks
Switching Networks
− Long distance transmission is typically done
over a network of switching devices called
nodes
− Nodes do not concern with the content of data
− Data routed by being switched from node to
node
− End devices are called stations
●e.g. Computer, terminal, phone, etc
CHAPTER 3 Characteristics of Data Communication Networks:
Packet-switched data networks & Circuit switched data
networks
Figure 1 Switched
network
83
CHAPTER 3 Characteristics of Data Communication Networks:
Packet-switched data networks & Circuit switched data
networks
Nodes
− Nodes may connect to other nodes only (e.g. node 5), or
to stations and other nodes (e.g. node 6)
− Node-to-node links usually multiplexed (FDM or TDM)
− Some redundant connections (alternative paths) are
desirable for reliability
− Two general types of switching technologies
●Circuit switching
●Packet switching
CHAPTER 3 Characteristics of Data Communication Networks:
Packet-switched data networks & Circuit switched data
networks
CIRCUIT-SWITCHED NETWORKS
A circuit-switched network consists of a set of switches
connected by physical links. A connection between two
stations is a dedicated path made of one or more links.
However, each connection uses only one dedicated channel
on each link. Each link is normally divided into n channels by
using FDM or TDM.
Topics discussed in this section:
Three Phases
Efficiency
Delay
Circuit-Switched Technology in Telephone
Networks
86
CHAPTER 3 Characteristics of Data Communication Networks:
Packet-switched data networks & Circuit switched data
networks
Disadvantages
− Inefficient
●Channel capacity dedicated for duration of connection
hence if no data, capacity wasted especially for terminal-
to-computer connection.
− Delay
●Set up connection takes time
Applications
− Public telephone network
− Private branch exchange
− Data switch
Example
1
As a trivial example, let us use a circuit-switched network to connect eight
telephones in a small area. Communication is through 4-kHz voice channels.
We assume that each link uses FDM to connect a maximum of two voice
channels. The bandwidth of each link is then 8 kHz. Figure 4 shows the
situation. Telephone 1 is connected to telephone 7; 2 to 5; 3 to 8; and 4 to 6.
Of course the situation may change when new connections are made. The
switch controls the connections.
91
Example
2
As another example, consider a circuit-switched network that connects
computers in two remote offices of a private company. The offices are
connected using a T-1 line leased from a communication service provider.
There are two 4 × 8 (4 inputs and 8 outputs) switches in this network. For
each switch, four output ports are folded into the input ports to allow
communication between computers in the same office. Four other output
ports allow communication between the two offices. Figure 5 shows the
situation.
92
CHAPTER 3 Characteristics of Data Communication Networks:
Packet-switched data networks & Circuit switched data
networks
93
CHAPTER 3 Characteristics of Data Communication Networks:
Packet-switched data networks & Circuit switched data
networks
94
CHAPTER 3 Characteristics of Data Communication Networks:
Packet-switched data networks & Circuit switched data
networks
CHAPTER 3 Characteristics of Data Communication Networks:
Packet-switched data networks & Circuit switched data
networks
DATAGRAM NETWORKS
In data communications, we need to send messages
from one end system to another. If the message is
going to pass through a packet-switched network, it
needs to be divided into packets of fixed or variable
size. The size of the packet is determined by the
network and the governing protocol.
Topics discussed in this section:
Routing Table
Efficiency
Delay
Datagram Networks in the Internet
96
CHAPTER 3 Characteristics of Data Communication Networks:
Packet-switched data networks & Circuit switched data
networks
Packet-switching Principles
− Data are transmitted in small packets
●Typically 1000 octets
●Longer messages are split into a series of packets
●Each packet contains a portion of user data plus some control info
for routing purpose
98
CHAPTER 3 Characteristics of Data Communication Networks:
Packet-switched data networks & Circuit switched data
networks
99
CHAPTER 3 Characteristics of Data Communication Networks:
Packet-switched data networks & Circuit switched data
networks
Datagram Approach
● Each packet treated independently
●
Packets can take any practical route
● Packets may arrive out of order
●
Packets may go missing
●
Up to receiver to re-order packets and to
detect and recover missing packets
In a packet-switched network, there
is no resource reservation;
resources are allocated on demand.
100
CHAPTER 3 Characteristics of Data Communication Networks:
Packet-switched data networks & Circuit switched data
networks
101
CHAPTER 3 Characteristics of Data Communication Networks:
Packet-switched data networks & Circuit switched data
networks
102
CHAPTER 3 Characteristics of Data Communication Networks:
Packet-switched data networks & Circuit switched data
networks
104
CHAPTER 3 Characteristics of Data Communication Networks:
Packet-switched data networks & Circuit switched data
networks
VIRTUAL-CIRCUIT NETWORKS
Figure 10 Virtual-circuit
network
106
CHAPTER 3 Characteristics of Data Communication Networks:
Packet-switched data networks & Circuit switched data
networks
107
CHAPTER 3 Characteristics of Data Communication Networks:
Packet-switched data networks & Circuit switched data
networks
108
CHAPTER 3 Characteristics of Data Communication Networks:
Packet-switched data networks & Circuit switched data
networks
Setup Phase
●
Preplanned route established before any packets
sent.
●
All switches need to have a table entry for this
virtual circuit.
●
These switching tables contain information such as
incoming port/VCI and outgoing port/VCI.
● This phase is implemented in two approaches:
− Permanent virtual circuit (PVC)
− Switched virtual circuit (SVC)
109
CHAPTER 3 Characteristics of Data Communication Networks:
Packet-switched data networks & Circuit switched data
networks
●
An outgoing VCI is given to the source, and
an incoming VCI is given to the destination.
●
The source always uses this VCI to send
frames to that particular destination.
●
The PVC is like a leased telephone line.
110
CHAPTER 3 Characteristics of Data Communication Networks:
Packet-switched data networks & Circuit switched data
networks
112
CHAPTER 3 Characteristics of Data Communication Networks:
Packet-switched data networks & Circuit switched data
networks
113
CHAPTER 3 Characteristics of Data Communication Networks:
Packet-switched data networks & Circuit switched data
networks
− Setup request
●A setup request frame is sent from the source to
the destination.
network
CHAPTER 3 Characteristics of Data Communication Networks:
Packet-switched data networks & Circuit switched data
networks
− Acknowledgment
●An acknowledgment frame can complete the
entries in the switching tables.
116
CHAPTER 3 Characteristics of Data Communication Networks:
Packet-switched data networks & Circuit switched data
networks
Teardown Phase
● Source A, after sending all frames to B,
sends a special frame called a teardown
request.
●
Destination B responds with a teardown
confirmation frame.
●
All switches erase the corresponding entry
from their tables.
117
CHAPTER 3 Characteristics of Data Communication Networks:
Packet-switched data networks & Circuit switched data
networks
119
CHAPTER 3 Characteristics of Data Communication Networks:
Packet-switched data networks & Circuit switched data
networks
120
CHAPTER 3 Characteristics of Data Communication Networks:
Packet-switched data networks & Circuit switched data
networks
121
CHAPTER 3 Characteristics of Data Communication Networks:
Packet-switched data networks & Circuit switched data
networks
● Non-blocking
− Permits all stations to connect (in pairs) at once
− Suited for data connections as a terminal can be
connected for long hours at a time
123
CHAPTER 3 Characteristics of Data Communication Networks:
Packet-switched data networks & Circuit switched data
networks
Crossbar Switch
Input lines
Output 125
lines
CHAPTER 3 Characteristics of Data Communication Networks:
Packet-switched data networks & Circuit switched data
networks
Multistage Switch
● Example: Three-Stage Division Switch
●
Reduced number of crosspoints compared to
the cross-bar cross-points number.
● More than one path through network
Increased reliability
●
Downside:
− More complex control
− May be blocking. 126
CHAPTER 3 Characteristics of Data Communication Networks:
Packet-switched data networks & Circuit switched data
networks
3x3 127
5x2 2x5
switches switches switches
CHAPTER 3 Characteristics of Data Communication Networks:
Packet-switched data networks & Circuit switched data
networks
●
The RAM fills up with incoming data from
time slots in the order received
●
Slots are then sent out in an order based
on the decision of a control unit
130
CHAPTER 3 Characteristics of Data Communication Networks:
Packet-switched data networks & Circuit switched data
networks
TSI (cont.)
131
CHAPTER 3 Characteristics of Data Communication Networks:
Packet-switched data networks & Circuit switched data
networks
TDM Bus
● The input and output lines are connected
to a high-speed bus through input and
output gates (microswitches)
●
This pair of gates allows data to be
transferred using the bus
132
●
The control unit opens and closes the gates
CHAPTER 3 Characteristics of Data Communication Networks:
Packet-switched data networks & Circuit switched data
networks
133
CHAPTER 3 Characteristics of Data Communication Networks:
Packet-switched data networks & Circuit switched data
networks
TST Switch
135
CHAPTER 3 Characteristics of Data Communication Networks:
Packet-switched data networks & Circuit switched data
networks
Performance Analysis
● Propagation delay
− The time it takes a signal to propagate from
one node to the next.
− It is generally negligible.
● Transmission time
− The time it takes for a transmitter to send out
a block of data.
● Node delay
136
− The time it takes for a node to perform the
CHAPTER 3 Characteristics of Data Communication Networks:
Packet-switched data networks & Circuit switched data
networks
137
CHAPTER 3 Characteristics of Data Communication Networks:
Packet-switched data networks & Circuit switched data
networks
141
CHAPTER 3 Characteristics of Data Communication Networks:
Packet-switched data networks & Circuit switched data
networks
142