LS uses Dijkstra’s algorithm to compute the shortest paths
查看答案
Each router should generate a Link State Packet and share it with its neighbers.
A special ECHO packet is used to discover a router's neighbors
LS algorithm requires a router to discover the neighbors first.
DV is suitable for large scale networks.
微信支付 
支付宝支付