Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication最新文献_第9页

R2C2: A Network Stack for Rack-scale Computers R2C2:机架级计算机的网络堆栈

Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication Pub Date : 2015-08-17 DOI: 10.1145/2785956.2787492

Paolo Costa, Hitesh Ballani, Kaveh Razavi, Ian A. Kash

{"title":"R2C2: A Network Stack for Rack-scale Computers","authors":"Paolo Costa, Hitesh Ballani, Kaveh Razavi, Ian A. Kash","doi":"10.1145/2785956.2787492","DOIUrl":"https://doi.org/10.1145/2785956.2787492","url":null,"abstract":"Rack-scale computers, comprising a large number of micro-servers connected by a direct-connect topology, are expected to replace servers as the building block in data centers. We focus on the problem of routing and congestion control across the rack's network, and find that high path diversity in rack topologies, in combination with workload diversity across it, means that traditional solutions are inadequate. We introduce R2C2, a network stack for rack-scale computers that provides flexible and efficient routing and congestion control. R2C2 leverages the fact that the scale of rack topologies allows for low-overhead broadcasting to ensure that all nodes in the rack are aware of all network flows. We thus achieve rate-based congestion control without any probing; each node independently determines the sending rate for its flows while respecting the provider's allocation policies. For routing, nodes dynamically choose the routing protocol for each flow in order to maximize overall utility. Through a prototype deployed across a rack emulation platform and a packet-level simulator, we show that R2C2 achieves very low queuing and high throughput for diverse and bursty workloads, and that routing flexibility can provide significant throughput gains.","PeriodicalId":268472,"journal":{"name":"Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128103860","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}

引用次数: 48

A Declarative and Expressive Approach to Control Forwarding Paths in Carrier-Grade Networks 一种声明性和表达性的电信级网络转发路径控制方法

Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication Pub Date : 2015-08-17 DOI: 10.1145/2785956.2787495

Renaud Hartert, Stefano Vissicchio, P. Schaus, O. Bonaventure, C. Filsfils, T. Telkamp, Pierre François

引用次数: 155

BwE: Flexible, Hierarchical Bandwidth Allocation for WAN Distributed Computing BwE:灵活的、分层的广域网分布式计算带宽分配

Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication Pub Date : 2015-08-17 DOI: 10.1145/2785956.2787478

Alok Kumar, Susha Jain, Uday Naik, Anand Raghuraman, Nikhil Kasinadhuni, Enrique Cauich Zermeno, C. Gunn, Jing Ai, Björn Carlin, Mihai Amarandei-Stavila, Mathieu Robin, Aspi Siganporia, Stephen Stuart, Amin Vahdat

{"title":"BwE: Flexible, Hierarchical Bandwidth Allocation for WAN Distributed Computing","authors":"Alok Kumar, Susha Jain, Uday Naik, Anand Raghuraman, Nikhil Kasinadhuni, Enrique Cauich Zermeno, C. Gunn, Jing Ai, Björn Carlin, Mihai Amarandei-Stavila, Mathieu Robin, Aspi Siganporia, Stephen Stuart, Amin Vahdat","doi":"10.1145/2785956.2787478","DOIUrl":"https://doi.org/10.1145/2785956.2787478","url":null,"abstract":"WAN bandwidth remains a constrained resource that is economically infeasible to substantially overprovision. Hence, it is important to allocate capacity according to service priority and based on the incremental value of additional allocation. For example, it may be the highest priority for one service to receive 10Gb/s of bandwidth but upon reaching such an allocation, incremental priority may drop sharply favoring allocation to other services. Motivated by the observation that individual flows with fixed priority may not be the ideal basis for bandwidth allocation, we present the design and implementation of Bandwidth Enforcer (BwE), a global, hierarchical bandwidth allocation infrastructure. BwE supports: i) service-level bandwidth allocation following prioritized bandwidth functions where a service can represent an arbitrary collection of flows, ii)independent allocation and delegation policies according to user-defined hierarchy, all accounting for a global view of bandwidth and failure conditions, iii) multi-path forwarding common in traffic-engineered networks, and iv) a central administrative point to override (perhaps faulty) policy during exceptional conditions. BwE has delivered more service efficient bandwidth utilization and simpler management in production for multiple years.","PeriodicalId":268472,"journal":{"name":"Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115861235","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}

引用次数: 206

Network-Aware Scheduling for Data-Parallel Jobs: Plan When You Can 数据并行作业的网络感知调度:尽可能计划

Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication Pub Date : 2015-08-17 DOI: 10.1145/2785956.2787488

Virajith Jalaparti, P. Bodík, Ishai Menache, Sriram Rao, K. Makarychev, M. Caesar

{"title":"Network-Aware Scheduling for Data-Parallel Jobs: Plan When You Can","authors":"Virajith Jalaparti, P. Bodík, Ishai Menache, Sriram Rao, K. Makarychev, M. Caesar","doi":"10.1145/2785956.2787488","DOIUrl":"https://doi.org/10.1145/2785956.2787488","url":null,"abstract":"To reduce the impact of network congestion on big data jobs, cluster management frameworks use various heuristics to schedule compute tasks and/or network flows. Most of these schedulers consider the job input data fixed and greedily schedule the tasks and flows that are ready to run. However, a large fraction of production jobs are recurring with predictable characteristics, which allows us to plan ahead for them. Coordinating the placement of data and tasks of these jobs allows for significantly improving their network locality and freeing up bandwidth, which can be used by other jobs running on the cluster. With this intuition, we develop Corral, a scheduling framework that uses characteristics of future workloads to determine an offline schedule which (i) jointly places data and compute to achieve better data locality, and (ii) isolates jobs both spatially (by scheduling them in different parts of the cluster) and temporally, improving their performance. We implement Corral on Apache Yarn, and evaluate it on a 210 machine cluster using production workloads. Compared to Yarn's capacity scheduler, Corral reduces the makespan of these workloads up to 33% and the median completion time up to 56%, with 20-90% reduction in data transferred across racks.","PeriodicalId":268472,"journal":{"name":"Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129479462","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}

引用次数: 185

Extreme Web Caching for Faster Web Browsing 极速网页缓存，更快的网页浏览

Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication Pub Date : 2015-08-17 DOI: 10.1145/2785956.2790032

A. Raza, Y. Zaki, Thomas Pötsch, Jay Chen, Lakshmi Subramanian

引用次数: 2

Poptrie: A Compressed Trie with Population Count for Fast and Scalable Software IP Routing Table Lookup Poptrie:用于快速和可扩展的软件IP路由表查找的具有人口计数的压缩树

Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication Pub Date : 2015-08-17 DOI: 10.1145/2785956.2787474

H. Asai, Yasuhiro Ohara

{"title":"Poptrie: A Compressed Trie with Population Count for Fast and Scalable Software IP Routing Table Lookup","authors":"H. Asai, Yasuhiro Ohara","doi":"10.1145/2785956.2787474","DOIUrl":"https://doi.org/10.1145/2785956.2787474","url":null,"abstract":"Internet of Things leads to routing table explosion. An inexpensive approach for IP routing table lookup is required against ever growing size of the Internet. We contribute by a fast and scalable software routing lookup algorithm based on a multiway trie, called Poptrie. Named after our approach to traversing the tree, it leverages the population count instruction on bit-vector indices for the descendant nodes to compress the data structure within the CPU cache. Poptrie outperforms the state-of-the-art technologies, Tree BitMap, DXR and SAIL, in all of the evaluations using random and real destination queries on 35 routing tables, including the real global tier-1 ISP's full-route routing table. Poptrie peaks between 174 and over 240 Million lookups per second (Mlps) with a single core and tables with 500--800k routes, consistently 4--578% faster than all competing algorithms in all the tests we ran. We provide the comprehensive performance evaluation, remarkably with the CPU cycle analysis. This paper shows the suitability of Poptrie in the future Internet including IPv6, where a larger route table is expected with longer prefixes.","PeriodicalId":268472,"journal":{"name":"Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132831398","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}

引用次数: 73

Multi-Context TLS (mcTLS): Enabling Secure In-Network Functionality in TLS 多上下文TLS (mcTLS):在TLS中启用安全网络功能

Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication Pub Date : 2015-08-17 DOI: 10.1145/2785956.2787482

David Naylor, Kyle Schomp, Matteo Varvello, Ilias Leontiadis, Jeremy Blackburn, D. López, K. Papagiannaki, P. Rodriguez, P. Steenkiste

{"title":"Multi-Context TLS (mcTLS): Enabling Secure In-Network Functionality in TLS","authors":"David Naylor, Kyle Schomp, Matteo Varvello, Ilias Leontiadis, Jeremy Blackburn, D. López, K. Papagiannaki, P. Rodriguez, P. Steenkiste","doi":"10.1145/2785956.2787482","DOIUrl":"https://doi.org/10.1145/2785956.2787482","url":null,"abstract":"A significant fraction of Internet traffic is now encrypted and HTTPS will likely be the default in HTTP/2. However, Transport Layer Security (TLS), the standard protocol for encryption in the Internet, assumes that all functionality resides at the endpoints, making it impossible to use in-network services that optimize network resource usage, improve user experience, and protect clients and servers from security threats. Re-introducing in-network functionality into TLS sessions today is done through hacks, often weakening overall security. In this paper we introduce multi-context TLS (mcTLS), which extends TLS to support middleboxes. mcTLS breaks the current \"all-or-nothing\" security model by allowing endpoints and content providers to explicitly introduce middleboxes in secure end-to-end sessions while controlling which parts of the data they can read or write. We evaluate a prototype mcTLS implementation in both controlled and \"live\" experiments, showing that its benefits come at the cost of minimal overhead. More importantly, we show that mcTLS can be incrementally deployed and requires only small changes to client, server, and middlebox software.","PeriodicalId":268472,"journal":{"name":"Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115628428","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}

引用次数: 155

Coarse-grained Scheduling with Software-Defined Networking Switches 软件定义网络交换机的粗粒度调度

Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication Pub Date : 2015-08-17 DOI: 10.1145/2785956.2790004

M. Rifai, Dino Lopez Pacheco, G. Urvoy-Keller

引用次数: 9

Efficient Coflow Scheduling Without Prior Knowledge 无先验知识的高效协同流调度

Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication Pub Date : 2015-08-17 DOI: 10.1145/2785956.2787480

Mosharaf Chowdhury, I. Stoica

{"title":"Efficient Coflow Scheduling Without Prior Knowledge","authors":"Mosharaf Chowdhury, I. Stoica","doi":"10.1145/2785956.2787480","DOIUrl":"https://doi.org/10.1145/2785956.2787480","url":null,"abstract":"Inter-coflow scheduling improves application-level communication performance in data-parallel clusters. However, existing efficient schedulers require a priori coflow information and ignore cluster dynamics like pipelining, task failures, and speculative executions, which limit their applicability. Schedulers without prior knowledge compromise on performance to avoid head-of-line blocking. In this paper, we present Aalo that strikes a balance and efficiently schedules coflows without prior knowledge. Aalo employs Discretized Coflow-Aware Least-Attained Service (D-CLAS) to separate coflows into a small number of priority queues based on how much they have already sent across the cluster. By performing prioritization across queues and by scheduling coflows in the FIFO order within each queue, Aalo's non-clairvoyant scheduler reduces coflow completion times while guaranteeing starvation freedom. EC2 deployments and trace-driven simulations show that communication stages complete 1.93X faster on average and 3.59X faster at the 95th percentile using Aalo in comparison to per-flow mechanisms. Aalo's performance is comparable to that of solutions using prior knowledge, and Aalo outperforms them in presence of cluster dynamics.","PeriodicalId":268472,"journal":{"name":"Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115708679","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}

引用次数: 280

Scaling Up Clustered Network Appliances with ScaleBricks 使用ScaleBricks扩展集群网络设备

Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication Pub Date : 2015-08-17 DOI: 10.1145/2785956.2787503

Dong Zhou, Bin Fan, Hyeontaek Lim, D. Andersen, M. Kaminsky, M. Mitzenmacher, Ren Wang, A. Singh

引用次数: 29