什么意思Each node i periodically broadcasts the weights of all edges (i,j) incident on it (this is the link state) to all its neighbors. Each link state packet (LSP) has a sequence number seq. The mechanism for dissemination is flooding. This helps each node eventually compute the topology of the network, and independently determine the shortest path to any destination node using some standard graph algorithm like Dijkstra’s.

这段描述是指链路状态路由协议(Link State Routing Protocol)，其工作方式是每个节点周期性地向所有邻居节点广播其相邻链路的状态信息，包括链路权重和序列号。这些状态信息被称为链路状态分组(LSP)。这种广播机制被称为泛洪(flooding)。通过收集邻居节点广播的LSP，每个节点可以计算出网络的拓扑结构，并使用一些标准图算法（如Dijkstra算法）独立地确定到任何目标节点的最短路径。