Hi Brian, Yes CAIDA has been an excellent source of data and tools for anyone concerned about Internet topology or BGP operation.
It can also accurately detect a lot of anomalies and report them based on the comparison of historical data vs real time data (for example ARTEMIS). But the proposed here mechanism compares in real time BGP updates to an oracle database for AS-PATH content accuracy. So any data which is based on AS-PATHs itself (to create the relations) I am afraid can not be used as such baseline src to validate AS-PATHs correctness. Thx a lot, R. On Thu, Mar 14, 2019 at 1:20 AM Brian Dickson <[email protected]> wrote: > CAIDA has lots of data sets, tools, etc. > > Here's one of the README files I grabbed, with some URLs that would help > you find the specifics, and reference materials (papers) on what/why/how > they are able to infer these relationships. > > Brian > > The 'serial-2' directory contains AS relationships that combine the >> >> 'serial-1' AS relationships (inferred using the method described in >> >> "AS Relationships, Customer Cones, and Validation" published in >> >> IMC 2013, http://www.caida.org/publications/papers/2013/asrank/), >> >> with AS relationships inferred from Ark traceroutes, and from >> >> multilateral peering >> >> ( >> http://www.caida.org/publications/papers/2013/inferring_multilateral_peering/ >> ). >> >> >> >> To do this we first infer which AS owns each router independent of the >> >> interface addresses observed at that router. The ownership inferences >> >> are based on IP-to-AS mapping derived from public BGP data, list of >> >> peering prefixes from PeeringDB, and the previously inferred business AS >> >> relationships. Then we convert the observed IP path into an AS path >> >> using the router ownership information (rather than mapping each >> >> observed IP to AS directly) and retain the first AS link in the >> >> resulting path for the AS graph. >> >> >> >> The as-rel files contain p2p and p2c relationships. The format is: >> >> <provider-as>|<customer-as>|-1 >> >> <peer-as>|<peer-as>|0|<source> >> >> >> ------------------------ >> >> Acceptable Use Agreement >> >> ------------------------ >> >> >> >> The AUA that you accepted when you were given access to these datas is >> included >> >> in pdf format as a separate file in the same directory as this README >> file. >> >> When referencing this data (as required by the AUA), please use: >> >> >> >> The CAIDA AS Relationships Dataset, <date range used> >> >> http://www.caida.org/data/active/as-relationships/ >> >> >> >> Also, please, report your publication to CAIDA >> >> (http://www.caida.org/data/publications/report-publication.xml). >> > > On Mon, Mar 11, 2019 at 4:48 PM Robert Raszuk <[email protected]> wrote: > >> Dear authors of draft-chen-grow-enhanced-as-loop-detection, >> >> The draft says: >> >> " At this point, AS 200 *can lookup the local resource database* and >> check whether there is a real AS relationship between the local AS >> and the left AS and the right AS" >> >> Can you please share a pointer to any database or accurate public oracle >> where anyone could check if peering relation found in the AS-PATH is valid >> or invalid ? >> >> Just over the last few months I connected my AS to number of Tier1 ISPs >> in few of my experimental POPs, but never reported that peering >> establishment to anyone. Then I have a question - how any (public) database >> would accurately reflect any global BGP peering relation to be used >> anywhere for filtering of BGP updates ? >> >> Kind regards, >> RR. >> >> On Tue, Mar 12, 2019 at 12:27 AM <[email protected]> wrote: >> >>> >>> A New Internet-Draft is available from the on-line Internet-Drafts >>> directories. >>> >>> >>> Title : Enhanced AS-Loop Detection for BGP >>> Authors : Huanan Chen >>> Yunan Gu >>> Shunwan Zhuang >>> Haibo Wang >>> Filename : >>> draft-chen-grow-enhanced-as-loop-detection-00.txt >>> Pages : 9 >>> Date : 2019-03-11 >>> >>> Abstract: >>> This document proposes to enhance AS-Loop Detection for BGP Inbound/ >>> Outbound Route Processing. >>> >>> >>> >>> The IETF datatracker status page for this draft is: >>> >>> https://datatracker.ietf..org/doc/draft-chen-grow-enhanced-as-loop-detection/ >>> <https://datatracker.ietf.org/doc/draft-chen-grow-enhanced-as-loop-detection/> >>> >>> There are also htmlized versions available at: >>> https://tools.ietf.org/html/draft-chen-grow-enhanced-as-loop-detection-00 >>> >>> https://datatracker.ietf.org/doc/html/draft-chen-grow-enhanced-as-loop-detection-00 >>> >>> >>> Please note that it may take a couple of minutes from the time of >>> submission >>> until the htmlized version and diff are available at tools.ietf.org. >>> >>> Internet-Drafts are also available by anonymous FTP at: >>> ftp://ftp.ietf.org/internet-drafts/ >>> >>> _______________________________________________ >>> I-D-Announce mailing list >>> [email protected] >>> https://www.ietf.org/mailman/listinfo/i-d-announce >>> Internet-Draft directories: http://www.ietf.org/shadow.html >>> or ftp://ftp.ietf.org/ietf/1shadow-sites.txt >>> >> _______________________________________________ >> GROW mailing list >> [email protected] >> https://www.ietf.org/mailman/listinfo/grow >> >
_______________________________________________ GROW mailing list [email protected] https://www.ietf.org/mailman/listinfo/grow
