Вы находитесь на странице: 1из 38

Multiple Access Networking

Professor Izhak Rubin rubin@ee.ucla.edu Electrical Engineering Department UCLA


2013 by Professor Izhak Rubin

Information Sources

Analog; Digital Real-time Store and Forward

Examples:

Voice Video Imaging Facsimile Data

Time Frame=125 microsec

Time Frame

Time Frame

Real-Time Transmission of a Stream Store & Forward Transmission of a Stream


Prof. Izhak Rubin 2

Multiplexing

Definition: Sharing communication channel (service) resource among collocated stations (clients) Stations are said to be collocated when there is a lowdelay low-cost mechanism for scheduling controlling and coordinating their use of the shared resource Note: Messages fed into the Mux reside in a common buffer facility; scheduler then orderspackets for transmission across channel using designated slots.

Communication Channel

MUX

DeMUX

Prof. Izhak Rubin

Multiplexing Methods

1. Fixed Assigned: channel resource dedicated to a link flow


Frequency Division Multiplexing (FDM) Time Division Multiplexing (TDM) Wavelength Division Multiplexing (WDM)

2. Demand Assigned: channel resource allocated on demand


Asynchronous Time Division Multiplexing (ATDM) Statistical Multiplexing


Prof. Izhak Rubin 4

Time Division Multiplexing (TDM)-1


Time Frame Time Frame Time Frame

MUXed Comm Channel

4
Time t

Tx in slot 3 of every frame

Rx in specified slots

Rx

Tx

Messages Received Across Channel

Queue

Queue

Message Arrivals For Tx

Control process, or via net management, used to allocate a slot for transmissions from station-i to station-j. Assignment is fixed, or (slowly) programmable.
Communication Channel

Station 3
MUX

DeMUX

Prof. Izhak Rubin

Time Division Multiplexing (TDM)-2


Time Frame Time Frame Time Frame

MUXed Comm Channel

4
Time t

From slot 3 in each frame

Head of the line packets are destined to stations 4,3,2

Rx

Tx

Messages Received Across Channel

Queue

Queue

Message Arrivals For Tx

Control process, or via net management, used to allocate a slot for transmissions from station-i to station-j. Assignment is fixed, or (slowly) programmable.
Communication Channel

Station 3
MUX

DeMUX

Prof. Izhak Rubin

Frequency Division Multiplexing (FDM) - 1


MUXed Comm Channel Frequency Band 1 Frequency Band 2 Frequency Band 3 Frequency Band 4 Frequency

Received in specified Band

Rx

Tx

Messages Received Across Channel

Queue

Queue

Message Arrivals For Tx

Control process, or via net management, used to allocate band-k for transmissions from station-i to station-j. Assignment is fixed, or (slowly) programmable.
Communication Channel

Station 2
MUX

DeMUX

Prof. Izhak Rubin

Frequency Division Multiplexing (FDM) - 2


MUXed Comm Channel Frequency Band 1 Frequency Band 2 Frequency Band 3 Frequency Band 4 Frequency

Received in Band 3

Head of the line message is destined to station 2 and is transmitted in Band 2

Rx

Tx

Messages Received Across Channel

Queue

Queue

Message Arrivals For Tx

Control process, or via net management, used to allocate band-k for transmissions from station-i to station-j. Assignment is fixed, or (slowly) programmable.
Communication Channel

Station 3
MUX

DeMUX

Prof. Izhak Rubin

Asynchronous Time Division Multiplexing (ATDM) Statistical Multiplexing


MUXed Comm Channel
Head of the line packets are destined to stations 4,3,2; packet headers included.

Time t

From any slot; packets header destination ID= Station 3

Rx

Tx

Queue Service Discipline: FCFS (FIFO) or Priority

Packets are transmitted across available

Messages Received Across Channel

Queue

Queue

Message Arrivals For Tx

time slots. Packet includes a header identifying source-destination stations.

Station 3
MUX

Communication Channel

DeMUX

Prof. Izhak Rubin

Voice Digitization

PCM (Pulse Code Modulation):


Time Sampling at Nyquist Rate = 2 x BW = 2 x 4KHz = 8000 samples / sec = 125 microsec /sample Amplitude Quantization = 8bits/sample Data Rate = 8000 x 8 = 64 K bps ADPCM: 32 Kbps (4bits/ sample);

Transmission of Voice Messages Across Communication Channels:


Other compression schemes: 8K 16K bps

Example:

Tx a single sample every 125 microsec across a deidcated channel (at 64 Kbps for PCM voice) Four 64 Kbps voice streams multiplexed across a 256 Kbps Channel; 8 bits/segment sample; slot time = 8 / 256K =31.25 microsec; Frame Time = 125 microsec (TDM)
Time Frame Time Frame

Time Frame=125 microsec

31.25 microsec

Prof. Izhak Rubin

10

Voice Digitization Packet Voice


Assemble K samples into a packet (segment). Transmit the packet across the communications channel. Use replay buffer at the receiver to smooth out statistical transport delay variations. Example: ADPCM voice packetized into packets which contain 128 samples/packet = 4 x 128 = 512 voice bits/packet + 64 bits OH/packet = 576 bits/packet. Inter-packet generation time = 128x125microsec = 16 msec. Source loading rate = 1packet/16 msec = 62.5 packets/sec =62.5 x 576 = 36 kbps.
Other Sources
Packet Buildup Buffer

Tx

Replay Buffer

Rx

Communication Network
Source
Ex: Packet Buildup time = 16 msec Packet Transmit Time / 256K Link= 576/256K =2.25 msec Ex: End-to-End Network transfer Delay = 10 350 ms Ex: 10- 50 msec

Prof. Izhak Rubin

11

Voice Digitization Packet Voice (cont.)


Multiple Access Methods: Under a Fixed Assignment Circuit Switched System, each source is allocated (via TDMA or FDMA methods) a 36 kbps channel Under a Packet Switched method, a demand assigned method is used. For example, under a FCFS (First Come First Served) statistical multiplexer, assuming a voice activity factor of 50%, 4 packetized voice streams are multiplexed across a communications channel operating at rate of R=4x36Kbpsx50%=72kbps. Or, across a 256 kbps channel one can multiplex 256K / 18K = 14 voice streams. Note: each packet contains an header identifier; packets will have to be discarded when more than 256K/36K = 7 streams are active.

Prof. Izhak Rubin

12

Multiple Access Networking


Definition: Sharing communication channel (service) resource among distributed stations (clients) Stations are said to be distributed when there is no low-delay low-cost mechanism for scheduling, controlling and coordinating their use of the shared resource

Methods:

Fixed Assignment

Demand Assignment

Frequency Division Multiple Access (FDMA) Time Division Multiple Access (TDMA) Reservation Based

Polling Based

DA /FDMA; DA/TDMA Centralized Polling Token Passing Polling

Random Access

ALOHA random Access Carrier Sense Multiple Access (CSMA) CSMA with Collision Detection (CSMA/CD)
13

Prof. Izhak Rubin

Categorization of Medium Access Control Procedures


Fixed Assigned (FA) Demand Assignment (DA) Random Access (RA)

Signaling (SIG) Information /Control Techniques Transmission Method

SIG

IT

SIG/Control

IT Over (T,F,C,S)

T T F C S T F C S

Signaling/Control Channel

Fixed

Adaptive Channel Sensing

FA DA Per-station Signaling/Control Access Scheme

Poll/Response Access FA, RA Polling Reservation

Res/Assignment Access FA, RA

Prof. Izhak Rubin

14

Frequency Division Multiple Access (FDMA)


Shared Comm Channel Frequency Band 1 Frequency Band 2 Frequency Band 3 Frequency Band 4

Receive from any band or across designated bands

Transmit in Band 2

Parameters:

Rx

Tx

Messages Received Across Channel

Queue

Queue

Message Arrivals For Tx

Station 2

Control channel, or via net management, used to allocate band-k for transmissions from station-i to station-j. Assignment is fixed, or (slowly) programmable.

Channel Data Rate (R) [bps] and Bandwidth W [Hz] Band Tx Rate (R(B)) [bps] and BW W(B) [Hz] BW Index of Utilization = R(B)/W(B) [bps/Hz] No. of Bands = N(B) Others: Channel BW Overhead Others: Band Overhead Others: Buffer Capacity

Prof. Izhak Rubin

15

Time Division Multiple Access (TDMA)


Time Frame Time Frame Time Frame

Shared Comm Channel

4
Time t

From any slot

To Slot 2 in a frame

Parameters:

Rx

Tx

Messages Received Across Channel

Queue

Queue

Message Arrivals For Tx

Control channel, or via net management, used to allocate time slots in each frame for transmissions from station-i to station-j. Assignment is fixed, or (slowly) programmable.

Station 2

Channel Data Rate (R) [bps] Slot Length (T(S)) [sec] No. of Slots/Frame = N(SF) Frame Duration = T(F)=T(S) N(SF) [sec] Segment Length = L(S) [bits] Others: Frame Overhead, Frame Synch Preamble Others: Slot Overhead Others: Buffer Capacity

Prof. Izhak Rubin

16

Demand Assigned / TDMA


Time Frame Time Frame Time Frame

Shared Comm Channel

From any slot

To Slot 2 in a frame

Rx

Tx

Signaling subsystem: Reservation (order wire) channel set by controller by using announced slots.

S2

Messages Received Across Channel

Queue

Queue

Message Arrivals For Tx

S1

Station 3
Slot allocations made by controller (or in a distributed manner) in response to requests made by stations.

S3
Prof. Izhak Rubin

S4
17

Multiple Access Network

Demand Assigned Multiple Access: Polling


Centralized Structure Distributed Structure


Hub Polling Token Passing


S5
Station Responds to Poll if it is active

Central Controller

Cluster Controller Communication Bus

S1

Polls in turn Every station

S2

S3

S4

Prof. Izhak Rubin

18

Demand Assigned Multiple Access: Token Passing Polling


Packet (from s3)

S1
Token Passing Network (with early token release)

S5

Polls in turn Every station

Token

Performance of a polling network is determined by the relative value of the walk time = time it takes a token to poll all stations when no station has a packet ready for access

S2

S3

S4

Upon Receiving a Token, the Station:

Examples of Token Passing Ring Networks:


If Idle, lets the token pass by If Busy, seizes the token, transmits its packets, regenerates the token and puts it on the medium when its transmission is complete (or upon reaching its dwell time limit) IBM Token Ring, IEEE 802.5 Token Ring; 4/16Mbps FDDI (Fiber Data Distribution Interface); 100 Mbps; 100 Km.
Prof. Izhak Rubin 19

Random Access: ALOHA Scheme


S2 Communication Bus S1

S3
Wireline Multiple Access Network

S4

Radio Communications Wireless Network

Unslotted ALOHA Access Control Algorithm:


A ready station transmits its packet across the channel The station determines the outcome of the transmission

If no other stations transmission overlaps packets transmission is successful If other station transmission overlap collision; The station then retransmits its packet after a random retransmission delay

Prof. Izhak Rubin

20

Random Access: ALOHA Scheme


Slotted ALOHA Access Control Algorithm:


A ready station transmits its packet across the channel at a start of a slot The station determines the outcome of the transmission:

P1

If no other stations transmission overlaps packets transmission is successful If other station transmissions overlap collision; the station then retransmits its packet (at a start of a slot) after a random retransmission delay P3 P2 P2 Collision Successful Retransmission

Successful Transmission

An Unslotted ALOHA System Operation P1 Successful Transmission P2 P3 P2 Successful Retransmission

Time

Collision

Time

An Slotted ALOHA System Operation Prof. Izhak Rubin 21

Throughput Performance Measures


Throughput = average number of successful packet transmissions per unit time Normalized throughput (s) = average number of successful packet transmissions per slot

Slot duration = time to transmit a (max length) packet Hence: 0 s 1.

Throughput Capacity = maximum achievable throughput (or normalized throughput) level


Prof. Izhak Rubin 22

Throughput Performance under Random Access MAC


G = average number of packet transmissions per slot Assume the channel process to be modeled as a Poisson process:
P(number of transmissions per slot = k) = exp(-G)Gk/k!, k=0,1,2, Under slotted ALOHA protocol: s = P(number of transmissions = 1) = G*exp(-G) <= 1/e = 0.368 Under unslotted ALOHA protocol: s = P(number of transmissions in the slot = 1; no transmissions in previous slot) = G*exp(-G) *exp(-G) =G*exp(2G) <= 1/2e = 0.184.

Prof. Izhak Rubin

23

S vs. G Performance Curves

Prof. Izhak Rubin

24

Random Access: Carrier Sense Multiple Access (CSMA) Scheme


1.

2.

CSMA Access Control Algorithm A Ready station listens to the channel If the channel is Busy, it listens again later If the channel is Idle, it transmits its packet The station determines the outcome of the transmission: If no other stations transmission overlaps packets transmission is successful If other station transmissions overlap collision; The station then reschedules its next sensing of the channel to take place after a random back-off time Go to step 1 P3
P1 Successful Transmission P2 Collision P2 Successful Retransmission

A CSMA System Operation

Time

Prof. Izhak Rubin

25

CSMA: Performance Factor


Performance depends on the value of the acquisition factor a = t(a) / T; where T = average packet transmission time; t(a) = channel acquisition time = time taken by a ready station to initiate transmission, when allowed, and induce all other stations to detect it so that they avoid accessing the channel at this time.
Prof. Izhak Rubin 26

Random Access: Carrier Sense Multiple Access with Collision Detection (CSMA/CD) Scheme
1.

CSMA/CD Access Control Algorithm: A ready station listens to the channel.

2.

The station determines the outcome of the transmission while it is transmitting its packet:

If the channel is Busy, it listens again later If the channel is Idle, it transmits its packet

P1

If no other stations transmission overlaps packets transmission is successful If other station transmission overlap collision; The station aborts transmission at the collision detection time, it then reschedules its next sensing of the channel to take place after a random back-off time P3 Go to Step 1
P2 P2

Successful Transmission

Collision

Successful Retransmission

A CSMA/CD System Operation

Time

Prof. Izhak Rubin

27

802.11 Medium Access Control (MAC) for Wireless Local Area Networks (WLANs)
Reference: website of IEEE 802.11

Basic Access Protocol Features

Prof. Izhak Rubin

29

CSMA with Collision Avoidance (CSMA/CA)

Prof. Izhak Rubin

30

CSMA/CA + ACK Protocol

Prof. Izhak Rubin

31

Hidden Node Problem

Prof. Izhak Rubin

32

Hidden Node Provisions

Prof. Izhak Rubin

33

Frame Formats

Prof. Izhak Rubin

34

Address Field Description

Prof. Izhak Rubin

35

Power Management Approach

Prof. Izhak Rubin

36

Wireless LAN Infrastructure Network

Prof. Izhak Rubin

37

Roaming

Prof. Izhak Rubin

38

Вам также может понравиться