Added for You
#1 in Business Subscribe Email Print

You are here: Home > Computers and Technology > Hardware > Routing, Routed, and Non-Routable Protocols

Tags

  • destination
  • importantly
  • learned
  • networks todays
  • routing timersrouting
  • business always

  • Links

  • Affiliate Marketing - Making the Right Choices
  • Car Audio Bass By Alpine
  • Creative Offline Marketing-Part VI
  • Added for You - Routing, Routed, and Non-Routable Protocols

    How to Find Your French Home
    The decision has been made. You have decided to buy a home in France. But where on earth do you start your search for the ideal French property? To get some fresh ideas and the best tips on the top places to search for your dream home, start here. But first, another decision is required.Are you going to do most of your research from home or actually in France? It may be beneficial to do most of the initial “legwork” before leaving home, so that the majority of your time in France is fruitful, and not wasted. Perhaps selecting which part of France interests you most could be achieved from home? Many people take lists of properties, and likely looking agents with them when they head off to France.There are many ways of finding French property for sale. Many people start with searching the specialist property publications, like “French Property News”. This type of magazine is full of property for sale, of all types, styles and descriptions, in all areas of France. Maybe the lifestyle magazines such as “Living France” or websites like French property for sale will have your perfect home listed?Of course the Internet is a fantastic resource when buying property anywhere. But beware, like the real world, the Internet does have its fair share of crooks. So as with terrestrial life, in cyber life too, you should follow the maxim “caveat emptor” (let the buyer beware).One huge advantage the internet has over magazines is that it is much more of a current medium for advertisers. Many magazines whilst giving you a flavour of what type of property is available in which areas, may not be up to date on which properties have already been sold, and which
    larly scheduled updates that RIP routers send.

    RIP Routing Metric

    RIP uses a single routing metric (hop count) to measure the distance between the source and a destination network. Each hop in a path from source to destination is assigned a hop count value, which is typically 1. When a router receives a routing update that contains a new or changed destination network entry, the router adds 1 to the metric value indicated in the update and enters the network in the routing table. The IP address of the sender is used as the next hop.

    RIP Stability Features

    RIP prevents routing loops from continuing indefinitely by implementing a limit on the number of hops allowed in a path from the source to a destination. The maximum number of hops in a path is 15. If a router receives a routing update that contains a new or changed entry, and if increasing the metric value by 1 causes the metric to be infinity (that is, 16), the network destination is considered unreachable. The downside of this stability feature is that it limits the maximum diameter of a RIP network to less than 16 hops.

    RIP includes a number of other stability features that are common to many routing protocols. These features are designed to provide stability despite potentially rapid changes in a network's topology. For example, RIP implements the split horizon and holddown mechanisms to prevent incorrect routing information from being propagated.

    RIP Timers

    RIP uses numerous timers to regulate its performance. These include a routing-update timer, a route-timeout timer, and

    Yes, You Can Build a List With eBay
    Ebooks are not the way to make money on eBay, as glutted as the eBay market is with them. But, there is still money to be made with them if you know how to work the system. Selling an ebook on the site subjects you to intense competition, many times by people selling the exact same product for a dollar or less. There are also those who sell them even cheaper, losing money on each transaction through eBay and PayPal fees. But there is a hidden profit potential behind those .01 ebooks.The cheap ebooks people sell on eBay are often sold with resale rights. This means that you can always find plenty of inexpensive ebooks to sell, but it also means there are hundreds of people already selling it. But by utilizing the sales in another way, a workable list can be built in order to generate sales for the real items you are selling.Buyers on eBay these days are looking for incredibly cheap ebooks. So to get the customers you need, your books will have to be priced similarly. By having a low price, you will get more customers, making your list grow quickly. Once the sale is made, you can talk the customer into subscribing to your newsletter or other targeted marketing that you have available. One way to convince buyers to join is to offer them more ebooks for free. With that carrot dangling above them, buyers will jump to join your list. It’s a great deal for them- free ebooks. It’s a great deal for you- a cheap customer list. And with a list in hand, the door opens for countless other ventures.There is yet another way to create lists using eBay itself. If you don’t have a newsletter autoresponder already set up, you can actually send newsletter through the site. The site now has its own newsletter system that can be subscrib
    ROUTING PROTOCOLS

    A generic term that refers to a formula, or protocol, used by a router to determine the appropriate path over which data is transmitted. The routing protocol also specifies how routers in a network share information with each other and report changes. The routing protocol enables a network to make dynamic adjustments to its conditions, so routing decisions do not have to be predetermined and static.

    Routing, Routed and Non-Routable Protocols

    ROUTING | ROUTED | NON-ROUTABLE

    ROUTING PROTOCOLS

    ROUTING PROTOCOLS are the software that allow routers to dynamically advertise and learn routes, determine which routes are available and which are the most efficient routes to a destination. Routing protocols used by the Internet Protocol suite include:

    · Routing Information Protocol (RIP and RIP II).
    · Open Shortest Path First (OSPF).
    · Intermediate System to Intermediate System (IS-IS).
    · Interrior Gateway Routing Protocol (IGRP).
    · Cisco's Enhanced Interior Gateway Routing Protocol (EIGRP).
    · Border Gateway Protocol (BGP).

    Routing is the process of moving data across two or more networks. Within a network, all hosts are directly accessable because they are on the same

    ROUTED PROTOCOLS

    ROUTED PROTOCOLS are nothing more than data being transported across the networks. Routed protocols include:

    · Internet Protocol
    o Telnet
    o Remote Procedure Call (RPC)
    o SNMP
    o SMTP
    · Novell IPX
    · Open Standards Institute networking protocol
    · DECnet
    · Appletalk
    · Banyan Vines
    · Xerox Network System (XNS)

    Outside a network, specialized devices called ROUTES are used to perform the routing process of forwarding packets between networks. Routers are connected to the edges of two or more networks to provide connectivity between them. These devices are usually dedicated machines with specialized hardware and software to speed up the routing process. These devices send and receive routing information to each other about networks that they can and cannot reach. Routers examine all routes to a destination, determine which routes have the best metric, and insert one or more routes into the IP routing table on the router. By maintaining a current list of known routes, routers can quicky and efficiently send your information on it's way when received.

    There are many companies that produce routers: Cisco, Juniper, Bay, Nortel, 3Com, Cabletron, etc. Each company's product is different in how it is configured, but most will interoperate so long as they share common physical and data link layer protocols (Cisco HDLC or PPP over Serial, Ethernet etc.). Before purchasing a router for your business, always check with your Internet provider to see what equipment they use, and choose a router, which will interoperate with your Internet provider's equipment.

    NON-ROUTABLE PROTOCOLS

    NON-ROUTABLE PROTOCOLS cannot survive being routed. Non-routable protocols presume that all computers they will ever communicate with are on the same network (to get them working in a routed environment, you must bridge the networks). Todays modern networks are not very tolerant of protocols that do not understand the concept of a multi-segment network and most of these protocols are dying or falling out of use.

    · NetBEUI
    · DLC
    · LAT
    · DRP
    · MOP

    RIP (Routing Information Protocol)

    RIP is a dynamic internetwork routing protocol primary used in interior routing environments. A dynamic routing protocol, as opposed to a static routing protocol, automatically discovers routes and builds routing tables. Interior environments are typically private networks (autonomous systems). In contrast, exterior routing protocols such as BGP are used to exchange route summaries between autonomous systems. BGP is used among autonomous systems on the Internet.

    RIP uses the distance-vector algorithm developed by Bellman and Ford (Bellman-Ford algorithm).

    Routing Information Protocol

    Background

    The Routing Information Protocol, or RIP, as it is more commonly called, is one of the most enduring of all routing protocols. RIP is also one of the more easily confused protocols because a variety of RIP-like routing protocols proliferated, some of which even used the same name! RIP and the myriad RIP-like protocols were based on the same set of algorithms that use distance vectors to mathematically compare routes to identify the best path to any given destination address. These algorithms emerged from academic research that dates back to 1957.

    Today's open standard version of RIP, sometimes referred to as IP RIP, is formally defined in two documents: Request For Comments (RFC) 1058 and Internet Standard (STD) 56. As IP-based networks became both more numerous and greater in size, it became apparent to the Internet Engineering Task Force (IETF) that RIP needed to be updated. Consequently, the IETF released RFC 1388 in January 1993, which was then superceded in November 1994 by RFC 1723, which describes RIP 2 (the second version of RIP). These RFCs described an extension of RIP's capabilities but did not attempt to obsolete the previous version of RIP. RIP 2 enabled RIP messages to carry more information, which permitted the use of a simple authentication mechanism to secure table updates. More importantly, RIP 2 supported subnet masks, a critical feature that was not available in RIP.

    This chapter summarizes the basic capabilities and features associated with RIP. Topics include the routing update process, RIP routing metrics, routing stability, and routing timers.

    Routing Updates

    RIP sends routing-update messages at regular intervals and when the network topology changes. When a router receives a routing update that includes changes to an entry, it updates its routing table to reflect the new route. The metric value for the path is increased by 1, and the sender is indicated as the next hop. RIP routers maintain only the best route (the route with the lowest metric value) to a destination. After updating its routing table, the router immediately begins transmitting routing updates to inform other network routers of the change. These updates are sent independently of the regularly scheduled updates that RIP routers send.

    RIP Routing Metric

    RIP uses a single routing metric (hop count) to measure the distance between the source and a destination network. Each hop in a path from source to destination is assigned a hop count value, which is typically 1. When a router receives a routing update that contains a new or changed destination network entry, the router adds 1 to the metric value indicated in the update and enters the network in the routing table. The IP address of the sender is used as the next hop.

    RIP Stability Features

    RIP prevents routing loops from continuing indefinitely by implementing a limit on the number of hops allowed in a path from the source to a destination. The maximum number of hops in a path is 15. If a router receives a routing update that contains a new or changed entry, and if increasing the metric value by 1 causes the metric to be infinity (that is, 16), the network destination is considered unreachable. The downside of this stability feature is that it limits the maximum diameter of a RIP network to less than 16 hops.

    RIP includes a number of other stability features that are common to many routing protocols. These features are designed to provide stability despite potentially rapid changes in a network's topology. For example, RIP implements the split horizon and holddown mechanisms to prevent incorrect routing information from being propagated.

    RIP Timers

    RIP uses numerous timers to regulate its performance. These include a routing-update timer, a route-timeout timer, and

    Ten Things You Might Not Have Known About Social Security
    Social Security is a lot like the ozone layer--we all know it’s there now and we count on it being there in the future. Yet most people don’t know much more about it than that. Here’s a short list of interesting facts about Social Security.(1) Social Security benefits do not automatically start coming in the mail the first day of Normal Retirement Age. They must be applied for. The easiest way is to set up an appointment with the local Social Security office or call 1-800-772-1213.(2) To get an official statement of all the earnings recorded in your Social Security account, an estimate of your current disability and death benefits, and an estimate of future retirement benefits, fill out a Form #7004 Request for Social Security Statement, obtainable at your local office.(3) If you do not find and correct errors in your Social Security record within 3 years, they become part of your permanent record. Therefore, you might want to check on them every 3 years or so.(4) You can work during retirement, but if you earn too much it will reduce the size of the benefits you are receiving from age 62 up to your Normal Retirement Age. The limits on such earnings are currently $12,480 for 2006. Benefits are reduced by $1 for every $2 that you earn over this amount. After you attain your Normal Retirement Age, you may work as much as you want with no reduction in benefits, although they may become taxable if you earn too much.(5) You can increase the size of your retirement benefit by delaying collecting your benefits and by remaining on the job past full retirement age. This higher benefit comes from extra earnings toward your account and a credit awarded for this patience, ranging from 3% to 8% of your be
    r> · DECnet
    · Appletalk
    · Banyan Vines
    · Xerox Network System (XNS)

    Outside a network, specialized devices called ROUTES are used to perform the routing process of forwarding packets between networks. Routers are connected to the edges of two or more networks to provide connectivity between them. These devices are usually dedicated machines with specialized hardware and software to speed up the routing process. These devices send and receive routing information to each other about networks that they can and cannot reach. Routers examine all routes to a destination, determine which routes have the best metric, and insert one or more routes into the IP routing table on the router. By maintaining a current list of known routes, routers can quicky and efficiently send your information on it's way when received.

    There are many companies that produce routers: Cisco, Juniper, Bay, Nortel, 3Com, Cabletron, etc. Each company's product is different in how it is configured, but most will interoperate so long as they share common physical and data link layer protocols (Cisco HDLC or PPP over Serial, Ethernet etc.). Before purchasing a router for your business, always check with your Internet provider to see what equipment they use, and choose a router, which will interoperate with your Internet provider's equipment.

    NON-ROUTABLE PROTOCOLS

    NON-ROUTABLE PROTOCOLS cannot survive being routed. Non-routable protocols presume that all computers they will ever communicate with are on the same network (to get them working in a routed environment, you must bridge the networks). Todays modern networks are not very tolerant of protocols that do not understand the concept of a multi-segment network and most of these protocols are dying or falling out of use.

    · NetBEUI
    · DLC
    · LAT
    · DRP
    · MOP

    RIP (Routing Information Protocol)

    RIP is a dynamic internetwork routing protocol primary used in interior routing environments. A dynamic routing protocol, as opposed to a static routing protocol, automatically discovers routes and builds routing tables. Interior environments are typically private networks (autonomous systems). In contrast, exterior routing protocols such as BGP are used to exchange route summaries between autonomous systems. BGP is used among autonomous systems on the Internet.

    RIP uses the distance-vector algorithm developed by Bellman and Ford (Bellman-Ford algorithm).

    Routing Information Protocol

    Background

    The Routing Information Protocol, or RIP, as it is more commonly called, is one of the most enduring of all routing protocols. RIP is also one of the more easily confused protocols because a variety of RIP-like routing protocols proliferated, some of which even used the same name! RIP and the myriad RIP-like protocols were based on the same set of algorithms that use distance vectors to mathematically compare routes to identify the best path to any given destination address. These algorithms emerged from academic research that dates back to 1957.

    Today's open standard version of RIP, sometimes referred to as IP RIP, is formally defined in two documents: Request For Comments (RFC) 1058 and Internet Standard (STD) 56. As IP-based networks became both more numerous and greater in size, it became apparent to the Internet Engineering Task Force (IETF) that RIP needed to be updated. Consequently, the IETF released RFC 1388 in January 1993, which was then superceded in November 1994 by RFC 1723, which describes RIP 2 (the second version of RIP). These RFCs described an extension of RIP's capabilities but did not attempt to obsolete the previous version of RIP. RIP 2 enabled RIP messages to carry more information, which permitted the use of a simple authentication mechanism to secure table updates. More importantly, RIP 2 supported subnet masks, a critical feature that was not available in RIP.

    This chapter summarizes the basic capabilities and features associated with RIP. Topics include the routing update process, RIP routing metrics, routing stability, and routing timers.

    Routing Updates

    RIP sends routing-update messages at regular intervals and when the network topology changes. When a router receives a routing update that includes changes to an entry, it updates its routing table to reflect the new route. The metric value for the path is increased by 1, and the sender is indicated as the next hop. RIP routers maintain only the best route (the route with the lowest metric value) to a destination. After updating its routing table, the router immediately begins transmitting routing updates to inform other network routers of the change. These updates are sent independently of the regularly scheduled updates that RIP routers send.

    RIP Routing Metric

    RIP uses a single routing metric (hop count) to measure the distance between the source and a destination network. Each hop in a path from source to destination is assigned a hop count value, which is typically 1. When a router receives a routing update that contains a new or changed destination network entry, the router adds 1 to the metric value indicated in the update and enters the network in the routing table. The IP address of the sender is used as the next hop.

    RIP Stability Features

    RIP prevents routing loops from continuing indefinitely by implementing a limit on the number of hops allowed in a path from the source to a destination. The maximum number of hops in a path is 15. If a router receives a routing update that contains a new or changed entry, and if increasing the metric value by 1 causes the metric to be infinity (that is, 16), the network destination is considered unreachable. The downside of this stability feature is that it limits the maximum diameter of a RIP network to less than 16 hops.

    RIP includes a number of other stability features that are common to many routing protocols. These features are designed to provide stability despite potentially rapid changes in a network's topology. For example, RIP implements the split horizon and holddown mechanisms to prevent incorrect routing information from being propagated.

    RIP Timers

    RIP uses numerous timers to regulate its performance. These include a routing-update timer, a route-timeout timer, and

    Writing Articles About Vehicles
    If you are an article marketer and you sell something on the Internet that has to do with automobiles or vehicles then you know you wish to get the targeted traffic that is interested in such things. This means you need to write articles that are about vehicles. You need to write about engines and motors, tires and brakes, stereo systems and GPS systems, as well as places to go and things to do in vehicles.Often online article marketers will feel that they have already written all the possible articles they can possibly ever write about automobiles, trucks, motorcycles or motor homes. They have written about hybrid vehicles, all the latest models and all the safety gear, what else could they possibly write next?One way to come up with more articles is to consider coming up with new and fancy titles. Another way to subscribe to several automotive magazines and each month scour through them. It also makes sense to watch the Discovery Channel where they have many shows about automobiles, motorcycles and trucks.Recently, I have discovered after writing over 500 articles about different kinds of vehicles that it was not such a big number at all. Indeed, when I went to one major automotive trade show, picked up all the literature (sacks full of it) and then went to the car show afterwards, I learned that there were hundreds and hundreds of more articles I could write about vehicles.In fact, my previous writing barely scratched the surface and it made me laugh because I thought I could not write another article about vehicles or automobiles. Boy was I wrong about that. Please consider all this in 2006.
    , you must bridge the networks). Todays modern networks are not very tolerant of protocols that do not understand the concept of a multi-segment network and most of these protocols are dying or falling out of use.

    · NetBEUI
    · DLC
    · LAT
    · DRP
    · MOP

    RIP (Routing Information Protocol)

    RIP is a dynamic internetwork routing protocol primary used in interior routing environments. A dynamic routing protocol, as opposed to a static routing protocol, automatically discovers routes and builds routing tables. Interior environments are typically private networks (autonomous systems). In contrast, exterior routing protocols such as BGP are used to exchange route summaries between autonomous systems. BGP is used among autonomous systems on the Internet.

    RIP uses the distance-vector algorithm developed by Bellman and Ford (Bellman-Ford algorithm).

    Routing Information Protocol

    Background

    The Routing Information Protocol, or RIP, as it is more commonly called, is one of the most enduring of all routing protocols. RIP is also one of the more easily confused protocols because a variety of RIP-like routing protocols proliferated, some of which even used the same name! RIP and the myriad RIP-like protocols were based on the same set of algorithms that use distance vectors to mathematically compare routes to identify the best path to any given destination address. These algorithms emerged from academic research that dates back to 1957.

    Today's open standard version of RIP, sometimes referred to as IP RIP, is formally defined in two documents: Request For Comments (RFC) 1058 and Internet Standard (STD) 56. As IP-based networks became both more numerous and greater in size, it became apparent to the Internet Engineering Task Force (IETF) that RIP needed to be updated. Consequently, the IETF released RFC 1388 in January 1993, which was then superceded in November 1994 by RFC 1723, which describes RIP 2 (the second version of RIP). These RFCs described an extension of RIP's capabilities but did not attempt to obsolete the previous version of RIP. RIP 2 enabled RIP messages to carry more information, which permitted the use of a simple authentication mechanism to secure table updates. More importantly, RIP 2 supported subnet masks, a critical feature that was not available in RIP.

    This chapter summarizes the basic capabilities and features associated with RIP. Topics include the routing update process, RIP routing metrics, routing stability, and routing timers.

    Routing Updates

    RIP sends routing-update messages at regular intervals and when the network topology changes. When a router receives a routing update that includes changes to an entry, it updates its routing table to reflect the new route. The metric value for the path is increased by 1, and the sender is indicated as the next hop. RIP routers maintain only the best route (the route with the lowest metric value) to a destination. After updating its routing table, the router immediately begins transmitting routing updates to inform other network routers of the change. These updates are sent independently of the regularly scheduled updates that RIP routers send.

    RIP Routing Metric

    RIP uses a single routing metric (hop count) to measure the distance between the source and a destination network. Each hop in a path from source to destination is assigned a hop count value, which is typically 1. When a router receives a routing update that contains a new or changed destination network entry, the router adds 1 to the metric value indicated in the update and enters the network in the routing table. The IP address of the sender is used as the next hop.

    RIP Stability Features

    RIP prevents routing loops from continuing indefinitely by implementing a limit on the number of hops allowed in a path from the source to a destination. The maximum number of hops in a path is 15. If a router receives a routing update that contains a new or changed entry, and if increasing the metric value by 1 causes the metric to be infinity (that is, 16), the network destination is considered unreachable. The downside of this stability feature is that it limits the maximum diameter of a RIP network to less than 16 hops.

    RIP includes a number of other stability features that are common to many routing protocols. These features are designed to provide stability despite potentially rapid changes in a network's topology. For example, RIP implements the split horizon and holddown mechanisms to prevent incorrect routing information from being propagated.

    RIP Timers

    RIP uses numerous timers to regulate its performance. These include a routing-update timer, a route-timeout timer, and

    A Children's Injury Lawyer Talks About Settlement of Children's Injury Claims
    When an injury case involving a minor is settled, the courts often require special precautions to protect the minor. The court is concerned that the settlement proceeds be used solely for the best interests of the child.Typically, the lawyer is required to file a petition requesting court approval of the settlement. The petition sets forth the terms of the settlement and why the attorney believes it is in the child’s best interest. The court may require parental consent as well. Other issues that the petition will address include any liens on the settlement, the age of the child, the injuries suffered and the present condition of the minor.Some courts require a hearing so that the court can question the attorney, the parents and even the child. Other courts will approve the petition without a hearing if it appears on its face to be proper.Once the petition is approved, the attorney and/or the parents set up an interest bearing trust account. This account will be virtually untouchable until the minor turns 18. If the minor is in dire need of funds, the attorney will have to petition the court for early withdrawal.Where the court is especially concerned about parental neglect, the court may require that the attorney, and not the parent, take responsibility for setting up the account. The court is concerned that since the parent cannot spend the money, the check may never be deposited. The court may require that the attorney file a certification attesting to the fact that the account was indeed set up promptly after the court’s approval of the settlement.A final protection involves the attorney’s fee. Even in states that do not ordinarily cap the percentage an attorney can charge in an injury ca
    defined in two documents: Request For Comments (RFC) 1058 and Internet Standard (STD) 56. As IP-based networks became both more numerous and greater in size, it became apparent to the Internet Engineering Task Force (IETF) that RIP needed to be updated. Consequently, the IETF released RFC 1388 in January 1993, which was then superceded in November 1994 by RFC 1723, which describes RIP 2 (the second version of RIP). These RFCs described an extension of RIP's capabilities but did not attempt to obsolete the previous version of RIP. RIP 2 enabled RIP messages to carry more information, which permitted the use of a simple authentication mechanism to secure table updates. More importantly, RIP 2 supported subnet masks, a critical feature that was not available in RIP.

    This chapter summarizes the basic capabilities and features associated with RIP. Topics include the routing update process, RIP routing metrics, routing stability, and routing timers.

    Routing Updates

    RIP sends routing-update messages at regular intervals and when the network topology changes. When a router receives a routing update that includes changes to an entry, it updates its routing table to reflect the new route. The metric value for the path is increased by 1, and the sender is indicated as the next hop. RIP routers maintain only the best route (the route with the lowest metric value) to a destination. After updating its routing table, the router immediately begins transmitting routing updates to inform other network routers of the change. These updates are sent independently of the regularly scheduled updates that RIP routers send.

    RIP Routing Metric

    RIP uses a single routing metric (hop count) to measure the distance between the source and a destination network. Each hop in a path from source to destination is assigned a hop count value, which is typically 1. When a router receives a routing update that contains a new or changed destination network entry, the router adds 1 to the metric value indicated in the update and enters the network in the routing table. The IP address of the sender is used as the next hop.

    RIP Stability Features

    RIP prevents routing loops from continuing indefinitely by implementing a limit on the number of hops allowed in a path from the source to a destination. The maximum number of hops in a path is 15. If a router receives a routing update that contains a new or changed entry, and if increasing the metric value by 1 causes the metric to be infinity (that is, 16), the network destination is considered unreachable. The downside of this stability feature is that it limits the maximum diameter of a RIP network to less than 16 hops.

    RIP includes a number of other stability features that are common to many routing protocols. These features are designed to provide stability despite potentially rapid changes in a network's topology. For example, RIP implements the split horizon and holddown mechanisms to prevent incorrect routing information from being propagated.

    RIP Timers

    RIP uses numerous timers to regulate its performance. These include a routing-update timer, a route-timeout timer, and

    Purchase Repossessed Houses Put Up For Auction By The Banks
    Foreclosures can happen to anybody. And with many people having no homes, a great number of other homeowners are bound to lose theirs. This will give a chance for people looking for cheap homes and real estate agents who resell repossessed homes to purchase foreclosed houses put up for auction by the banks.Banks are well known lending institutions. The bank extends loans to countless individuals and some of them use their homes as collaterals. Before a loan is granted, the bank clearly states its rules; and these rules should be strictly followed. The contract signed by the borrower stipulates such rules and conditions, which they are deemed to follow.However, certain events can cause a lot of borrowers to miss out on their payments like divorce, illness, vices, and job loss. After three missed payments, the banks usually send their clients a notice. Never disregard such notice unless you want the bank to foreclose your property. The bank is not merciless and you were clearly notified and informed about matters concerning your loan and collateral. Therefore, you can just watch the bank's personnel as they takeover your property.Foreclosed houses are put up in an auction. Repossessed houses are already part of the banks assets. In a way, the bank is at a loss since you were unable to pay for your loan. In order to regain their loss, they hold auctions for repossessed homes.A lot of individuals find repossessed houses a good deal. For a cheap price, they can actually purchase a new house. If you're interested in a bank repossessed house auction, you must submit your price rate. The highest bid will win, and the person can get the property.The main advantage of repossessed or foreclosed properties is affo
    larly scheduled updates that RIP routers send.

    RIP Routing Metric

    RIP uses a single routing metric (hop count) to measure the distance between the source and a destination network. Each hop in a path from source to destination is assigned a hop count value, which is typically 1. When a router receives a routing update that contains a new or changed destination network entry, the router adds 1 to the metric value indicated in the update and enters the network in the routing table. The IP address of the sender is used as the next hop.

    RIP Stability Features

    RIP prevents routing loops from continuing indefinitely by implementing a limit on the number of hops allowed in a path from the source to a destination. The maximum number of hops in a path is 15. If a router receives a routing update that contains a new or changed entry, and if increasing the metric value by 1 causes the metric to be infinity (that is, 16), the network destination is considered unreachable. The downside of this stability feature is that it limits the maximum diameter of a RIP network to less than 16 hops.

    RIP includes a number of other stability features that are common to many routing protocols. These features are designed to provide stability despite potentially rapid changes in a network's topology. For example, RIP implements the split horizon and holddown mechanisms to prevent incorrect routing information from being propagated.

    RIP Timers

    RIP uses numerous timers to regulate its performance. These include a routing-update timer, a route-timeout timer, and a route-flush timer. The routing-update timer clocks the interval between periodic routing updates. Generally, it is set to 30 seconds, with a small random amount of time added whenever the timer is reset. This is done to help prevent congestion, which could result from all routers simultaneously attempting to update their neighbors. Each routing table entry has a route-timeout timer associated with it. When the route-timeout timer expires, the route is marked invalid but is retained in the table until the route-flush timer expires.

    Packet Formats
    The following section focuses on the IP RIP and IP RIP 2 packet formats illustrated in Figures 44-1 and 44-2. Each illustration is followed by descriptions of the fields illustrated. RIP Packet Format

    · Command—Indicates whether the packet is a request or a response. The request asks that a router send all or part of its routing table. The response can be an unsolicited regular routing update or a reply to a request. Responses contain routing table entries. Multiple RIP packets are used to convey information from large routing tables.

    · Version number—Specifies the RIP version used. This field can signal different potentially incompatible versions.

    · Zero—This field is not actually used by RFC 1058 RIP; it was added solely to provide backward compatibility with prestandard varieties of RIP. Its name comes from its defaulted value: zero.

    · Address-family identifier (AFI)—Specifies the address family used. RIP is designed to carry routing information for several different protocols. Each entry has an address-family identifier to indicate the type of address being specified. The AFI for IP is 2.

    · Address—Specifies the IP address for the entry.

    · Metric—Indicates how many internetwork hops (routers) have been traversed in the trip to the destination. This value is between 1 and 15 for a valid route, or 16 for an unreachable route.

    Note: Up to 25 occurrences of the AFI, Address, and Metric fields are permitted in a single IP RIP packet. (Up to 25 destinations can be listed in a single RIP packet.)

    RIP 2 Packet Format

    · Command—Indicates whether the packet is a request or a response. The request asks that a router send all or a part of its routing table. The response can be an unsolicited regular routing update or a reply to a request. Responses contain routing table entries. Multiple RIP packets are used to convey information from large routing tables.

    · Version—Specifies the RIP version used. In a RIP packet implementing any of the RIP 2 fields or using authentication, this value is set to 2.

    · Unused—Has a value set to zero.

    · Address-family identifier (AFI)—Specifies the address family used. RIPv2's AFI field functions identically to RFC 1058 RIP's AFI field, with one exception: If the AFI for the first entry in the message is 0xFFFF, the remainder of the entry contains authentication information. Currently, the only authentication type is simple password.

    · Route tag—Provides a method for distinguishing between internal routes (learned by RIP) and external routes (learned from other protocols).

    · IP address—Specifies the IP address for the entry.

    · Subnet mask—Contains the subnet mask for the entry. If this field is zero, no subnet mask has been specified for the entry.

    ·Next hop—Indicates the IP address of the next hop to which packets for the entry should be forwarded.

    · Metric—Indicates how many internetwork hops (routers) have been traversed in the trip to the destination. This value is between 1 and 15 for a valid route, or 16 for an unreachable route.

    Note: Up to 25 occurrences of the AFI, Address, and Metric fields are permitted in a single IP RIP packet. That is, up to 25 routing table entries can be listed in a single RIP packet. If the AFI specifies an authenticated message, only 24 routing table entries can be specified. Given that individual table entries aren't fragmented into multiple packets, RIP does not need a mechanism to resequence datagrams bearing routing table updates from neighboring routers.

    Summary

    Despite RIP's age and the emergence of more sophisticated routing protocols, it is far from obsolete. RIP is mature, stable, widely supported, and easy to configure. Its simplicity is well suited for use in stub networks and in small autonomous systems that do not have enough redundant paths to warrant the overheads of a more sophisticated protocol.

    Review Questions

    Q—Name RIP's various stability features.
    A—RIP has numerous stability features, the most obvious of which is RIP's maximum hop count. By placing a finite limit on the number of hops that a route can take, routing loops are discouraged, if not completely eliminated. Other stability features include its various timing mechanisms that help ensure that the routing table contains only valid routes, as well as split horizon and holddown mechanisms that prevent incorrect routing information from being disseminated throughout the network.

    Q—What is the purpose of the timeout timer?
    A—The timeout timer is used to help purge invalid routes from a RIP node. Routes that aren't refreshed for a given period of time are likely invalid because of some change in the network. Thus, RIP maintains a timeout timer for each known route. When a route's timeout timer expires, the route is marked invalid but is retained in the table until the route-flush timer expires.

    Q—What two capabilities are supported by RIP 2 but not RIP?
    A—RIP 2 enables the use of a simple authentication mechanism to secure table updates. More importantly, RIP 2 supports subnet masks, a critical feature that is not available in RIP.

    Q—What is the maximum network diameter of a RIP network?
    A—A RIP network's maximum diameter is 15 hops. RIP can count to 16, but that value is considered an error condition rather than a valid hop count.

    HTTP = HTML link (for blogs, profiles,phorums):
    <a href="http://www.added4u.com/article/175290/added4u-Routing-Routed-and-NonRoutable-Protocols.html">Routing, Routed, and Non-Routable Protocols</a>

    BB link (for phorums):
    [url=http://www.added4u.com/article/175290/added4u-Routing-Routed-and-NonRoutable-Protocols.html]Routing, Routed, and Non-Routable Protocols[/url]

    Related Articles:

    Search... Search... Search Your Way To eBay Cash!

    Creating A Successful Ezine - 4 Ways To Profit From Your Ezine

    If You Build It-He Will Come-Not!

    Bookmark it: del.icio.us digg.com reddit.com netvouz.com google.com yahoo.com technorati.com furl.net bloglines.com socialdust.com ma.gnolia.com newsvine.com slashdot.org simpy.com shadows.com blinklist.com