[Abstract]
The purpose of this document is to explain different routing protocols by using them within a scenario of being charged to reconfigure a company’s network. In the past static routes have been used and, for the scenario, I would like to ease the configuration of routing information. I am concerned about processor utilization if dynamic routing protocols are used. Also the reduction of network utilization by routing protocols is desired, as well as, ensuring the shortest path is the path taken all while preventing routing loops.
[Introduction and background]
I have been charged with the task of reconfiguring my company’s network which has grown considerably over the past year. Previously static routes have been used, but I do not wish to maintain the static routing tables since the network has grown. I would rather use a dynamic routing protocol to cause me the least amount of administrative work as possible, however I do have some major concerns. I would like to automate the updating of router table information, but I do not want this to put a major burden on my networking devices processor, memory, and I do not want this automation to place a burden on my network bandwidth. I also wish to ensure packets are being sent along the truest shortest path and in the process, avoid causing any routing loops. Finally I would like to ensure I have redundant links, so that in the event of a failure traffic will still be able to be passed via the shortest path. I am going to draw a conclusion about which dynamic routing protocol will best suite my needs by thoroughly assessing the different types of dynamic routing protocols based upon my requirements.
[Comparison of routing protocols: memory, processor, and network bandwidth usage]
There are different link-state routing protocols and it is important to know each one. Open Shortest Path First (OSPF) is a link-state routing protocol that utilizes route tables, topological databases, and the shortest path first algorithm to determine the most ideal path to send data along. OSPF uses only the destination address of a packet to determine the best route. Because OSPF maintains routing tables and topological databases it can quickly determine if a link should happen to go down and therefore reduces the processor and bandwidth overhead needed for passing routing information. OSPF maintains neighboring relationships between routers in which “hello packets” are exchanged during a handshaking by each router. This handshaking is when routers will send any updates to their routing table. Another link-state routing protocol is the Intermediate System to Intermediate System (IS-IS) routing protocol. The IS-IS routing protocol is similar to OSPF, however it is an interior gateway protocol. This means that it does not route information to external autonomous systems, and therefore relies on an exterior gateway protocol to talk between different autonomous systems (Martey, 2002). The IS-IS protocol is also not an Internet standard and also is not as widely used as OSPF. The IS-IS protocol functions at the networking layer of the OSI model, which is at the same layer as IP traffic, but it does not use IP to carry routing information messages. OSPF, on the other hand, functions at the networking layer, but it functions on top of IP allowing it to use the Internet Protocol to carry routing information messages. OSPF and IS-IS are routing protocols that are similar, however OSPF is the most widely used routing protocol and it can function on top of the Internet Protocol.
There are different distance-vector routing protocols and it is important to know about each one. The routing information protocol (RIP) is a distance vector protocol which uses hop-count as a routing metric and it relies on information from other routers to attempt to determine the best routing path. RIP allows for a 15 maximum hop count and it sends complete routing table updates to other routers every 30 seconds. Cisco has developed a proprietary distance-vector routing protocol called “Interior Gateway Routing Protocol (IGRP).” This routing protocol uses the distance-vector algorithm with the conjunction of four elements, bandwidth, delay, load, and reliability, to determine the best path for routing packets. IGRP sends routing information to other routers on the network every 90 seconds and can become both a burden on network bandwidth and processor utilization as it is updating routing information in 90 second intervals. Although, IGRP is better than RIP, it too can use some improvement. Enhanced Interior Gateway Routing Protocol (EIGRP) is a Cisco proprietary protocol, however it is not the same as IGRP. EIGRP is a balanced network protocol that uses a hybrid of both the link-state and distance vector routing algorithms. This has many benefits as it provides an equal-cost load balancing, incremental routing updates, and formal neighbor relationships (Lammel, Barkl, 2003). EIGRP is similar to IGRP as it uses the same distance-vector information as IGRP, but it puts a different algorithm against that information. EIGRP uses a diffusing update algorithm (DUAL) to calculate different metrics. Distance-vector routing protocols rely on information from other routers, which is sent out in 30 second intervals, to determine the most ideal path for passing traffic.
[Distance vector protocols versus link state protocols]
When considering which dynamic routing protocol is best to use for reconfiguring a network, it is important to know about routing protocols. Routing protocols are a set of protocols that have a specific function. Routing protocols main function is to maintain route tables that are used by routers and make decisions based upon those routes (Lammel, Barkl, 2003). There are two major categories of routing protocols: Link-state and Distance-vector. A link-state routing protocol understands an entire network, it does not listen to secondhand information, and it can make advanced routing decisions. A distance-vector routing protocol only understands the distance and direction to a network connection and it listens to secondhand information in order to get its routing table updates. Link-state routing protocols will send routing information to other routers during a handshake period of communication. This allows for less CPU utilization and less bandwidth needed because link-state routing protocols only update routing tables that have changed. Distance-vector routing protocols rely on information from other routers so they will periodically send routing tables to other routers, which in the even of a connection going down can slow down a network because all networking devices using distance-vector routing will send information to each other. There are two different types of routing protocols, link-state and distance-vector, that both have their advantages, disadvantages, and proper uses.
[Recommended Protocol]
Both the link-state and the distance-vector routing protocols have advantages and disadvantages, however it is the advanced metric calculating and hybrid of both link-state and distance-vector that allows for the Cisco proprietary EIGRP routing protocol to be the most ideal dynamic routing protocol to best suite my requirements and allow for the reconfiguring of the network.
[Conclusion]
In conclusion, both link-state and distance-vector routing protocols had their uses, however it is the hybrid of both of these two routing protocols which will be the most ideal solution for my reconfiguration of my company’s network. Link-state routing protocol is efficient in identifying the most ideal routes by talking with other routers and sharing if a connection goes down. Distance-vector was one of the first routing protocols used, however its lack of efficiency and relying on outside sources to pass traffic with the high overhead needed makes it not a viable solution to suite my needs.
[References]
1. Lammel, Barkl, Todd, Andy (2003). CCDA Cisco Certified Design Associate. Alameda, California: SYBEC Inc..
2. Martey, Abe (2002, May 17). Integrated IS-IS Routing Protocol Concepts. Retrieved September 21, 2008, from Integrated IS-IS Routing Protocol Concepts Web site: http://www.ciscopress.com/articles/article.asp?p=26850
Routing Protocols
Categories
Archives
- December 2024
- November 2024
- October 2024
- September 2024
- August 2024
- July 2024
- June 2024
- May 2024
- April 2024
- March 2024
- February 2024
- January 2024
- December 2023
- November 2023
- October 2023
- September 2023
- August 2023
- July 2023
- June 2023
- May 2023
- April 2023
- March 2023
- February 2023
- January 2023
- December 2022
- November 2022
- October 2022
- September 2022
- August 2022
- July 2022
- June 2022
- May 2022
- April 2022
- March 2022
- February 2022
- January 2022
- December 2021
- November 2021
- October 2021
- September 2021
- August 2021
- July 2021
- June 2021
- May 2021
- April 2021
- March 2021
- February 2021
- January 2021
- December 2020
- November 2020
- October 2020
- September 2020
- August 2020
- July 2020
- June 2020
- May 2020
- April 2020
- March 2020
- February 2020
- January 2020
- December 2019
- November 2019
- October 2019
- September 2019
- August 2019
- July 2019
- June 2019
- May 2019
- April 2019
- March 2019
- February 2019
- January 2019
- December 2018
- November 2018
- October 2018
- September 2018
- August 2018
- July 2018
- June 2018
- May 2018
- April 2018
- March 2018
- February 2018
- January 2018
- December 2017
- November 2017
- October 2017
- September 2017
- August 2017
- July 2017
- June 2017
- May 2017
- April 2017
- March 2017
- February 2017
- January 2017
- December 2016
- November 2016
- October 2016
- September 2016
- August 2016
- July 2016
- June 2016
- May 2016
- April 2016
- March 2016
- February 2016
- January 2016
- December 2015
- November 2015
- October 2015
- September 2015
- August 2015
- July 2015
- June 2015
- May 2015
- April 2015
- March 2015
- February 2015
- January 2015
- December 2014
- November 2014
- October 2014
- September 2014
- August 2014
- July 2014
- June 2014
- May 2014
- April 2014
- March 2014
- February 2014
- January 2014
- December 2013
- November 2013
- October 2013
- September 2013
- August 2013
- July 2013
- June 2013
- May 2013
- April 2013
- March 2013
- February 2013
- January 2013
- December 2012
- November 2012
- October 2012
- September 2012
- August 2012
- July 2012
- June 2012
- May 2012
- April 2012
- March 2012
- February 2012
- January 2012
- December 2011
- November 2011
- October 2011
- September 2011
- August 2011
- July 2011
- June 2011
- May 2011
- April 2011
- March 2011
- February 2011
- January 2011
- December 2010
- November 2010
- October 2010
- September 2010
- August 2010
- July 2010
- June 2010
- May 2010
- April 2010
- March 2010
- February 2010
- January 2010
- December 2009
- November 2009
- October 2009
- September 2009
- August 2009
- July 2009
- June 2009
- May 2009
- April 2009
- March 2009
- February 2009
- January 2009
- December 2008
- November 2008
- October 2008
- September 2008
- August 2008
- July 2008
- June 2008
- May 2008
- April 2008
- March 2008
- February 2008
- January 2008
- December 2007
- November 2007
- October 2007
- September 2007
- August 2007
- June 2007
- February 2007
- January 2007
- December 2006
- November 2006
- October 2006
- September 2006
- August 2006
- July 2006
- June 2006
- May 2006
- April 2006
- March 2006
- February 2006
- January 2006
- December 2005
- November 2005
- October 2005
- September 2005
- August 2005
- July 2005
- June 2005
- May 2005
- April 2005
- March 2005
- February 2005
- January 2005
- December 2004
- November 2004
- October 2004
- September 2004
- August 2004
- July 2004
- June 2004
- May 2004
- April 2004
- March 2004
- February 2004
- February 2003
- January 2003
- December 2002
- October 2002
- August 2002
- July 2002
- June 2002
- May 2002
- April 2002
- March 2002
- December 2001
- November 2001
- October 2001
- August 2001
- May 2001
- April 2001
- September 2000
- August 2000
- June 2000
- May 2000
- April 2000
- March 2000
- December 1999
- November 1999
- July 1999
- May 1999
- April 1999
- March 1999
- February 1999
- November 1998
- September 1998
- July 1998
- June 1998
- May 1998
- March 1998
- December 1997
- April 1997
- December 1996
- June 1996
- March 1996
- February 1996
- November 1995