https://doi.org/10.1140/epjb/e2004-00116-y
An internet graph model based on trade-off optimization
1
LRI () , Université Paris-Sud, bâtiment 490, 91405 Orsay Cedex, France
2
CNRS, LIP, ENS Lyon () , 46 allée d'Italie, 69364 Lyon Cedex 07, France
Corresponding author: a nicolas.schabanel@ens-lyon.fr
Received:
29
October
2003
Revised:
9
February
2004
Published online:
14
May
2004
This paper presents a new model for the Internet graph (AS graph) based on the concept of heuristic trade-off optimization, introduced by Fabrikant, Koutsoupias and Papadimitriou in [CITE] to grow a random tree with a heavily tailed degree distribution. We propose here a generalization of this approach to generate a general graph, as a candidate for modeling the Internet. We present the results of our simulations and an analysis of the standard parameters measured in our model, compared with measurements from the physical Internet graph.
PACS: 89.75.-k – Complex systems / 89.75.Hc – Networks and genealogical trees / 89.75.Da – Systems obeying scaling laws / 89.75.Fb – Structures and organization in complex systems / 89.65.Gh – Economics; econophysics, financial markets, business and management
© EDP Sciences, Società Italiana di Fisica, Springer-Verlag, 2004
