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

Proceedings of the Symposium on Architectures for Networking and Communications Systems最新文献

筛选
英文 中文
The Cost of Stateless Network Functions in 5G 5G中无状态网络功能的成本
Proceedings of the Symposium on Architectures for Networking and Communications Systems Pub Date : 2021-12-13 DOI: 10.1145/3493425.3502749
U. Kulkarni, Amit Sheoran, S. Fahmy
{"title":"The Cost of Stateless Network Functions in 5G","authors":"U. Kulkarni, Amit Sheoran, S. Fahmy","doi":"10.1145/3493425.3502749","DOIUrl":"https://doi.org/10.1145/3493425.3502749","url":null,"abstract":"The adoption of a cloud-native architecture in 5G networks has facilitated rapid deployment and update of cellular services. An important part of this architecture is the implementation of 5G network functions statelessly. However, statelessness and its associated serialization and de-serialization of data and database interaction significantly increase latency. In this work, we take the first steps towards quantifying the cost of statelessness in a cloud-native 5G system. We compare the cost of different state management paradigms, and propose a number of optimizations to reduce this cost. Our preliminary results indicate that sharing user state among 5G functions reduces the overall cost by on an average of 10% in experiments with 100 to 1000 simultaneous requests. Optimizations such as non-blocking calls and custom database APIs also reduce cost, albeit to a lower extent. We believe that the paradigms proposed in this paper can aid operators and software vendors as they design cloud-native 5G networks.","PeriodicalId":426581,"journal":{"name":"Proceedings of the Symposium on Architectures for Networking and Communications Systems","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127028758","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
KickTree KickTree
Proceedings of the Symposium on Architectures for Networking and Communications Systems Pub Date : 2021-12-13 DOI: 10.1145/3493425.3502752
Yao Xin, Yuxi Liu, Wenjun Li, Ruyi Yao, Yang Xu, Yi Wang
{"title":"KickTree","authors":"Yao Xin, Yuxi Liu, Wenjun Li, Ruyi Yao, Yang Xu, Yi Wang","doi":"10.1145/3493425.3502752","DOIUrl":"https://doi.org/10.1145/3493425.3502752","url":null,"abstract":"As a promising alternative to TCAM-based solutions for packet classification, FPGA has received increasing attention. Although extensive research has been conducted in this area, existing FPGA-based packet classifiers cannot satisfy the burgeoning needs from OpenFlow, which demands large-scale rule sets and frequent rule updates. As a recently proposed hardware-specific approach, TabTree avoids rule replication and supports dynamic rule update. However, it still faces problems of unbalanced rule subset partition, unevenly distributed subtrees and excessive TSS leaf nodes when implemented on FPGA. In this paper, we propose a hardware-friendly packet classification approach called KickTree, which is elaborated by considering hardware properties. To take advantage of intrinsic parallelism of FPGA, KickTree adopts multiple balanced decision trees which can run simultaneously. The bit selection is more flexible which breaks the restriction of rule subset. Moreover, each subset size is strictly limited, leading to bounded and evenly-distributed","PeriodicalId":426581,"journal":{"name":"Proceedings of the Symposium on Architectures for Networking and Communications Systems","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114595178","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}
引用次数: 5
Mitigation of IPv6 Router Spoofing Attacks with P4 基于P4的IPv6路由器欺骗攻击缓解
Proceedings of the Symposium on Architectures for Networking and Communications Systems Pub Date : 2021-12-13 DOI: 10.1145/3493425.3502765
Moritz Mönnich, Nurefsan Sertbas Bülbül, Doğanalp Ergenç, Mathias Fischer
{"title":"Mitigation of IPv6 Router Spoofing Attacks with P4","authors":"Moritz Mönnich, Nurefsan Sertbas Bülbül, Doğanalp Ergenç, Mathias Fischer","doi":"10.1145/3493425.3502765","DOIUrl":"https://doi.org/10.1145/3493425.3502765","url":null,"abstract":"The IPv6 protocol will sooner or later replace IPv4 to cope with an exponentially increasing number of connected devices. Some of the most significant functions of IPv6 networks are network discovery, maintenance, and routing mechanisms to promote auto-configuration of the network with less manual effort. Network Discovery Protocol (NDP) is an important protocol in IPv6 to identify the relationships between different neighboring devices in a network. However, it is also subject to spoofing and man-in-the-middle attacks. This paper implements an attack detection and mitigation strategy called Router Advertisement Guard (RA-Guard) in P4 to defend IPv6 networks against router spoofing attacks directly on the data plane. In contrast to very few proprietary RA-Guard implementations with limited details, we consider different scenarios to exploit IPv6 packet structure and publish our implementation open-source. The experiments show that our P4-based implementation can detect and mitigate spoofing attacks leveraging RA-Guard together with its control plane extensions.","PeriodicalId":426581,"journal":{"name":"Proceedings of the Symposium on Architectures for Networking and Communications Systems","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123582272","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
On Efficient Oblivious Wavelength Assignments for Programmable Wide-Area Topologies 可编程广域拓扑的高效无关波长分配
Proceedings of the Symposium on Architectures for Networking and Communications Systems Pub Date : 2021-12-13 DOI: 10.1145/3493425.3502753
Thomas Fenz, Klaus-Tycho Foerster, S. Schmid
{"title":"On Efficient Oblivious Wavelength Assignments for Programmable Wide-Area Topologies","authors":"Thomas Fenz, Klaus-Tycho Foerster, S. Schmid","doi":"10.1145/3493425.3502753","DOIUrl":"https://doi.org/10.1145/3493425.3502753","url":null,"abstract":"Given the explosively growing traffic related to data-centric applications and AI, especially to and from the cloud, it is crucial to make the best use of the given resources of wide-area backbone networks (WANs). An intriguing approach to improve both efficiency and performance of WANs is to render networks more adaptive and \"demand-aware\", on the physical layer: innovative programmable wide-area topologies support dynamic wavelength assignments. This is enabled by the application of colorless and directionless Reconfigurable Optical Add/Drop Multiplexers (CD ROADM), and by leveraging the capabilities of software-defined controllers. This paper investigates the benefit of such fully dynamic wavelength assignments in programmable WAN topologies, compared to an oblivious wavelength assignment. To this end, we also propose a new demand-oblivious strategy to optimize the capacity of a WAN. Considering both real and synthetic scenarios, we find that our proposed demand-oblivious strategy can perform close to dynamic approaches with respect to throughput, without entailing reconfiguration costs.","PeriodicalId":426581,"journal":{"name":"Proceedings of the Symposium on Architectures for Networking and Communications Systems","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131713364","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
Macchiato: Importing Cache Side Channels to SDNs 玛奇朵:将缓存侧通道导入sdn
Proceedings of the Symposium on Architectures for Networking and Communications Systems Pub Date : 2021-12-13 DOI: 10.1145/3493425.3502758
A. Sabzi, Liron Schiff, K. Thimmaraju, Andreas Blenk, S. Schmid
{"title":"Macchiato: Importing Cache Side Channels to SDNs","authors":"A. Sabzi, Liron Schiff, K. Thimmaraju, Andreas Blenk, S. Schmid","doi":"10.1145/3493425.3502758","DOIUrl":"https://doi.org/10.1145/3493425.3502758","url":null,"abstract":"Since caches are shared and coherent, a memory access of one process may evict from the cache another process' memory block with an address mapped to the same cache line. This property is exploited by several attacks to form side channels. We show that MAC learning in Software Defined Networks (SDNs) has a similar property in the sense that a MAC address discovered by one network device may be revoked by the discovery of the same address at another switch. This allows us to implement Macchiato, a covert channel for SDNs between any two network devices (including hosts); prior SDN covert channels required at least one malicious switch. We evaluate a prototype implementation of Macchiato and discuss how methods to improve the performance of cache side channels (such as deep neural networks) can also be used in Macchiato.","PeriodicalId":426581,"journal":{"name":"Proceedings of the Symposium on Architectures for Networking and Communications Systems","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132283471","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
Realizing Zenoh with programmable dataplanes 用可编程数据平面实现Zenoh
Proceedings of the Symposium on Architectures for Networking and Communications Systems Pub Date : 2021-12-13 DOI: 10.1145/3493425.3502761
Alexandre Santos, José Quevedo, Daniel Corujo
{"title":"Realizing Zenoh with programmable dataplanes","authors":"Alexandre Santos, José Quevedo, Daniel Corujo","doi":"10.1145/3493425.3502761","DOIUrl":"https://doi.org/10.1145/3493425.3502761","url":null,"abstract":"This paper presents an implementation of the Zenoh pub-sub stack using P4. Traditional pub-sub protocols generally rely on a centralized broker to forward messages. Using P4, one could make every network equipment able to assume such role, with the whole system behaving as a distributed broker. By deploying network tasks at the edge, this approach can reduce end-to-end latency and the overhead caused by packet retransmission due to packet loss. The proposed implementation accounts for the offloading of some control tasks into the data plane. The prototype is validated and the impact of the task offloading features is assessed. Results show that offloading can be beneficial and improve network performance. Still, our system is outperformed by traditional Zenoh Routers, which is explained by the lack of performance of the used BMv2 software switch. To account for these limitations, future developments from this work will target hardware-based validation.","PeriodicalId":426581,"journal":{"name":"Proceedings of the Symposium on Architectures for Networking and Communications Systems","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134122239","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
Generic change detection (almost entirely) in the dataplane 数据平面中的通用变更检测(几乎全部)
Proceedings of the Symposium on Architectures for Networking and Communications Systems Pub Date : 2021-12-13 DOI: 10.1145/3493425.3502767
Gonçalo P. Matos, S. Signorello, Fernando M. V. Ramos
{"title":"Generic change detection (almost entirely) in the dataplane","authors":"Gonçalo P. Matos, S. Signorello, Fernando M. V. Ramos","doi":"10.1145/3493425.3502767","DOIUrl":"https://doi.org/10.1145/3493425.3502767","url":null,"abstract":"Identifying traffic changes accurately sits at the core of many network tasks, from congestion analysis to intrusion detection. Modern systems leverage sketch-based structures that achieve favourable memory-accuracy tradeoffs by maintaining compact summaries of traffic data. Mainly used to detect heavy-hitters (usually the major source of network congestion), some can be adapted to detect traffic changes, but they fail on generality. As their core data structures track elephant flows, they miss to identify mice traffic that may be the main cause of change (e.g., microbursts or low-volume attacks). We present k-meleon, an in-network online change detection system that identifies heavy-changes - instead of changes amongst heavy-hitters only, a subtle but crucial difference. Our main contribution is a variant of the k-ary sketch (a well-known heavy-change detector) that runs on the data plane of a switch. The challenge was the batch-based design of the original. To address it, k-meleon features a new stream-based design that matches the pipeline computation model and fits its tough constraints. A preliminary evaluation shows that k-meleon achieves the same level of accuracy for online detection as the offline k-ary, detecting changes for any type of flow: be it an elephant, or a mouse.","PeriodicalId":426581,"journal":{"name":"Proceedings of the Symposium on Architectures for Networking and Communications Systems","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132849984","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
High-Performance Match-Action Table Updates from within Programmable Software Data Planes 可编程软件数据平面内的高性能匹配-动作表更新
Proceedings of the Symposium on Architectures for Networking and Communications Systems Pub Date : 2021-12-13 DOI: 10.1145/3493425.3502759
Manuel Simon, Henning Stubbe, D. Scholz, Sebastian Gallenmüller, G. Carle
{"title":"High-Performance Match-Action Table Updates from within Programmable Software Data Planes","authors":"Manuel Simon, Henning Stubbe, D. Scholz, Sebastian Gallenmüller, G. Carle","doi":"10.1145/3493425.3502759","DOIUrl":"https://doi.org/10.1145/3493425.3502759","url":null,"abstract":"For long, P4's mantra was that table entries could only be updated by the control plane. With the ongoing Portable NIC Architecture (PNA) standardization efforts, this is changing. In fact, PNA presumably includes explicit methods for table updates from within the data planes. Now, it is onto manufacturers and developers to integrate and use this mechanism in future P4 data planes. This would enable novel and improved applications, e.g., requiring means for maintaining state. We present our implementation of flexible match-action tables for the DPDK-based t4p4s target. We discuss different approaches for table updates from within the data plane and challenges that arise when operating at line rate. Further, we analyze the data consistency of our enhanced table structures in a multi-core scenario and model the memory overhead for state management purposes.","PeriodicalId":426581,"journal":{"name":"Proceedings of the Symposium on Architectures for Networking and Communications Systems","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126112396","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
Towards a more programmable and performance-optimized Virtual Switch: Introducing P4 programmability within OVS 迈向更可编程和性能优化的虚拟交换机:在OVS中引入P4可编程性
Proceedings of the Symposium on Architectures for Networking and Communications Systems Pub Date : 2021-12-13 DOI: 10.1145/3493425.3502763
Debashis Chatterjee, Namrata Limaye
{"title":"Towards a more programmable and performance-optimized Virtual Switch: Introducing P4 programmability within OVS","authors":"Debashis Chatterjee, Namrata Limaye","doi":"10.1145/3493425.3502763","DOIUrl":"https://doi.org/10.1145/3493425.3502763","url":null,"abstract":"Advent of network function virtualization and multiple virtual machines hosting multiple applications fueled the need for a programmable software switch that coordinates network traffic across them. Open Virtual Switch (OVS) is a software component that serves the purpose, and is it is ubiquitously deployed in the data centers. Today it is one of the key components of network infrastructure. We need a solution for efficiently offloading OVS in HW, to free up the host cores. The solution should be highly programmable and based on open standards, not constrained to work with a specific HW platform. In this paper, we will introduce a solution using P4, a domain-specific language for network packet processing.","PeriodicalId":426581,"journal":{"name":"Proceedings of the Symposium on Architectures for Networking and Communications Systems","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124839455","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
Mahjong 麻将
Proceedings of the Symposium on Architectures for Networking and Communications Systems Pub Date : 2021-12-13 DOI: 10.1145/3493425.3502755
Yifan Li, Chengjun Jia, Xiaohe Hu, Jun Li
{"title":"Mahjong","authors":"Yifan Li, Chengjun Jia, Xiaohe Hu, Jun Li","doi":"10.1145/3493425.3502755","DOIUrl":"https://doi.org/10.1145/3493425.3502755","url":null,"abstract":"Existing network data plane verification approaches check network correctness with various models and algorithms. With respect to a specific scenario, it is hard to judge which network model provides sufficient functionality and suitable performance, because existing verification approaches are implemented with different languages and evaluated against different datasets on different hardware platforms in their papers. A network operator usually has to try out a number of complex verification approaches to find the best one for her/his network and intents. Mahjong has a modular system architecture, a unified input format, and three classic verification tools built-in. Leveraging its well-defined partition interfaces and straight-forward configuration file, not only existing approaches can be refactored and merged into Mahjong, new approaches can also be introduced and evaluated with ease.","PeriodicalId":426581,"journal":{"name":"Proceedings of the Symposium on Architectures for Networking and Communications Systems","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122028437","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
下一页 尾页
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学术官方微信