Show simple item record

dc.contributor.authorCorbo, Jacomo
dc.contributor.authorJain, Shaili
dc.contributor.authorMitzenmacher, Michael D.
dc.contributor.authorParkes, David C.
dc.date.accessioned2011-01-25T20:53:13Z
dc.date.issued2007
dc.identifier.citationCorbo, 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.en_US
dc.identifier.isbn159593653Xen_US
dc.identifier.urihttp://nrs.harvard.edu/urn-3:HUL.InstRepos:4686805
dc.description.abstractWe 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.en_US
dc.description.sponsorshipEngineering and Applied Sciencesen_US
dc.language.isoen_USen_US
dc.publisherAssociation for Computing Machineryen_US
dc.relation.isversionofhttp://netecon-ibc.si.umich.edu/en_US
dc.relation.hasversionhttp://www.eecs.harvard.edu/econcs/pubs/cjmp-netecon2007.pdfen_US
dash.licenseMETA_ONLY
dc.titleAn Economically Principled Generative Model of AS Graph Connectivityen_US
dc.typeMonograph or Booken_US
dc.description.versionAccepted Manuscripten_US
dc.relation.journalProceeding of Joint Workshop on The Economics of Networked Systems and Incentive-Based Computingen_US
dash.depositing.authorParkes, David C.
dash.embargo.until10000-01-01
dash.contributor.affiliatedJain, Shaili
dash.contributor.affiliatedMitzenmacher, Michael
dash.contributor.affiliatedParkes, David


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record