# An Analysis of The Internal Structure of Large Autonomous Systems

@inproceedings{Govindan2002AnAO, title={An Analysis of The Internal Structure of Large Autonomous Systems}, author={Ramesh Govindan and Pavlin Radoslavov}, year={2002} }

This study examines the topological and geographical structure of eight large Autonomous System (AS) topologies. We use a large collection of traceroutes obtained from multiple vantage points, and a set of heuristics designed to infer, from those traceroutes, the topology of individual ASs. We carefully validate some aspects of these topologies using publicly available information. Our analyses uncover several interesting common features of these topologies. We find high variability both in the…

## 7 Citations

What Causal Forces Shape Internet Connectivity at the AS-level?

- Computer Science
- 2003

A new optimization-driven model for Internet growth at the ASpc level is developed, an explicit construction of a novel class of intuitive, multi-objective, local optimizations by which the different ASs determine in a fully distributed and decentralized fashion their "best" upstream provider.

Internet connectivity at the AS-level: an optimization-driven modeling approach

- Computer ScienceMoMeTools '03
- 2003

A new optimization-driven model for Internet growth at the ASPC level that is broadly robust, perforce yields graphs that match inferred AS connectivity with respect to a number of different metrics, and is ideal for exploring the impact of new peering incentives or policies on AS-level connectivity.

BGP-based interdomain traffic engineering

- Computer Science
- 2006

A new approach for modeling BGP on large Internet-scale network topologies is designed and implemented and a new mechanism based on a combination of BGP and IP tunneling is proposed, called Virtual Peerings, to solve various interdomain traffic engineering problems.

NXG01-4: Scalable Hierarchical Traceback

- Computer ScienceIEEE Globecom 2006
- 2006

HIT has significant improvements over other works in several dimensions: with just a few tens of packets, HIT enables the victim to reconstruct the attack graph, an improvement of 2-3 orders of magnitude when compared to previous schemes.

An a priori estimator for the delay distribution in global hybrid multicast

- BusinessCo-Next Student Workshop '09
- 2009

A strong dependence on hop counts and proximity awareness is diagnosed for the overlay multicast approach in use with promising results for most efficient schemes.

Distributing Storage in Cloud Environments

- Computer Science2013 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum
- 2013

This paper investigates in which way load balancing of the computational resources as well as the data locality can be maintained at the same time and shows that it is possible to both balance the load nearly perfectly and to keep the data close to its origin.

## References

SHOWING 1-10 OF 29 REFERENCES

On the marginal utility of network topology measurements

- Computer ScienceIMW '01
- 2001

This paper characterize the observable topology in terms of nodes, links, node degree distribution, and distribution of end-to-end flows using statistical and information-theoretic techniques and shows that the utility of adding destinations is constant for interfaces, node, links and node degree indicating that it is more important to add destinations than sources.

Modeling the Internet's large-scale topology

- Computer ScienceProceedings of the National Academy of Sciences of the United States of America
- 2002

This work identifies the universal mechanisms that shape the Internet's router and autonomous system level topology and finds that the physical layout of nodes form a fractal set, determined by population density patterns around the globe.

BRITE: A Flexible Generator of Internet Topologies

- Computer Science
- 2000

This work uses BRITE in [BU-CS-TR-2000-0004] to study the origin of power laws and other metrics in Internet topologies, and considers four of them: preferential connectivity of a new node to existing nodes; incremental growth of the network; geographical distribution of nodes; and locality of edge connections.

On power-law relationships of the Internet topology

- Computer ScienceSIGCOMM '99
- 1999

These power-laws hold for three snapshots of the Internet, between November 1997 and December 1998, despite a 45% growth of its size during that period, and can be used to generate and select realistic topologies for simulation purposes.

Inferring AS-level Internet topology from router-level path traces

- Computer ScienceSPIE ITCom
- 2001

Several mapping rules and heuristics for inferring the ASs of border routers are presented and results showing the effectiveness and validity of these rules andHeuristics are reported on.

Measuring ISP topologies with Rocketfuel

- Computer ScienceIEEE/ACM Transactions on Networking
- 2004

New Internet mapping techniques that have enabled us to measure router-level ISP topologies are presented, finding that these maps are substantially more complete than those of earlier Internet mapping efforts.

Collective dynamics of ‘small-world’ networks

- Computer ScienceNature
- 1998

Simple models of networks that can be tuned through this middle ground: regular networks ‘rewired’ to introduce increasing amounts of disorder are explored, finding that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs.

Inet: Internet Topology Generator

- Computer Science
- 2000

A topology generator that is based on Autonomous System (AS) connectivity in the Internet and generates random networks with characteristics similar to those of the Internet from November 1997 to June 2000, and beyond is presented.

Topology of evolving networks: local events and universality

- Computer SciencePhysical review letters
- 2000

A continuum theory is proposed that predicts the connectivity distribution of the network describing the professional links between movie actors as well as the scaling function and the exponents, in good agreement with numerical results.

A random graph model for massive graphs

- Computer Science, MathematicsSTOC '00
- 2000

A random graph model is proposed which is a special case of sparse random graphs with given degree sequences which involves only a small number of parameters, called logsize and log-log growth rate, which capture some universal characteristics of massive graphs.