发布求助
文献互助 智能选刊 最新文献

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

筛选
英文 中文
Tardis Tardis
Proceedings of the ACM SIGCOMM Symposium on SDN Research (SOSR) Pub Date : 2021-10-11 DOI: 10.1145/3482898.3483355
Zhenyu Zhou, Theophilus A. Benson, Marco Canini, B. Chandrasekaran
{"title":"Tardis","authors":"Zhenyu Zhou, Theophilus A. Benson, Marco Canini, B. Chandrasekaran","doi":"10.1145/3482898.3483355","DOIUrl":"https://doi.org/10.1145/3482898.3483355","url":null,"abstract":"Guaranteeing high availability of networks virtually hinges on the ability to handle and recover from bugs and failures. Yet, despite the advances in verification, testing, and debugging, production networks remain susceptible to large-scale failures --- often due to deterministic bugs. This paper explores the use of input transformations as a viable method for recovering from such deterministic bugs. In particular, we introduce an online system, Tardis, for overcoming deterministic faults by using a blend of program analysis and runtime program data to systematically determine the fault-triggering input events and using domain-specific models to automatically generate transformations of the fault-triggering inputs that are both safe and semantically equivalent. We evaluated Tardison several production network control plane applications (CPAs), including six SDN CPAs and several popular BGP CPAs using 71 realistic bugs. We observe that Tardisimproves recovery time by 7.44%, introduces a 25% CPU and 0.5% memory overhead, and recovers from 77.26% of the injected realistic and representative bugs, more than twice that of existing solutions.","PeriodicalId":161157,"journal":{"name":"Proceedings of the ACM SIGCOMM Symposium on SDN Research (SOSR)","volume":"51 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":"114853413","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
Analyzing Traffic by Domain Name in the Data Plane 数据平面的域名流量分析
Proceedings of the ACM SIGCOMM Symposium on SDN Research (SOSR) Pub Date : 2021-10-11 DOI: 10.1145/3482898.3483357
Jason Kim, Hyojoon Kim, J. Rexford
{"title":"Analyzing Traffic by Domain Name in the Data Plane","authors":"Jason Kim, Hyojoon Kim, J. Rexford","doi":"10.1145/3482898.3483357","DOIUrl":"https://doi.org/10.1145/3482898.3483357","url":null,"abstract":"Associating network traffic with human-readable domain names, instead of low-level identifiers like IP addresses, is helpful for measuring traffic by domain name, rate-limiting packets by domain, and identifying IoT devices. However, existing monitoring techniques require examining traffic at an external compute node, introducing overhead and privacy risks. In this paper, we introduce Meta4, a framework for monitoring traffic by domain name in the data plane by extracting the client IP, server IP, and domain name from DNS response messages and associating the domain name with data traffic from the subsequent client-server session. A data-plane implementation has the benefits of running efficiently at line-rate, enabling the switch to take direct action on the packets (e.g., to rate-limit, block, or mark traffic based on the associated domain), and protecting the privacy of user information. We implemented Meta4 on an Intel Tofino switch and evaluated our prototype against packet traces from an operational network.","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":"122947474","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
A P4-based 5G User Plane Function 基于p4的5G用户平面功能
Proceedings of the ACM SIGCOMM Symposium on SDN Research (SOSR) Pub Date : 2021-10-11 DOI: 10.1145/3482898.3483358
Robert MacDavid, C. Cascone, Pingping Lin, Badhrinath Padmanabhan, A. Thakur, Larry L. Peterson, J. Rexford, M. O. Sunay
{"title":"A P4-based 5G User Plane Function","authors":"Robert MacDavid, C. Cascone, Pingping Lin, Badhrinath Padmanabhan, A. Thakur, Larry L. Peterson, J. Rexford, M. O. Sunay","doi":"10.1145/3482898.3483358","DOIUrl":"https://doi.org/10.1145/3482898.3483358","url":null,"abstract":"The demands on mobile networks are constantly evolving, but designing and integrating new high-speed packet processing remains a challenge due to the complexity of requirements and opacity of protocol specifications. 5G data planes should be implemented in programmable hardware for both speed and flexibility, and extending or replacing these data planes should be painless. In this paper we implement the 5G data plane using two P4 programs: one that acts as a open-source model data plane to simplify the interface with the control plane, and one to run efficiently on hardware switches to minimize latency and maximize bandwidth. The model data plane enables testing changes made to the control plane before integrating with a performant data plane, and vice versa. The hardware data plane implements the fast path for device traffic, and makes use of microservices to implement functions that highspeed switch hardware cannot do. Our data plane implementation is currently in limited deployment on three university campuses where it is enabling new research on mobile networks.","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":"131143108","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}
引用次数: 29
D2R: Policy-Compliant Fast Reroute D2R:符合策略的快速路由
Proceedings of the ACM SIGCOMM Symposium on SDN Research (SOSR) Pub Date : 2021-10-11 DOI: 10.1145/3482898.3483360
Kausik Subramanian, Anubhavnidhi Abhashkumar, Loris D'antoni, Aditya Akella
{"title":"D2R: Policy-Compliant Fast Reroute","authors":"Kausik Subramanian, Anubhavnidhi Abhashkumar, Loris D'antoni, Aditya Akella","doi":"10.1145/3482898.3483360","DOIUrl":"https://doi.org/10.1145/3482898.3483360","url":null,"abstract":"In networks today, the data plane handles forwarding--- sending a packet to the next device in the path---and the control plane handles routing---deciding the path of the packet in the network. This architecture has limitations. First, when link failures occur, the data plane has to wait for the control plane to install new routes, and packet losses can occur due to delayed routing convergence or central controller latencies. Second, policy-compliance is not guaranteed without sophisticated configuration synthesis or controller intervention. Fast reroute mechanisms in the data plane cannot provide both connectivity and policy-compliance guarantees. We take advantage of the recent advances in fast programmable switches to perform policy-compliant route computations entirely in the data plane, thus providing fast and programmable reactions to failures. D2R provides the illusion of a hierarchical network fabric that is always available and policy-compliant under failures. We implement our data plane in P4 and show its viability in real world topologies.","PeriodicalId":161157,"journal":{"name":"Proceedings of the ACM SIGCOMM Symposium on SDN Research (SOSR)","volume":"66 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":"127622718","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}
引用次数: 9
DBVal
Proceedings of the ACM SIGCOMM Symposium on SDN Research (SOSR) Pub Date : 2021-10-11 DOI: 10.1145/3482898.3483352
K. S. Kumar, R. K., P. S. Prashanth, Mina Tahmasbi Arashloo, V. U., Praveen Tammana
{"title":"DBVal","authors":"K. S. Kumar, R. K., P. S. Prashanth, Mina Tahmasbi Arashloo, V. U., Praveen Tammana","doi":"10.1145/3482898.3483352","DOIUrl":"https://doi.org/10.1145/3482898.3483352","url":null,"abstract":"The P4 software ecosystem to operate programmable data planes is increasingly becoming complex. The packet-processing behavior is defined by several components: the P4 program, the compiler that maps P4 programs to resource-constrained switch pipeline, the control-plane program that installs rules, and the switch software agents that configure the data plane. Bugs in any one or more of these components would potentially introduce packet-processing errors in the data plane. Prior work verifies P4 programs before deployment and found many program bugs. But bugs can happen in other components after the program deployment and may not be found during testing and only manifest themselves in production. In this work, our goal is to detect packet-processing errors induced by bugs that are not caught (or are difficult to catch) before the P4 program deployment. Our key idea is to let P4 programmers specify the intended packet-processing behavior and validate the actual packet-processing behavior against the intended behavior at runtime. We obtain intended behavior from the P4 programmers in the form of assertions, where each assertion specifies which tables and actions should be applied and in what order on a certain subset of traffic. Next, the assertions are compiled and translated to P4 implementation such that the implementation efficiently tracks the packet execution path, that is, the set of tables applied and actions executed, and then validates the tracked behavior at line rate. We show that our techniques can be used to effectively detect bugs that are difficult, if not impossible, to catch with existing techniques for testing and verifying programmable data planes.","PeriodicalId":161157,"journal":{"name":"Proceedings of the ACM SIGCOMM Symposium on SDN Research (SOSR)","volume":"75 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":"127403490","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
Nimble 灵活的
Proceedings of the ACM SIGCOMM Symposium on SDN Research (SOSR) Pub Date : 2021-10-11 DOI: 10.5040/9781623560621.06710
Vineeth Sagar Thapeta, Komal Shinde, Mojtaba MalekpourShahraki, Darius Grassi, Balajee Vamanan, Brent E. Stephens
{"title":"Nimble","authors":"Vineeth Sagar Thapeta, Komal Shinde, Mojtaba MalekpourShahraki, Darius Grassi, Balajee Vamanan, Brent E. Stephens","doi":"10.5040/9781623560621.06710","DOIUrl":"https://doi.org/10.5040/9781623560621.06710","url":null,"abstract":"","PeriodicalId":161157,"journal":{"name":"Proceedings of the ACM SIGCOMM Symposium on SDN Research (SOSR)","volume":"111 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":"125853427","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
Telemetry Retrieval Inaccuracy in Programmable Switches: Analysis and Recommendations 遥测检索不准确的可编程开关:分析和建议
Proceedings of the ACM SIGCOMM Symposium on SDN Research (SOSR) Pub Date : 2021-10-11 DOI: 10.1145/3482898.3483359
Hun Namkung, Daehyeok Kim, Zaoxing Liu, V. Sekar, P. Steenkiste
{"title":"Telemetry Retrieval Inaccuracy in Programmable Switches: Analysis and Recommendations","authors":"Hun Namkung, Daehyeok Kim, Zaoxing Liu, V. Sekar, P. Steenkiste","doi":"10.1145/3482898.3483359","DOIUrl":"https://doi.org/10.1145/3482898.3483359","url":null,"abstract":"Sketching algorithms or sketches are attractive as telemetry capabilities on programmable hardware switches since they offer rigorous accuracy guarantees and use compact data structures. However, we find that in practice, their actual implementations can have a significant (up to 94×) accuracy drop compared to theoretical expectations. We find that the delays incurred by pulling and resetting the data plane state induce accuracy degradation. We design and implement solutions to reduce the delays and show that our solutions can help eliminate almost all the inaccuracy of existing sketch workflows.","PeriodicalId":161157,"journal":{"name":"Proceedings of the ACM SIGCOMM Symposium on SDN Research (SOSR)","volume":"88 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":"129110076","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
Performance-Driven Internet Path Selection 性能驱动的互联网路径选择
Proceedings of the ACM SIGCOMM Symposium on SDN Research (SOSR) Pub Date : 2020-01-21 DOI: 10.1145/3482898.3483366
M. Apostolaki, Ankit Singla, L. Vanbever
{"title":"Performance-Driven Internet Path Selection","authors":"M. Apostolaki, Ankit Singla, L. Vanbever","doi":"10.1145/3482898.3483366","DOIUrl":"https://doi.org/10.1145/3482898.3483366","url":null,"abstract":"Internet routing can often be sub-optimal, with the chosen routes providing worse performance than other available policy-compliant routes. This stems from the lack of visibility into route performance at the network layer. While this is an old problem, we argue that recent advances in programmable hardware finally open up the possibility of performance-aware routing in a deployable, BGP-compatible manner. We introduce RouteScout, a hybrid hardware/software system supporting performance-based routing at ISP scale. In the data plane, RouteScoutleverages P4-enabled hardware to monitor performance across policy-compliant route choices for each destination, at line-rate and with a small memory footprint. RouteScout'scontrol plane then asynchronously pulls aggregated performance metrics to synthesize a performance-aware forwarding policy. We show that RouteScoutcan monitor performance across most of an ISP's traffic, using only 4 MB of memory. Further, its control can flexibly satisfy a variety of operator objectives, with sub-second operating times.","PeriodicalId":161157,"journal":{"name":"Proceedings of the ACM SIGCOMM Symposium on SDN Research (SOSR)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124598910","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
首页 上一页
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学术官方微信