SwePub
Sök i LIBRIS databas

  Extended search

onr:"swepub:oai:DiVA.org:kth-222338"
 

Search: onr:"swepub:oai:DiVA.org:kth-222338" > Local transit polic...

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist
  • Chiesa, Marco,1987-Roma Tre University, Italy (author)

Local transit policies and the complexity of BGP Stability Testing

  • Article/chapterEnglish2011

Publisher, publication year, extent ...

  • Institute of Electrical and Electronics Engineers (IEEE),2011
  • printrdacarrier

Numbers

  • LIBRIS-ID:oai:DiVA.org:kth-222338
  • https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-222338URI
  • https://doi.org/10.1109/INFCOM.2011.5935136DOI

Supplementary language notes

  • Language:English
  • Summary in:English

Part of subdatabase

Classification

  • Subject category:ref swepub-contenttype
  • Subject category:kon swepub-publicationtype

Notes

  • QC 20180207
  • BGP, the core protocol of the Internet backbone, is renowned to be prone to oscillations. Despite prior work shed some light on BGP stability, many problems remain open. For example, determining how hard it is to check that a BGP network is safe, i.e., it is guaranteed to converge, has been an elusive research goal up to now. In this paper, we address several problems related to BGP stability, stating the computational complexity of testing if a given configuration is safe, is robust, or is safe under filtering. Further, we determine the computational complexity of checking popular sufficient conditions for stability. We adopt a model that captures Local Transit policies, i.e., policies that are functions only of the ingress and the egress points. The focus on Local Transit policies is motivated by the fact that they represent a configuration paradigm commonly used by network operators. We also address the same BGP stability problems in the widely adopted SPP model. Unfortunately, we find that the most interesting problems are computationally hard even if policies are restricted to be as expressive as Local Transit policies. Our findings suggest that the computational intractability of BGP stability be an intrinsic property of policy-based path vector routing protocols that allow policies to be specified in complete autonomy.

Subject headings and genre

Added entries (persons, corporate bodies, meetings, titles ...)

  • Cittadini, L. (author)
  • Di Battista, G. (author)
  • Vissicchio, S. (author)
  • Roma Tre University, Italy (creator_code:org_t)

Related titles

  • In:INFOCOM, 2011 Proceedings IEEE: Institute of Electrical and Electronics Engineers (IEEE), s. 2957-29659781424499212

Internet link

Find in a library

To the university's database

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist

Search outside SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view