Suppose that a positive lower bound is known for all link costs. Design a new link state algorithm which can add more than one node into the set N at each iteration. What are the major differences...

Suppose that a positive lower bound is known for all link costs. Design a new link state algorithm which can add more than one node into the set N at each iteration.

What are the major differences between link state routing and distance vector routing? What are the stability problems of distance vector algorithms, and what are the possible solutions to these problems?