
Summary: Cisco's proprietary routing protocol, EIGRP (Enhanced Interior Gateway Routing Protocol) is one of the two most widely employed routing protocols in the Internet. The underlying algorithm is reputed to be optimal with respect to the EIGRP metric. We construct a counterexample to illustrate that it is not optimal. We implemented the test network from the counterexample in our Networking Lab and it was confirmed that the Cisco routers did not find optimal routes. We suggest ways in which the EIGRP algorithm can be improved. These suggestions would also improve the operation of the Diffusing Updating Algorithm, the portion of EIGRP used to recover from link/node failures.
dynamic programming, Discrete location and assignment, Communication networks in operations research, communication networks, Network protocols, Dynamic programming, routing protocols, routing algorithms, Cisco networking
dynamic programming, Discrete location and assignment, Communication networks in operations research, communication networks, Network protocols, Dynamic programming, routing protocols, routing algorithms, Cisco networking
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
