Revisiting Link Prioritization for Efficient Traversal in Structured Decentralized Environments

These files are the benchmark results produced for the analysis in the paper: "Revisiting Link Prioritization for Efficient Traversal in Structured Decentralized Environments". These include the timing runs without $R^{3}$ tracking, five $R^{3}$ runs for the diefficiency, and one run for calculating the $R^{3}$. To process this data you can use and follow the instructions from this repository.