Presentation is loading. Please wait.

Presentation is loading. Please wait.

GROUP ASSIGNMENT CT046-3.5-3-NWT NETWORK TROUBLESHOOTING Name: Tan Ming Fatt Student ID: TP036625 Group Members: - Gan Pei Shan Elamparithi A/L Thuraisamy.

Similar presentations


Presentation on theme: "GROUP ASSIGNMENT CT046-3.5-3-NWT NETWORK TROUBLESHOOTING Name: Tan Ming Fatt Student ID: TP036625 Group Members: - Gan Pei Shan Elamparithi A/L Thuraisamy."— Presentation transcript:

1 GROUP ASSIGNMENT CT046-3.5-3-NWT NETWORK TROUBLESHOOTING Name: Tan Ming Fatt Student ID: TP036625 Group Members: - Gan Pei Shan Elamparithi A/L Thuraisamy Tan Ken Sing

2 Recommendation to upgrade the network (Section B) Routing Protocol  Routing is the process of selecting paths in a network  routing directs traffic forwarding of logically addressed packets through intermediate modes from their source to their ultimate destination  Routing protocols are designed to select and determine the best path to each router in the network  Routers should learn the next hop to send the packets. Forwarding data should be effective and efficient  routing decision of a protocol is very important for network performance and reliability

3 Types of Routing Protocols  Routing Information Protocol (RIP)  Open Shortest Path First (OSPF)  Enhanced Interior Gateway Routing Protocol (EIGRP)

4 Routing Information Protocol (RIP)  a distance vector dynamic routing protocol that employs the hop count as a routing metric  implemented on top of the User Datagram Protocol (UDP) as its transport protocol  assigned the reserved port number 520  prevents routing loops by implementing a limit on the number of hops allowed in a path from the source to a destination  the maximum number of permitted hop is 15  this hop number limits the size of networks that RIP may support, RIP selects paths that have the smallest hop counts. However, the path may be slowest in the network.

5 Open Shortest Path First (OSPF)  a shortest path first (SPF) or link-state protocol  better suited than RIP for complex network with many routers  an interior gateway protocol that distributes routing information between routers in a single autonomous system (AS)  chooses the least cost path as the best path, it provides equal costs multipath routing where packets to a single destination builds out of the collected link-state advertisements of all routers.

6 Enhanced Interior Gateway Routing Protocol (EIGRP)  a hybrid routing protocol developed by Cisco systems for routing many protocols across an enterprise Cisco network  has characteristics of both distance vector routing protocols and link state routing protocols  proprietary which requires that use Cisco routers  EIGRP use the same composite metrics as IGRP to select a best path destination  there is the option to load balance traffic across equal or unequal metric cost paths  Summarization is automatic at a network class address however it can be configured to summarize at subnet boundaries as well  There is support for hop count of 255 and variable length subnet masks.

7 Comparison of Routing Protocol ProtocolRIPOSPFEIGRP Type of Protocol Distance VectorLink-StateHybrid Knowledge of network topology None Maintains table with complete knowledge of each area Maintains limited topology table Routing updates Complete routing table sent to all neighbors every 30 seconds Incremental updates sent to all routers in an area when necessary Incremental updates sent to the affected routers when necessary Send acknowledgements after receiving routing updates NoYes (LSAck packet)Yes (ACK packet) Convergence SlowFastVery Fast Prone to routing loops No Yes Supports VLSMs NoYes

8 Comparison of Routing Protocol (Continued) Supports route summarization on arbitrary boundaries NoYes Supports hierarchical routing NoYes Proprietary to Cisco No Yes Supports multiple protocols No Yes Updates Full TableOnly Changes Update Timers30 seconds Only when change occurs; (however, LSA table is refreshed every 30 minutes) Only when change occurs Algorithms Bellman-FordDijkstraDUAL ProtocolRIPOSPFEIGRP

9 Recommendation and Justification Chosen EIGRP  is faster since it uses an algorithm called dual update algorithm or DUAL, which is run when a router detects that a particular route is unavailable  The router queries its neighbors looking for a feasible successor  EIGRP does recognize assignment of different autonomous systems (AS) which are processes running under the same administrative routing domain  Assigning different AS number is not for defining a backbone such as with OSPF  With EIGRP, it is used to change route distribution, filtering and summarization points.

10 Recommendation EIGRP Monitoring Tool  NetBrain’s ‘Map+App’ troubleshooting methodology can help to troubleshoot EIGRP routers effectively, through automation  Users can instantly create a dynamic network map to target the EIGRP as in question, then can drill down with NetBrain apps to automatically diagnose neighbor adjacencies, route table changes, and configuration discrepancies in real-time  This same methodology can be applied towards troubleshooting any other dynamic routing protocols including OSPF, RIPv2, and BGP.

11 IMPLEMENTING EIGRP Kemaman>en Kemaman#conf t Enter configuration commands, one per line. End with CNTL/Z. Kemaman (config)#router eigrp 10 Kemaman (config-router)#no auto Kemaman (config-router)#no auto-summary Kemaman (config-router)#network 192.168.40.0 Kemaman (config-router)#network 200.128.30.0 Kemaman (config-router)# %DUAL-5-NBRCHANGE: IP-EIGRP 10: Neighbor 200.128.30.67 (Serial0/3/1) is up: new adjacency CommandPurpose Kemaman (config)#router eigrp 10This creates an EIGRP routing process, and the user enters router configuration mode for this EIGRP process. The as-num argument is the autonomous system number of the EIGRP routing process. Kemaman (config-router)#no auto-summary Disables automatic summarization (subnets are included in the routing updates)

12

13 Thank you!


Download ppt "GROUP ASSIGNMENT CT046-3.5-3-NWT NETWORK TROUBLESHOOTING Name: Tan Ming Fatt Student ID: TP036625 Group Members: - Gan Pei Shan Elamparithi A/L Thuraisamy."

Similar presentations


Ads by Google