链路状态算法（也称最短路径算法）发送路由信息到互联网上所有的结点，然而对于每个路由器，仅发送它的路由表中描述了其自身链路状态的那一部分,其算法思想是每一个路由算法必须完成以下的工作，发现它的邻居节点，并知道其网络地址，测量到各邻居节点的延迟或者开销，构造一个分组，分组中包含所有它刚刚知道的信息，将这个分组发送给所有其他的路由器，计算出到每一个其他路由器的最短路径-Link state algorithm (also known as the shortest path algorithm) to send routing information to the Internet on all nodes, but for each router, it only sends the routing table describing its link state that part, its algorithm is a routing algorithm is required to complete the following work, found its neighbor nodes, and know the network address, measuring to the neighbor node delay or overhead, constructs a packet, packet contains all the information it had just know, the packet is sent to all other routers, calculated to every other router shortest path