I am doing master in TUM for communication engineering, this was way more clear then the lecture thanks :D i looked over the slides again and again but couldnt relate how 1 persistent differs from non-persistant except the behavior after collision.
1-persistent - while(!idle) { //keeps on sensing } //sends its data Non-persistent - while(!idle) { //senses time = random() wait(time) } //Sends its data
You said that, In O- persistent CSMA( sub part of Random access protocol), supervisory node decides the order of transmission. Whereas in Random access protocol u said there is no superior node, every node is equal. Can you please explain how this is possible?
You didn't explain p-persistent properly, especially the concept of probability.the probability is calculated randomly and has no relationship with time slots.
Correct me if I am wrong: I think P-Persistant means, after checking that the channel is free it checks if the current time slot allocated to the receiver station it wants to send a frame to. Then it only sends the frame with a certain probability. This is necessary because, if another sender has queued messages for this receiver and both senders would send their frames with a probability of 1 it would always lead to collisions. With a probability < 1 there is a chance to work off the transmission queues slowly.
The first carrier sense protocol that we will study here is called 1-persistent CSMA (Carrier Sense Multiple Access). When a station has data to send, it first listens to the channel to see if anyone else is transmitting at that moment. If the channel is busy, the station waits until it becomes idle. When the station detects an idle channel, it transmits a frame. If a collision occurs, the station waits a random amount of time and starts all over again. The protocol is called 1-persistent because the station transmits with a probability of 1 when it finds the channel idle. A second carrier sense protocol is nonpersistent CSMA. In this protocol, a conscious attempt is made to be less greedy than in the previous one. Before sending, a station senses the channel. If no one else is sending, the station begins doing so itself. However, if the channel is already in use, the station does not continually sense it for the purpose of seizing it immediately upon detecting the end of the previous transmission. Instead, it waits a random period of time and then repeats the algorithm. Consequently, this algorithm leads to better channel utilization but longer delays than 1-persistent CSMA. The last protocol is p-persistent CSMA. It applies to slotted channels and works as follows. When a station becomes ready to send, it senses the channel. If it is idle, it transmits with a probability p. With a probability q = 1 - p, it defers until the next slot. If that slot is also idle, it either transmits or defers again, with probabilities p and q. This process is repeated until either the frame has been transmitted or another station has begun transmitting. In the latter case, the unlucky station acts as if there had been a collision (i.e., it waits a random time and starts again). If the station initially senses the channel busy, it waits until the next slot and applies the above algorithm.
Thankyou dear for the great work, I had a doubt, CSMA/CD is used by Ethernet. Ethernet is end to end, like between two nodes. It has different channel for transmission and receiption, I hope. Then how could a collision occur. Can't understand, correct me if I am wrong. Tell me what I am missing.
@@mohansurendar7429 different applications connecting same point is a bigger picture, my doubt is about node-to-node connection, where single Ethernet cable is connected.
A specified time might be assigned to multiple nodes, and another node might use the channel in that time slot so it is a good idea to sense the carrier before transmitting the data.
In p persistent csma it should be checking for two things. One is is it in the beginning of the time slot, and also check whether the channel is free. It is checking continuously right? Why can’t you send it the second time slot instead of sending at the beginning of the fourth time slot, I’m asking with respect to the picture 11:51
Sir please complete the full syllabus of computer networks ( network layer design issues) and other transport layer , session layer , presentation layer , application layer 🎉)
Hi Neso academy, just want to know how many of your viewers are from India? Great work!
all CS students watch neso
Hi abhiram sir big fan !
Almost
Bhai ye Indian channel hi h
@@bhanushah9849ECE students also
You are teaching very well because you are telling problem statement and teaching in Laman
language
I have never seen this type of clear explanation ever.. Great job 👏 👍
best educational channel ever. good job legends
U are one who saves my life thank you 🙏💕
Tks a lot. Very well explained☺️
I am doing master in TUM for communication engineering, this was way more clear then the lecture thanks :D i looked over the slides again and again but couldnt relate how 1 persistent differs from non-persistant except the behavior after collision.
1-persistent -
while(!idle) {
//keeps on sensing
}
//sends its data
Non-persistent -
while(!idle) {
//senses
time = random()
wait(time)
}
//Sends its data
GRVNS Student, same here
Clear and superb explanation
Best Explanation in the world!
Explained very well sir nn
You said that, In O- persistent CSMA( sub part of Random access protocol), supervisory node decides the order of transmission. Whereas in Random access protocol u said there is no superior node, every node is equal. Can you please explain how this is possible?
Same doubt 😕
my teacher does not respond to any doubts, but makes sure to like all those "best explanation in the world" comment😀🤑
Very great explanation!
Thank you!
mazaaa aagya 🥰🙂
Very helpful!
You didn't explain p-persistent properly, especially the concept of probability.the probability is calculated randomly and has no relationship with time slots.
Correct me if I am wrong: I think P-Persistant means, after checking that the channel is free it checks if the current time slot allocated to the receiver station it wants to send a frame to. Then it only sends the frame with a certain probability. This is necessary because, if another sender has queued messages for this receiver and both senders would send their frames with a probability of 1 it would always lead to collisions. With a probability < 1 there is a chance to work off the transmission queues slowly.
@@felixreibold8891 which country u all are from ?
Thank you ❤🌹
The first carrier sense protocol that we will study here is called 1-persistent CSMA (Carrier
Sense Multiple Access). When a station has data to send, it first listens to the channel to see if
anyone else is transmitting at that moment. If the channel is busy, the station waits until it
becomes idle. When the station detects an idle channel, it transmits a frame. If a collision
occurs, the station waits a random amount of time and starts all over again. The protocol is
called 1-persistent because the station transmits with a probability of 1 when it finds the
channel idle. A second carrier sense protocol is nonpersistent CSMA. In this protocol, a conscious attempt
is made to be less greedy than in the previous one. Before sending, a station senses the
channel. If no one else is sending, the station begins doing so itself. However, if the channel is
already in use, the station does not continually sense it for the purpose of seizing it
immediately upon detecting the end of the previous transmission. Instead, it waits a random
period of time and then repeats the algorithm. Consequently, this algorithm leads to better
channel utilization but longer delays than 1-persistent CSMA.
The last protocol is p-persistent CSMA. It applies to slotted channels and works as follows.
When a station becomes ready to send, it senses the channel. If it is idle, it transmits with a
probability p. With a probability q = 1 - p, it defers until the next slot. If that slot is also idle, it
either transmits or defers again, with probabilities p and q. This process is repeated until either
the frame has been transmitted or another station has begun transmitting. In the latter case,
the unlucky station acts as if there had been a collision (i.e., it waits a random time and starts
again). If the station initially senses the channel busy, it waits until the next slot and applies
the above algorithm.
Svaka cast brate moj
Hello, Is the O Persistent continuously checking or randomly checking ?
Quite helpful
Thankyou dear for the great work, I had a doubt, CSMA/CD is used by Ethernet. Ethernet is end to end, like between two nodes. It has different channel for transmission and receiption, I hope. Then how could a collision occur. Can't understand, correct me if I am wrong. Tell me what I am missing.
sorry I don't Know whether it is correct or not, I think we use different applications(stations) to get data from same point(channel)
@@mohansurendar7429 different applications connecting same point is a bigger picture, my doubt is about node-to-node connection, where single Ethernet cable is connected.
An ethernet cable can be used in a bus topology as the backbone cable, so there will be collisions.
What is the limit of that random time exactly ? I mean is it possible to take 1 day or more ? or is it depends
Why does P persistent CSMA needs to sense the carries if it has specific time slots?
A specified time might be assigned to multiple nodes, and another node might use the channel in that time slot so it is a good idea to sense the carrier before transmitting the data.
Superb love from Pakistan
Thank You Sir!!
11:50 didn't get the point?
Time period appointed for each station,,, so other stations wait for their time.
In p persistent csma it should be checking for two things. One is is it in the beginning of the time slot, and also check whether the channel is free. It is checking continuously right? Why can’t you send it the second time slot instead of sending at the beginning of the fourth time slot, I’m asking with respect to the picture 11:51
Sir ig the channel utilisation in case of non persistent is much lesser than 1persistant csma
Sir you said that collision occurs in csma but cant the node sense the channel
Suggest a book that contains all the topics you have covered
??? If any then comment
Computer networks A top to down approach
Well said
Are they referring the station as node or a station has many nodes?
station as node
Which book are you using for reference?
According to me------Data Communications and Networking by forouzan
Data Communication and Networking by Behrouz Forouzan
It's Google Chrome!!!
Super sir
Plsss make little more easy notes😥...its more bulky #onourhead..
Less points ...Bt need main point
What is Q?
Thank u
Jay gurudev!
I LOVE YOU
is anyone else having trouble viewing this particular video on their website ?
Thank you for pointing this. The issue is now resolved.
Sir please complete the full syllabus of computer networks ( network layer design issues) and other transport layer , session layer , presentation layer , application layer 🎉)
The best
5:00
Hall Scott Williams George Anderson Jose
your voice is very cute
Tw Hedhi Hayeét?
2.53 explained wrong
shad medium
Hi
fourozon
Ycce gang wya
Gud
🙂
are you gay?
Please speak in hindi.
It will not help us 😂
@@ibrahimibnmahmoud4756 why ?
👌👌👌🤌🤌🤌💯💯💯💯💯