Network Convergance

[Chronictank]

I am probably just being dim, but when you are talking about network routing algorithms, more specifically Dijkstra (link state) vs Bellman-Ford (distance-vector) what does it mean when you say
"Distance vector suffers from slow convergance"

Thanks in advance

 

[Chronictank]

nr mind got the answer from a book

 

[DocWolfe]

lol I learnt all that shit at uni, but because I crammed so hard and got drunk so much I've forgotten it all within a year

 

[Chronictank]

lol I learnt all that shit at uni, but because I crammed so hard and got drunk so much I've forgotten it all within a year

tnx for the effort tho
All sorted now ^^

 

[Himse]

lol I learnt all that shit at uni, but because I rammed so hard and got drunk so much I've forgotten it all within a year

By men!?!

Gayer! :kissit:

 

[kirennia]

Bleh, had to make a program from scratch which implemented Dijkstra's algorithm and this is my bloody first year at uni User enters x amount of nodes, states a distance between each of them and after which, can enter any 2 nodes. The program would then have to find the shortest route between them. I got close but couldn't get the damn thing working in the end.

Anyway, wont hijack the thread, just thought I'd post my annoyances at Dijkstra and his damn algorithm. Damn it all to hell!

 

[Himse]

wtf at all this :<

 

[Congax]

wtf at all this :<

No worries Himse, one of these days the doctors will be able to get the crayon out of your brains.