Delayed Internet routing convergence
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
An analysis of BGP multiple origin AS (MOAS) conflicts
IMW '01 Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement
On inferring and characterizing internet routing policies
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
HLP: a next generation inter-domain routing protocol
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
In search for an appropriate granularity to model routing policies
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Performance improvement of two-dimensional packet classification by filter rephrasing
IEEE/ACM Transactions on Networking (TON)
Scalable packet classification by TCAM entry encryption algorithm
Journal of High Speed Networks
Uncovering performance differences among backbone ISPs with Netdiff
NSDI'08 Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation
Sampling biases in network path measurements and what to do about it
Proceedings of the 9th ACM SIGCOMM conference on Internet measurement conference
Impact of prefix-match changes on IP reachability
Proceedings of the 9th ACM SIGCOMM conference on Internet measurement conference
Route oracle: where have all the packets gone?
ACM SIGMETRICS Performance Evaluation Review
IEEE Journal on Selected Areas in Communications - Special issue title on scaling the internet routing system: an interim report
Routing state distance: a path-based metric for network analysis
Proceedings of the 2012 ACM conference on Internet measurement conference
| Hi-index | 0.00 |
The notion of Internet Policy Atoms has been recently introduced in [1], [2] as groups of prefixes sharing a common BGP AS path at any Internet backbone router In this paper we further research these 'Atoms'. First we offer a new method for computing the Internet policy atoms, and use the RIPE RIS database [6] to derive their structure Second, we show that atoms remain stable with only about 2--3% of prefixes changing their atom membership in eight hour periods. We support the 'Atomic' nature of the policy atoms by showing BGP update and withdraw notifications carry updates for complete atoms in over 70% of updates, while the complete set of prefixes in an AS is carried in only 21% of updates. We track the locations where atoms are created (first different AS in the AS path going back from the common origin AS 1) showing 86% are split between the origin AS and it's peers thus supporting the assumption that they are created by policies. Finally applying atoms "real fife" applications we achieve a modest savings in BGP updates due to the low average prefix count in the atoms.