Comput. Commun. Rev.最新文献_第5页

A Broadcast-Only Communication Model Based on Replicated Append-Only Logs 基于复制唯追加日志的唯广播通信模型

Comput. Commun. Rev. Pub Date : 2019-05-21 DOI: 10.1145/3336937.3336943

C. Tschudin

引用次数: 7

Evaluating the artifacts of SIGCOMM papers 评估SIGCOMM文件的工件

Comput. Commun. Rev. Pub Date : 2019-05-21 DOI: 10.1145/3336937.3336944

D. Saucez, L. Iannone, O. Bonaventure

引用次数: 8

On the Complexity of Non-Segregated Routing in Reconfigurable Data Center Architectures 可重构数据中心体系结构中非隔离路由的复杂性研究

Comput. Commun. Rev. Pub Date : 2019-05-21 DOI: 10.1145/3336937.3336939

Klaus-Tycho Foerster, Maciej Pacut, S. Schmid

{"title":"On the Complexity of Non-Segregated Routing in Reconfigurable Data Center Architectures","authors":"Klaus-Tycho Foerster, Maciej Pacut, S. Schmid","doi":"10.1145/3336937.3336939","DOIUrl":"https://doi.org/10.1145/3336937.3336939","url":null,"abstract":"By enhancing the traditional static network (e.g., based on electric switches) with a dynamic topology (e.g., based on reconfigurable optical switches), emerging reconfigurable data centers introduce unprecedented flexibilities in how networks can be optimized toward the workload they serve. However, such hybrid data centers are currently limited by a restrictive routing policy enforcing artificial segregation: each network flow can only use either the static or the flexible topology, but not a combination of the two.\u0000 This paper explores the algorithmic problem of supporting more general routing policies, which are not limited by segregation. While the potential benefits of non-segregated routing have been demonstrated in recent work, the underlying algorithmic complexity is not well-understood.\u0000 We present a range of novel results on the algorithmic complexity of non-segregated routing. In particular, we show that in certain specific scenarios, optimal data center topologies with nonsegregated routing policies can be computed in polynomial-time. In many variants of the problem, however, introducing a more flexible routing comes at a price of complexity: we prove several important variants to be NP-hard.","PeriodicalId":403234,"journal":{"name":"Comput. Commun. Rev.","volume":"70 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120929116","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}

引用次数: 25

Workshop on Internet Economics (WIE2018) Final Report 互联网经济研讨会(WIE2018)最终报告

Comput. Commun. Rev. Pub Date : 2019-05-21 DOI: 10.1145/3336937.3336941

K. Claffy, D. Clark

{"title":"Workshop on Internet Economics (WIE2018) Final Report","authors":"K. Claffy, D. Clark","doi":"10.1145/3336937.3336941","DOIUrl":"https://doi.org/10.1145/3336937.3336941","url":null,"abstract":"On 12-13 December 2018, CAIDA hosted the 9th interdisciplinary Workshop on Internet Economics (WIE) at the UC San Diego’s Supercomputer Center. This workshop series provides a forum for researchers, Internet facilities and service providers, technologists, economists, theorists, policy makers, and other stakeholders to exchange views on current and emerging regulatory and policy debates. To add clarity to a range of vigorous policy debates, and in pursuit of actionable objectives, this year’s meeting used a different approach to structuring the agenda. Each attendee chose a specific policy goal or harm, and structured their presentation to answer three questions: (1) What data is needed to measure progress toward/away from this goal/harm? (2) What methods do you propose to gather such data? (3) Who are the right entities to gather such data, and how should such data be managed and shared? With a specific focus on measurement challenges, the topics we discussed included: analyzing the evolution of the Internet in a layered-platform context to gain new insights; measurement and analysis of economic impacts of new technologies using old tools; security and trustworthiness, reach (universal service) and reachability, sustainability of investment into Internet infrastructure, as well as infrastructure to measure the Internet. All slides made available at https://www.caida.org/workshops/wie/1812/.","PeriodicalId":403234,"journal":{"name":"Comput. Commun. Rev.","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116340206","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}

引用次数: 6

Democratizing the Network Edge 网络边缘的民主化

Comput. Commun. Rev. Pub Date : 2019-05-21 DOI: 10.1145/3336937.3336942

L. Peterson, T. Anderson, S. Katti, N. McKeown, G. Parulkar, J. Rexford, M. Satyanarayanan, O. Sunay, Amin Vahdat

引用次数: 50

Thoughts on load distribution and the role of programmable switches 关于负载分配和可编程开关作用的思考

Comput. Commun. Rev. Pub Date : 2019-02-20 DOI: 10.1145/3314212.3314216

J. McCauley, Aurojit Panda, A. Krishnamurthy, S. Shenker

引用次数: 28

Network telemetry: towards a top-down approach 网络遥测:走向自上而下的方法

Comput. Commun. Rev. Pub Date : 2019-02-20 DOI: 10.1145/3314212.3314215

Minlan Yu