Avoiding Loops and Packet Losses in ISP Networks
Keywords:
ISP networks, OUTFC (Ordered Updating Technique with Fast Convergence), Link Failures, Reverse Shortest Path Tree (RSPT)
Abstract
Even in well managed Large ISP networks failures of links and routers are common Due to these failures the routers update their routing tables Transient loops can occur in the networks when the routers adapt their forwarding tables In this paper a new approach is proposed that lets the network converge to its optimal state without loops and the related packet lossless The mechanism OUTFC-Ordered Updating Technique with Fast Convergence is based on an ordering of the updates of the forwarding tables of the routers and fast convergence Typically we have chosen a Network consisting of routers and Link costs for simulation Link failures are simulated Avoiding transient loops in each case is demonstrated by constructing a Reverse Shortest PathTree RSPT
Downloads
- Article PDF
- TEI XML Kaleidoscope (download in zip)* (Beta by AI)
- Lens* NISO JATS XML (Beta by AI)
- HTML Kaleidoscope* (Beta by AI)
- DBK XML Kaleidoscope (download in zip)* (Beta by AI)
- LaTeX pdf Kaleidoscope* (Beta by AI)
- EPUB Kaleidoscope* (Beta by AI)
- MD Kaleidoscope* (Beta by AI)
- FO Kaleidoscope* (Beta by AI)
- BIB Kaleidoscope* (Beta by AI)
- LaTeX Kaleidoscope* (Beta by AI)
How to Cite
Published
2011-05-15
Issue
Section
License
Copyright (c) 2011 Authors and Global Journals Private Limited
This work is licensed under a Creative Commons Attribution 4.0 International License.