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

A Survey on Artifacts from CoNEXT, ICN, IMC, and SIGCOMM Conferences in 2017 2017年next, ICN, IMC和SIGCOMM会议的工件调查

Comput. Commun. Rev. Pub Date : 2018-04-27 DOI: 10.1145/3211852.3211864

Matthias Flittner, M. Mahfoudi, D. Saucez, Matthias Wählisch, L. Iannone, Vaibhav Bajpai, A. Afanasyev

引用次数: 14

Local Fast Failover Routing With Low Stretch 低伸缩的本地快速故障转移路由

Comput. Commun. Rev. Pub Date : 2018-04-27 DOI: 10.1145/3211852.3211858

Klaus-Tycho Foerster, Y. Pignolet, S. Schmid, Gilles Trédan

{"title":"Local Fast Failover Routing With Low Stretch","authors":"Klaus-Tycho Foerster, Y. Pignolet, S. Schmid, Gilles Trédan","doi":"10.1145/3211852.3211858","DOIUrl":"https://doi.org/10.1145/3211852.3211858","url":null,"abstract":"Network failures are frequent and disruptive, and can significantly reduce the throughput even in highly connected and regular networks such as datacenters. While many modern networks support some kind of local fast failover to quickly reroute flows encountering link failures to new paths, employing such mechanisms is known to be non-trivial, as conditional failover rules can only depend on local failure information.\u0000 While over the last years, important insights have been gained on how to design failover schemes providing high resiliency, existing approaches have the shortcoming that the resulting failover routes may be unnecessarily long, i.e., they have a large stretch compared to the original route length. This is a serious drawback, as long routes entail higher latencies and introduce loads, which may cause the rerouted flows to interfere with existing flows and harm throughput.\u0000 This paper presents the first deterministic local fast failover algorithms providing provable resiliency and failover route lengths, even in the presence of many concurrent failures. We present stretch-optimal failover algorithms for different network topologies, including multi-dimensional grids, hypercubes and Clos networks, as they are frequently deployed in the context of HPC clusters and datacenters. We show that the computed failover routes are optimal in the sense that no failover algorithm can provide shorter paths for a given number of link failures.","PeriodicalId":403234,"journal":{"name":"Comput. Commun. Rev.","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126634205","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}

引用次数: 24

Thoughts and Recommendations from the ACM SIGCOMM 2017 Reproducibility Workshop ACM SIGCOMM 2017再现性研讨会的想法和建议

Comput. Commun. Rev. Pub Date : 2018-04-27 DOI: 10.1145/3211852.3211863

D. Saucez, L. Iannone

{"title":"Thoughts and Recommendations from the ACM SIGCOMM 2017 Reproducibility Workshop","authors":"D. Saucez, L. Iannone","doi":"10.1145/3211852.3211863","DOIUrl":"https://doi.org/10.1145/3211852.3211863","url":null,"abstract":"Ensuring the reproducibility of results is an essential part of experimental sciences, including computer networking. Unfortunately, as highlighted recently, a large portion of research results are hardly, if not at all, reproducible, raising reasonable lack of conviction on the research carried out around the world.\u0000 Recent years have shown an increasing awareness about reproducibility of results as an essential part of research carried out by members of the ACM SIGCOMM community. To address this important issue, ACM has introduced a new policy on results and artifacts review and badging. The policy defines the terminology to be used to assess results and artifacts but does not specify the review process or how to make research reproducible.\u0000 During SIGCOMM'17 a side workshop has been organized with the specific purpose to tackle this issue. The objective being to trigger discussion and activity in order to craft recommendations on how to introduce incentives for authors to share their artifacts, and the details on how to use them, as well as defining the process to be used.\u0000 This editorial overviews the workshop activity and summarizes the main discussions and outcomes.","PeriodicalId":403234,"journal":{"name":"Comput. Commun. Rev.","volume":"209 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127653885","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}

引用次数: 10

Charting the Algorithmic Complexity of Waypoint Routing 航路点路由的算法复杂度

Comput. Commun. Rev. Pub Date : 2018-04-27 DOI: 10.1145/3211852.3211859

S. A. Amiri, Klaus-Tycho Foerster, R. Jacob, S. Schmid

引用次数: 18

The January 2018 issue 2018年1月号

Comput. Commun. Rev. Pub Date : 2018-04-27 DOI: 10.1145/3211852.3211853

O. Bonaventure

引用次数: 0

A Scalable VPN Gateway for Multi-Tenant Cloud Services 面向多租户云服务的可扩展VPN网关

Comput. Commun. Rev. Pub Date : 2018-04-27 DOI: 10.1145/3211852.3211860

Mina Tahmasbi Arashloo, P. Shirshov, Rohan Gandhi, Guohan Lu, Lihua Yuan, J. Rexford

{"title":"A Scalable VPN Gateway for Multi-Tenant Cloud Services","authors":"Mina Tahmasbi Arashloo, P. Shirshov, Rohan Gandhi, Guohan Lu, Lihua Yuan, J. Rexford","doi":"10.1145/3211852.3211860","DOIUrl":"https://doi.org/10.1145/3211852.3211860","url":null,"abstract":"Major cloud providers offer networks of virtual machines with private IP addresses as a service on the cloud. To isolate the address space of different customers, customers are required to tunnel their traffic to a Virtual Private Network (VPN) gateway, which is typically a middlebox inside the cloud that internally tunnels each packet to the correct destination. To improve performance, an increasing number of enterprises connect directly to the cloud providerâs network at the edge, to a device we call the providerâs edge (PE). PE is a chokepoint for customerâs traffic to the cloud, and therefore a natural candidate for implementing network functions concerning customersâ virtual networks, including the VPN gateway, to avoid a detour to middleboxes inside the cloud.\u0000 At the scale of todayâs cloud providers, VPN gateways need to maintain information for around a million internal tunnels. We argue that no single commodity device can handle these many tunnels while providing a high enough port density to connect to hundreds of cloud customers at the edge. Thus, in this paper, we propose a hybrid architecture for the PE, consisting of a commodity switch, connected to a commodity server which uses Data-Plane Development Kit (DPDK) for fast packet processing. This architecture enables a variety of network functions at the edge by offering the benefits of both hardware and software data planes. We implement a scalable VPN gateway on our proposed PE and show that it matches the scale requirements of todayâs cloud providers while processing packets close to line rate.","PeriodicalId":403234,"journal":{"name":"Comput. Commun. Rev.","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115513500","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}

引用次数: 10

A longitudinal study of IP Anycast IP任播的纵向研究

Comput. Commun. Rev. Pub Date : 2018-04-27 DOI: 10.1145/3211852.3211855

Danilo Cicalese, D. Rossi

引用次数: 15

The Future of CISE Distributed Research Infrastructure CISE分布式研究基础设施的未来

Comput. Commun. Rev. Pub Date : 2018-03-27 DOI: 10.1145/3213232.3213239

Jay Aikat, I. Baldin, M. Berman, Joe Breen, Richard Brooks, P. Calyam, J. Chase, Wallace Chase, Russ Clark, C. Elliott, J. Griffioen, Dijiang Huang, J. Ibarra, T. Lehman, I. Monga, Abraham Matta, C. Papadopoulos, Mike Reiter, D. Raychaudhuri, Glenn Ricart, R. Ricci, P. Ruth, I. Seskar, J. Sobieski, K. V. Merwe, Kuang-Ching Wang, T. Wolf, M. Zink

引用次数: 2

ex uno pluria: The Service-Infrastructure Cycle, Ossification, and the Fragmentation of the Internet 非多数人:服务-基础设施周期、僵化和互联网碎片化

Comput. Commun. Rev. Pub Date : 2017-12-12 DOI: 10.1145/3211852.3211861

M. Ammar

{"title":"ex uno pluria: The Service-Infrastructure Cycle, Ossification, and the Fragmentation of the Internet","authors":"M. Ammar","doi":"10.1145/3211852.3211861","DOIUrl":"https://doi.org/10.1145/3211852.3211861","url":null,"abstract":"In this article I will first argue that a {em Service-Infrastructure Cycle} is fundamental to networking evolution. Networks are built to accommodate certain services at an expected scale. New applications and/or a significant increase in scale require a rethinking of network mechanisms which results in new deployments. Four decades-worth of iterations of this process have yielded the Internet as we know it today, a common and shared global networking infrastructure that delivers almost all services. I will further argue, using brief historical case studies, that success of network mechanism deployments often hinges on whether or not mechanism evolution follows the iterations of this Cycle. Many have observed that this network, the Internet, has become ossified and unable to change in response to new demands. In other words, after decades of operation, the Service-Infrastructure Cycle has become stuck. However, novel service requirements and scale increases continue to exert significant pressure on this ossified infrastructure. The result, I will conjecture, will be a fragmentation, the beginnings of which are evident today, that will ultimately fundamentally change the character of the network infrastructure. By ushering in a ManyNets world, this fragmentation will lubricate the Service-Infrastructure Cycle so that it can continue to govern the evolution of networking. I conclude this article with a brief discussion of the possible implications of this emerging ManyNets world on networking research.","PeriodicalId":403234,"journal":{"name":"Comput. Commun. Rev.","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131816048","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}

引用次数: 12

Measuring YouTube Content Delivery over IPv6 衡量IPv6 YouTube内容交付

Comput. Commun. Rev. Pub Date : 2017-10-25 DOI: 10.1145/3155055.3155057

Vaibhav Bajpai, Saba Ahsan, J. Schönwälder, J. Ott

{"title":"Measuring YouTube Content Delivery over IPv6","authors":"Vaibhav Bajpai, Saba Ahsan, J. Schönwälder, J. Ott","doi":"10.1145/3155055.3155057","DOIUrl":"https://doi.org/10.1145/3155055.3155057","url":null,"abstract":"We measure YouTube content delivery over IPv6 using ∼100 SamKnows probes connected to dual-stacked networks representing 66 different origin ASes. Using a 34-months long (Aug 2014-Jun 2017) dataset, we show that success rates of streaming a stall-free version of a video over IPv6 have improved over time. We show that a Happy Eyeballs (HE) race during initial TCP connection establishment leads to a strong (more than 97%) preference over IPv6. However, even though clients prefer streaming videos over IPv6, we observe worse performance over IPv6 than over IPv4. We witness consistently higher TCP connection establishment times and startup delays (∼100 ms or more) over IPv6. We also observe consistently lower achieved throughput both for audio and video over IPv6. We observe less than 1% stall rates over both address families. Due to lower stall rates, bitrates that can be reliably streamed over both address families are comparable. However, in situations, where a stall does occur, 80% of the samples experience higher stall durations that are at least 1s longer over IPv6 and have not reduced over time. The worse performance over IPv6 is due to the disparity in the availability of Google Global Caches (GGC) over IPv6. The measurements performed in this work using the youtube test and the entire dataset is made available to the measurement community.","PeriodicalId":403234,"journal":{"name":"Comput. Commun. Rev.","volume":"134 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122626032","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}

引用次数: 14