Content deleted Content added
Revi. lang |
ClumsyOwlet (talk | contribs) spam |
||
| (3 intermediate revisions by 2 users not shown) | |||
Line 24:
==History==
What is believed to be the first adaptive routing network of computers, using link-state routing, was designed and implemented during 1976–1977 by a team from [[Plessey Radar]] led by Bernard J Harris; the project was for "Wavell"{{snd}} a system of computer command and control for the [[British Army]].{{citation needed|date=September 2016}} The first link-state routing concept was published in 1979 by [[John M. McQuillan]] (then at [[Bolt, Beranek and Newman]]) as a mechanism that would calculate routes more quickly when network conditions changed and thus lead to more stable routing.<ref>[[John M. McQuillan]], Isaac Richer and Eric C. Rosen, ''ARPANet Routing Algorithm Improvements'', BBN Report No. 3803, Cambridge, April 1978</ref><ref>[[John M. McQuillan]], Isaac Richer and Eric C. Rosen, ''The New Routing Algorithm for the ARPANet'', [[IEEE]] Trans. on Comm., 28(5), pp. 711–719, 1980
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,<ref>{{Cite web |title=Cisco Firepower Threat Defense Configuration Guide for Firepower Device Manager, Version 7.1 - Enhanced Interior Gateway Routing Protocol (EIGRP) [Cisco Secure Firewall Threat Defense] |url=https://www.cisco.com/c/en/us/td/docs/security/firepower/710/fdm/fptd-fdm-config-guide-710/fptd-fdm-eigrp.html |access-date=2024-01-18 |website=Cisco |language=en}}</ref> 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.
Line 58:
===Topology reduction===
In some cases, it is reasonable to reduce the number of nodes that generate LSA messages. 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) but have also been proposed for OSPF<ref>{{Cite journal|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| doi=10.17487/RFC5449 |doi-access = free|url-access = subscription}}</ref> and [[connected dominating set]]s that were again proposed for OSPF.<ref>{{Cite journal|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| doi=10.17487/RFC5614 |url-access = subscription}}</ref>
===Fisheye State Routing===
With [[Fisheye State Routing]] (FSR), the LSA are sent with different time-to-live values to restrict their diffusion and limit the overhead due to control messages. The same concept is used also in the [[Hazy Sighted Link State Routing Protocol]].
| |||