hard20 pts · first answer countsgraphsshortest-pathbellman-ford
Routers slowly counting up
In distance-vector routing, which works like distributed Bellman-Ford, a link fails and two routers keep raising their distance to a lost network by one each round. What is this called, and what helps?
Discussion 0
Join free to post in the discussion.
Related questions
- Edges in a tree with n nodesBackend Developer
- Most nodes in a binary tree of height 3Backend Developer
- What inorder traversal of a BST givesBackend Developer
- Preorder output of a small treeBackend Developer
- Traversal for freeing a whole treeBackend Developer
- Data structure for level-order traversalBackend Developer
- BST search time, typical and worstBackend Developer
- Leaves in a full binary treeBackend Developer