Scribd
Upload
2 views

unit 2 access control

The document discusses multiple access control methods in data link layer protocols, focusing on random access and controlled access techniques. It covers protocols such as ALOHA, Carrier Sense Multiple Access (CSMA), and token passing, detailing their throughput calculations and operational principles. Examples illustrate the performance of these protocols under different load conditions.

Uploaded by

Suriya
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
2 views

unit 2 access control

The document discusses multiple access control methods in data link layer protocols, focusing on random access and controlled access techniques. It covers protocols such as ALOHA, Carrier Sense Multiple Access (CSMA), and token passing, detailing their throughput calculations and operational principles. Examples illustrate the performance of these protocols under different load conditions.

Uploaded by

Suriya
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 52

Multiple Access Control

12.1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Figure 12.1 Data link layer divided into two functionality-oriented
sublayers

12.2
12.3
Figure 12.2 Taxonomy of multiple-access protocols discussed in this chapter

12.4
12-1 RANDOM ACCESS

In random access or contention methods, no station is


superior to another station and none is assigned the
control over another. No station permits, or does not
permit, another station to send. At each instance, a
station that has data to send uses a procedure defined
by the protocol to make a decision on whether or not to
send.
Topics discussed in this section:
ALOHA
Carrier Sense Multiple Access
Carrier Sense Multiple Access with Collision Detection
Carrier Sense Multiple Access with Collision Avoidance
12.5
12.6
12.7
Figure 12.3 Frames in a pure ALOHA network

12.8
Figure 12.5 Vulnerable time for pure ALOHA protocol

12.9
Figure 12.4 Procedure for pure ALOHA protocol

12.10
Note

The throughput for pure ALOHA is


S = G × e −2G .
The maximum throughput
Smax = 0.184 when G= (1/2).
G is the number of stations that wish to
transmit at the same time

12.11
Example 12.3
A pure ALOHA network transmits 200-bit frames on a
shared channel of 200 kbps. What is the throughput if the
system (all stations together) produces
a. 1000 frames per second b. 500 frames per second
c. 250 frames per second.
Solution
The frame transmission time is 200/200 kbps or 1 ms.
a. If the system creates 1000 frames per second, this is 1
frame per millisecond. The load is 1. In this case
S = G× e−2 G or S = 0.135 (13.5 percent). This means
that the throughput is 1000 × 0.135 = 135 frames. Only
135 frames out of 1000 will probably survive.
12.12
Example 12.3 (continued)
b. If the system creates 500 frames per second, this is
(1/2) frame per millisecond. The load is (1/2). In this
case S = G × e −2G or S = 0.184 (18.4 percent). This
means that the throughput is 500 × 0.184 = 92 and that
only 92 frames out of 500 will probably survive. Note
that this is the maximum throughput case,
percentagewise.

c. If the system creates 250 frames per second, this is (1/4)


frame per millisecond. The load is (1/4). In this case
S = G × e −2G or S = 0.152 (15.2 percent). This means
that the throughput is 250 × 0.152 = 38. Only 38
frames out of 250 will probably survive.
12.13
12.14
Figure 12.6 Frames in a slotted ALOHA network

12.15
Figure 12.7 Vulnerable time for slotted ALOHA protocol

12.16
Note

The throughput for slotted ALOHA is


S = G × e−G .
The maximum throughput
Smax = 0.368 when G = 1.

12.17
12.18
Example 12.4
A slotted ALOHA network transmits 200-bit frames on a
shared channel of 200 kbps. What is the throughput if the
system (all stations together) produces
a. 1000 frames per second b. 500 frames per second
c. 250 frames per second.
Solution
The frame transmission time is 200/200 kbps or 1 ms.
a. If the system creates 1000 frames per second, this is 1
frame per millisecond. The load is 1. In this case
S = G× e−G or S = 0.368 (36.8 percent). This means
that the throughput is 1000 × 0.0368 = 368 frames.
Only 386 frames out of 1000 will probably survive.
12.19
Example 12.4 (continued)
b. If the system creates 500 frames per second, this is
(1/2) frame per millisecond. The load is (1/2). In this
case S = G × e−G or S = 0.303 (30.3 percent). This
means that the throughput is 500 × 0.0303 = 151.
Only 151 frames out of 500 will probably survive.

c. If the system creates 250 frames per second, this is (1/4)


frame per millisecond. The load is (1/4). In this case
S = G × e −G or S = 0.195 (19.5 percent). This means
that the throughput is 250 × 0.195 = 49. Only 49
frames out of 250 will probably survive.

12.20
12.21
12.22
12.23
12.24
12.25
12.26
Figure 12.10 Behavior of three persistence methods

12.27
Figure 12.11 Flow diagram for three persistence methods

12.28
12.29
Figure 12.14 Flow diagram for the CSMA/CD

12.30
Figure 12.15 Energy level during transmission, idleness, or collision

12.31
12.32
12.33
Figure 12.16 Timing in CSMA/CA

12.34
Note

In CSMA/CA, the IFS can also be used to


define the priority of a station or a frame.

12.35
Note

In CSMA/CA, if the station finds the


channel busy, it does not restart the
timer of the contention window;
it stops the timer and restarts it when
the channel becomes idle.

12.36
Figure 12.17 Flow diagram for CSMA/CA

12.37
12-2 CONTROLLED ACCESS

In controlled access, the stations consult one another


to find which station has the right to send. A station
cannot send unless it has been authorized by other
stations. We discuss three popular controlled-access
methods.

Topics discussed in this section:


Reservation
Polling
Token Passing

12.38
12.39
Figure 12.18 Reservation access method

12.40
12.41
12.42
12.43
12.44
Figure 12.19 Select and poll functions in polling access method

12.45
12.46
12.47
12.48
Figure 12.20 Logical ring and physical topology in token-passing access method

12.49
Example 12.7

What is the number of sequences if we have 90 stations in


our network?

Solution
The number of sequences needs to be 2m. We need to
choose m = 7 and N = 27 or 128. We can then use 90
of the sequences as the chips.

12.50
Example 12.8

Prove that a receiving station can get the data sent by a


specific sender if it multiplies the entire data on the
channel by the sender’s chip code and then divides it by
the number of stations.

Solution
Let us prove this for the first station, using our previous
four-station example. We can say that the data on the
channel
D = (d1 ⋅ c1 + d2 ⋅ c2 + d3 ⋅ c3 + d4 ⋅ c4).
The receiver which wants to get the data sent by station 1
multiplies these data by c1.
12.51
Example 12.8 (continued)

When we divide the result by N, we get d1 .

12.52

You might also like