Friday, 28 May 2010

RIP, RIP2, IS-IS

RIP



  • Performs autosummarization by default

  • Doesn't support manual route summarization

  • Doesn't support authentication

  • Sends periodic routing updates over the broadcast

  • Four equal paths are supported by default (6 maximum)


RIP2




  • Is best for VLSM and minimum overhead.

  • Support manual route summarization

  • Performs autosummarization by default

  • Multicast 224.0.0.9, FF02::9

  • Supports authentication


IS-IS



  • Link state

  • Supports VLSM

  • Doesn't support auto summarization

  • Supports manual summarization



EIGRP(Enhanced Interior Gateway Routing Protocol)

Some facts


  • It’s enhanced distance-vector protocol.

  • It’s classless.

  • Supports manual route summarization

  • Performs autosummarization by default

  • Network layer.

  • The range of valid AS numbers is 1 through 65,535

  • The fastest convergence

  • It uses the concept of an autonomous system.

  • Wildcards are used

  • Supports MD5 auth

  • It’s hybrid routing protocol because it has characteristics of both distance-vector and link-state protocols.

  • EIGRP has a maximum hop count of 255 (the default is set to 100).

  • It provides routing support for multiple Network layer protocols: IP, IPX, AppleTalk, and now IPv6

  • Communication via Reliable Transport Protocol (RTP) - Cisco proprietary protocol, is used for transmitting EIGRP messages between routers. It can provide reliable packet delivery when necessary, by using sequence number, acknowledgement, and retransmission with unicast (a packet will be retransmitted up to 16 times if no acknowledgement is received, before declaring the neighbor router is dead).

  • Diffusing Update Algorithm (DUAL).It is used to determine a route to network, when successor failed and there is no feasible successors. This algoritm just asks neighbor routers for route.

  • Technologies: Split horizon, Poison Reverse.

  • Conseptions:



  1. Reported distance - distance to the remote network, reported by the neighbor router.

  2. Feasible distance - This is the best metric along all paths to a remote network, including the metric to the neighbor that is advertising that remote network. This is the route that you will find in the routing table because it is considered the best path.

  3. Successor - next hop router with the best metric, is placed in routing table of router, there might be several successors, if they have equal metrics.

  4. Feasible successor - backup next hop router. EIGRP will keep up to six feasible successors in the topology table. If a nonsuccessor route’s RD is less than the FD, the route is a feasible successor route.


  • All data is stored in three tables:


  1. Neighbor table - stores data about neighboring routers.

  2. Topology table – stores contains the aggregation of the routing tables gathered from all directly connected neighbors. There also may be successors and feasible successors for some routes in this table. Destination may be passive or active. Passive means that route is stable. Active means that route is updating. In Cisco routers route may be: Passive, Active, Update, Query, Reply.

  3. Routing table – contains all actual routes with their successors and possible feasible successors, if load balancing is enabled.


  • It uses 4 metrics(by default delay and bandwidrth are used):


  1. Total Delay (the sum of all the delay values for all links in the route, with a unit of “tens of microseconds.”)

  2. Minimum Bandwidth ( the lowest-bandwidth link in the route,using a unit of kilobits per second)

  3. Reliability (number in range 1 to 255; 255 being most reliable)

  4. Load (number in range 1 to 255; 255 being saturated)


  • The router uses formula to calculate overall metric:

metric=(107/least-bandwidth + cumulative delay)*256

Bandwidth - kilobits per second.

Delay - tens of microseconds

In this case k1=1,k2=0,k3=1,k4=0,k5=0 by default(only Bandwidth and Delay is used). You can change their value with command:

Router(config-router)#metric weights …


  • Administrative distance - 90 for internal route(in one AS) an 170 for external route(in different AS or from other protocol).

  • Multicast 224.0.0.10 for Hello messages, but updates can also be sent to unicast address. FF02::A for IPv6.

  • EIGRP can provide equal-cost load balancing of up to four links by default, but it is possible to use 16 links with command:


(config-router)#maximum-paths

  • EIGRP can provide unequal-cost load balancing with command

variance.

  • First routers have to establish neighborship , to do it, three conditions must be met:



  1. Hello or ACK received

  2. AS numbers match

  3. Identical metrics (K values)

  4. Auth passed

  5. The same subnet


Show commands

show ip eigrp topology all-links

Shows all routes, not only successors and feasable successors.



Debuging

debug eigrp packets

Displays the contents of EIGRP packets.



debug eigrp fsm

Displays changes to the EIGRP successor and feasible successor routes.

debug ip eigrp

Displays similar output to the debug eigrp packets command, but specifically for IP.



EIGRP packet types


  • Hello packet It is used for discovering neighbors and maintaining neighbor relationship. It is sent to neighbors periodically (hello interval). The default hello interval is: Non-broadcast multi-access (NBMA) network with bandwidth Other networks (e.g. Ethernet, point-to-point serial links, high speed frame relay, etc.) - 5 seconds . A neighbor is assumed dead if no hello message from that neighbor is received before the hold timer expires (default = 3 times of the hello timer value). All routes learned from that neighbor will also be deleted. Neighbor routers can use different hello and hold-time intervals. A router informs the neighbors its hold-time interval through hello packets. It is sent as multicast. Acknowledgement is not required (i.e. unreliable delivery).

  • Update packet It is used for sending routing information to neighbors as follows: Full routing updates (i.e. the whole topology table) during initialization of the routing process. Incremental routing updates (i.e. routing updates about the paths that have been changed) when there is a change in the network topology or metric. It is sent to the relevant routers as unicast or multicast. Acknowledgement is required (i.e. reliable delivery).

  • Query packet It is used for querying neighbors if they have feasible successors for a destination network. It is sent during a diffusing computation (to be explained later in this Section). It is sent as multicast. Acknowledgement is required (i.e. reliable delivery).

  • Reply packet It is used for replying a query with the requested routing information (e.g. information of the best path to the destination network, or destination unreachable). It is sent as unicast. Acknowledgement is required (i.e. reliable delivery).

  • Acknowledgement (ACK) packet It is used for acknowledging the receipt of an update / query / reply packet. It is sent as unicast. Acknowledgement is not required (i.e. unreliable delivery).

  • Redistribution is required when more than one EIGRP session or process is running and they are identified with different ASNs. Redistribution shares topology information between EIGRP sessions.


OSPF routing protocol

Some facts
  • Supports variable-length subnet masking (VLSM, CIDR)
  • Reduces the routing overhead using areas
  • Doesn't perform route autosummarization by default
  • Supports manual route summarization
  • OSPF allows only equal cost load balancing
  • It is Interior Gateway Protocol(IGP)
  • OSPF uses the SPF algorithm, conceived by a mathematician named Dijkstra.
  • It supports IP and IPv6
  • The area-id can be an integer between 0 and 4294967295
  • Link layer
  • Uses Dijkstra SPF algorithm
  • Unlimited hop count
  • OSPF is supposed to be designed in a hierarchical fashion, which basically means that you can separate the larger internetwork into smaller internetworks called areas. The following are reasons for creating OSPF in a hierarchical design:
  1. To decrease routing overhead
  2. To speed up convergence
  3. To confine network instability to single areas of the network
  • Uses areas, area 0 is a backbone area
  • By default support 4 equal routes to one destination in routing table. It can also be configured with:

Router(config-router)#maximum-paths number
  • Multicast addresses 224.0.0.5 (all SPF/link state routers, also known as AllSPFRouters) and 224.0.0.6 (all Designated Routers, AllDRouters) are reserved for OSPF (RFC 2328) and FF02::5, FF02::6 for IPv6
  • The router types are attributes of an OSPF process. A given physical router may have one or more OSPF processes. OSPF defines the following router types:
  1. Area border router (ABR) - Routers that connect other areas to the backbone area within an AS.ABR is a router that connects one or more OSPF areas to the main backbone network. It is considered a member of all areas it is connected to. An ABR keeps multiple copies of the link-state database in memory, one for each area to which that router is connected.

  2. Autonomous system border router (ASBR) - An ASBR is a router that is connected to more than one AS and that exchanges routing information with routers in other ASs. ASBRs typically also run a non-IGP routing protocol (e.g., BGP), or use static routes, or both. An ASBR is used to distribute routes received from other ASs throughout its own AS.

  3. Internal router (IR) - An IR is a router that has only OSPF neighbor relationships with routers in the same area.

  4. Backbone router (BR)
  • An area border router is always a backbone router, but a backbone router is not necessarily an area border router


Becoming neighbors
  • To become neighbors:
  1. The same area ID
  2. Authentication – the same password
  3. The same hello and dead intervals
  4. Subnet mask and subnet
  • Hello packets every 10 seconds, are addressed to 224.0.0.5
  • Dead interval is 4 * Hello intervals - 40 seconds. “Down” in neighbor table
Neighbor states:
  1. Down
  2. Init
  3. 2 way
  4. Full

DR & BDR
  • DR and BDR are elected on broadcast and non-broadcast multi-access networks
  • To elect DR priority on interface is used(show ip ospf interface), if priority is identical, router ID is used
  • Router with the highest OSPF priority setting becomes the DR.
  • A priority setting of 0 means that the router does not participate in the election and can never become the DR or BDR.
  • The range of priority values that allow a router to be a candidate are 1 through 255.
Router ID (RID) is:
  • router-id rid OSPF subcommand OR
  • The highest numeric IP address among the up/up loopback interfaces OR
  • The highest IP address of logical interface configured on the router
    Path cost
  • Calculate routes based on Bandwidth
  • OSPF router collects link-state information to construct the entire network topology of so-called “areas” from which it computes the shortest path tree for each route using a method based on Dijkstra's algorithm
  • The cost of the entire path is the sum of the costs of the outgoing interfaces along the path
  • Cisco uses a simple equation of 108/bandwidth(in bits)
  • OSPF has an administrative distance of 110
  • * In contrast to the Routing Information Protocol (RIP) or the Border Gateway Protocol (BGP), OSPF does not use TCP or UDP but uses IP directly, via IP protocol 89. OSPF handles its own error detection and correction, therefore negating the need for TCP or UDP functions
  • The OSPF Protocol can operate securely between routers, optionally using a clear-text password or using MD5 to authenticate peers before forming adjacencies and before accepting link-state advertisements (LSA)
  • As a link state routing protocol, OSPF establishes and maintains neighbour relationships in order to exchange routing updates with other routers. The neighbour relationship table is called an adjacency database in OSPF. Provided that OSPF is configured correctly, OSPF forms neighbour relationships only with the routers directly connected to it. The routers that it forms a neighbour relationship with must be in the same area as the interface with which it is using to form a neighbor relationship. An interface can only belong to a single area
  • An OSPF network is divided into areas, which have 32-bit area identifiers commonly, but not always, written in the dotted decimal format of an IP address. Area identifiers are not IP addresses and may duplicate, without conflict, any IP address. While most OSPF implementations will right-justify an area number written in other than dotted decimal format (e.g., area 1), it is wise always to use dotted decimal formats. Most implementations would expand area 1 to the area identifier 0.0.0.1, but some have been known to expand it as 1.0.0.0. These are logical groupings of routers whose information may be summarized towards the rest of the network
  • There are 4 types of areas: backbone, stub area, totally stubby area, not-so-stubby area
  • Each router has a router identifier, customarily written in the dotted decimal format (e.g.: 1.2.3.4) of an IP address
Configuration

router ospf 1(zero is unacceptable)
Router(config-router)# network 192.168.10.0 0.0.0.255 area 0
Show commands
show ip ospf - display details of all OSPF routing processes enabled on a router.
show ip ospf interface - display interface-specific OSPF information.
show ip ospf neighbor - display all OSPF neighbors.
show ip ospf database - display all different OSPF route types that are currently known by the router.

Ping does not work

Today I would like to discuss a banal situation: host A is directly connected to host B, ping from host A to host B does not work. What are...