Implementation of Graph Theory in Computer Networking To Find an Efficient Routing Algorithm | Abstract

ISSN ONLINE(2320-9801) PRINT (2320-9798)

Research Article Open Access

Implementation of Graph Theory in Computer Networking To Find an Efficient Routing Algorithm

Abstract

In a computer network, the transmission of data is based on the routing protocol which selects the best routes between any two nodes. Different types of routing protocols are applied to specific network environment as one routing protocol which seems to be efficient in one network seems to be inefficient in a different network especially when the number of nodes varies. RIP (Routing Information Protocol) is one of the oldest routing protocols still in service. Hop count is the metric that RIP uses and the hop limit limits the network size that RIP can support. OSPF (Open Shortest Path First) is the most widely used IGP (Interior Gateway Protocol) in large enterprise networks. EIGRP (Enhanced Interior Gateway Routing Protocol) is Cisco's proprietary routing protocol. This paper analyses which computer routing protocol performs the most efficiently. Each protocol is built around a single source shortest path algorithm. MATLAB was used to construct complex scenarios and determine which algorithms are best for graphs of variable lengths.

Mohd Nayeem Shah

To read the full article Download Full Article