I thought of reading the in depth comparison of RIP and OSPF protocol.
RIP : Count to infinity problem, slow convergence, O(M*N) complexity where M is edges and N is number of nodes
To solve count to infinity approaches are hold down, split horizon but still there are other issues like no sub net masking support. All nodes in the network should use the same sub net mask, some frame related issues... Network size should be small .. Hope count is just 15 ... moreover packets between neighbors are exchanged every 30 seconds...
OSPF: Intelligent routing with improved alternative to RIP. Link state, Main problem is flooding in the network for sending updates but by using proper sub net masking support and carefully fine tuning the parameter, this can be bettered.
Full comparison is present on this site so please look here....
http://www.networkcomputing.com/unixworld/feature/002.html?cid=ref-true
SJ
No comments:
Post a Comment