شبکههای کامپیوتری/مسیریابی: تفاوت میان نسخهها
محتوای حذفشده محتوای افزودهشده
بدون خلاصۀ ویرایش |
added Category:شبکههای کامپیوتری با استفاده از ردهساز |
||
خط ۳۱۳:
This process loops until all nodes find out that the weight of link to D is infinity. In this way, experts say that distance vector algorithms have a slow convergence rate. In conclusion, distance vector algorithm is not robust. One way to solve this problem is for routers to send information only to the neighbors that are not exclusive links to the destination. For example, in this case, B should not send any information to C about D, because C is the only way to D.
[[رده:شبکههای کامپیوتری]]
|