Results 11 - 20 of 170

Network-wide prediction of BGP routes

by Nick Feamster, Jennifer Rexford, Senior Member - In IEEE/ACM Trans. Networking , 2007
"... 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: t ..."
Abstract - Cited by 27 (7 self) - Add to MetaCart
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

Working Around BGP: An Incremental Approach to Improving Security and Accuracy of Interdomain Routing

by Geoffrey Goodell, William Aiello, Timothy Griffin, John Ioannidis, Patrick McDaniel, Aviel Rubin - In Proc. NDSS , 2003
"... BGP is essential to the operation of the Internet, but is vulnerable to both accidental failures and malicious attacks. We propose a new protocol that works in concert with BGP, which Autonomous Systems will use to help detect and mitigate accidentally or maliciously introduced faulty routing inform ..."
Abstract - Cited by 141 (13 self) - Add to MetaCart
information. The protocol differs from previous efforts at securing BGP in that it is receiver-driven, meaning that there is a mechanism for recipients of BGP UPDATE messages to corroborate the information they receive and to provide feedback. We argue that our new protocol can be adopted incrementally

BGP-Inspect: Extracting information from raw BGP data

by Dionysus Blazakis, Manish Karir, John S. Baras - in Proc. IEEE/IFIP Network Operations and Management Symposium , 2006
"... Abstract — While BGP routing datasets, consisting of raw routing data, are freely available and easy to obtain, extracting any useful information is tedious. Currently, researcher and network operators implement their own custom data processing tools and scripts. A single tool that provides easy acc ..."
Abstract - Cited by 7 (1 self) - Add to MetaCart
access to the information within large raw BGP data-sets could be used by both communities to avoid re-writing these tools each time. Moreover, providing not just raw BGP messages, but some commonly used summary statistics as well can help guide deeper custom analyses. Based on these observations

Topology Inference from BGP Routing Dynamics

by David Andersen Nick, David G. Andersen, Nick Feamster, Steve Bauer, Hari Balakrishnan - In Proc. Internet Measurement Workshop , 2002
"... This paper describes a method of inferring logical relationships between network prefixes within an Autonomous System (AS) using only passive monitoring of BGP messages. By clustering these prefixes based upon similarities between their update times, we create a hierarchy linking the prefixes wi ..."
Abstract - Add to MetaCart
This paper describes a method of inferring logical relationships between network prefixes within an Autonomous System (AS) using only passive monitoring of BGP messages. By clustering these prefixes based upon similarities between their update times, we create a hierarchy linking the prefixes

Measures of Self-Similarity of BGP Updates and Implications for Securing BGP

by Geoff Huston
"... Abstract. Techniques for authenticating BGP protocol objects entail the inspection of additional information in the form of authentication credentials that can be used to validate the contents of the BGP update message. The additional task of validation of these credentials when processing BGP messa ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
Abstract. Techniques for authenticating BGP protocol objects entail the inspection of additional information in the form of authentication credentials that can be used to validate the contents of the BGP update message. The additional task of validation of these credentials when processing BGP

Observation and Analysis of BGP Behavior Under Stress

by Lan Wang, Xiaoliang Zhao, Dan Pei, Randy Bush, Daniel Massey, Allison Mankin, S. Felix Wu, Lixia Zhang - in Proceedings of the ACM SIGCOMM Internet Measurement Workshop 2002 , 2002
"... Despite BGP's critical importance as the de-facto Internet inter-domain routing protocol, there is little understanding of how BGP actually performs under stressful conditions when dependable routing is most needed. In this paper, we examine BGP's behavior during one stressful period, the ..."
Abstract - Cited by 103 (27 self) - Add to MetaCart
, the Code Red/Nimda attack on September 18, 2001. The attack was correlated with a 30-fold increase in the BGP update messages at a monitoring point which peers with a number of Internet service providers. Our examination of BGP's behavior during the event concludes that BGP exhibited no significant

Bringing Order to BGP: Decreasing Time and Message Complexity

by Anat Bremler-barr, Nir Chen, Jussi Kangasharju, Osnat (ossi Mokryn, Yuval Shavitt
"... routing protocol of the internet, generates lots of traffic after changes in the underlying backbone. Previous papers [1], [2] show that BGP suffers from high convergence delay and high message complexity after a fail down (detachment) of a network, due to path exploration caused by a limited versio ..."
Abstract - Cited by 3 (1 self) - Add to MetaCart
routing protocol of the internet, generates lots of traffic after changes in the underlying backbone. Previous papers [1], [2] show that BGP suffers from high convergence delay and high message complexity after a fail down (detachment) of a network, due to path exploration caused by a limited

Network-Wide Prediction of BGP Routes

by unknown authors
"... 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: ..."
Abstract - Add to MetaCart
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

Network-Wide Prediction of BGP Routes

by unknown authors
"... 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: ..."
Abstract - Add to MetaCart
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

Network-Wide Prediction of BGP Routes

by unknown authors
"... 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: ..."
Abstract - Add to MetaCart
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
Results 11 - 20 of 170