(Un)-stable routing in the Internet: A survey from the algorithmic perspective

3Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The Internet is a huge and complex network in which Internet Service Providers (ISPs) compete for revenue. In order to support the establishment of commercial agreements, routing in the Internet must therefore allow each ISP to autonomously set up its own routing policies while ensuring global connectivity. The Border Gateway Protocol (BGP) allows to achieve both these goals, and is the currently adopted protocol for Internet routing. It can be shown that the interaction of not-so-unlikely BGP configurations adopted at different ISPs can cause permanent oscillations of routing. Several models and algorithms have been proposed in the literature to study routing oscillations. The goal of this paper is to provide a survey of state of the art contributions in this field with an emphasis on the algorithmic aspects. © 2008 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Cittadini, L., Di Battista, G., & Rimondini, M. (2008). (Un)-stable routing in the Internet: A survey from the algorithmic perspective. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5344 LNCS, pp. 1–13). https://doi.org/10.1007/978-3-540-92248-3_1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free