Link-state routing protocol: Difference between revisions

Content deleted Content added
Undid revision 1025009377 by 223.235.103.48 (talk)
Citation bot (talk | contribs)
Alter: template type. Add: doi, pages, title, date, authors 1-5. Changed bare reference to CS1/2. Formatted dashes. | Use this bot. Report bugs. | Suggested by BrownHairedGirl | Linked from User:BrownHairedGirl/Articles_with_bare_links | #UCB_webform_linked 1513/2197
Line 15:
The technique was later adapted for use in the contemporary link-state routing protocols IS-IS and OSPF. Cisco literature refers to [[enhanced interior gateway routing protocol]] (EIGRP) as a "hybrid" protocol,{{cn|date=September 2016}} despite the fact it distributes routing tables instead of topology maps. However, it does synchronize routing tables at start up as OSPF does, and sends specific updates only when topology changes occur.
 
In 2004, [[Radia Perlman]] proposed using link-state routing for [[layer 2]] frame forwarding with devices called [[Routing Bridge|routing bridge]]s or Rbridges. The [[Internet Engineering Task Force]] has standardized the [[TRILL (Computer Networking)|transparent interconnection of lots of links]] (TRILL) protocol to accomplish this.<ref>{{citation |rfc=7176 |title=Transparent Interconnection of Lots of Links (TRILL) Use of IS-IS|date=May 2014|last1=Eastlake 3Rd|first1=Donald E.|last2=Senevirathne|first2=Tissa|last3=Ghanwani|first3=Anoop|last4=Dutt|first4=Dinesh|last5=Banerjee|first5=Ayan}}</ref>
 
More recently, this hierarchical technique was applied to [[wireless mesh network]]s using the [[optimized link state routing protocol]] (OLSR). Where a connection can have varying quality, the quality of a connection can be used to select better connections. This is used in some [[Ad hoc routing protocol list|routing protocols]] that use radio frequency transmission.
Line 76:
===Topology Reduction===
In some cases it is reasonable to reduce the number of nodes that generate LSA messages. For instance, a node that has only one connection to the network graph does not need to send LSA messages, as the information on its existence could be already included in the LSA message of its only neighbor. For this reason a topology reduction strategy can be applied, in which only a subset of the network nodes generate LSA messages. Two widely studied approaches for topology reduction are:
# [[Optimized_Link_State_Routing_Protocol#Multipoint_relays|MultiPoint Relays]] that are at the base of the [[Optimized_Link_State_Routing_Protocol|OLSR]] protocol but have also been proposed for OSPF<ref>{{Cite document|url=https://tools.ietf.org/html/rfc5449|title = OSPF Multipoint Relay (MPR) Extension for Ad Hoc Networks|date = February 2009|last1 = Nguyen|first1 = Dang-Quan|last2 = Clausen|first2 = Thomas H.|last3 = Jacquet|first3 = Philippe|last4 = Baccelli|first4 = Emmanuel}}</ref>
# [[Connected_dominating_set|Connected Dominating Sets]] that again have been proposed for OSPF<ref>{{Cite document|url=https://tools.ietf.org/html/rfc5614|title = Mobile Ad Hoc Network (MANET) Extension of OSPF Using Connected Dominating Set (CDS) Flooding|date = August 2009|last1 = Ogier|first1 = Richard|last2 = Spagnolo|first2 = Phil}}</ref>
 
===Fisheye State Routing===
Line 85:
If all the nodes are not working from exactly the same map, ''routing loops'' can form. These are situations in which, in the simplest form, two neighboring nodes each think the other is the best path to a given destination. Any packet headed to that destination arriving at either node will loop between the two, hence the name. Routing loops involving more than two nodes are also possible.
 
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==