Scribd
Upload
12 views8 pages

Unit-III Part-2

Uploaded by

Malli
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
12 views8 pages

Unit-III Part-2

Uploaded by

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

Unit-III-part-2

Controlled Access:
 Reservation  Polling  Token Passing.
*************************************
In controlled access, the stations search for information from one another to
find which station has the right to send. It allows only one node(station) to
send at a time, to avoid the collision of messages on a shared medium. The
three controlled-access methods are:
1. Reservation 2. Polling 3. Token Passing

1. Reservation:- [train ticket reservation]


 In the reservation method, a station needs to make a reservation before
sending data.
 The timeline has two kinds of periods:
 Reservation interval of fixed time length
 Data transmission period of variable frames.
 If there are N stations, the reservation interval is divided into N slots, and
each station has one slot.
 When a station needs to send the data frame, it makes a reservation in its
own slot.
 The station that has made reservation can send their data frames after the
reservation frame.
 After data transmission period, next reservation interval begins.
 Since everyone agrees on who goes next, there will never be any collisions.

 The above figure show that five stations having five-slot reservation frame.
In the first interval, only stations 1, 3, and 4 have made reservations and
stations 2 and 5 don’t have reservations. Stations 1, 3, and 4 have send
the data due made the reservation. Station 2 and 5 don’t send data due to
they don’t have reservation.
 Stations 1 have made reservations send data, other stations don’t have
reservation and don’t send data
 Station1 to 5 don’t have reservation and they don’t send data.
Advantages:-

 The main advantage of reservation is high rates and low rates of data
accessing time of the respective channel can be predicated easily. Here
time and rates are fixed.
 Priorities can be set to provide fast access from secondary.
 Predictable network performance: such as in real-time video or audio
streaming.
 Reduced contention: we can improve network efficiency and reduce
packet loss.
 Quality of Service (QoS) support: we ensure that high-priority traffic is
given better usage of over lower-priority traffic.
 Efficient use of bandwidth
 Support for multimedia applications
Disadvantages:-
 Highly trust on controlled dependability.
 Decrease in capacity and channel data rate under light loads; increase in
transposition time.

2. Polling:- [class, lecturer and student]


 The polling protocol requires one of the node to designated as master node
(primary station or controller)
 The master nodes poll each of the nodes in a round robin fashion.
 The master node first sends a message to node 1, saying that node 1 can
transmit up to some maximum no. of frames.
 After node 1 transmit some frames, the master node send a message to node
2, the node 2 can transmit up to the maximum no. of frames.
 The master node can determine when a node has finished sending its frames
by observing the lack of signals on the channel.
 The procedure will continue in this manner, with the master node polling
each of the nodes in a cyclic manner.
 It eliminates the collision.
 It allows achieving higher efficiency.
Polling functions:-
Poll function: - If the primary wants to receive data, It asks the secondaries if
they have anything to send.
Select function:- If the primary wants to send data, It tells to the secondary to
get ready to receive.
Advantages:-
 The maximum and minimum access time and data rates on the channel are
fixed predictable.
 It has maximum efficiency.
 It has maximum bandwidth.
 No slot is wasted in polling.
 There is assignment of priority to ensure faster access from some
secondary.
Disadvantages:-
 It consume more time.
 Since every station has an equal chance of winning in every round, link
sharing is biased.
 Only some station might run out of data to send.
 An increase in the transposition time leads to a drop in the data rates of the
channel under low loads.
Efficiency Let Tpoll be the time for polling and Tt be the time required for
transmission of data. Then,
Efficiency = T t/(Tt + Tpoll)
3. Token Passing:-
 A station is authorized to send data when it receives a special frame called
as token.
 Here there is no master node
 A small special purpose frame known as a token is exchanged among the
nodes in some fixed order.
 When a node receive a token, It holds onto the token only it has some frames
to transmit; otherwise it immediately forward the token to the next frame.
 If a node does have frame to transmit when it receive the token, it sends up
to a maximum no.of frames and thgen farword to the token to the next frame.
 Token passing is decentralized and highly efficient. But it has problems as
well.
Example: the failure of node can crash the entire channel ot if a node
accidentally neglects to release the token, the some recovery procedure must
invoked to get token back in circulation.
Performance of token ring can be concluded by 2 parameters:-
Delay: It is a measure of time between when a packet is ready and when it is
delivered. So, the average time (delay) required to send a token to the next
station = a/N.
Throughput:- which is a measure of successful traffic.
Throughput, S = 1/(1 + a/N) for a<1

S = 1/{a(1 + 1/N)} for a>1.


where N = number of stations
a = Tp/Tt
Here Tp = propagation delay
Tt = transmission delay
****************************
Channelization Protocol
 It is a multiple-access method in which the available bandwidth of a link is
shared in time, frequency, and code between different stations.
 Multiplexing means multiple signals are combined together thus travel
simultaneously in a shared medium. By using this we are sharing the
bandwidth.
The three types of channelization are:
 Frequency Division Multiple Access [FDMA]
 Time Division Multiple Access [TDMA]
 Code Division Multiple Access [CDMA]
 Frequency Division Multiple Access (FDMA):-

 In FDMA, The available bandwidth is divided into equal bands so that each
station can be allocated its own band.

 Guard bands are also added so that no two bands overlap to avoid Collision
and noise.
 It is a data link layer protocol that uses FDM[frequency division multiplexing]
at the physical layer.
Example:-

 In the above diagram we have 4 stations like station 1, 2, 3 and 4.each


station can generate data. Entire bandwidth will broken into user bands and
Guard band used to protect overlapping.
 Multiple stations are used to transmit the data simultaneously with out any
collision and noise.
 Time Division Multiple Access (TDMA) :-

 In this, the bandwidth is shared just only one channel. Suppose we have 10
stations .all 10 stations are not send data at the same time rather each
station has allotted a time and that time the station will transmit the data.
 The entire bandwidth is just one channel.
 Stations share the capacity of the channel in time.

 Not all data will transmitted at same time in the channel. The time is allotted
to each station and at that time station need to send data. The entire channel
will give to one station and it is completed then given to next station.

 Code Division Multiple Access (CDMA) :-

 One channel carries all transmissions simultaneously


 CDMA differs from FDMA, because only one channel occupies the entire
bandwidth of the link.
 It differs from TDMA because all stations can send data simultaneously,there
is no time sharing.
Example:-

 In the above diagram station 1, 2, 3 and 4 can generate the data like
d1,d2,d3 and d4.each station will having a code. C1 is the code for station1
and it is applied to on d1. Similarly C2 is the code for station 2 and it is
applied to on d2,
 C3 is the code for station3 and it is applied to on d3 and C4 is the code for
station 4 and it is applied to on d4.
 The common channel has carried all data like d1.c1+d2.c2+d3.c3+d4.c4.
Hence this is multiplexing. i .e multiple signals are converting to single
channel.

The receiver will use the code in order to retrieve the data. The assigned code
have two properties.
1. If we multiply each code by another we get 0
2. If we multiply each code by itself, we get 4 ( the no. of stations)

You might also like