CCNA :) Be a Good Network Administrator

 1.2.2 RIP V2 Features This page will discuss RIP v2, which is an improved version of RIP v1. Both versions of RIP share the following features: It is a distance vector protocol that uses a hop count metric. It uses hold down timers to prevent routing loops – default is 180 seconds. It uses split horizon to prevent routing loops. It uses 16 hops as a metric for infinite distance. RIP v2 provides prefix routing, which allows it to send out subnet mask information with the route update. Therefore, RIP v2 supports the use of classless routing in which different subnets within the same network can use different subnet masks, as in VLSM. RIP v2 provides for authentication in its updates. A set of keys can be used on an interface as an authentication check. RIP v2 allows for a choice of the type of authentication to be used in RIP v2 packets. The choice can be either clear text or Message-Digest 5 (MD5) encryption. Clear text is the default. MD5 can be used t...

1.2 RIP Version 1.2.1 RIP History This page will explain the functions and limitations of RIP. The Internet is a collection of autonomous systems (AS). Each AS is generally administered by a single entity. Each AS has a routing technology which can differ from other autonomous systems. The routing protocol used within an AS is referred to as an Interior Gateway Protocol (IGP). A separate protocol used to transfer routing information between autonomous systems is referred to as an Exterior Gateway Protocol (EGP). RIP is designed to work as an IGP in a moderate-sized AS. It is not intended for use in more complex environments. RIP v1 is considered a classful IGP. RIP v1 is a distance vector protocol that broadcasts the entire routing table to each neighbor router at predetermined intervals. The default interval is 30 seconds. RIP uses hop count as a metric, with 15 as the maximum number of hops. If the router receives information about a network, and the receiving interface belongs to th...

 1.1.6  The following are VLSM calculations for the LAN connections in Figure : Network address: 192.168.10.0 The Perth router has to support 60 hosts. That means a minimum of six bits are needed in the host portion of the address. Six bits will yield 2 6 – 2, or 62 possible host addresses. The LAN connection for the Perth router is assigned the 192.168.10.0/26 subnet. The Sydney and Singapore routers have to support 12 hosts each. That means a minimum of four bits are needed in the host portion of the address. Four bits will yield 2 4 – 2, or 14 possible host addresses. The LAN connection for the Sydney router is assigned the 192.168.10.96/28 subnet and the LAN connection for the Singapore router is assigned the 192.168.10.112/28 subnet. The KL router has to support 28 hosts. That means a minimum of five bits are needed in the host portion of the address. Five bits will yield 2 5 – 2, or 30...

1.1.5  Route aggregation with VLSM When VLSM is used,  it is important to keep the subnetwork numbers grouped together in the network to allow for aggregation. For example, networks like 172.16.14.0 and 172.16.15.0 should be near one another so that the routers only carry a route for 172.16.14.0/23. The use of classless interdomain routing (CIDR) and VLSM prevents address waste and promotes route aggregation, or summarization. Without route summarization, Internet backbone routing would likely have collapsed sometime before 1997. Figure illustrates how route summarization reduces the burden on upstream routers. This complex hierarchy of variable-sized networks and subnetworks is summarized at various points with a prefix address, until the entire network is advertised as a single aggregate route of 200.199.48.0/20. Route summarization, or supernetting, is only possible if the routers of a network use a classless routing protocol, such as OSPF or EIGRP. Classless routing pr...