204 views

A) LSP Packets contains information of the network.

B) LSP Packets are forwarded using flooding algorithm.

C) Routers in the network converted into tree before forwarding LSP Packet.

D) All of the above.

D is the answer here. and  I doubt how is the C option is correct? and also A is correct but partially according to me as each LSP packet contains distances only not all network information such as topology etc.

explain pls.
| 204 views
0
LSR is based on Global knowledge  because we apply  dijkstra in LSR

Unlike distance vector in which it sends it's distance vector to its  neighbour only , In link state Routing it just flod the information packet to every others Routers

I'm not sure but we find Dijkstra’s Shortest Path Tree   therefore I think it also implies the option C

what you think ??
0
B) is correct

but what A) is telling ? Is it contain all information about destination network?
0
Yeah LSR is based on Global knowledge
0

@srestha i'm also having the same doubt.

0

a) is wrong

b) Each router transmits a Link State Packet (LSP) on all links ..Keep a copy locally and don't forward previously-seen LSPs.    true

c)  we know that a LSP can reach to any router many times and we discard the previously seen LSP .(we know this thing already )   .so now suppose if it have already made the spanning tree then how a LSP can come many times on any router

so the given statement is false

moreover ethernet make spanning tree just after making connection

by Boss (10.6k points)

All True

1) Yes, LSP packets contains information of the network.

because each node's LSP packet describes their portion of topology and by combining all LSP packets we get the network topology information.

and along with this each node then knows the whole network topology after combining.

note : here they said "LSP packets" not single packet.

2) True,

We use flooding as a forwarding technique because in our network we have different routers that may be using different topologies so while routing, these different topologies may create inconsistencies, loops or other problems.

This is the reason we use flooding.

3) Yes, they are converted into Tree using Djiktra's algo

because link state routing runs using Djiktra's algo(mainly) and to make routing tables of nodes we have to find the source tree using Djiktra's algorithm.

For each node we made source tree from Djiktra algo and them made routing table for that node. This way we made Routing table of every node using source trees.

Example for pt 3

by Junior (529 points)
edited
0

Supporting Image regarding the LSP packets data

It consists identity of the sender, followed by a sequence number and age (used to avoid failure of segment number), a list of neighbors and Cost of each neighbor.

0

Note: We use flooding as a forwarding technique because in our network we have different routers that may be using different topologies so while routing, these different topologies may create inconsistencies, loops or other problems.

This is the reason we use flooding.