0% found this document useful (0 votes)
46 views71 pages

The Medium Access Sublayer

The document discusses different medium access control (MAC) techniques used in data link layer. It describes centralized and distributed MAC access and synchronous techniques like FDM and TDM and asynchronous techniques like round robin, reservation and contention. It then explains multiple access mechanisms like ALOHA, slotted ALOHA and CSMA/CA. It provides details on vulnerable time, throughput calculation and examples for pure and slotted ALOHA. It also compares ALOHA, slotted ALOHA and describes CSMA/CA flow diagram.

Uploaded by

ShitizGagrani
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
46 views71 pages

The Medium Access Sublayer

The document discusses different medium access control (MAC) techniques used in data link layer. It describes centralized and distributed MAC access and synchronous techniques like FDM and TDM and asynchronous techniques like round robin, reservation and contention. It then explains multiple access mechanisms like ALOHA, slotted ALOHA and CSMA/CA. It provides details on vulnerable time, throughput calculation and examples for pure and slotted ALOHA. It also compares ALOHA, slotted ALOHA and describes CSMA/CA flow diagram.

Uploaded by

ShitizGagrani
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 71

CHAPTER 4

The Medium Access Sublayer

Sublayers of Data Link


Layer

Introduction MAC
MAC controls the access to the
transmission medium for an orderly
and efficient use of the transmission
capacity of the n/w.
MAC access is in two different ways:
1) Centralized
2) Distributed

Access control
techniques
Synchronous: FDM and TDM

Asynchronous : Round Robin,


Reservation,Contention

Multiple Access
Mechanisms

Multiple Access
Mechanisms

10

11

12

13

14

15

16

17

Packet Transmission
Time
Packet Transmission Time: It is

amount of time from beginning until


the end of packet transmission.

Packet transmission Time= Packet Size/Bit


Rate
Assuming, 100Mbits/sec. Ethernet
Maximum packet size of 1526 Bytes
Result in,
Packet Transmission Time = (1526*8)/
(100,000,000) = 122usec.
18

Propagation Time

Propagation Time= Distance/Propagation


Speed
It is nothing but the time it takes for first
bit to travel from the sender to receiver.
Propagation speed depends on physical
medium of the link.
Propagation speed for fiber, twisted pair,
copper wire is in the range of
2*10^8m/sec. and 3*10^8 m/sec for
wireless communications.
19

20

21

ALOHA: Vulnerable Time

22

Example:
A pure ALOHA n/w transmit 200 bit
frames on a shared channel of 200
Kbps. What is the requirement to make
this frame collision-free?
Frame transmission time Tfr=200
bits/200 Kbps = 1 ms
The vulnerable time = 2*1 ms = 2ms

23

Throughput:
How much data can be
transferred from one location
to another in given time.
24

ALOHA: Throughput

The throughput for pure ALOHA is


S = G e2G
where G is the average number of
frames generated during one frame
transmission time.
The maximum throughput

Smax = 0.184 when G= 1/2

25

Example

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

1000 frames per second


500 frames per second
250 frames per second

26

If the system creates 1000 frames


per seconds, that is 1 frame per
millisec. The load is 1. In this case
S=G*e^-2G = 0.135(13.5%)
This means that throughput is
1000*0.135=135 frames.
Only 135 frames out of 1000 will
probably survive.

27

If the system creates 500 frames per


seconds, that is 1/2 frame per
millisec. The load is 1/2. In this case
S=G*e^-2G = 0.184(18.4%)
This means that throughput is
1000*0.184=92 frames.
Only 92 frames out of 500 will
probably survive.

28

If the system creates 250 frames per


seconds, that is 1/4 frame per
millisec. The load is 1/4. In this case
S=G*e^-2G = 0.152(15.2%)
This means that throughput is
1000*0.152=38 frames.
Only 38 frames out of 250 will
probably survive.

29

Slotted ALOHA

30

Slotted ALOHA: Vulnerable


Time

31

Slotted ALOHA:
Throughput
The throughput for Slotted ALOHA is
S = G eG

where G is the average number of


frames requested per frame-time
The maximum throughput

Smax = 0.368 when G= 1


32

Example

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

1000 frames per second


500 frames per second
250 frames per second

33

Comparison

34

35

36

37

38

39

40

41

42

43

44

CSMA/CA

Carrier Sense Multiple Access with


Collision Avoidance
Used in a network where collision
cannot be detected

E.g., wireless LAN

IFS Interframe Space


45

CSMA/CA: Flow Diagram

contention
window size is 2K1
After each slot:
- If idle, continue
counting
- If busy, stop counting

46

47

48

49

50

51

52

53

54

55

56

57

58

59

60

61

62

63

64

65

66

67

68

69

70

71

You might also like