NETWORK ADMINISTRATIONSsnmp

CN | Flow Control Methods | CSMA/CD | Ravindrababu Ravula | Free GATE CS Classes

For Any Queries, You can contact RBR on LinkedIn: https://www.linkedin.com/in/ravindrababu-ravula/
Telegram: https://t.me/ravindrababu_ravula
Instagram: https://www.instagram.com/ravindrababu_ravula_rbr/

– For Full Computer Networks Playlist: https://www.youtube.com/playlist?list=PLEbnTDJUr_IegfoqO4iPnPYQui46QqT0j If you’re considering studying abroad, don’t forget to explore ‘Games of Visas,’ my dedicated consultancy service and YouTube channel designed to streamline the process of studying abroad.

For Study Abroad, contact “Game of Visas” at 9494555454 | Ravindrababu Ravula

source

by Ravindrababu Ravula

simple network management protocol

34 thoughts on “CN | Flow Control Methods | CSMA/CD | Ravindrababu Ravula | Free GATE CS Classes

  • hey! can anyone tell me that in case a station is checking if the link/medium is free or not and it is doing so by sending some dummy data/package? would that not corrupt the data if another station was sending data and for that station would that be considered a collision?
    Thanks in advance.

  • Is it compulsory to know the proof of efficiency in ETHERNET coming to GATE point of view?

  • Thank you so much. I have been referring your videos for my exams. It's helping me a lot to understand easily 🙂

  • Hello sir,
    You explained efficiency of CSMA/CD, Here In every collision we will waste Tt+2*Tp time but you added only 2*Tp for the contention because in every collision it will also waste Tt.

  • Carrier Sense means "Listen to the media, is another device transmitting? Yes = a carrier has been sensed, wait until transmission has finished. If the answer was NO, then transmit data". Devices do not transmit a carrier signal to test the media before transmitting data.

  • Sir i agree with the condition Tt>2Tp, but i have a doubt, you had said A will detect collision only when it is transmitting the packet so in this condition Tt<Tp if collision occurs by B then A think that packet is successfully transmitted…

  • God Bless you, Thank you so much for everything my lectures dont have any intuition behind things unlike yours which is full of it. This is exactly the way I wish everyone taught

  • Its Geometric distribution not Poisson and expected value of geometric distribution is 1/p

  • Tp – time taken for the last bit of the packet to reach the destination.
    Tt – time take for putting the packet into communication medium.

    Then, how Tt >= 2*Tp is possible. Because, unless the packet is completely transmitted, we can't send the last bit to the reciever.

  • sir Tp time is for transmitting the last bit of the packet to the destination. then why did you say "first bit" in the 3rd example where Tt>=2*Tp ??

  • Thank you Sir always search for your lecture whenever i get confused in books whether these are parsers or nertwork protocols .Thank you

  • Until you get the first head is geometrically distributed.

  • I remembered the song "Aaj exactly 10 am mera break up ho gaya" …jokes apart .. Awesome lecture you are god to us

  • Sir, suppose we have another station E after station D. when station A has completely transmitted the data but the last bit of data is still in the cable. Now station E senes that the carrier is free at its point of contact and sends data to station A. Now, if the last bit of data from A and data from E collides, how will the station A know that the collision has occurred?

  • Small doubt p=1/e. Means one successful transfer in e attempts. So no of collisions are e-1 .isn't my approach correct sir?.. an excellent video sir. A standing ovation by my side sir.

  • Useful time is t.t not t.t+tp why?? I mean why we are not considering propagation time also as useful time ?

  • love your work , <3 . But could you add more engsub on your videos . many thanks

  • The toll gate example is tooooooooooo gooooooood .
    Add this type of examples in every future videos .

  • Thank you..sir for this tutorials..can you please include the tutorials for each layers in iso/osi model design issues in Computer networks

  • why the vulnerable time in ALOHA depends on the frame transmission time (Tfr), but in CSMA it depends on frame propagation time (Tp)?

Comments are closed.