Faculty of Technology, Engineering and the Environment

Undergraduate Programme 2010/2011 Academic Year

Module: School: Module Co-ordinator: Date: Start Time: Reading Time: Time Allowed: 5 minutes 40 minutes Advanced Networking Technologies UG3 CTN Ron Austin

SEP Sample Exam PAPER

Instructions to Candidates:
All questions carry equal marks Marks breakdown is shown in brackets Note that marks are allocated for method, in addition to the final answer. Therefore method and full calculations should be shown in your solutions to analytical questions Calculators may be used provided thay are in accordance with TEE guidelines The following are provided: 1. 2.

Question 1
OSPF uses three tables to manage the routers knowledge of other networks. Identify each table and give a brief description of its purpose. [25 marks] Adjacency database Routing database Neighbour database Similar to EIGRP
multicast traffic for this group.

Question 2
Referring to the figure shown below, explain how EIGRP can be configured to load balance over un-equal cost links. You need to give a explanation from router E.

In the figure, there are three paths to network Z with the following metrics: Path 1: 30 (via B) Path 2: 20 (via C) Path 3: 45 (via D)

By default, the router places only path 2, via C, in the routing table, because it is the least cost path. To load balance over paths 1 and 2, use a variance of 2, because 20 * 2 = 40, which is greater than the metric through path 1. In this example, router E uses router C as the successor because it has the lowest FD (20). With the variance 2 command applied to router E, the path through router B meets the criteria for load balancing. In this case, the FD through router B is less than twice the FD for the successor (router C). Router D is not considered for load balancing with this variance, because the FD through router D is greater than twice the FD for the successor (router C). In this example, however, router D would never be a feasible successor no matter what the variance is, because router Ds AD of 25 is greater than router Es FD of 20. To avoid a potential routing loop, router D is not considered a feasible successor.

Question 3 Consider Figure Q3, assuming each routing protocol, hostname and serial interface is correctly configured according to the topology presented. Provide a command script which will allow redistribution to occur on R2, where networks 222.222.30.0 and 222.222.130 are permitted, but the rest denied egress into the EIGRP area.

Figure Q3
On R2 Conf t Redist OSPF 1 metric 10000 100 255 1 1500 router eigrp 1 redistribute ospf 1 route-map ospf-to-eigrp default-metric 20000 2000 255 1 1500 !--- Output suppressed. ! route-map ospf-to-eigrp deny 10 match tag 6 match route-type external type-2 ! route-map ospf-to-eigrp permit 20 match ip address prefix-list pfx set metric 40000 1000 255 1 1500 ! route-map ospf-to-eigrp permit 30 set tag 8

Question 5 Routers B, A and C from the figure below require BGP configuration, provided the correct configuration for these three routers.

Router A Conf t Router bgp 65101 No auto Neighbour 192.168.1.1 remote-as 65102 Neighbour 10.2.2.2 remote-as 65101 Router B Conf t Ip route 192.168.1.1 255.255.255.255 se 1 Router bgp 65101 Neighbour 10.1.1.2 remote-as 65102 Neighbour 192.168.1.1 remote-as 65102 Neighbour 192.168.1.1 ebgp-multihop 3 Router C Conf t Ip route 10.2.2.2 255.255.255.255 se 1 Router bgp 65102 No auto Neighbour 192.168.1.2 remote-as 65101 Neighbour 10.2.2.2 remote-as 65101 Neighbour 10.2.2.2 ebgp-mutihop 3

Question 6 BGP uses a number of attributes, explain the well know BGP attributes:

Well-known mandatory attributes o Autonomous system path o Next hop o Origin

AS path is a pre-pended list of all AS s the route has passed through. Next hop is the next hop address that BGP will use to reach the destination Orgin Source AS number for the route

Question 7 OSPF uses different types of LSA to send updates within an area, Explain the types of LSU and how they update the DR and how the DR updates all DRother routers.

Step 1

On broadcast networks, routers form adjacencies only with the DR and BDR. Therefore, when a router notices a change in a link-state, it multicasts an LSU packet (which includes the updated LSA entry) to all OSPF DRs and BDRs. DRs and BDRs have their own multicast address, which is 224.0.0.6. An LSU packet may contain several distinct LSAs. The DR acknowledges the receipt of the change and floods the LSU to others on the network using the OSPF multicast address 224.0.0.5. After receiving the LSU, each router responds to the DR with an LSAck. To make the flooding procedure reliable, each LSA must be acknowledged separately. If a router is connected to other networks, it floods the LSU to those other networks by forwarding the LSU to the DR of the other network (or to the adjacent router if it is in a point-to-point network). That DR, in turn, would multicast the LSU to the routers on the other network. The router updates its LSDB using the LSU that includes the changed LSA. It then recomputes the SPF algorithm against the updated database after a short delay (the SPF delay) and updates the routing table as necessary.

Step 2

Step 3

Step 4

The same DR/BDR functionality exists on NBMA networks, except that the LSAs are unicast from the routers to the DR and BDR. In return, the DR unicasts a copy of the LSA to all adjacent neighbors. OSPF simplifies synchronization by requiring only adjacent routers to remain synchronized. Summaries of individual link-state entries, not the complete link-state entries, are sent every 30 minutes to ensure LSDB synchronization. Each link-state entry has a timer to determine when the LSA refresh update must be sent. Each link-state entry also has a maximum age of 60 minutes. If a link-state entry has not been refreshed within 60 minutes, it is removed from the LSDB.