ACLs EXT ACLs

8/13/2019 ACLs EXT ACLs

1/32

Msc Ts 3rd

Networking Fundamental -IIMuhammmad Usman Mehmood


2/32

2

A function used for Branch Level Connectivity is called Routing. The

destination in Routing table of the router is called Routing.

Routing

Manual

Dynamic

Static Default Distance Vector Hybrid Link State

How many Number OSPF It check

Of Hopes are there in b/w band width

Source are Destination (EIGRP)

(Rip V1V2)


3/32

3

APPLY IP ADDRESS ON FAST ETHERNET (0/0) ON ROUTER (COMPUTER DEPT)

COMMANDS:

Router>Enable Router# Config terminal Router (config )# Interface fast Ethernet Router(configif)# Ip address Router(configif)# No shutdown


4/32

4

APPLY IP ADDRESS ON SERIAL PORT (2/0) ON ROUTER (COMPUTER DEPT)

APPLY IP ADDRESS ON FAST ETHERNET (0/0) ON ROUTER (PHY DEPT)

APPLY IP ADDRESS ON SERIAL PORT (2/0) ON ROUTER (PHY DEPT)

Commands:

Router (config )# Interface fast Ethernet

Router (config )# Interface serial

Router (config -if)# Clock rate


5/32

5

APPLY STATIC ROUTING ON ROUTER (COM DEPT)

APPLY STATIC ROUTING ON ROUTER (PHY DEPT)

DISPLAY THE STATIC ROUTING PROTOCOL

Commands:

Router (config )# Ip route

Router # Show ip router

Pc> Ping ( ip address)


6/32

6


7/32

7

APPLY DEFULT ROUTING ON ROUTER (MLT)

APPLY DEFULT ROUTING ON ROUTER (LHR)

NOTE: Apply Ip address on Fast Ethernet and Serial Port on both Routers

COMMANDS:



8/32

8

Commands:




Commands:




9/32

9

MTL LHR ISLInt Fa 0/0 192.168.10.1 Int Fa 0/0 192.168.20.1 Int Fa 0/0 192.168.30.1In Se 2/0 1.1.1.2 Int Se 2/0 1.1.1.1 In Se 2/0 2.1.1.2P.C 192.168.10.2 Int Se 3/0 2.1.1.2 P.C 192.168.30.2

P.C 192.168.20.2

COMMANDS:



10/32

10

APPLY ROUTING INFORMATION PROTOCOL (RIP) ON MLT

APPLY ROUTING INFORMATION PROTOCOL (RIP) ON LHR


11/32

11

APPLY ROUTING INFORMATION PROTOCOL (RIP) ON ISL

Show Rip Protocol on These Routers

Commands:




Commands:



Router (config )#do show ip router


12/32

12

PING ROUTER (MTL) TO ROUTER (ISL) (2.1.1.2)

PING PC.0 (192.168.10.2) TO PC.2 (192.168.30.2)

PING PC.0 (192.168.10.2) TO ROUTER (ISL) (2.1.1.2)

COMMANDS:

Router# ping ip add

P.C> ping ip add

Router# show ruuning config


13/32

13

Overview of EIGRP in an Enterprise Network

EIGRP is an enhanced version of IGRP.EIGRP has some characteristics similar to thoseof a link-state routing protocol.This makes EIGRP suitable for very large networks.EIGRP has a maximum hop count of 255 (the default is set to 100).The

administrative distance for EIGRP is 90.

EIGRP Terminology

Neighbor

A router running EIGRP that is directly connected.Neighbor table

This table is built from information on Hellos received fromadjacent routers (neighbors).

When a newly discovered neighbor is learned, the addressand interface of the neighbor are recorded, and this information is held in the neighbor

table.

Neighbor Discovery

Before EIGRP routers are willing to exchange routes with each other, they must becomeneighbors.

There are three conditions that must be met for neighborship establishment:Hellos received

AS numbers match

Identical metrics (K values)

Protocol-Dependent Modules

One of the most interesting features of EIGRP is that it provides routing support formultiple Network layer protocols: IP, IPX, AppleTalk, and now IPv6. (Obviously we

wont use IPX and AppleTalk, but EIGRP does support them.)


14/32

14

EIGRP supports different Network layer protocols through the use of protocol-dependentmodules (PDMs).

Routing table

The routing table, or list of available networks and the best paths. A path is moved from the topology table to the routing table when a feasible successor is

identified.

Topology table

A table that contains all the paths advertised by neighbors to allthe known networks.

This is a list of all the successors, feasible successors, the feasible distance, the advertiseddistance, and the outgoing interface.

For each neighbor, the advertised metric (distance), which comes only from theneighbors routing table, is recorded as well as the FD.

Smooth Round-Trip Time (SRTT)

The time that the router waits after sending a packet reliably to hear an acknowledgment. This is held in the neighbor table and is used to calculate the RTO.

Retransmission Timeout (RTO)

Timer calculated in reference to the SRTT. RTO determines how long the router waits for an ACK before retransmitting the packet.

Reliable Transport Protocol (RTP)

Mechanism used to determine requirements that the packets be delivered in sequence andguaranteed.

Diffusing Update Algorithm (DUAL)

An algorithm performed on the topology table to converge the network.Feasible distance (FD)

This is the best metric among all paths to a remote network, including the metric to theneighbor that is advertising that remote network.

The route with the lowest FD is the route that you will find in the routing table because itis considered the best path.


15/32

15

The metric of a feasible distance is the metric reported by the neighbor (called reported oradvertised distance) plus the metric to the neighbor reporting the route.

The lowest-cost distance (metric) to a remote network.Reported/advertised distance (AD)

This is the metric of a remote network, as reported by a neighbor. It is also the routing table metric of the neighbor and is the same as the second number in

parentheses as displayed in the topology table, the first number being the feasible

distance.

Feasible successor

A feasible successor is a path whose advertised distance is less than the feasible distanceof the current successor, and it is considered a backup route.

EIGRP will keep up to 16 feasible successors in the topology table.

Only the one with the best metric (the successor) is copied and placed in the routingtable.

The show ip eigrp topology command will display all the EIGRP feasible successorroutes known to a router.

Successor

A successor route (think successful!) is the best route to a remote network. A successor route is used by EIGRP to forward traffic to a destination and is stored in the

routing table.

It is backed up by a feasible successor route that is stored in the topology tableif one isavailable.

Active

Route state when there is a network change, but after examining the topology table, noFS is found.

The route is set to active mode, and the router queries its neighbors for alternative routes.Passive

An operational route is passive. If the path is lost, the router examines the topology table to find an FS.


16/32

16

ISL KARACHI LHRInt fa 0/0 192.168.10.1 Int fa 0/0 192.168.20.1 Int fa 0/0 192.168.30.1Int se 2/0 1.1.1.1 Int se 2/0 1.1.1.2 Int se 2/0 2.1.1.2P.C 0 192.168.10.2 P.C 2 192.168.20.2 P.C 4 192.168.30.2P.C 1 192.168.10.3 P.C 3 192.168.20.3 P.C 5 192.168.30.3

Int se 3/0 2.1.1.1

COMMANDS:



17/32

17

CONFIGURE EIGRP 1 ON ROUTER (ISL)

CONFIGURE EIGRP 1 ON ROUTER (KARACHI)

CONFIGURE EIGRP 1 ON ROUTER (LHR)

Command:

Router(config ) # router eigrp 1


18/32

18

IP ADDRESSING WITH SUBNETTING

We have five networksand we use class C

We have network ID is 192.168.10.0

2

3

=8 and we have limits 8 networks.

XXXXXXXX XXXXXXXX XXXXXXXX XXXXXXXX

Block Size is 32

The network Scheme is

192.168.10.0 192.168.10.32 192.168.10.64 192.168.10.96 192.168.10.128

192.168.10.1 192.168.10.33 192.168.10.65 192.168.10.97 192.168.10.129

192.168.10.30 192.168.10.62 192.168.10.94 192.168.10.126 192.168.10.158

192.168.10.31 192.168.10.63 192.168.10.95 192.168.10.127 192.168.10.159


19/32

19

OSP [Open Shortest Path irst] OSPF stands for open shortest path first. It also uses the SPF (shortest path first)

algorithm to determine the best route to its neighbors.

The administrative distance for OSPF is 110. The entire network that OSPF routes for is called an "Autonomous System", or "AS". All OSPF routing updates must traverse area 0. Because of this, you should carefully

design your network before you begin deploying OSPF.

OSPF is a LINK STATE protocol. With OSPF, every router has its own unique "picture" (topology map) of the network.

Routers use "HELLO" packets to periodically check with routers to ensure they are stillthere.

What features does OSPF offer?

OSPF provides the following features:

Consists of areas and autonomous systems Minimizes routing update traffic

Allows scalability

Supports VLSM/CIDR Has unlimited hop count Allows multi-vendor deployment (open standard)


20/32

20

Characteristics Of OSPF

Hierarchical Fashion

OSPF is supposed to be designed in a hierarchical fashion, which basically meansthat you can separate the larger internetwork into smaller internetworks called

areas.

This is the best design for OSPF. The following are reasons for creating OSPF in a hierarchical design: To decrease routing overhead To speed up convergenceTo confine network instability to single areas of the network


21/32

21

OSPF design example

Notice how some routers connect to the backbonecalled area 0, or the backbonearea.

OSPF must have an area 0, and all other areas should connect to this area. Routers that connect other areas to the backbone area within an AS are called Area

Border

Routers (ABRs). Still, at least one interface of the ABR must be in area 0. OSPF runs inside an autonomous system, but it can also connect multiple autonomous

systems together.

The router that connects these ASs is called an Autonomous System Boundary Router(ASBR).


22/32

22

OSPF areas

A collection of networks and routers that has the same area identification .

The Characteristics of OSPF Area

OSPF divides the network into multiple areas. Each area can contain N number of routers. All the Areas should connect to Area 0(Backbone area) All the routers within the same area will be having the same topology table It contains one Autonomous system border system router(ASBR) All routers in the same area share a common Area ID. Because a router can be a member of more than one area at a time, the Area ID is

associated with specific interfaces on the router

Point-to-point

Point-to-point refers to a type of network topology consisting of a direct connection between

two routers that provides a single communication path.

The point-to-point connection can be physical, as in a serial cable directly connectingtwo routers, or it can be logical.

Process ID

A value in the range from 1 to 65,535 identifies the OSPF Process ID.

Its a unique number on this router that groups a series of OSPF


23/32

23

Wildcard mask:

it is a 32 bit in length.

A 0 in a bit position means there must be an exact march and 1in bit position meansignore.

For example address is 192.168.10.0 then these wild card mask is 0.0.0.255

Then we find this address through procedure

255.255.255.255

255.255.255.0

The wild card is subtraction so 0.0.0.255

Types of tables

There are three types of tables used in OSPF.

Neighbor Table Topology Table Routing Table

Neighbor Table The router tracks all the neighbors which is running OSPF as a routingprotocol and put that information in this table.

It contains all the information about the directly connected neighbors. Topology Table This is the one of the big difference between Distance vector and link-

state protocols.

Distance vector protocol doesnt have this topology table. They only know aboutthedirectly connected neighbors.

Routing Table

This table contains all the best routes to reach a particular network. Based on the topology table it will be having multiple paths for a single destination

network.


24/32

24

Router ID

The Router ID (RID) is an IP address used to identify the router.

OSPF will choose the highest IP address of all active physical interfaces.

Designated Router

A router elected by all others to represent the network area

A router that is elected by all other routers on the same area to represent all the routers.

selection based on the priority assigned by the network administrator

The election is won by the router with the highest priority, and the highest Router ID is used as

a tiebreaker if the priority of more than one router turns out to be the same.

All routers on the shared network will establish adjacencies with the DR and backup designated

router (BDR)

Backup designated router

A backup designated router (BDR) is a hot standby for the DR on multi-access links.

The BDR receives all routing updates from OSPF adjacent routers but doesnt flood LSAupdates.


25/32

25


26/32

26

ROUTER 0 ROUTER 1 ROUTER 2 ROUTER 3Int fa 192.168.10.1 Int fa 192.168.11.1 Int fa 192.168.12.1 Int fa 192.168.13.1Int se 1.1.1.1 Int se 1.1.1.2 Int se 2.1.1.2 Int se 3.1.1.2

Int se 2.1.1.1 Int se 3.1.1.1P.C 192.168.10.2 P.C 192.168.11.2 P.C 192.168.12.2 P.C 192.168.13.2P.C 192.168.10.3 P.C 192.168.11.3 P.C 192.168.12.3 P.C 192.168.13.3

COMMANDS:



27/32

27

CONFIGURE OSPF ON ROUTER 0



28/32

28



Commands:

Router(config ) # do show ip route

Router(config ) # router ospf 1


29/32

29

SHOW ROUTING PROTOCOL

Save Configurations..

Ping Router 1 to Router 2

Commands:

Router# show ip route

Router# write

Router# ping 2.1.1.2


30/32

30

We have network ID is 192.168.10.0

23=8 and we have limits 8 networks.

XXXXXXXX XXXXXXXX XXXXXXXX XXXXXXXX

Block Size is 32

The network Scheme is

192.168.10.0 192.168.10.32 192.168.10.64 192.168.10.96 192.168.10.128

192.168.10.1 192.168.10.33 192.168.10.65 192.168.10.97 192.168.10.129

192.168.10.30 192.168.10.62 192.168.10.94 192.168.10.126 192.168.10.158

192.168.10.31 192.168.10.63 192.168.10.95 192.168.10.127 192.168.10.159

And Wild card mask is 0.0.0.31

Subnet Mask is 255.255.255.224


31/32

31


32/32

32

ACLs EXT ACLs

Documents

Transcript of ACLs EXT ACLs