Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications最新文献

筛选

英文中文

Systematic topology analysis and generation using degree correlations 系统拓扑分析和生成使用度相关

Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications Pub Date : 2006-05-01 DOI: 10.1145/1151659.1159930

Priya Mahadevan, D. Krioukov, K. Fall, Amin Vahdat

{"title":"Systematic topology analysis and generation using degree correlations","authors":"Priya Mahadevan, D. Krioukov, K. Fall, Amin Vahdat","doi":"10.1145/1151659.1159930","DOIUrl":"https://doi.org/10.1145/1151659.1159930","url":null,"abstract":"Researchers have proposed a variety of metrics to measure important graph properties, for instance, in social, biological, and computer networks. Values for a particular graph metric may capture a graph's resilience to failure or its routing efficiency. Knowledge of appropriate metric values may influence the engineering of future topologies, repair strategies in the face of failure, and understanding of fundamental properties of existing networks. Unfortunately, there are typically no algorithms to generate graphs matching one or more proposed metrics and there is little understanding of the relationships among individual metrics or their applicability to different settings. We present a new, systematic approach for analyzing network topologies. We first introduce the dK-series of probability distributions specifying all degree correlations within d-sized subgraphs of a given graph G. Increasing values of d capture progressively more properties of G at the cost of more complex representation of the probability distribution. Using this series, we can quantitatively measure the distance between two graphs and construct random graphs that accurately reproduce virtually all metrics proposed in the literature. The nature of the dK-series implies that it will also capture any future metrics that may be proposed. Using our approach, we construct graphs for d=0, 1, 2, 3 and demonstrate that these graphs reproduce, with increasing accuracy, important properties of measured and modeled Internet topologies. We find that the d=2 case is sufficient for most practical purposes, while d=3 essentially reconstructs the Internet AS-and router-level topologies exactly. We hope that a systematic method to analyze and synthesize topologies offers a significant improvement to the set of tools available to network topology and protocol researchers.","PeriodicalId":109155,"journal":{"name":"Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128407266","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 350

Session details: Architecture 会话细节:架构

Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications Pub Date : 2003-01-11 DOI: 10.1145/3262098

Mohammad Neilforoshan

引用次数: 0

首页上一页