Register

Link state routing

2,648 views

4 Answers

4 votes
4 votes

TTL in LSP ensures that old LSP is eventually removed •

Creator of an LSP sets a maximum value of  (TTL) •

A node decrements ttl value of  the LSP while it is stored in the node •

When TTL reaches 0, the node deletes the LSP; it also floods the LSP with a TTL of 0, causing all nodes to delete that LSP..../////this is used to ensure that old information is removed from network...so that new information is may arrive...and also nodes have a limited buffer they cannot store every packet they receive due to flooding....after a while they have to delete that old lsp....it is also uesd to minimize the trafffic

• edited by
User Avatar
1 votes
1 votes

Answer: To ensure there is not Indefinite Looping of the packet within the network.

User Avatar
1 votes
1 votes
Not only TTL but also sequence number as well as packet life time is also added in the link state routing packet.Bcz ,Sometimes packet struck into infinite loop within the AS.TO solve such problem we simply use TTL bcz it reduces each time when it passes through router.For removing duplication we use sequence number feild.
User Avatar
0 votes
0 votes
The network adapter when picks up the frame it sees that TTL is 0 and discards the frame there itself, if there is no TTL filed in the frame then the frame with TTL 0 is also moved up to the high layers and the function of the upper layers is disturbed to prevent that TTL is used
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
3 answers
1
Gurdeep Saini asked Jan 2, 2019
1,671 views
Link state routing
True / False ) LSR uses dijkstra algorithm ? ) LSR working is similar to dijkstra algorithm ? ) DVR uses bellman algorithm for finding the shortest distance to other routers/hops?
True / False) LSR uses dijkstra algorithm ?) LSR working is similar to dijkstra algorithm ?) DVR uses bellman algorithm for finding the shortest distance to other routers...
User Avatar
0 votes
0 votes
0 answers
2
Parimal Paritosh asked Jul 2, 2018
987 views
Link State Routing
Why do we use Dijkstra algorithm in Link State Routing Protocol? I understand that it is essential to compute the shortest path to every other node, but is Dijkstra algorithm run for each system in the graph and does each node have its own Shortest Path Tree?
Why do we use Dijkstra algorithm in Link State Routing Protocol? I understand that it is essential to compute the shortest path to every other node, but is Dijkstra algor...
User Avatar
Link Copied!