• DocumentCode
    3332618
  • Title

    RIP-MTI: A New Way to Cope with Routing Loops

  • Author

    Steigner, Ch ; Dickel, H. ; Keupen, T.

  • Author_Institution
    Univ. of Koblenz-Landau, Koblenz
  • fYear
    2008
  • fDate
    13-18 April 2008
  • Firstpage
    626
  • Lastpage
    632
  • Abstract
    We introduce a new downward compatible routing protocol called Routing Information Protocol with Minimal Topology Information (RIP-MTI) which is based on the simple Routing Information Protocol (RIP). We exploit the distance vector updates more thoroughly than common RIP-protocols, and therefore, need not alter the interactive behavior of the Routing Information Protocol. With this approach, we are able to recognize loops and avoid the well known Counting to Infinity problem of distance vector routing. This new protocol can recognize and reject updates which have made their way along loops by evaluating simple metric-based equations.
  • Keywords
    routing protocols; telecommunication network topology; counting to infinity problem; distance vector routing; loop recognization; metric-based equation; minimal topology information; routing information protocol; Assembly; Convergence; Equations; H infinity control; Linux; Network topology; Open source software; Routing protocols; Stability; Testing; RIP; RIP-MTI; communication networks; internetworking; intra-domain routing; network stability; routing algorithms; routing convergence;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Networking, 2008. ICN 2008. Seventh International Conference on
  • Conference_Location
    Cancun
  • Print_ISBN
    978-0-7695-3106-9
  • Electronic_ISBN
    978-0-7695-3106-9
  • Type

    conf

  • DOI
    10.1109/ICN.2008.58
  • Filename
    4498232