Thumbnail
Access Restriction
Subscribed

Author Cittadini, Luca ♦ Battista, Giuseppe Di ♦ Rimondini, Massimo
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©2012
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword BGP ♦ SPP ♦ SPVP ♦ Interdomain routing ♦ Routing policies ♦ Safety ♦ Stability
Abstract Most routing protocols guarantee convergence to a stable routing state. That is, in the absence of topology or configuration changes, each router will eventually find a stable route to any destination. However, this is not the case for policy-based routing protocols, for example, the BGP protocol used as a de facto standard for interdomain routing. The interaction of not-so-complex BGP configurations can cause permanent oscillations of routing. Several models and algorithms have been proposed in the literature to study routing oscillations. This article surveys state-of-the-art contributions in this field, with a special emphasis on algorithmic and combinatorial aspects.
ISSN 03600300
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2012-09-07
Publisher Place New York
e-ISSN 15577341
Journal ACM Computing Surveys (CSUR)
Volume Number 44
Issue Number 4
Page Count 40
Starting Page 1
Ending Page 40


Open content in new tab

   Open content in new tab
Source: ACM Digital Library