Proceedings of the 16th ACM Workshop on Hot Topics in Networks最新文献

DIY Hosting for Online Privacy DIY在线隐私托管

Proceedings of the 16th ACM Workshop on Hot Topics in Networks Pub Date : 2017-11-30 DOI: 10.1145/3152434.3152459

Shoumik Palkar, M. Zaharia

{"title":"DIY Hosting for Online Privacy","authors":"Shoumik Palkar, M. Zaharia","doi":"10.1145/3152434.3152459","DOIUrl":"https://doi.org/10.1145/3152434.3152459","url":null,"abstract":"Web users today rely on centralized services for applications such as email, file transfer and chat. Unfortunately, these services create a significant privacy risk: even with a benevolent provider, a single breach can put millions of users' data at risk. One alternative would be for users to host their own servers, but this would be highly expensive for most applications: a single VM deployed in a high-availability mode can cost many dollars per month. In this paper, we propose Deploy It Yourself (DIY), a new model for hosting applications based on serverless computing platforms such as Amazon Lambda. DIY allows users to run a highly available service with much stronger privacy guarantees than current centralized providers, and at a dramatically lower cost than traditional server hosting. DIY only relies on the security of container isolation and a key manager as opposed to the large codebase of a high-level application such as Gmail (and all the Google teams using Gmail data). With attestation technology such as SGX, DIY's execution could also be verified remotely. We show that a DIY email server that sends 500 messages/day costs $0.26/month, which is 50x cheaper than a highly available EC2 server. We also implement a DIY chat service and show that it performs well. Finally, we argue that DIY applications are simple enough to operate that cloud providers could offer a simple \"app store\" for using them.","PeriodicalId":120886,"journal":{"name":"Proceedings of the 16th ACM Workshop on Hot Topics in Networks","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114259884","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}

引用次数: 8

HotCocoa: Hardware Congestion Control Abstractions HotCocoa:硬件拥塞控制抽象

Proceedings of the 16th ACM Workshop on Hot Topics in Networks Pub Date : 2017-11-30 DOI: 10.1145/3152434.3152457

Mina Tahmasbi Arashloo, Monia Ghobadi, J. Rexford, D. Walker

{"title":"HotCocoa: Hardware Congestion Control Abstractions","authors":"Mina Tahmasbi Arashloo, Monia Ghobadi, J. Rexford, D. Walker","doi":"10.1145/3152434.3152457","DOIUrl":"https://doi.org/10.1145/3152434.3152457","url":null,"abstract":"Congestion control in multi-tenant data centers is an active area of research because of its significant impact on customer experience, and, consequently, on revenue. Therefore, new algorithms and protocols are expected to emerge as the Cloud evolves. Deploying new congestion control algorithms in the end host's hypervisor allows frequent updates, but processing packets at high rates in the hypervisor and implementing the elements of a congestion control algorithm, such as traffic shapers and timestamps, in software have well-studied inaccuracies and CPU inefficiencies. In this paper, we argue for implementing the entire congestion control algorithm in programmable NICs. To do so, we identify the absence of hardware-aware programming abstractions as the most immediate challenge and solve it using a simple high-level domain specific language called HotCocoa. HotCocoa lies at a sweet spot between the ability to express a broad set of congestion control algorithms and efficient hardware implementation. It offers a set of hardware-aware COngestion COntrol Abstractions that enable operators to specify their algorithm without having to worry about low-level hardware primitives. To evaluate HotCocoa, we implement four congestion control algorithms (Reno, DCTCP, PCC, and TIMELY) and use simulations to show that HotCocoa's implementation of Reno perfectly tracks the behavior of a native implementation in C++.","PeriodicalId":120886,"journal":{"name":"Proceedings of the 16th ACM Workshop on Hot Topics in Networks","volume":"156 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114015563","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}

引用次数: 27

Stick a fork in it: Analyzing the Ethereum network partition 插入一个分叉:分析以太坊网络分区

Proceedings of the 16th ACM Workshop on Hot Topics in Networks Pub Date : 2017-11-30 DOI: 10.1145/3152434.3152449

Lucianna Kiffer, Dave Levin, A. Mislove

引用次数: 42

An Axiomatic Approach to Congestion Control 拥塞控制的公理方法

Proceedings of the 16th ACM Workshop on Hot Topics in Networks Pub Date : 2017-11-30 DOI: 10.1145/3152434.3152445

Doron Zarchy, R. Mittal, Michael Schapira, S. Shenker

{"title":"An Axiomatic Approach to Congestion Control","authors":"Doron Zarchy, R. Mittal, Michael Schapira, S. Shenker","doi":"10.1145/3152434.3152445","DOIUrl":"https://doi.org/10.1145/3152434.3152445","url":null,"abstract":"Recent years have witnessed a surge of interest in congestion control. Unfortunately, the overwhelmingly large design space along with the increasingly diverse range of application environments makes evaluating congestion control protocols a daunting task. Researchers often use simulation and experiments to examine the performance of designs in specific contexts, but this gives limited insight into the more general properties of these schemes and provides no information about the inherent limits of congestion control designs, e.g., which properties are simultaneously achievable. To complement simulation and experimentation, we advocate a principled framework for reasoning about congestion control protocols. We report on our initial steps in this direction, which was inspired by the axiomatic approach from social choice theory and game theory. We consider several natural requirements (\"axioms\") from congestion control protocols -- e.g., efficient resource-utilization, loss-avoidance, fairness, stability, and TCP-friendliness -- and investigate which combinations of these can be achieved within a single design. Thus, our framework allows us to investigate the fundamental tradeoffs between desiderata, and to identify where existing and new congestion control architectures fit within the space of possible outcomes. We believe that our results are but a first step in the axiomatic exploration of congestion control and leave the reader with exciting directions for future research.","PeriodicalId":120886,"journal":{"name":"Proceedings of the 16th ACM Workshop on Hot Topics in Networks","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114402289","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}

引用次数: 8

Learning to Route 学习路由

Proceedings of the 16th ACM Workshop on Hot Topics in Networks Pub Date : 2017-11-30 DOI: 10.1145/3152434.3152441

Asaf Valadarsky, Michael Schapira, Dafna Shahaf, Aviv Tamar

引用次数: 156

Biases in Data-Driven Networking, and What to Do About Them 数据驱动网络中的偏见，以及如何解决它们

Proceedings of the 16th ACM Workshop on Hot Topics in Networks Pub Date : 2017-11-30 DOI: 10.1145/3152434.3152448

Mihovil Bartulovic, Junchen Jiang, Sivaraman Balakrishnan, V. Sekar, B. Sinopoli

引用次数: 20

FreeLab: A Free Experimentation Platform 一个免费的实验平台

Proceedings of the 16th ACM Workshop on Hot Topics in Networks Pub Date : 2017-11-30 DOI: 10.1145/3152434.3152436

Matteo Varvello, Diego Perino

引用次数: 0

In-Network Computation is a Dumb Idea Whose Time Has Come 网络计算是一个愚蠢的想法，它的时代已经到来

Proceedings of the 16th ACM Workshop on Hot Topics in Networks Pub Date : 2017-11-30 DOI: 10.1145/3152434.3152461

Amedeo Sapio, I. Abdelaziz, Abdulla Aldilaijan, M. Canini, Panos Kalnis

{"title":"In-Network Computation is a Dumb Idea Whose Time Has Come","authors":"Amedeo Sapio, I. Abdelaziz, Abdulla Aldilaijan, M. Canini, Panos Kalnis","doi":"10.1145/3152434.3152461","DOIUrl":"https://doi.org/10.1145/3152434.3152461","url":null,"abstract":"Programmable data plane hardware creates new opportunities for infusing intelligence into the network. This raises a fundamental question: what kinds of computation should be delegated to the network? In this paper, we discuss the opportunities and challenges for co-designing data center distributed systems with their network layer. We believe that the time has finally come for offloading part of their computation to execute in-network. However, in-network computation tasks must be judiciously crafted to match the limitations of the network machine architecture of programmable devices. With the help of our experiments on machine learning and graph analytics workloads, we identify that aggregation functions raise opportunities to exploit the limited computation power of networking hardware to lessen network congestion and improve the overall application performance. Moreover, as a proof-of-concept, we propose Daiet, a system that performs in-network data aggregation. Experimental results with an initial prototype show a large data reduction ratio (86.9%-89.3%) and a similar decrease in the workers' computation time.","PeriodicalId":120886,"journal":{"name":"Proceedings of the 16th ACM Workshop on Hot Topics in Networks","volume":"2013 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129907771","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}

引用次数: 203

Harvesting Randomness to Optimize Distributed Systems 收集随机性以优化分布式系统

Proceedings of the 16th ACM Workshop on Hot Topics in Networks Pub Date : 2017-11-30 DOI: 10.1145/3152434.3152435

Mathias Lécuyer, Joshua Lockerman, Lamont Nelson, S. Sen, Amit Sharma, Aleksandrs Slivkins

{"title":"Harvesting Randomness to Optimize Distributed Systems","authors":"Mathias Lécuyer, Joshua Lockerman, Lamont Nelson, S. Sen, Amit Sharma, Aleksandrs Slivkins","doi":"10.1145/3152434.3152435","DOIUrl":"https://doi.org/10.1145/3152434.3152435","url":null,"abstract":"We view randomization through the lens of statistical machine learning: as a powerful resource for offline optimization. Cloud systems make randomized decisions all the time (e.g., in load balancing), yet this randomness is rarely used for optimization after-the-fact. By casting system decisions in the framework of reinforcement learning, we show how to collect data from existing systems, without modifying them, to evaluate new policies, without deploying them. Our methodology, called harvesting randomness, has the potential to accurately estimate a policy's performance without the risk or cost of deploying it on live traffic. We quantify this optimization power and apply it to a real machine health scenario in Azure Compute. We also apply it to two prototyped scenarios, for load balancing (Nginx) and caching (Redis), with much less success, and use them to identify the systems and machine learning challenges to achieving our goal. Our long-term agenda is to harvest the randomness in distributed systems to develop non-invasive and efficient techniques for optimizing them. Like CPU cycles and bandwidth, we view randomness as a valuable resource being wasted by the cloud, and we seek to remedy this.","PeriodicalId":120886,"journal":{"name":"Proceedings of the 16th ACM Workshop on Hot Topics in Networks","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132518908","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}

引用次数: 16

Online Advertising under Internet Censorship 互联网审查下的网络广告

Proceedings of the 16th ACM Workshop on Hot Topics in Networks Pub Date : 2017-11-30 DOI: 10.1145/3152434.3152455

Hira Javaid, Hafiz Kamran Khalil, Z. A. Uzmi, I. Qazi

引用次数: 1