![]() The distance vector of each of its neighbors, i.e., D v = for each neighbor v of x.ĭistance vector routing is an asynchronous algorithm in which node x sends the copy of its distance vector to all its neighbors.The distance vector x, i.e., D x =, containing its cost to all destinations, y, in N. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |