skip to main content
10.1145/2018436.2018525acmconferencesArticle/Chapter ViewAbstractPublication PagescommConference Proceedingsconference-collections
demonstration
Free access

OSPF failure reconvergence through SRG inference and prediction of link state advertisements

Published: 15 August 2011 Publication History

Abstract

We demonstrate machine learning augmented Open Shortest Path First (OSPF) routing which infers Shared Risk Groups (SRG) from link failure history. For an initial link failure matching an SRG, it predicts subsequent link state advertisements corresponding with that SRG, improving convergence and recovery times during multiple network failures.

References

[1]
ECODE project. http://www.ecode-project.eu/.
[2]
J. Moy. OSPF Version 2. RFC 2328, IETF, April 1998.
[3]
XORP, eXtensible Open Router Platform, http://www.xorp.org/
[4]
G. Das et al. Link state protocol data mining for shared risk link group detection. In 19th Int. Conf. on Computer Communications and Networks (ICCCN 2010), Zurich, Switzerland, August 2010.
[5]
G. Das et al. SRLG identification from time series analysis of link state data. In 3rd Int. Conf. on Communication Systems and Networks (COMSNET 2011), Bangalore, India, January 2011.
[6]
Demonstration video. http://users.ugent.be/bpuype/pub/sigcomm2011/

Index Terms

  1. OSPF failure reconvergence through SRG inference and prediction of link state advertisements

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image ACM Conferences
      SIGCOMM '11: Proceedings of the ACM SIGCOMM 2011 conference
      August 2011
      502 pages
      ISBN:9781450307970
      DOI:10.1145/2018436
      • cover image ACM SIGCOMM Computer Communication Review
        ACM SIGCOMM Computer Communication Review  Volume 41, Issue 4
        SIGCOMM '11
        August 2011
        480 pages
        ISSN:0146-4833
        DOI:10.1145/2043164
        Issue’s Table of Contents
      Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

      Sponsors

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 15 August 2011

      Check for updates

      Author Tags

      1. cognitive routing
      2. machine learning
      3. network recovery
      4. ospf
      5. shared risk group

      Qualifiers

      • Demonstration

      Conference

      SIGCOMM '11
      Sponsor:
      SIGCOMM '11: ACM SIGCOMM 2011 Conference
      August 15 - 19, 2011
      Ontario, Toronto, Canada

      Acceptance Rates

      SIGCOMM '11 Paper Acceptance Rate 32 of 223 submissions, 14%;
      Overall Acceptance Rate 462 of 3,389 submissions, 14%

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • 0
        Total Citations
      • 275
        Total Downloads
      • Downloads (Last 12 months)27
      • Downloads (Last 6 weeks)6
      Reflects downloads up to 14 Sep 2024

      Other Metrics

      Citations

      View Options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Get Access

      Login options

      Media

      Figures

      Other

      Tables

      Share

      Share

      Share this Publication link

      Share on social media