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

Application-transparent scheduling of socket system calls on many-core systems 多核系统上套接字系统调用的应用程序透明调度

Proceedings of the 2018 Symposium on Architectures for Networking and Communications Systems Pub Date : 2018-07-23 DOI: 10.1145/3230718.3232113

Jooho Kim, Joong-Yeon Cho, Hyun-Wook Jin

引用次数: 0

Dark packets and the end of network scaling 暗数据包和网络扩展的结束

Proceedings of the 2018 Symposium on Architectures for Networking and Communications Systems Pub Date : 2018-07-23 DOI: 10.1145/3230718.3230727

Shelby Thomas, Rob McGuinness, G. Voelker, G. Porter

{"title":"Dark packets and the end of network scaling","authors":"Shelby Thomas, Rob McGuinness, G. Voelker, G. Porter","doi":"10.1145/3230718.3230727","DOIUrl":"https://doi.org/10.1145/3230718.3230727","url":null,"abstract":"Today 100GbE network interfaces are commercially available, with 400GbE proposals already in the standardization process. In this environment, a major bottleneck is DRAM latency, which has stagnated at 100ns per access. Beyond 100GbE, all packet sizes will arrive faster than main memory can accommodate, resulting packet drops due to the latency incurred by the memory hierarchy. We call these losses caused by the gap between cache and DRAM, Dark Packets. We observe that for link rates of 100GbE an application making a single memory access causes a high number of packet drops. Today, this problem can be overcome by increasing the physical core count (not scalable), increasing packet sizes (not generalizable), or by building specialized hardware (high cost). In this work, we measure the impact of the dark packet phenomenon and propose CacheBuilder, an API to carve out bespoke hardware caches from existing ones through simple user level APIs. CacheBuilder allows for explicit control over processor cache memory and cache-to-main memory copies by creating application-specific caches that result in higher overall performance and reduce dark packets. Our results show that for NFVs operating with small packet sizes at 40GbE we reduce dark packets from 35% to 0% and only require half the amount of cores to achieve line rates.","PeriodicalId":247881,"journal":{"name":"Proceedings of the 2018 Symposium on Architectures for Networking and Communications Systems","volume":"204 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132907513","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}

引用次数: 11

Network-wide routing-oblivious heavy hitters 全网路由无关的重量级攻击者

Proceedings of the 2018 Symposium on Architectures for Networking and Communications Systems Pub Date : 2018-07-23 DOI: 10.1145/3230718.3230729

R. Ben-Basat, Gil Einziger, Shir Landau Feibish, Jalil Moraney, D. Raz

{"title":"Network-wide routing-oblivious heavy hitters","authors":"R. Ben-Basat, Gil Einziger, Shir Landau Feibish, Jalil Moraney, D. Raz","doi":"10.1145/3230718.3230729","DOIUrl":"https://doi.org/10.1145/3230718.3230729","url":null,"abstract":"The recent introduction of SDN allows deploying new centralized network algorithms that dramatically improve the network operation. Many of these solutions rely on the assumption that the centralized controller merges data from different Network Monitoring Points (NMP) to obtain a network-wide view. This is far from trivial when the same packet may traverse through several NMPs. Therefore, existing solutions either assume that each packet is measured at exactly one NMP or that the routing of each packet is known. Another approach is to mark the sampled packets so that other NMPs are aware that the packet was already considered. We suggest the first network-wide and routing oblivious algorithms for three fundamental network monitoring problems. The suggested algorithms allow flexible NMP placement, require no control over edge routers, and are indifferent to network topology and routing. Moreover, they are based on passive measurements without modifying the traffic in any way. Formally, we provide a general, constant time framework that solves the distributed versions of the volume estimation, frequency estimation and heavy-hitters problems with provable guarantees. The evaluation of our scheme on real packet traces shows that we can achieve very accurate results using a very reasonable amount of memory. For example, using less than 60KB memory in each monitoring point we get a root square error of less than 0.01% of the packets for frequency estimation.","PeriodicalId":247881,"journal":{"name":"Proceedings of the 2018 Symposium on Architectures for Networking and Communications Systems","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131305523","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}

引用次数: 31

Towards a highly scalable network tester 迈向高度可扩展的网络测试器

Proceedings of the 2018 Symposium on Architectures for Networking and Communications Systems Pub Date : 2018-07-23 DOI: 10.1145/3230718.3232104

M. Ramanujam, Noa Zilberman

引用次数: 1

APF APF

Proceedings of the 2018 Symposium on Architectures for Networking and Communications Systems Pub Date : 2018-07-23 DOI: 10.1145/3230718.3232112

Jinghan Zhou, Danyang Li, Xiaohe Hu, Y. Sun, Shui Cao, Wei Xu, Jun Li

引用次数: 0

VNF chain allocation and management at data center scale 数据中心级VNF链分配与管理

Proceedings of the 2018 Symposium on Architectures for Networking and Communications Systems Pub Date : 2018-07-23 DOI: 10.1145/3230718.3230724

N. Kodirov, Sam Bayless, Fabian Ruffy, Ivan Beschastnikh, H. Hoos, A. Hu

引用次数: 9

FTvNF

Proceedings of the 2018 Symposium on Architectures for Networking and Communications Systems Pub Date : 2018-07-23 DOI: 10.1145/3230718.3230731

Yotam Harchol, David Hay, Tal Orenstein

引用次数: 11

Hardware acceleration of intrusion detection systems for high-speed networks 高速网络入侵检测系统的硬件加速

Proceedings of the 2018 Symposium on Architectures for Networking and Communications Systems Pub Date : 2018-07-23 DOI: 10.1145/3230718.3232114

J. Kucera, Lukás Kekely, V. Pus, A. Piecek, J. Korenek

引用次数: 0

Scalable high-speed NDN name lookup 可扩展的高速NDN名称查找

Proceedings of the 2018 Symposium on Architectures for Networking and Communications Systems Pub Date : 2018-07-23 DOI: 10.1145/3230718.3230720

Kun Huang, Zhaohua Wang, Gaogang Xie

{"title":"Scalable high-speed NDN name lookup","authors":"Kun Huang, Zhaohua Wang, Gaogang Xie","doi":"10.1145/3230718.3230720","DOIUrl":"https://doi.org/10.1145/3230718.3230720","url":null,"abstract":"Name lookup is a core function of the Named Data Networking (NDN) forwarding plane. It performs a name-based longest prefix match lookup against a large amount of variable-length, hierarchical name prefixes. NDN name lookup suffers a scalability challenge and needs to satisfy three key requirements: high-speed lookups, low memory cost, and fast updates. However, no existing work satisfies these requirements. Hash-based linear search schemes achieve fast updates and low memory cost but not high-speed lookups. Binary search (BS) schemes achieve high-speed lookups but slow updates with high memory cost. In this paper, we propose CBS, a hash-based counting binary search scheme for scalable high-speed NDN name lookup. CBS achieves fast updates and low memory cost, while sustaining high-speed lookups. The key to CBS is using a counter for each slot in a hash table to keep track of the number of markers that direct a search to find longer matching prefixes. This design not only allows fast updates by incrementing and decrementing counters, but also reduces the additional memory cost. Our experimental results demonstrate that CBS outperforms BS in update throughput, memory cost, and lookup throughput.","PeriodicalId":247881,"journal":{"name":"Proceedings of the 2018 Symposium on Architectures for Networking and Communications Systems","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131276093","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

Query language for large-scale P4 network debugging 用于大规模P4网络调试的查询语言

Proceedings of the 2018 Symposium on Architectures for Networking and Communications Systems Pub Date : 2018-07-23 DOI: 10.1145/3230718.3232108

Jehandad Khan, P. Athanas

引用次数: 1