S> A routingprotocolSuch aSOSPF which permitS routerS to exchange information with one another about the reachability of other networkS and the coSt or metric to reach the other networkS. The coSt/metric iS baSed on number of hopS, link SpeedS, traffic congeStion, and other factorS aS determined by the network deSigner. Link State routerS uSe {DijkStra' S algorithm} to calculate ShorteSt (loweSt coSt) pathS, and normally update other routerS with whom they are connected only when their own routing tableS change. Link State routing iS an improvement over {diStance-vector routing} protocolSSuch aS {RIP} which normally uSe only a Single metric (Such aS hop count) and which exchange all of their table information with all other routerS on a regular Schedule. Link State routing normally requireS more proceSSing but leSS tranSmiSSion overhead. (2000-03-14)