00:08 Count to infinity problem occurs in distance vector routing 01:33 Neighbours send their distance vector to each other 02:54 The total cost of reaching the internet is two 04:11 Count to Infinity problem occurs when a link is broken and a node sets its cost to infinite. 05:29 Neighbours sending each other values as infinite 06:54 The count to infinity problem occurred due to incorrect routing information 08:10 Updates in Distance Vector Routing 09:23 Count to infinity problem occurs when nodes in a routing network keep increasing their cost indefinitely.
Thank you so much sir, you are doing such a noble job by teaching students who are in dire need of free GATE lectures. I hope your channel grows even further.
I don't usually comment on lectures but as a person who's cramming through computer networks.. this playlist is perfect to understand what's going on in particular topic. hat's off sir. would recommend
At 5:10. The link between internet and B is broken. So, B will send hello message, but it will not be acknowledged by internet as there is no link. This line is correct. But, at the same time B would have received the distance vector from A, which says A can take B to internet, with cost = 2 + 1 = 3. So now, B has only one link active, that connects B to A. Hence, B will have only one way to go to the internet, i.e., through A with a cost of 3. And it will update its distance. So, according to me: C - A - B - Internet: 3 - 2 - 1 (When stable) After B - Internet link is broken: C - A - B x Internet: 3 - 2 - 3 3 - 4 - 3 5 - 4 - 5 5 - 6 - 5 7 - 6 - 5 ..... All I want to say is, at 5:10 as you wrote infinity for B, that is incorrect. It should be 3. Please let me know if I'm thinking wrong.
From 9:10-9:25 why have you updated C and B values from 3 to 5? As value of A is 4 which is greater than B=3 and C=3 which is less distance. So why should B and C should update from 3 to 5 as the distance is taking more distance? Is it violation of DV property? I'm thinking that after updating the values to B=3 A=4 C=3 both B and C will check whether is there a possible route to internet with cost 3 and find out that it is not possible with cost=3 so that they update cost to infinite. So in next updation A will say it can take to internet with value of 4 to B and C so both B and C value will be updated to 5 and A will remain 4. At that time A also found it is not possible to go to internet with value 4 so it updates A to internet distance as infinite and takes values from B and C as 5 and A updates itself as 6. Am I thinking right?
@@upasonabiswas2367 C doesn't have a direct edge to internet... so after each cycle while updating the routing table, it checks which-which edge of C takes it to internet. And the minimum of all the costs is the value it updates the routing table with... it doesn't consider the previous routing table at all. So, previous value 3 is of no use... comparison will happen between the distance vector sent to C from it's neighbors ... and we can see that C has only one neighbor A... so if it sends 4, then C update the routing table with 4+1 !! Similar thing will happen with B too, as it has no more an edge with internet, so it will be dependent on distance vector sent by A(B's neighbor) .. and thus B will update the val with 5 too... In next cycle, Again A has no direct edge with internet, so it receives dist vector from B and C, both of them are 5, so A is updated with 6 !! Thus values will keep increasing step by step ... I hope it helps, if you still care about it !!
First time aapko beth k padate hue dekha😀 to khud hi samjh aaya ki recent video hai😂 great!!! Advance technology using!!! Thanks for nice series of CN🙏
If someone still wants to know the answer to this, this happens because a router takes the minimum of all the distance vectors that it received in a given pass, since in this case (for the node C) in each pass it received only 1 distance vector it doesn't have any other vector to compare with. Also when creating a new routing table we don't use the values from the old routing table. Hope this clears the doubt.
if we have more than one route to go then we should take minimum values among all the possible route. In 5th step, we know from A to internet cost is 2 and C to internet is 3 and B to internet is infintity. So A should take route with the minimum cost among all which is 2. As A can reach to internet in 2 cost then why while it go through the C.
I request you to please upload your beneficent tutorials on Digital Image processing.. I would be grateful to you. As I found your tutorial best among all. #respect
If you are looking for DAA playlist, please check out the channel for #complete #playlist of #Algorithm, #Database and #LinearAlgebra. Rest will be uploaded periodically.
Sir,in kurose book they said that a node will only share vectors if there is change in them, but here in 5th line we saw that A is also sending value simultaneously to B,but there is nochange in vector B.so which is right
Sir, one question please solve P------Q-------R--------S Initially link P------Q was down and all routers agree that P is unreachable, P-----Q becomes live again. X: number of exchanges by router P to stabilise its Distance vector. After reaching steady state, P-------Q link goes down again. Y: Number of exchanges need for all routers to conclude that P is unreachable What is X,Y
Sir Please start a python programming series logic building by explaining some programs from easy to tough Not on theory, many videos available on theories.. we can't build logics 🙏🙏
But in the video where you explained distance vector you clearly said that this process of sending neighbours and changing each matrix again and again happens only (v-1) means vertex - 1 times...then how can this reach to the infinity?
Count to infinite term not bcz of value goes to infinite, its terminology bcz of all connected routers in network will be updated one by one with wrong entry,so n/w will collapse,
Are Sir aap apne videos ke end mein suggested links daalte hain jo video ki aakhri 20 seconds aate hain woh nahi hai kya? Main toh aap hi ke lectures ko dekh kar apne saare University exams ko clear kar paya. Toh zara suggested videos ke screen ko aap add kar dijiye na please.
![[UNCUT] เก็บ "สจ.โต้ง" เอี่ยวมาเฟีย รู้ตัวคนบงการ ก่อนสั่งลั่นไก I คนดังนั่งเคลียร์ I 13 ธ.ค.67](http://i.ytimg.com/vi/o-J_p62D40w/mqdefault.jpg)
00:08 Count to infinity problem occurs in distance vector routing
01:33 Neighbours send their distance vector to each other
02:54 The total cost of reaching the internet is two
04:11 Count to Infinity problem occurs when a link is broken and a node sets its cost to infinite.
05:29 Neighbours sending each other values as infinite
06:54 The count to infinity problem occurred due to incorrect routing information
08:10 Updates in Distance Vector Routing
09:23 Count to infinity problem occurs when nodes in a routing network keep increasing their cost indefinitely.
Thank you so much sir, you are doing such a noble job by teaching students who are in dire need of free GATE lectures. I hope your channel grows even further.
It really takes a lot of hard work to teach ALL CS SUBJECTS with this level of dedication! Thank you sir.
I don't usually comment on lectures but as a person who's cramming through computer networks.. this playlist is perfect to understand what's going on in particular topic. hat's off sir. would recommend
most confusing topic but repeatedly dekhne ke baad samaj aa he gaya. Thank you sir
At 5:10.
The link between internet and B is broken. So, B will send hello message, but it will not be acknowledged by internet as there is no link. This line is correct. But, at the same time B would have received the distance vector from A, which says A can take B to internet, with cost = 2 + 1 = 3.
So now, B has only one link active, that connects B to A. Hence, B will have only one way to go to the internet, i.e., through A with a cost of 3. And it will update its distance.
So, according to me:
C - A - B - Internet:
3 - 2 - 1 (When stable)
After B - Internet link is broken:
C - A - B x Internet:
3 - 2 - 3
3 - 4 - 3
5 - 4 - 5
5 - 6 - 5
7 - 6 - 5
.....
All I want to say is, at 5:10 as you wrote infinity for B, that is incorrect. It should be 3.
Please let me know if I'm thinking wrong.
Our whole class including our. Teacher is watching ur video's for complete reference...!
You are from which clg??
😂
@@sakshidherange7554 he is from IIT Bombay
How you know
@@sakshidherange7554 he is kidding
From 9:10-9:25 why have you updated C and B values from 3 to 5? As value of A is 4 which is greater than B=3 and C=3 which is less distance. So why should B and C should update from 3 to 5 as the distance is taking more distance? Is it violation of DV property? I'm thinking that after updating the values to B=3 A=4 C=3 both B and C will check whether is there a possible route to internet with cost 3 and find out that it is not possible with cost=3 so that they update cost to infinite. So in next updation A will say it can take to internet with value of 4 to B and C so both B and C value will be updated to 5 and A will remain 4. At that time A also found it is not possible to go to internet with value 4 so it updates A to internet distance as infinite and takes values from B and C as 5 and A updates itself as 6. Am I thinking right?
I was also thinking that why he updated the value to 5.. did you find any answer?
@@upasonabiswas2367 C doesn't have a direct edge to internet... so after each cycle while updating the routing table, it checks which-which edge of C takes it to internet. And the minimum of all the costs is the value it updates the routing table with... it doesn't consider the previous routing table at all. So, previous value 3 is of no use... comparison will happen between the distance vector sent to C from it's neighbors ... and we can see that C has only one neighbor A... so if it sends 4, then C update the routing table with 4+1 !!
Similar thing will happen with B too, as it has no more an edge with internet, so it will be dependent on distance vector sent by A(B's neighbor) .. and thus B will update the val with 5 too...
In next cycle, Again A has no direct edge with internet, so it receives dist vector from B and C, both of them are 5, so A is updated with 6 !!
Thus values will keep increasing step by step ...
I hope it helps, if you still care about it !!
@@priyam_vd thank you so much! this was very clear to understand!
@@priyam_vd thank you
thanks sir, this was my big doubt.. thanks for clearing
Wo sab thik hai lekin exam me likhenge kha A ne B ko bheja B ne C ko🙂
Bhai yrr tu bhi. 😆😆😆😆
😂😂😂😂😂😂
Theory gpt karlo smaj to aa hi gaya 😅
You're explaining very well and by a very easy method sir , thank you
This is what I was actually in need of ur great...!
Thank you sir for making my understand and making my concept crystal clear ☺️
great effort ...that much simplified
superb explanation! thank you sir!
From Bangladesh,
Thank you so much
You r doing great service Sir...God Bless u🙏🙏🙏
First time aapko beth k padate hue dekha😀 to khud hi samjh aaya ki recent video hai😂 great!!! Advance technology using!!! Thanks for nice series of CN🙏
Very well explained sir.thank you
thnx sir your method is so best and easy to understand thnx from pak
Thank you very much, sir! I hadn't understood this in my college lecture but not because of you I did. Thank you!
Great... Very well explained sir.. Waiting for next numerical video on this. 👍
Ur explaination is great 😊
Thanks 👍 Sir Easy and Nice Explanation
Awsum welldone keep it up!
Hope you reach 1 million soon👍
why does it update 5 over 3 as it always takes minimum value
If someone still wants to know the answer to this, this happens because a router takes the minimum of all the distance vectors that it received in a given pass, since in this case (for the node C) in each pass it received only 1 distance vector it doesn't have any other vector to compare with. Also when creating a new routing table we don't use the values from the old routing table. Hope this clears the doubt.
@@siddharthkataria4945 thanks bro i also had the same doubt
@@siddharthkataria4945 Thanks , I have also the same doubt luckily I found my solution 😁
Greatly appreciated
Thanks alot for good explanation
Thanks sir,bahut simple kar deya aapne🙏
if we have more than one route to go then we should take minimum values among all the possible route. In 5th step, we know from A to internet cost is 2 and C to internet is 3 and B to internet is infintity. So A should take route with the minimum cost among all which is 2. As A can reach to internet in 2 cost then why while it go through the C.
Thanks sir great explanation 🙏🏻😊
Sir ur manual white board videos are more effective, kindly keep that simple way if easy
Yes sir....
😁😁😁😁 ye ek dusre ke secre chupa raha h...but I understand it easy way thanks.
Bhaiya sahi samjaya 🙌
Sir you are my favourite teacher
Sir thanks a ton for such crystal clear explanations❤❤
Thanks a lot Sir!!
Very nice
This is how politicians work 😂
Nicely explained 😊💟
Thanks you dear sir ❤️
I request you to please upload your beneficent tutorials on Digital Image processing.. I would be grateful to you. As I found your tutorial best among all.
#respect
we can make a bollywood drama movie using the same concept 💀💀🤣🤣🤣🤣
Thank you ❤
Sir, It's a small request that please make more videos on DAA!!
If you are looking for DAA playlist, please check out the channel for #complete #playlist of #Algorithm, #Database and #LinearAlgebra. Rest will be uploaded periodically.
Great teacher ❤
Sir,in kurose book they said that a node will only share vectors if there is change in them, but here in 5th line we saw that A is also sending value simultaneously to B,but there is nochange in vector B.so which is right
Sir, one question please solve
P------Q-------R--------S
Initially link P------Q was down and all routers agree that P is unreachable, P-----Q becomes live again.
X: number of exchanges by router P to stabilise its Distance vector.
After reaching steady state, P-------Q link goes down again.
Y: Number of exchanges need for all routers to conclude that P is unreachable
What is X,Y
Beautiful❤
Sir syllabus to change ho gya gate 2021 CN ka to ek video bna do ki is playlist m se Kya Kya padhna h
Thank you sir
ok
Sir, as the syllabus has changed, please make a video on which videos to watch from the playlist.
Lifesaver💜💚💙
Thank you
Is it possible to get English subtitles for this? Would very much be appreciated as the video itself seems useful and informative. Thanks!
I believe neso academy teaches in English so you can check out that channel
Yeah as mentioned by the other guy as well, there is another great channel named "Neso Academy". They teach in English so you can check them out.
kis kis ka kal exam hai haath uthao
I wish my college faculty of cn taught like this
maja agaya
Iski topi uske sir 😂
Sir
Please start a python programming series logic building by explaining some programs from easy to tough
Not on theory, many videos available on theories..
we can't build logics 🙏🙏
But in the video where you explained distance vector you clearly said that this process of sending neighbours and changing each matrix again and again happens only (v-1) means vertex - 1 times...then how can this reach to the infinity?
glad i was forced to learn hindi when i was younger
Solve previous year gate tough question please.
Gate cse 2011 question on DVR
easy hai
@@vishalcseiitghy tere lia easy hoga
@@sagarmehla3781 email ID dey solution send karta hu
thank u
Love u sir
sir agar shortest path choose krega node..... to fr 9:05 pe usne 3 se 5 kyu kiyaa......?
sir ap theory of automata k lectures mazeed share kara plz
🎉🎉🎉🎉
Sir❤
Count to infinite term not bcz of value goes to infinite,
its terminology bcz of all connected routers in network will be updated one by one with wrong entry,so n/w will collapse,
❤❤❤
Meanwhile internet:- Why the heck I'm here??
Are Sir aap apne videos ke end mein suggested links daalte hain jo video ki aakhri 20 seconds aate hain woh nahi hai kya? Main toh aap hi ke lectures ko dekh kar apne saare University exams ko clear kar paya. Toh zara suggested videos ke screen ko aap add kar dijiye na please.
please confirm when a is sending cost of 4 then then b and c will not update their table because they have the cost of 3 with them
which is less
Sir g please aap simple bord per Khade hokar padhaya Karo g please .... Woh real Lagta h
count to infinity problem is nothimg but misunderstandings between the routers.....
And they say router is intelligent device!!!!
❤️
Ispe question wali video kab ayegi
meanwhile A to b and c , ye saare humko pagal bna re hai but mujhe to ye malum hi nhi tha
sir why the a1 accept t the cost of b1 after disconnection when the value of b2 is 4 which is greater than a1(3) value i am confused on that
Node A aur B ka bahut bada chutiya kat raha 😂️😂️😂️
🤣🤣🤣🤣🤣
Our teacher explains same examples of yours
uncle ko puchi...
Very funny problem 🤣🤣
A B, B A, A B 😂, confused in middle a bit but yeah good explain..
please explain in english all can understand
Pillay❤
If possible...try to do all videos is English....
Wo pehle se 3 hai toh q update hoga
i am actually laughing at this thing
So B was imposter here. CALL MEETING!
Ye Kya chutiyapanti h yrrrr😂😂😂😂😂 m to ghum gya
Yeh kya majak hai 😂😂
Sir kisse ladai hogai apki, akh suji hui hai
Try to do all videos in English
Your title is in english, why isn't your video?
If you're making a video in your own language please give it a title in your own native language so people don't waste their time.