S Eckhardt, AM Mühling, J Nowak - … Symposium, Eilat, Israel, October 8-10 …, 2007 - Springer
This work studies lowest common ancestor computations in directed acyclic graphs. We present fast algorithms for solving the All-Pairs Representative LCA and All-Pairs All LCA …
S Li, H Duan, Z Wang, X Li - … and Privacy in Communication Networks: 11th …, 2015 - Springer
Route leaks have become an important security problem of inter-domain routing. Operators increasingly suffer from large-scale or small-scale route leak incidents in recent years. Route …
B Hummel, S Kosub - Proceedings of the 7th ACM SIGCOMM …, 2007 - dl.acm.org
An experimental study of the feasibility and accuracy of the acyclicity approach introduced in [14] for the inference of business relationships among autonomous systems (ASes) is …
R Cohen, D Raz - … 2007-26th IEEE International Conference on …, 2007 - ieeexplore.ieee.org
The Internet connectivity in the autonomous system (AS) level reflects the commercial relationship between ASes. A connection between two ASes could be of type customer …
Compliance with the Gao-Rexford conditions [1] is perhaps the most realistic explanation of Internet routing stability, although BGP is renowned to be prone to oscillations. Informally …
The discovery of autonomous systems (ASes) interconnections and the inference of their commercial type of relationships (ToR) has been motivated by the need to accurately …
This paper aims to improve on existing methods by providing a near-deterministic inference scheme (ND-ToR) for solving the ToR problem. The input for ND-ToR is the Internet Core, a …
Most routing protocols guarantee convergence to a stable routing state. That is, in the absence of topology or configuration changes, each router will eventually find a stable route …
Our world is full of networks. The linking relationships might be quite abstract, such as friendship or metabolic processes or even more concrete, like roads or railways, but are still …