Multiple Access

12.1
 Figure 12.1 Data link layer divided into two functionality-oriented sublayers

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

12.3
 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.

To avoid access conflict, each station follows a procedure.

When can station access the medium?

What can the station do if the medium is busy?

How can the station determine the success of failure of the transmission?

What can the station do if there is an access conflict?

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.4
 Figure 12.3 Frames in a pure ALOHA network

12.5
 Figure 12.4 Procedure for pure ALOHA protocol

12.6
 Figure 12.5 Vulnerable time for pure ALOHA protocol

12.7
 Note

The throughput for pure ALOHA is

−2G
S=G×e .

The maximum throughput

Smax = 0.184 when G= (1/2).

12.8
 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

−2 G
S = G× e 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.9
 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

−2G
case S = G × e 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

2G
S = G × e − 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.10
 Figure 12.6 Frames in a slotted ALOHA network

12.11
 Note

The throughput for slotted ALOHA is

−G
S=G×e .

The maximum throughput

Smax = 0.368 when G = 1.

12.12
 Figure 12.7 Vulnerable time for slotted ALOHA protocol

12.13
 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

−G
S = G× e 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.14
 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

−G
case S = G × e 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

−G
S = G × e 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.15
 Figure 12.9 Vulnerable time in CSMA

12.16
 Figure 12.10 Behavior of three persistence methods

12.17
 Figure 12.11 Flow diagram for three persistence methods

12.18
 Figure 12.12 Collision of the first bit in CSMA/CD

12.19
 Example 12.5

A network using CSMA/CD has a bandwidth of 10 Mbps. If the maximum propagation time

(including the delays in the devices and ignoring the time needed to send a jamming signal, as we

see later) is 25.6 μs, what is the minimum size of the frame?

Solution

The frame transmission time is Tfr = 2 × Tp = 51.2 μs. This means, in the worst case, a station

needs to transmit for a period of 51.2 μs to detect the collision. The minimum size of the frame is 10

Mbps × 51.2 μs = 512 bits or 64 bytes. This is actually the minimum size of the frame for Standard

Ethernet.

12.20
 Figure 12.14 Flow diagram for the CSMA/CD

12.21
 Figure 12.16 Timing in CSMA/CA

12.22
 Figure 12.17 Flow diagram for CSMA/CA

12.23
 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.24
 Figure 12.18 Reservation access method

12.25
 Figure 12.19 Select and poll functions in polling access method

12.26
 Figure 12.20 Logical ring and physical topology in token-passing access method

12.27