Advance Computer network

Presentation
TABLE OF CONTENT
Access control Protocol

Types

Reservation

Polling

Token Access
CONTROLLED
ACCESS
PROTOCOL
• IN A CONTROLLED ACCESS PROTOCOL, ALL STATIONS LOOK
FOR INFORMATION FROM EACH OTHER. SO THAT THEY CAN
FIND THE STATION THAT HAS THE RIGHT TO TRANSMIT THE DATA
ON THE MEDIUM.

IN CONTROLLED ACCESS, THERE IS ONLY ONE NODE THAT IS

ALLOWED TO TRANSMIT DATA AT A TIME.

THIS MECHANISM LEADS TO THE AVOIDANCE OF COLLISION

PROBLEMS OF MESSAGES ON A MEDIUM.

CONTROLLED ACCESS PROTOCOL GRANTS PERMISSION TO

ONLY ONE NODE AT A TIME TO TRANSFER THE DATA. SO THAT
THERE IS NO PROBLEM OF COLLISION OF DATA ON THE
MEDIUM.
WITHOUT AUTHORIZATION FROM OTHER STATIONS, NO
STATION CAN TRANSFER THE DATA.
 TYPES
IN GENERAL, THERE ARE THREE
METHODS OF CONTROLLED
ACCESS PROTOCOL.

RESERVATION
POLLING
TOKEN PASSING
 Reservation
IN THIS METHOD OF CONTROLLED ACCESS
PROTOCOL, FIRST OF ALL, THE STATION IS
REQUIRED TO MAKE A RESERVATION, THEN ONLY
IT CAN TRANSMIT THE DATA ON THE SHARED
MEDIUM.
THERE ARE TWO TYPES OF PERIODS IN
THE TIMELINE
FIRST, THERE IS A FIXED TIME LENGTH IN THE
INTERVAL OF RESERVATION.
THE SECOND IS THE DATA TRANSMISSION PERIOD
OF THE VARIABLE FRAME THE INTERVAL OF THE
RESERVATION DEPENDS ON THE NUMBER OF
STATIONS ON THAT PARTICULAR MEDIUM.
 Explanation
• Suppose there are M stations, then the reservation interval is divided into an equal number
of M slots. There is one separate slot for each station.
• Suppose station 1 wants to transmit a frame to another station, then it can send only 1 bit
during slot1. During this period, no other station can transmit the data on the medium.
• Suppose the ith station wants to send a frame by adding one bit into the ith slot then after
checking all the N number of slots, each station will learn which station wants to transmit
the data.
• The station can transfer the frame according to the sequence in which they reserved the slot.
• If the transmission period expires then a new interval reservation starts.
• There is no chance of collision if the station agrees on the thought of which station is next
to transfer the frame.
 Example
Let us take an example, through which we learn how reservations work.
Suppose there are 5 stations and also 5 mini slot reservation frames. If in the
first interval, only the 2nd,3rd, and 5th stations are allowed to make the
reservation and then after that in the second interval only the second station is
allowed to make the reservation.
 Polling
• Generally, the polling method is used in those types of topology where one device is
served as a primary station and other devices are served as the secondary station.

• In this method, all data needs to be transmitted through the primary device even though
its final destination is the secondary device.

• The primary device is acting as an initiator and always controls the link.

• On the other hand, secondary devices must follow the instructions of the primary device.

• This is the responsibility of the primary device to decide which particular secondary
device is allowed to access the channel for how much time.

• Data frame transmission is done by the primary device and also contains the address of
the secondary device that has been chosen for granting access.

• All secondary devices can receive the data but the device that is addressed can only be
allowed to respond to that data and transmit data if has any to send.

• Otherwise, if there is no data to send then, it transmits a poll reject (NAK) frame to the
primary device.

• Thus to impose order on a network that is of independent users, and in order to establish
one station in the network that will act as a controller and periodically polls all other
stations is simply referred to as polling.
EFFICIENCY
Suppose the time for Polling is Tpoll and Tt will be
the time needed for the transferring of data.
Then,
Efficiency=Tt/Tt+Tpoll
 Polling function
• In case if primary devices want to receive the data, then it usually asks the secondary
devices if they have anything to send. This is commonly known as Poll Function.
• There is a poll function that is mainly used by the primary devices in order to solicit
transmissions from the secondary devices.
• When the primary device is ready to receive the data then it must ask(poll) each secondary
device in turn if it has anything to send.
• If the secondary device has data to transmit then it sends the data frame, otherwise, it sends
a negative acknowledgment (NAK).
• After that in case of the negative response, the primary then polls the next secondary, in the
same manner until it finds the one with the data to send. When the primary device received
a positive response that means (a data frame), then the primary devices reads the frame and
then returns an acknowledgment (ACK )frame,
 Select function
• In case, if the primary device wants to send the data then it tells the secondary devices in order
to get ready to receive the data. This is commonly known as the Select function.
• Thus the select function is used by the primary device when it has something to send.
• We had already told you that the primary device always controls the link.
• Before sending the data frame, a select (SEL ) frame is created and transmitted by the primary
device, and one field of the SEL frame includes the address of the intended secondary.
• The primary device alerts the secondary devices for the upcoming transmission and after that
wait for an acknowledgment (ACK) of the secondary devices.
 Advantages
• There are fixed and
predictable data rates and
the minimum and maximum
access time on the channel.
• To ensure faster access to
data from the secondary
device it used priority
assignment.
DISADVANTAGES
• The dependency on the
reliability of the controller is
high.
• In the condition of low load,
there is a decrement in the
data rate of the channel due to
the increment in turnaround
time.
• There is so much overhead of
polling messages.
 Token Passing
• All the stations present in a particular network are arranged in the form of a
logical ring in the token-passing method.
• there is always a predecessor and successor for each station in a medium.
• The station that is logically present before the station in the ring is known as
the predecessor station
• the station that is present after the station in the ring is known as
the successor station.
• The station that is currently using the channel is known as the current
station.
• There is a special bit pattern or a small message known as a token. It usually
passes in a predefined order from one station to another station.
• The station that has this token now has the right to access the channel and can also transmit
data present in its queue.
• Any station needs to wait for some time till it gets a token from its predecessor station if
wants to transfer any data.
• After this, the station receives a token and then holds it and have now the right to access the
channel and transfer its data.
• In the condition, when the station has nothing to transfer then it releases the token soon and
passes this token to the next logical station present in that particular ring.
• Although, the station can transfer the data again only when it has a token and it is possible
now in the second round only.
• Station simply passes the token to the next logical station if it has nothing to transfer at that
particular time.
 Problem
There is a problem of replication of token
or sometimes the loss of token in the
token passing method. The creation of a
new station or the deletion of the
existing station can be proved to be the
hurdle in performing the token passing
method properly and reliably.
 PERFORMANCE
• There are two parameters through which the performance of the token ring can be identified -
• Delay
• Throughput
Delay: Delay is considered as the measurement of time. Delay is the time difference between
when the data packet is ready to transfer and when it is transferred. Therefore, a/N is the
average time needed for sending a token to the next station.
Throughput: There is always some traffic on the network in which you transfer the data packet.
So the measure of successful traffic on the communication medium is known as throughput.
Throughput S= for a<1

here N = number of stations, a=Tt/Tp​,

Tp = propagation delay, Tt = transmission delay
 Advantages DISADVANTAGES

• It resolves the problem • Station had to wait for the

of the collision of data token even if no other
on a particular medium. computer wanted to
transmit the data.

• It allowed equal access

to resources to each • Required more expensive
connected station in a equipment for
particular network. complicated processes.