NDLI: Network-Wide Prediction of BGP Routes

Content Provider	IEEE Xplore Digital Library
Author	Feamster, N. Rexford, J.
Copyright Year	1993
Abstract	This paper presents provably correct algorithms for computing the outcome of the BGP route-selection process for each router in a network, without simulating the complex details of BGP message passing. The algorithms require only static inputs that can be easily obtained from the routers: the BGP routes learned from neighboring domains, the import policies configured on the BGP sessions, and the internal topology. Solving the problem would be easy if the route-selection process were deterministic and every router received all candidate BGP routes. However, two important features of BGP-the Multiple Exit Discriminator (MED) attribute and route reflectors-violate these properties. After presenting a simple route-prediction algorithm for networks that do not use these features, we present algorithms that capture the effects of the MED attribute and route reflectors in isolation. Then, we explain why the interaction between these two features precludes efficient route prediction. These two features also create difficulties for the operation of BGP itself, leading us to suggest improvements to BGP that achieve the same goals as MED and route reflection without introducing the negative side effects
Sponsorship	IEEE Computer Society IEEE Communications Society Association for Computing Machinery (ACM)
Starting Page	253
Ending Page	266
Page Count	14
File Size	786066
File Format	PDF
ISSN	10636692
Volume Number	15
Issue Number	2
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2007-04-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Computational modeling Network topology Routing protocols Spine Costs Computer networks Message passing Reflection Communication system traffic control Algorithm design and analysis routing Networks protocols
Content Type	Text
Resource Type	Article
Subject	Computer Networks and Communications Electrical and Electronic Engineering Computer Science Applications Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Modeling the routing of an autonomous system with C-BGP

TIE Breaking: Tunable Interdomain Egress Selection

BGP routing policies in ISP networks

Efficient algorithm for virtual topology design in multihop lightwave networks

New dynamic SPT algorithm based on a ball-and-string model

Opportunity Cost Analysis for Dynamic Wavelength Routed Mesh Networks

Integrated routing algorithms for anycast messages

Design and performance of a network-processor-based intelligent DSLAM

Reconfiguration of spare capacity for MPLS-based recovery in the Internet backbone networks

Network-Wide Prediction of BGP Routes

Similar Documents

Modeling the routing of an autonomous system with C-BGP

TIE Breaking: Tunable Interdomain Egress Selection

BGP routing policies in ISP networks

Efficient algorithm for virtual topology design in multihop lightwave networks

New dynamic SPT algorithm based on a ball-and-string model

Opportunity Cost Analysis for Dynamic Wavelength Routed Mesh Networks

Integrated routing algorithms for anycast messages

Design and performance of a network-processor-based intelligent DSLAM

Reconfiguration of spare capacity for MPLS-based recovery in the Internet backbone networks

Network-Wide Prediction of BGP Routes