Network Routing Assignment Example | Topics and Well Written Essays - 2500 words

Network Routing - Assignment Example A working and configuration of a routing protocol shall also be elaborated. PROTOCOL: The protocol that is given for the completion of the task is Open Shortest Path First (OSPF). It falls in the category of link-state routing protocol. So we shall start with some information on what is link-state. LINK-STATE Link-state is a mechanism that follows the condition and connection type of every connected link and develops a metric calculation that is based on some factors that also included the factors that were set by the network engineers. The functionality of the link-state protocols is that it knows the status of the link, whether it is up or down and what is its bandwidth and calculates a cost to use that path. As we know that every router run routing protocols to find out the best path to the destination, one can consider the 'link-states' as representing the status of the interfaces on the router. (Davis, 2002) The functionality of a link-state protocol is this that it may take a p ath with more number of hops, but uses the medium that has higher bandwidth than all the other paths even with lowest number of hops. Due to the features of media type awareness and other factors, these protocols consume more processing power and memory. Link-state influences all the routers that structure up the complete topology of the whole internetwork (or of the position where router is presently located), this means that every router contains the same information of the topology. Due to this whenever a change is occurred it is broadcasted to the entire topology.  This method of routing is known as shortest path first. Protocols that work on link-state mechanism are OSPF, EGP and BGP mechanism. KEY-POIINTS: It uses Dijkstra algorithm for the calculation of shortest path. (Zhang, 2011) Every router in the network builds up the complete topology in its routing table, thus each router contains equal amount of information. It consumes space and memory more than distance vector. I t is suitable for implementing in large networks. DESIGN AND IMPLEMENTATION The design of this network implements the virtue connection International School of Networking has a Chelmsford HQ in England and two remote sites in Mexico and Malaysia. Communication within the routers is via Open Shortest Path First (OSPF) that has fast convergence and is able to meet the demands of a large organization. The routing protocol is configured on all of the routers specified in the topology diagram and advertises to every host connected in the topology except the loopback interface attached to Chelmsford HQ. NETWORK DESIGN BACKGROUND This report is for the demonstration of network design for an International School of Networking (ISN). ISN has branch campuses at Mexico City and Kuala Lumpur. These branches are connected with Chelmsford HQ and each other. Requirement for this implementation was of an open standard routing protocol with fast convergence and support routing update security. Open Shortest Path First (OSPF) is the best solution for given scenario and also for large scale businesses having offices at different locations. In this network design topology three routers are interconnected logically and each router is further directly connected with two more networks. OSPF routing protocol is configured within the logical network: network topology from the network design above both the physical and logical network topology can be obtained. Using the above topology an IP-addressing scheme was created to accommodate the all the