A case study of OSPF behavior in a large enterprise network

Simple item page
dc.contributor.authorShaikh, A.
dc.contributor.authorIsett, C.
dc.contributor.authorGreenberg, A.
dc.contributor.authorRoughan, M.
dc.contributor.authorGottlieb, J.
dc.contributor.conferenceInternet Measurement Conference (2002 : Marseilles, France)
dc.date.issued2002
dc.description.abstractOpen Shortest Path First (OSPF) is widely deployed in IP networks to manage intra-domain routing. OSPF is a link-state protocol, in which routers reliably flood "Link State Advertisements" (LSAs), enabling each to build a consistent, global view of the routing topology. Reliable performance hinges on routing stability, yet the behavior of large operational OSPF networks is not well understood. In this paper, we provide a case study on the eharacteristics and dynamics of LSA traffic for a large enterprise network. This network consists of several hundred routers, distributed in tens of OSPF areas, and connected by LANs and private lines. For this network, we focus on LSA traffic and analyze: (a) the class of LSAs triggered by OSPF's soft-state refresh, (b) the class of LSAs triggered by events that change the status of the network, and (c) a class of "duplicate" LSAs received due to redundancy in OSPF's reliable LSA flooding mechanism. We derive the baseline rate of refresh-triggered LSAs automatically from network configuration information. We also investigate finer time scale statistical properties of this traffic, including burstiness, periodicity, and synchronization. We discuss root causes of event-triggered and duplicate LSA traffic, as well as steps identified to reduce this traffic (e.g., localizing a failing router or changing the OSPF configuration).
dc.description.statementofresponsibilityAman Shaikh, Chris Isett, Albert Greenberg, Matthew Roughan, Joel Gottlieb.
dc.identifier.citationProceedings of the Second Internet Measurement Workshop : IMW 2002 : Marseille, France, November 6-8, 2002 / sponsored by ACM SIGCOMM, in co-operation with USENIX, with generous support from: Sprint ... [et al.] (eds.)
dc.identifier.doi10.1145/637201.637236
dc.identifier.isbn158113603X
dc.identifier.orcidRoughan, M. [0000-0002-7882-7329]
dc.identifier.urihttp://hdl.handle.net/2440/37043
dc.language.isoen
dc.publisherACM Press
dc.publisher.placeNew York, NY, USA
dc.rights© 2002 ACM
dc.source.urihttps://doi.org/10.1145/637201.637236
dc.titleA case study of OSPF behavior in a large enterprise network
dc.typeConference paper
pubs.publication-statusPublished

Files

Collections

Mathematical Sciences publications