BGP and inter-AS economic relationships

E Gregori, A Improta, L Lenzini, L Rossi… - NETWORKING 2011: 10th …, 2011 - Springer
The structure of the Internet is still unknown even though it provides services for most of the
world. Its current configuration is the result of complex economic interactions developed in …

Fast lowest common ancestor computations in dags

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 …

Route leaks identification by detecting routing loops

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 …

Acyclic type-of-relationship problems on the internet: an experimental analysis

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 …

Acyclic type of relationships between autonomous systems

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 …

Assigning AS relationships to satisfy the Gao-Rexford conditions

L Cittadini, G Di Battista, T Erlebach… - The 18th IEEE …, 2010 - ieeexplore.ieee.org
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 …

Near-deterministic inference of AS relationships

Y Shavitt, E Shir, U Weinsberg - 2009 10th International …, 2009 - ieeexplore.ieee.org
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 …

Near-deterministic inference of AS relationships

U Weinsberg, Y Shavitt, E Shir - IEEE INFOCOM Workshops …, 2009 - ieeexplore.ieee.org
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 …

On the stability of interdomain routing

L Cittadini, GD Battista, M Rimondini - ACM Computing Surveys (CSUR), 2012 - dl.acm.org
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 …

Constrained graph drawing

B Pampel - 2012 - kops.uni-konstanz.de
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 …