Proceedings of the ACM SIGCOMM Symposium on SDN Research (SOSR)最新文献

筛选
英文 中文
Correct-by-Construction Network Programming for Stateful Data-Planes 有状态数据平面的构造校正网络编程
Proceedings of the ACM SIGCOMM Symposium on SDN Research (SOSR) Pub Date : 2021-10-11 DOI: 10.1145/3482898.3483362
Jedidiah McClurg
{"title":"Correct-by-Construction Network Programming for Stateful Data-Planes","authors":"Jedidiah McClurg","doi":"10.1145/3482898.3483362","DOIUrl":"https://doi.org/10.1145/3482898.3483362","url":null,"abstract":"As switch hardware becomes faster, more stateful, and more programmable, functionality that was once confined to end hosts or the control plane is being pushed into the data plane. For example, recent work on adaptive congestion control and heavy hitter detection uses stateful switches to implement sophisticated functionality with only minor controller involvement. In applications where correctness depends on individual switches making coherent decisions, it is important that the switches have a consistent view of global state. However, such a consistency requirement makes it difficult to maintain efficiency (high throughput), due to the CAP theorem. Moreover, previous work on data-plane programming provides little to no built-in support for addressing this difficulty. We propose Callback State Machines(CSMs), a new high-level declarative network programming abstraction which allows operators to write correct data-plane programs against global state. CSMs offer programmers useful consistency guarantees without the need to manage how global state is replicated/updated at the individual switch level. To aid in the implementation of this high-level programming framework, we present a flexible new intermediate representation (IR) called TAPIR that natively supports stateful data plane functionality, as well as a compiler to generate device-specific code such as P4 from TAPIR code. Additionally, we demonstrate the power of TAPIR itself by using it to build a working implementation of the CONGA congestion control system.","PeriodicalId":161157,"journal":{"name":"Proceedings of the ACM SIGCOMM Symposium on SDN Research (SOSR)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121027953","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}
引用次数: 0
Helix: Traffic Engineering for Multi-Controller SDN Helix:多控制器SDN流量工程
Proceedings of the ACM SIGCOMM Symposium on SDN Research (SOSR) Pub Date : 2021-10-11 DOI: 10.1145/3482898.3483354
Nicu Florin Zaicu, M. Luckie, R. Nelson, M. Barcellos
{"title":"Helix: Traffic Engineering for Multi-Controller SDN","authors":"Nicu Florin Zaicu, M. Luckie, R. Nelson, M. Barcellos","doi":"10.1145/3482898.3483354","DOIUrl":"https://doi.org/10.1145/3482898.3483354","url":null,"abstract":"Deploying traffic engineering (TE) in the context of multi-controller SDN (MCSDN) or on WANs is challenging due to state and consistency requirements. For example, using strong consistency to ensure that information is always up-to-date introduces significant performance overheads. However, using eventual consistency to reduce synchronisation time comes at the expense of using outdated information to make decisions. We design and implement Helix, an MCSDN system that supports deployment on WANs. Helix offloads operations closer to the data plane and minimises shared state between devices, allowing it to tolerate high latency and mitigate state consistency concerns. We develop a lightweight TE algorithm that requires minimal state, making it suitable for use with Helix. Our simulation results show that Helix reduces congestion loss by up to 1.6x and performs 12x fewer path changes compared to CSPF.","PeriodicalId":161157,"journal":{"name":"Proceedings of the ACM SIGCOMM Symposium on SDN Research (SOSR)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122791590","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}
引用次数: 0
Helix 螺旋
Proceedings of the ACM SIGCOMM Symposium on SDN Research (SOSR) Pub Date : 2021-10-11 DOI: 10.1007/springerreference_15706
Nicu Florin Zaicu, M. Luckie, Richard Nelson, M. Barcellos
{"title":"Helix","authors":"Nicu Florin Zaicu, M. Luckie, Richard Nelson, M. Barcellos","doi":"10.1007/springerreference_15706","DOIUrl":"https://doi.org/10.1007/springerreference_15706","url":null,"abstract":"","PeriodicalId":161157,"journal":{"name":"Proceedings of the ACM SIGCOMM Symposium on SDN Research (SOSR)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126993419","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}
引用次数: 0
P4 Weaver: Supporting Modular and Incremental Programming in P4 P4 Weaver:支持P4中的模块化和增量编程
Proceedings of the ACM SIGCOMM Symposium on SDN Research (SOSR) Pub Date : 2021-10-11 DOI: 10.1145/3482898.3483353
Ali Fattaholmanan, M. Baldi, Antonio Carzaniga, R. Soulé
{"title":"P4 Weaver: Supporting Modular and Incremental Programming in P4","authors":"Ali Fattaholmanan, M. Baldi, Antonio Carzaniga, R. Soulé","doi":"10.1145/3482898.3483353","DOIUrl":"https://doi.org/10.1145/3482898.3483353","url":null,"abstract":"In this paper, we introduce P4 Weaver as an approach towards bringing modularity into the P4 language. P4 Weaver is designed to merge new data plane features into a base program in a principled and controlled way, so as to preserve the reliability of the switch. We also present an architecture for an integrated development environment that supports modular P4 programming while also safeguarding the intellectual property of the vendor code. We demonstrate the utility of P4 Weaver by adding three popular but non-trivial protocols to a P4 switch. We show that modularity is indeed beneficial and that P4 Weaver supports modularity efficiently and reliably.","PeriodicalId":161157,"journal":{"name":"Proceedings of the ACM SIGCOMM Symposium on SDN Research (SOSR)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132707286","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}
引用次数: 1
NanoTransport
Proceedings of the ACM SIGCOMM Symposium on SDN Research (SOSR) Pub Date : 2021-10-11 DOI: 10.1145/3482898.3483365
S. Arslan, Stephen Ibanez, Alex Mallery, Changhoon Kim, N. McKeown
{"title":"NanoTransport","authors":"S. Arslan, Stephen Ibanez, Alex Mallery, Changhoon Kim, N. McKeown","doi":"10.1145/3482898.3483365","DOIUrl":"https://doi.org/10.1145/3482898.3483365","url":null,"abstract":"Transport protocols can be implemented in NIC (Network Interface Card) hardware to increase throughput, reduce latency and free up CPU cycles. If the ideal transport protocol were known, the optimal implementation would be simple: bake it into fixed-function hardware. But transport layer protocols are still evolving, with innovative new algorithms proposed every year. A recent study proposed Tonic, a Verilog-programmable transport layer in hardware. We build on this work to propose a new programmable hardware transport layer architecture, called nanoTransport, optimized for the extremely low-latency message-based RPCs (Remote Procedure Calls) that dominate large, modern distributed data center applications. NanoTransport is programmed using the P4 language, making it easy to modify existing (or create entirely new) transport protocols in hardware. We identify common events and primitive operations, allowing for a streamlined, modular, programmable pipeline, including packetization, reassembly, timeouts and packet generation, all to be expressed by the programmer. We evaluate our nanoTransport prototype by programming it to run the reliable message-based transport protocols NDP and Homa, as well as a hybrid variant. Our FPGA prototype - implemented in Chisel and running on the Firesim simulator - exposes P4-programmable pipelines and is designed to run in an ASIC at 200Gb/s with each packet processed end-to-end in less than 10ns (including message reassembly).","PeriodicalId":161157,"journal":{"name":"Proceedings of the ACM SIGCOMM Symposium on SDN Research (SOSR)","volume":"100 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116321954","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
Clustreams Clustreams
Proceedings of the ACM SIGCOMM Symposium on SDN Research (SOSR) Pub Date : 2021-10-11 DOI: 10.1145/3482898.3483356
Roy Friedman, Or Goaz, Ori Rottenstreich
{"title":"Clustreams","authors":"Roy Friedman, Or Goaz, Ori Rottenstreich","doi":"10.1145/3482898.3483356","DOIUrl":"https://doi.org/10.1145/3482898.3483356","url":null,"abstract":"Clusteringis a basic machine learning task. In this task, a stream of input items needs to be grouped into clusters, such that all items classified into the same cluster are closer to each other than to items classified to other clusters. Each cluster is centered around a centroidpoint, which may either be given as a parameter, or must be learned during the process in the case of unsupervised online learning. This work studies the ability to perform clustering, e.g., for classifying network traffic, in programmable switches. Conducting such classification by the switches through which the traffic flows is potentially the most efficient approach. To that end, we develop Clustreams, a novel in-network clustering system designed to handle clustering in the data path. At the core of Clustreamsis a novel clustering algorithm that relies heavily on TCAM (Ternary Content Addressable Memory) match-action capabilities. This algorithm is realized for the Nvidia Spectrum-3 switch, and is limited to classification when the centroid points are known a-priori. The work includes accuracy measurements for the algorithms, as well as run-time performance measurements and analysis of the clustering algorithm on a Spectrum-3 switch. As shown in the measurements, Clustreamsobtains very high accuracy without any noticeable run-time impact on the switch' performance.","PeriodicalId":161157,"journal":{"name":"Proceedings of the ACM SIGCOMM Symposium on SDN Research (SOSR)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122891056","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}
引用次数: 7
How Much TCAM do we Need for Splitting Traffic? 我们需要多少TCAM来分流交通?
Proceedings of the ACM SIGCOMM Symposium on SDN Research (SOSR) Pub Date : 2021-10-11 DOI: 10.1145/3482898.3483367
Yaniv Sadeh, Ori Rottenstreich, Haim Kaplan
{"title":"How Much TCAM do we Need for Splitting Traffic?","authors":"Yaniv Sadeh, Ori Rottenstreich, Haim Kaplan","doi":"10.1145/3482898.3483367","DOIUrl":"https://doi.org/10.1145/3482898.3483367","url":null,"abstract":"Traffic splitting is a required functionality in networks, for example for load balancing over paths or servers or by the source's access restrictions. The capacities of the servers (or the number of users with particular access restrictions) determine the sizes of the parts into which traffic should be split. A recent approach implements traffic splitting within the ternary content addressable memory (TCAM), which is often available in switches. It is important to reduce the amount of memory allocated for this task since TCAMs are power consuming and are often also required for other tasks such as classification and routing. Recent works suggested algorithms to compute a smallest implementation of a given partition in the longest prefix match (LPM) model. In this paper we analyze properties of such minimal representations and prove lower and upper bounds on their size. The upper bounds hold for general TCAMs, and we also prove an additional lower-bound for general TCAMs.","PeriodicalId":161157,"journal":{"name":"Proceedings of the ACM SIGCOMM Symposium on SDN Research (SOSR)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130103896","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}
引用次数: 3
Accelerating Distributed Deep Learning using Multi-Path RDMA in Data Center Networks 在数据中心网络中使用多路径RDMA加速分布式深度学习
Proceedings of the ACM SIGCOMM Symposium on SDN Research (SOSR) Pub Date : 2021-10-11 DOI: 10.1145/3482898.3483363
Feng Tian, Yang Zhang, Wei Ye, Cheng Jin, Ziyan Wu, Zhi-Li Zhang
{"title":"Accelerating Distributed Deep Learning using Multi-Path RDMA in Data Center Networks","authors":"Feng Tian, Yang Zhang, Wei Ye, Cheng Jin, Ziyan Wu, Zhi-Li Zhang","doi":"10.1145/3482898.3483363","DOIUrl":"https://doi.org/10.1145/3482898.3483363","url":null,"abstract":"Data center networks (DCNs) have widely deployed RDMA to support data-intensive applications such as machine learning. While DCNs are designed with rich multi-path topology, current RDMA (hardware) technology does not support multi-path transport. In this paper we advance Maestro- a purely software-basedmulti-path RDMA solution - to effectively utilize the rich multi-path topology for load balancing and reliability. As a \"middleware\" operating at the user-space, Maestro is modulaR@and software-defined:Maestro decouples path selection and load balancing mechanisms from hardware features, and allows DCN operators and applications to make flexible decisions by employing the best mechanisms as needed. As such, Maestro can be readily deployed using existing RDMA hardware (NICs) to support distributed deep learning (DDL) applications. Our experiments show that Maestro is capable of fully utilizing multiple paths with negligible CPU overheads, thereby enhancing the performance of DDL applications.","PeriodicalId":161157,"journal":{"name":"Proceedings of the ACM SIGCOMM Symposium on SDN Research (SOSR)","volume":"34 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132082731","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}
引用次数: 4
Nimble: Scalable TCP-Friendly Programmable In-Network Rate-Limiting 灵活:可扩展的tcp友好的可编程网络限速
Proceedings of the ACM SIGCOMM Symposium on SDN Research (SOSR) Pub Date : 2021-10-11 DOI: 10.1145/3482898.3483361
Vineeth Sagar Thapeta, Komal Shinde, Mojtaba MalekpourShahraki, Darius Grassi, Balajee Vamanan, Brent E. Stephens
{"title":"Nimble: Scalable TCP-Friendly Programmable In-Network Rate-Limiting","authors":"Vineeth Sagar Thapeta, Komal Shinde, Mojtaba MalekpourShahraki, Darius Grassi, Balajee Vamanan, Brent E. Stephens","doi":"10.1145/3482898.3483361","DOIUrl":"https://doi.org/10.1145/3482898.3483361","url":null,"abstract":"There is an emerging need for scalable high-performance in-networkrate-limiting because rate-limiters can be used to provide performance isolation. However, existing approaches to in-network rate-limiting are not scalable or TCP-friendly. This paper presents the design of Nimble, a new approach to in-network rate-limiting that is scalable, high performance, and TCP-friendly. Nimble uses meters to scalably provide hardware rate-limiting without any dedicated queuing or buffering resources, and Nimble uses ECN-Shaping for TCP-friendly rate-limit enforcement. Nimble also introduces the first algorithm for configuring in-network rate-limiters to enforce network-wide isolation policies. Through a P4 implementation and experiments with a 100Gbps Barefoot Tofino switch, we find that Nimble is immediately usable and can operate even with high bandwidth rate-limits without needing to recirculate packets or rely on hardware packet generators to generate token refill packets. This overcomes the scalability limitations of prior approaches. Experiments with Apache and Redis show that Nimble can reduce application-level latency by an order of magnitude when compared to not using in-network rate-limiting, and ns-3 simulations demonstrate that Nimble behaves well in larger clusters. We find that Nimble can scale to 100K rate-limiters perswitch when implemented on a Barefoot Tofino switch, and our new rate allocation algorithm reduces rate-limiter updates by a factor of 10x-24x and improves network utilization by 24%.","PeriodicalId":161157,"journal":{"name":"Proceedings of the ACM SIGCOMM Symposium on SDN Research (SOSR)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132225313","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}
引用次数: 7
Taproot: Resilient Diversity Routing with Bounded Latency Taproot:具有有限延迟的弹性分集路由
Proceedings of the ACM SIGCOMM Symposium on SDN Research (SOSR) Pub Date : 2021-10-11 DOI: 10.1145/3482898.3483364
Eman Ramadan, Hesham Mekky, Cheng Jin, Braulio Dumba, Zhi-Li Zhang
{"title":"Taproot: Resilient Diversity Routing with Bounded Latency","authors":"Eman Ramadan, Hesham Mekky, Cheng Jin, Braulio Dumba, Zhi-Li Zhang","doi":"10.1145/3482898.3483364","DOIUrl":"https://doi.org/10.1145/3482898.3483364","url":null,"abstract":"As we increasingly depend on networked services, ensuring resiliency of networks against network failures and providing bounded latency to applications become imperative. Adding ample redundancy in the network substrate alone is not sufficient; resilient routing mechanisms that can effectively take advantage of such topological diversity also play a critical role. In this paper, we present Taproot, a resilient diversity routing algorithmthat ensures bounded latencyfor packet delivery under failures by leveraging a preordeR@routing structure with precomputed routing rules. Leveraging the centralizedcontrol plane and programmable match-actionrules in the data plane, we describe how Taproot can be realized in SDN networks. We implement Taproot in OVS and conduct extensive simulations and experiments to demonstrate its superior performance over existing solutions. Our results show that by tuning the latency allowance upon failure, Taproot reduces/eliminates the number of disconnected src-dst pairs even under 10 link failures. Finally, as a use case, we illustrate the impact of control channel failures on SDN data plane/application performance, and employ Taproot to provide a \"hardened\" SDN control network with bounded latency against failures. Our results show that Taproot immediately detects the failure and re-routes the control messages to a different path avoiding failed links/nodes. Hence, the control channel is maintained without interruption, or involvement from the controller, and the throughput was not affected.","PeriodicalId":161157,"journal":{"name":"Proceedings of the ACM SIGCOMM Symposium on SDN Research (SOSR)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115391696","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}
引用次数: 2
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信