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

Network Routing - Assignment Example In this algorithm, whenever a status of the link changes, a routing update is exchanged between the routers; this routing update is called a Link-State Advertisement (LSA).   When routers receive this LSA routing update they recalculate the shortest path using link-state protocols to affected destinations.   Link-state routing constantly tries to keep complete networks topology by updating its routing table whenever a status of any link is changed in the network. Every router builds a map of the full network topology. OSPF (Open Shortest Path First) is an example of Link State protocol.   Ã‚  Ã‚  Ã‚  Ã‚     Ã‚  Ã‚  Ã‚  Ã‚  In distance vector protocols, routers are updated about remote networks with the help of neighbouring routers using Bellman Ford algorithm. The distance part defines the total number of hops towards the destination, while in highly developed routing protocols these hops can be weighted by components such as delay and bandwidth available. The vector in distance-vector describes which hop to move as the next step along the direction (path) for this route. This routing information is passed on using neighbouring routers with routing table up to date by using update packets. The requirement here is to design a network for an International Travel Agency that has a HQ in London and its two remote branches in Paris and Rome. An open standard dynamic routing protocol is required for the communication between all the routers. Configuration of routing protocol on all the three sites must be as per the requirement advertisement of routes to all directly connected networks except the loopback interface attached to London HQ. Network design for an International Travel Agency (ITA) is demonstrated in this report. Head Office of the ITA located in London, United Kingdom, and it is connected with branch offices at Paris and Rome. The Headquarters are directly connected with both the branches while both