This project contains algorithms to predict (deterministically, probabilistically or with the help of oracles) the catchment of anycasted IP prefixes. The project implements the pseudo-algorithms presented in , and includes some examples. Please cite  if you use this code for your research.
 Pavlos Sermpezis and Vasileios Kotronis. “Inferring Catchment in Internet Routing”, ACM SIGMETRICS, 2019.
Files for running a BGP simulation:
Files for building the R-graph and implementing algorithms of :
Files with examples (how to run the code):
Files with example datasets:
- /CAIDA AS-graph/20190401.as-rel2.txt