................................................................................................................................................................................... Whereas the RIP is so simple by using DV algorithm, it also has some problems such as counting infinity, slow convergence, etc. The DV algorithm, depending on the relative path costs, can converge slowly and can have routing loops while the algorithm is converging. ( N routers; traffic=N2 , running of calculation =N3) DV also suffers from count to infinity problem (fig.1). Fig.1 count to infinity problem Now look at these phenomenons by running the RIP applet. ||Prev||Next|| (c) Marcos Andres Diaz & Yasuko Iwai Boston University, College of Engineering