Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
313 views

Collision Free Protocols

Uploaded by

Ali Ahammad
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
313 views

Collision Free Protocols

Uploaded by

Ali Ahammad
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 15

Collision – free

Protocols
Collision – free Protocols
• In computer networks, when more than one station tries to transmit
simultaneously via a shared channel, the transmitted data is garbled. This
event is called collision.

• The Medium Access Control (MAC) layer of the OSI model is responsible
for handling collision of frames.

• Collision – free protocols are developed so that collisions do not occur.


Protocols like CSMA/CD and CSMA/CA nullifies the possibility of
collisions once the transmission channel is acquired by any station.

• However, collision can still occur during the contention (transmission


free)period if more than one stations starts to transmit at the same time.

• Collision – free protocols resolves collision in the contention period and so


the possibilities of collisions are eliminated.
Types of Collision – free Protocols
• Bit – map Protocol
• Binary Countdown
• Limited Contention Protocols
• Adaptive Tree Walk Protocol
• Token based
Bit-map protocol
• Bit-map protocol is a collision free protocol that operates
in the Medium Access Control (MAC) layer of the OSI
model.
• It resolves any possibility of collisions while multiple
stations are looking for acquiring a shared channel for
transmission.

• In this protocol, if a station wishes to transmit, it


broadcasts itself(by sending a bit 1) before the actual
transmission. This is an example of Reservation Protocol.
How it works?
• In this protocol, the contention period ( free time between frame
transmissions) is divided into N slots, where N is the total number
of stations sharing the channel. If a station has a frame to send, it
sets the corresponding bit in the slot.

• Suppose that there are 8 stations. So the number of contention


slots will be 8. If the stations wish to transmit, they will set the
corresponding slots to 1 as shown in the following diagram

• Once each station announces itself, one of them gets the channel
based upon any agreed criteria.
• Generally, transmission is done in the order of the slot numbers.
Each station has complete knowledge whether every other station
wants to transmit or not, before transmission starts. So, all
possibilities of collisions are eliminated.
• This protocol works best under high loads. During high
loads,
• if all the stations want to transmit, the N bit contention
time is distributed over all the stations.
• So, the overhead is just 1 bit per frame. If d is the data
transmission time, the efficiency is .

• However, during low loads, if only 1 station has to


transmit, the contention time has to be allowed by only that
station. The overhead becomes N bits per frame. Here the
efficiency drops to.
Binary Countdown
• Binary countdown protocol is used to overcome the
overhead 1 bit per binary station.
• In a binary countdown protocol, each station is
assigned a binary address.
• The binary addresses are bit strings of equal lengths.
• When a station wants to transmit, it broadcasts its
address to all the stations in the channel, one bit at a
time starting with the highest order bit.
• In order to decide which station gets the channel
access, the addresses of the stations which are
broadcasted are OR-ed. The higher numbered station
gets the channel access.
Example
• Suppose that six stations contend for channel access which have the addresses:
1011, 0010, 0101, 1100, 1001 and 1101.

• The iterative steps are −


• All stations broadcast their most significant bit, i.e. 1, 0, 0, 1, 1, 1. Stations 0010
and 0101 sees 1 bit in other stations, and so they give up competing for the
channel.

• The stations 1011, 1100, 1001 and 1101 continue. They broadcast their next bit,
i.e. 0, 1, 0, 1. Stations 1011 and 1001 sees 1 bit in other stations, and so they give
up competing for the channel.

• The stations 1100 and 1101 continue. They broadcast their next bit, i.e. 0, 0. Since
both of them have same bit value, both of them broadcast their next bit.

• The stations 1100 and 1101 broadcast their least significant bit, i.e. 0 and 1. Since
station 1101 has 1 while the other 0, station 1101 gets the access to the channel.

• After station 1101 has completed frame transmission, or there is a time-out, the
next contention cycle starts.
The procedure is illustrated as follows −
Adaptive Tree Walk Protocol
• Adaptive Tree Walk Protocol is a technique for transmitting
data over shared channels that combines the advantages of
collision based protocols and collision free protocols.
• In adaptive tree walk protocol, the stations are partitioned
into groups in a hierarchical manner.
• The contention period is divided into discrete time slots,
and for each slot the contention rights of the stations are
limited.
• Under light loads, all the stations can participate for
contention each slot like ALOHA.
• However, under heavy loads, only a group can try for a
given slot.
Working Principle
• In adaptive tree walk protocol, the stations or nodes are arranged in the
form of a binary tree as shown in the diagram. Here, the internal nodes
(marked from 0 to 6) represent the groups while the leaf nodes (marked A
to H) are the stations contending for network access.
• Initially all nodes (A, B ……. G, H) are permitted to compete for the channel. If a node is
successful in acquiring the channel, it transmits its frame. In case of collision, the nodes are
divided into two groups −

– Stations under the group 1, i.e. A, B, C, D


– Stations under the group 2, i.e. E, F, G, H

• Nodes belonging to only one of them is permitted for competing. Say, for slot 1, all stations
under group 1 are allowed to contend. If one of the stations successfully acquires the channel,
then it transmits to completion. In the next slot, i.e. slot 2, all stations under group 2 can
contend.

• However, if there is a collision (for above step), then the stations are further divided into
groups as follows −

– Stations under the group 3, i.e. A, B


– Stations under the group 4, i.e. C, D
– Stations under the group 5, i.e. E, F
– Stations under the group 6, i.e. G, H

• In order to locate the contending stations, depth-first search algorithm is used. The same
principle of contention is applied, only for those groups that has some contending stations.
• The division continues if collisions occur, until each group contains only 1 node.
Token Passing Mechanism
• A token is a small message that circulates among the
stations of a computer network providing permission to
the stations for transmission.
• If a station has a frame to transmit when it receives a
token, it sends the frame and then passes the token to the
next station; otherwise it simply passes the token to the
next station.

• For token passing mechanism to operate, the stations


should be connected in a single ring as shown in the
following diagram −
• In the above configuration, passing the token comprise of
receiving the token from the preceding station and transmitting
to the successor station.
• The data flow is unidirectional in the direction of the token
passing.
• The token may be generated by the station that wants to send
the frame or the station that wants to receive the frame.
• In order that tokens are not circulated infinitely, they are
Limited Contention Protocols
• These protocols combines the advantages of
collision based protocols and collision free
protocols.
• Under light load, they behave like ALOHA
scheme.
• Under heavy load, they behave like bitmap
protocols.

You might also like