Link-state routing protocol: Difference between revisions

Revision as of 14:25, 31 May 2022

Revision as of 21:12, 1 June 2022

Line 89:

This can occur since each node computes its shortest-path tree and its routing table without interacting in any way with any other nodes. If two nodes start with different maps, it is possible to have scenarios in which routing loops are created. In certain circumstances, differential loops may be enabled within a multi cloud environment. Variable access nodes across the interface protocol may also bypass the simultaneous access node problem.<ref>{{cite journal |last1=Wójcik |first1=R |title=A survey on methods to provide interdomain multipath transmissions |journal=Computer Networks |date=2016 |volume=108|pages=233–259 |doi=10.1016/j.comnet.2016.08.028 }}</ref>

==The Optimized Link State Routing Protocol for mobile ad hoc networks==

The ''[[Optimized Link State Routing Protocol]]'' (OLSR) is a link-state routing protocol optimized for [[mobile ad hoc network]]s (which can also be used on other [[wireless ad hoc network]]s).<ref>RFC 3626</ref> OLSR is proactive, itand uses Hellohello and Topologytopology Controlcontrol (TC) messages to discover and disseminate link -state information into the [[mobile ad hoc network]]. Using Hellohello messages, each node discovers 2two-hop neighbor information and elects a set of ''[[multipoint relay]]s'' (MPRs). MPRs makesmake OLSR uniquedistinct from other link -state routing protocols. Individual nodes use the topology information to compute next -hop paths regard toregarding all nodes in the network using shortest -hop forwarding paths.

==See also==