Resilient routing in the internet

摘要: Although it is widely known that the Internet not prone to random failures, unplanned failures due to attacks can be very damaging. This prevents many organisations from deploying beneficial operations through Internet. In general, data delivered a source destination via series of routers (i.e routing path). These routers employ protocols compute best paths based on routing information they possess. However, when failure occurs, must re-construct their routing tables, which may take several seconds complete. Evidently, most losses occur during this period. IP Fast Re-Route (IPFRR), Multi-Topology (MT) routing, and overlays are examples of solutions proposed handle network failures. techniques alleviate packet different extents, yet none have provided optimal solutions. thesis focuses identifying fundamental routing problem convergence process. It describes mechanisms each existing technique as well as its pros cons. Furthermore, presents new for fast re-routing follows. Enhanced Loop-Free Alternates (E-LFAs) increase repair coverage techniques, Loop-Free (LFAs). addition, two namely, Full Failure Recovery (F3R) and fast re-route using Alternate Next Hop Counters (ANHC), offer full protection against any single link failures. Nevertheless, former requires significantly higher computational overheads and incurs longer backup routes. Both proved complete correct while ANHC neither requires major modifications traditional paradigm nor incurs significant overheads. Furthermore, in presence does jeopardise other operable parts network. As emerging applications require reliability, multiple scenarios cannot ignored. Most able only or dual cases. thesis provides an insight novel approach Packet Re-cycling (PR), capable handling any number oriented network. That is, packets forwarded successfully long as path between available. Since Internet-based services applications continue advance, improving resilience will challenging research topic the decades come.