Proceedings of the 2016 ACM SIGCOMM Conference最新文献_第4页

CS2P: Improving Video Bitrate Selection and Adaptation with Data-Driven Throughput Prediction 用数据驱动的吞吐量预测改进视频比特率选择和适应

Proceedings of the 2016 ACM SIGCOMM Conference Pub Date : 2016-08-22 DOI: 10.1145/2934872.2934898

Yi Sun, Xiaoqi Yin, Junchen Jiang, V. Sekar, Fuyuan Lin, Nanshu Wang, Tao Liu, B. Sinopoli

{"title":"CS2P: Improving Video Bitrate Selection and Adaptation with Data-Driven Throughput Prediction","authors":"Yi Sun, Xiaoqi Yin, Junchen Jiang, V. Sekar, Fuyuan Lin, Nanshu Wang, Tao Liu, B. Sinopoli","doi":"10.1145/2934872.2934898","DOIUrl":"https://doi.org/10.1145/2934872.2934898","url":null,"abstract":"Bitrate adaptation is critical in ensuring good users’ quality-of-experience (QoE) in Internet video delivery system. Several efforts have argued that accurate throughput prediction can dramatically improve (1) initial bitrate selection for low startup delay and high initial resolution; (2) midstream bitrate adaptation for high QoE. However, prior ef- forts did not systematically quantify real-world throughput predictability or develop good prediction algorithms. To bridge this gap, this paper makes three key technical contributions: First, we analyze the throughput characteristics in a dataset with 20M+ sessions. We find: (a) Sessions sharing similar key features (e.g., ISP, region) present similar initial values and dynamical patterns; (b) There is a natural “stateful” dynamical behavior within a given session. Second, building on these insights, we develop CS2P, a better throughput prediction system. CS2P leverages data-driven approach to learn (a) clusters of similar sessions, (b) an initial throughput predictor, and (c) a Hidden-Markov-Model based midstream predictor modeling the stateful evolution of throughput. Third, we develop a prototype system and show by trace-driven simulation and real-world experiments that CS2P outperforms state-of-art by 40% and 50% median pre- diction error respectively for initial and midstream through- put and improves QoE by 14% over buffer-based adaptation algorithm.","PeriodicalId":284960,"journal":{"name":"Proceedings of the 2016 ACM SIGCOMM Conference","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114345415","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}

引用次数: 341

Dataplane Specialization for High-performance OpenFlow Software Switching 高性能OpenFlow软件交换的数据平面专门化

Proceedings of the 2016 ACM SIGCOMM Conference Pub Date : 2016-08-22 DOI: 10.1145/2934872.2934887

László Molnár, Gergely Pongrácz, G. Enyedi, Z. Kis, Levente Csikor, F. Juhász, Attila Korösi, G. Rétvári

{"title":"Dataplane Specialization for High-performance OpenFlow Software Switching","authors":"László Molnár, Gergely Pongrácz, G. Enyedi, Z. Kis, Levente Csikor, F. Juhász, Attila Korösi, G. Rétvári","doi":"10.1145/2934872.2934887","DOIUrl":"https://doi.org/10.1145/2934872.2934887","url":null,"abstract":"OpenFlow is an amazingly expressive dataplane programming language, but this expressiveness comes at a severe performance price as switches must do excessive packet classification in the fast path. The prevalent OpenFlow software switch architecture is therefore built on flow caching, but this imposes intricate limitations on the workloads that can be supported efficiently and may even open the door to malicious cache overflow attacks. In this paper we argue that instead of enforcing the same universal flow cache semantics to all OpenFlow applications and optimize for the common case, a switch should rather automatically specialize its dataplane piecemeal with respect to the configured workload. We introduce ESwitch, a novel switch architecture that uses on-the-fly template-based code generation to compile any OpenFlow pipeline into efficient machine code, which can then be readily used as fast path. We present a proof-of-concept prototype and we demonstrate on illustrative use cases that ESwitch yields a simpler architecture, superior packet processing speed, improved latency and CPU scalability, and predictable performance. Our prototype can easily scale beyond 100 Gbps on a single Intel blade even with complex OpenFlow pipelines.","PeriodicalId":284960,"journal":{"name":"Proceedings of the 2016 ACM SIGCOMM Conference","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132235388","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}

引用次数: 62

Taming the Flow Table Overflow in OpenFlow Switch 控制OpenFlow交换机的流表溢出

Proceedings of the 2016 ACM SIGCOMM Conference Pub Date : 2016-08-22 DOI: 10.1145/2934872.2959063

Siyi Qiao, Chengchen Hu, X. Guan, Jianhua Zou

引用次数: 27

Named Data Networking Based Smart Home Lighting 命名为基于数据网络的智能家居照明

Proceedings of the 2016 ACM SIGCOMM Conference Pub Date : 2016-08-22 DOI: 10.1145/2934872.2959055

U. Silva, Adisorn Lertsinsrubtavee, A. Sathiaseelan, K. Kanchanasut

引用次数: 7

Modular SDN Compiler Design with Intermediate Representation 基于中间表示的模块化SDN编译器设计

Proceedings of the 2016 ACM SIGCOMM Conference Pub Date : 2016-08-22 DOI: 10.1145/2934872.2959061

Hao Li, Chengchen Hu, Peng Zhang, Lei Xie

引用次数: 6

Multi-Domain Orchestration across RAN and Transport for 5G 跨RAN和5G传输的多域业务流程

Proceedings of the 2016 ACM SIGCOMM Conference Pub Date : 2016-08-22 DOI: 10.1145/2934872.2959073

A. Rostami, P. Ohlen, Mateus A. S. Santos, A. Vidal

引用次数: 16

Eliminating Channel Feedback in Next-Generation Cellular Networks 消除下一代蜂窝网络中的信道反馈

Proceedings of the 2016 ACM SIGCOMM Conference Pub Date : 2016-08-22 DOI: 10.1145/2934872.2934895

Deepak Vasisht, Swarun Kumar, Hariharan Rahul, D. Katabi

{"title":"Eliminating Channel Feedback in Next-Generation Cellular Networks","authors":"Deepak Vasisht, Swarun Kumar, Hariharan Rahul, D. Katabi","doi":"10.1145/2934872.2934895","DOIUrl":"https://doi.org/10.1145/2934872.2934895","url":null,"abstract":"This paper focuses on a simple, yet fundamental question: ``Can a node infer the wireless channels on one frequency band by observing the channels on a different frequency band?'' This question arises in cellular networks, where the uplink and the downlink operate on different frequencies. Addressing this question is critical for the deployment of key 5G solutions such as massive MIMO, multi-user MIMO, and distributed MIMO, which require channel state information. We introduce R2-F2, a system that enables LTE base stations to infer the downlink channels to a client by observing the uplink channels from that client. By doing so, R2-F2 extends the concept of reciprocity to LTE cellular networks, where downlink and uplink transmissions occur on different frequency bands. It also removes a major hurdle for the deployment of 5G MIMO solutions. We have implemented R2-F2 in software radios and integrated it within the LTE OFDM physical layer. Our results show that the channels computed by R2-F2 deliver accurate MIMO beamforming (to within 0.7~dB of beamforming gains with ground truth channels) while eliminating channel feedback overhead.","PeriodicalId":284960,"journal":{"name":"Proceedings of the 2016 ACM SIGCOMM Conference","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128975929","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

FAST: A Simple Programming Abstraction for Complex State-Dependent SDN Programming FAST:复杂状态相关SDN编程的简单编程抽象

Proceedings of the 2016 ACM SIGCOMM Conference Pub Date : 2016-08-22 DOI: 10.1145/2934872.2960424

K. Gao, Chen Gu, Qiao Xiang, Y. Yang, J. Bi

引用次数: 3

Jumpstarting BGP Security with Path-End Validation 通过路径端验证快速启动BGP安全

Proceedings of the 2016 ACM SIGCOMM Conference Pub Date : 2016-08-22 DOI: 10.1145/2934872.2934883

Avichai Cohen, Y. Gilad, A. Herzberg, Michael Schapira

引用次数: 46

Programmable Packet Scheduling at Line Rate 线路速率可编程包调度

Proceedings of the 2016 ACM SIGCOMM Conference Pub Date : 2016-08-22 DOI: 10.1145/2934872.2934899

Anirudh Sivaraman, Suvinay Subramanian, Mohammad Alizadeh, S. Chole, Shang-Tse Chuang, Anurag Agrawal, H. Balakrishnan, T. Edsall, S. Katti, N. McKeown

{"title":"Programmable Packet Scheduling at Line Rate","authors":"Anirudh Sivaraman, Suvinay Subramanian, Mohammad Alizadeh, S. Chole, Shang-Tse Chuang, Anurag Agrawal, H. Balakrishnan, T. Edsall, S. Katti, N. McKeown","doi":"10.1145/2934872.2934899","DOIUrl":"https://doi.org/10.1145/2934872.2934899","url":null,"abstract":"Switches today provide a small menu of scheduling algorithms. While we can tweak scheduling parameters, we cannot modify algorithmic logic, or add a completely new algorithm, after the switch has been designed. This paper presents a design for a {em programmable} packet scheduler, which allows scheduling algorithms---potentially algorithms that are unknown today---to be programmed into a switch without requiring hardware redesign. Our design uses the property that scheduling algorithms make two decisions: in what order to schedule packets and when to schedule them. Further, we observe that in many scheduling algorithms, definitive decisions on these two questions can be made when packets are enqueued. We use these observations to build a programmable scheduler using a single abstraction: the push-in first-out queue (PIFO), a priority queue that maintains the scheduling order or time. We show that a PIFO-based scheduler lets us program a wide variety of scheduling algorithms. We present a hardware design for this scheduler for a 64-port 10 Gbit/s shared-memory (output-queued) switch. Our design costs an additional 4% in chip area. In return, it lets us program many sophisticated algorithms, such as a 5-level hierarchical scheduler with programmable decisions at each level.","PeriodicalId":284960,"journal":{"name":"Proceedings of the 2016 ACM SIGCOMM Conference","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123282053","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}

引用次数: 216