Hop Count in EIGRP Metric

Ristov, Sashko (2010) Hop Count in EIGRP Metric. In: Proceedings of the Seventh Conference on Informatics and Information Technology. Institute of Informatics, Faculty of Natural Sciences and Mathematics, Ss. Cyril and Methodius University in Skopje, Macedonia, Skopje, Macedonia, pp. 35-36. ISBN 978-9989-668-88-3

[img]
Preview
Text
978-9989-668-88-3_pp35-36.pdf

Download (175kB) | Preview
Official URL: http://ciit.finki.ukim.mk

Abstract

In a properly designed network, it is expected that multiple routes between any two destinations do exist. If one route becomes unavailable, the traffic flow must continue, without interruptions if possible, through a backup route installed immediately. This paper offers the way to test the influence of RIP protocol and its hop count metric onto EIGRP Protocol, in order to include hop count into EIGRP metric. One solution to this issue, implemented in the EIGRP routing protocol, is to store in each router its neighbour's routing tables. Then, when a route disappears from the routing table, the router will simply install a new route from the stored information. If a route is not found locally, the router will start time consuming diffusing computations to discover alternative routes.

Item Type: Book Section
Subjects: International Conference on Informatics and Information Technologies > Computer architectures
International Conference on Informatics and Information Technologies > Computer networks
International Conference on Informatics and Information Technologies > GRID Computing
Depositing User: Vangel Ajanovski
Date Deposited: 28 Oct 2016 00:15
Last Modified: 03 May 2018 09:18
URI: http://eprints.finki.ukim.mk/id/eprint/11271

Actions (login required)

View Item View Item