2019 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS)最新文献_第2页

Cryptographic Hashing in P4 Data Planes P4数据平面中的加密哈希

2019 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS) Pub Date : 2019-09-01 DOI: 10.1109/ANCS.2019.8901886

D. Scholz, Andreas Oeldemann, Fabien Geyer, Sebastian Gallenmüller, Henning Stubbe, Thomas Wild, A. Herkersdorf, G. Carle

{"title":"Cryptographic Hashing in P4 Data Planes","authors":"D. Scholz, Andreas Oeldemann, Fabien Geyer, Sebastian Gallenmüller, Henning Stubbe, Thomas Wild, A. Herkersdorf, G. Carle","doi":"10.1109/ANCS.2019.8901886","DOIUrl":"https://doi.org/10.1109/ANCS.2019.8901886","url":null,"abstract":"P4 introduces a standardized, universal way for data plane programming. Secure and resilient communication typically involves the processing of payload data and specialized cryptographic hash functions. We observe that current P4 targets lack the support for both. Therefore, applications and protocols, which require message authentication codes or hashing structures that are resilient against attacks such as denial-of-service, cannot be implemented. To enable authentication and resilience, we make the case for extending P4 targets with cryptographic hash functions. We propose an extension of the P4 Portable Switch Architecture for cryptographic hashes and discuss our prototype implementations for three different P4 target platforms: CPU, NPU, and FPGA. To assess the practical applicability, we conduct a performance evaluation and analyze the resource consumption. Our prototype implementations show that cryptographic hashing can be integrated efficiently. We cannot identify a single hash function delivering satisfying performance on all investigated platforms. Therefore, we recommend a set of hash functions to optimize target-specific performance.","PeriodicalId":405320,"journal":{"name":"2019 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129808956","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}

引用次数: 33

BPFHV: Adaptive Network Paravirtualization for Continuous Cloud Provider Evolution BPFHV:面向持续云提供商演进的自适应网络准虚拟化

2019 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS) Pub Date : 2019-09-01 DOI: 10.1109/ANCS.2019.8901879

Vincenzo Maffione, G. Lettieri, L. Rizzo

{"title":"BPFHV: Adaptive Network Paravirtualization for Continuous Cloud Provider Evolution","authors":"Vincenzo Maffione, G. Lettieri, L. Rizzo","doi":"10.1109/ANCS.2019.8901879","DOIUrl":"https://doi.org/10.1109/ANCS.2019.8901879","url":null,"abstract":"Cloud providers are continuously evolving their virtual networking infrastructure to improve performance and functionality. This evolution, however, typically stops at the virtual NIC interface, since any change in that domain would require impractical upgrades in the running VMs with the collaboration of the customers who own them. This could hinder many important evolutions, like the transition to newer revisions of the VirtIO standard. To overcome this problem we propose BPFHV, a new paravirtualized network meta-device that is able to dynamically change its internal operation under the hypervisor control. BPFHV comes with a set of hypervisor-provided callbacks that the guest must call to complete datapath operations, such as posting a new packet for transmission. By injecting new callbacks, the hypervisor can dynamically change the behaviour of the device and of its guest driver even after the initial deployment of a VM. We describe our prototype implementation on the QEMU hypervisor with Linux guests, reusing the eBPF infrastructure for code injection. We show some preliminary experimental results and discuss some possible further applications.","PeriodicalId":405320,"journal":{"name":"2019 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126883440","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

Cuckoo Counter: A Novel Framework for Accurate Per-Flow Frequency Estimation in Network Measurement 布谷鸟计数器:网络测量中精确估计每流频率的新框架

2019 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS) Pub Date : 2019-09-01 DOI: 10.1109/ANCS.2019.8901891

Jiuhua Qi, Wenjun Li, Tong Yang, Dagang Li, Hui Li

{"title":"Cuckoo Counter: A Novel Framework for Accurate Per-Flow Frequency Estimation in Network Measurement","authors":"Jiuhua Qi, Wenjun Li, Tong Yang, Dagang Li, Hui Li","doi":"10.1109/ANCS.2019.8901891","DOIUrl":"https://doi.org/10.1109/ANCS.2019.8901891","url":null,"abstract":"Per-flow frequency estimation plays a fundamental role in network measurement. As a probabilistic data structure, sketch has been extensively investigated and used for per-flow frequency estimation, but most sketch-based proposals in previous literatures cannot achieve high accuracy and high speed simultaneously. Moreover, because each insertion to a sketch causes increment in multiple entries, the over-estimation error will accumulate quickly over time. In this paper, we propose Cuckoo Counter, a compact and accurate framework for per-flow frequency estimation, which employs three novel ideas: (1)kicking out conflicting flows instead of using multiple entries counts to improve accuracy; (2)using different sizes of entries to insulate mice flows from elephant flows, which can handle the skewed data streams efficiently and improve memory utilization; (3) a Cuckoo-like replacement strategy for mice flows, so as to maintain accurate records for elephant flows. To verify the effectiveness and efficiency of our framework, we compared it with two well-known sketches as well as the recent proposed Augmented sketch and Pyramid sketch. Extensive experimental results on three different types of test datasets show that Cuckoo Counter outperforms these sketches considerably.","PeriodicalId":405320,"journal":{"name":"2019 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS)","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122967988","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

Offloading data plane functions to the multi-tenant Cloud Infrastructure using P4 通过P4将数据平面功能卸载到多租户云基础设施

2019 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS) Pub Date : 2019-09-01 DOI: 10.1109/ANCS.2019.8901895

Tomasz Osiński, Mateusz Kossakowski, H. Tarasiuk, R. Picard

引用次数: 8

Empirical Predictability Study of SDN Switches SDN交换机的经验可预测性研究

2019 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS) Pub Date : 2019-09-01 DOI: 10.1109/ANCS.2019.8901878

Amaury Van Bemten, N. Deric, Amir Varasteh, Andreas Blenk, S. Schmid, W. Kellerer

引用次数: 15

Towards Understanding the Performance of P4 Programmable Hardware 了解P4可编程硬件的性能

2019 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS) Pub Date : 2019-09-01 DOI: 10.1109/ANCS.2019.8901881

Hasanin Harkous, M. Jarschel, Mu He, R. Pries, W. Kellerer

引用次数: 24

Graph-To-P4: A P4 boilerplate code generator for parse graphs Graph-To-P4:用于解析图的P4样板代码生成器

2019 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS) Pub Date : 2019-09-01 DOI: 10.1109/ANCS.2019.8901873

Eder Ollora Zaballa, Zifan Zhou

引用次数: 6

A Feature-based Video Transmission Framework for Visual IoT in Fog Computing Systems 基于特征的雾计算视觉物联网视频传输框架

2019 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS) Pub Date : 2019-09-01 DOI: 10.1109/ANCS.2019.8901872

Yuqin Wang, Jingce Xu, Wen Ji

{"title":"A Feature-based Video Transmission Framework for Visual IoT in Fog Computing Systems","authors":"Yuqin Wang, Jingce Xu, Wen Ji","doi":"10.1109/ANCS.2019.8901872","DOIUrl":"https://doi.org/10.1109/ANCS.2019.8901872","url":null,"abstract":"The rapid development of the internet of things (IoT)promotes research in smart city and Fog computing. The vast volume of real-time visual data produced from the tremendous end devices in IoT is a big challenge for the network to transmit and for the data center to store. The typical case is the huge volume of visual data produced by the surveillance cameras in a smart city. In this paper, we consider the problem of how to allocate the calculation ability of the Fog node to handle the surveillance data to obtain low delay meanwhile maintain the video quality. To solve this challenge, we attempt to reduce the tremendous video data using deep learning models in the computational Fog node and optimize the transmission function for high efficiency. To reduce data, we extract video feature and keep salient zones with high resolution meanwhile leave the unavoidable distortion in less important areas. To obtain the least transmission delay under the dynamic bandwidth in Fog computing, we model the transmission delay function and solve it by Lagrangian dual decomposition. We make experiments on public dataset Cityscapes and 4G/LTE Bandwidth Log to evaluate our method. The experiment results show that our feature-based image processing method obtains around 68.7% higher average SSIM (structural similarity index)than the traditional HEVC in the salient zones, and our solution reduces the system delay by 71.02 % comparing with the plain transmission method. It proves our solution reduces the video transmission latency meanwhile keeps the SSIM of salient areas in the video.","PeriodicalId":405320,"journal":{"name":"2019 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS)","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123051104","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

Asynchronous Extern Functions in Programmable Software Data Planes 可编程软件数据平面中的异步外部函数

2019 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS) Pub Date : 2019-09-01 DOI: 10.1109/ANCS.2019.8901875

Dániel Horpácsi, S. Laki, Péter Vörös, M. Tejfel, Gergely Pongrácz, László Molnár

引用次数: 3

TabTree: A TSS-assisted Bit-selecting Tree Scheme for Packet Classification with Balanced Rule Mapping 表树:一种基于tss辅助的平衡规则映射的分组分类选位树方案

2019 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS) Pub Date : 2019-09-01 DOI: 10.1109/ANCS.2019.8901884

Wenjun Li, Tong Yang, Yeim-Kuan Chang, Tao Li, Hui Li

{"title":"TabTree: A TSS-assisted Bit-selecting Tree Scheme for Packet Classification with Balanced Rule Mapping","authors":"Wenjun Li, Tong Yang, Yeim-Kuan Chang, Tao Li, Hui Li","doi":"10.1109/ANCS.2019.8901884","DOIUrl":"https://doi.org/10.1109/ANCS.2019.8901884","url":null,"abstract":"To support fast rule updates in SDN, the Open vSwitch implements Priority Sorting Tuple Space Search (PSTSS) for its packet classifications. Although it has good performance on rule updates, it has a performance concern on table lookups. In contrast, decision tree methods are being actively investigated for high throughput, but they are not able to support fast updates because of rule replications. CutSplit, the state-of-the-art decision tree scheme, provides a novel rule update mechanism by avoiding tree reconstructions. However, its average update time is still two orders of magnitude larger than PSTSS. Meanwhile, existing decision trees are not only unbalanced but also depth unbounded, making them difficult to be optimized on FPGA. In this paper, we present a new decision tree scheme called TabTree, which achieves high performance on both lookups and updates. By mapping rules into tree nodes dynamically, a very limited number of balanced trees with bounded depths can be generated without the trouble of rule replications. Experimental results show that, TabTree has comparable update performance to PSTSS, but it outperforms PSTSS significantly in terms of number of memory accesses for packet classification. Additionally, TabTree is more practical for implementations on FPGA.","PeriodicalId":405320,"journal":{"name":"2019 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122488578","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