An Economically Principled Generative Model of AS Graph Connectivity

DSpace/Manakin Repository

An Economically Principled Generative Model of AS Graph Connectivity

Citable link to this page

. . . . . .

Title: An Economically Principled Generative Model of AS Graph Connectivity
Author: Corbo, Jacomo; Jain, Shaili; Mitzenmacher, Michael D.; Parkes, David C.

Note: Order does not necessarily reflect citation order of authors.

Citation: Corbo, Jacomo, Shaili Jain, Michael Mitzenmacher, and David C. Parkes. 2007. An economically principled generative model of AS graph connectivity. In Proceedings, Joint Workshop on the Economics of Networked Systems and Incentive-Based Computing: June 11, 2007, San Diego, CA, ed. D. Grosu, R. Mahajan, R. Sami. New York, N.Y.: Association for Computing Machinery.
Access Status: At the direction of the depositing author this work is not currently accessible through DASH.
Full Text & Related Files:
Abstract: We explore the problem of modeling Internet connectivity at the Autonomous System (AS) level and present an economically-principled dynamic model that reproduces key features of the AS graph structure. We view the graph as the outcome of optimizing decisions made by each AS given its business model. In our model, nodes (representing ASs) arrive over time and choose and change providers to maximize their utility. Our formulation of AS utility includes revenue from an AS’s own generated demand for traffic, congestion and routing costs, as well as transfers to and from provider and customer ASs, respectively. Our model has the following features: it uses an empirically-motivated model of traffic demand (Chang, Jamin, Mao, Willinger, 2005) which considers the variation in demand with ASs’ business models and the graph of business relationships; it allows for nodes to revise their connections over time, in a fashion similar to the well-known ‘forest fire’ model (Leskovec, Kleinberg, Faloutsos, 2005); a node’s utility explicitly models many of the major economic and technological issues at play. We validate our model-generated graphs against those of other generative models. Building on previous work that has shown that rule-based generative models like preferential attachment yield poorly-performing traffic routing graphs (Li, Alderson, Doyle, Willinger, 2006), we show that our graphs perform well as designed, engineered systems, while retaining measured statistical properties of the AS graph.
Published Version: http://netecon-ibc.si.umich.edu/
Other Sources: http://www.eecs.harvard.edu/econcs/pubs/cjmp-netecon2007.pdf
Citable link to this page: http://nrs.harvard.edu/urn-3:HUL.InstRepos:4686805

Show full Dublin Core record

This item appears in the following Collection(s)

  • FAS Scholarly Articles [6463]
    Peer reviewed scholarly articles from the Faculty of Arts and Sciences of Harvard University
 
 

Search DASH


Advanced Search
 
 

Submitters