Symposium on Architectures for Networking and Communications Systems最新文献_第4页

Experience with high-speed automated application-identification for network-management 具有网络管理中高速自动化应用识别的经验

Symposium on Architectures for Networking and Communications Systems Pub Date : 2009-10-19 DOI: 10.1145/1882486.1882539

M. Canini, Wei Li, M. Zádník, A. Moore

引用次数: 37

Micro Secure Socket Layer (MSSL) for micro server 用于微服务器的微安全套接字层(MSSL)

Symposium on Architectures for Networking and Communications Systems Pub Date : 2009-10-19 DOI: 10.1145/1882486.1882506

Nguyen Thanh Hoa, Kensuke Naoe, Yoshiyasu Takefuji

引用次数: 0

Binary search on levels using a Bloom filter for IPv6 address lookup 使用Bloom过滤器对IPv6地址查找的级别进行二进制搜索

Symposium on Architectures for Networking and Communications Systems Pub Date : 2009-10-19 DOI: 10.1145/1882486.1882534

Kyuhee Lim, Kyunghye Park, Hyesook Lim

引用次数: 12

Designing high-speed packet processing tasks at arbitrary levels of abstraction: implementation and evaluation of a MIXMAP system 在任意抽象级别设计高速数据包处理任务:MIXMAP系统的实现和评估

Symposium on Architectures for Networking and Communications Systems Pub Date : 2009-10-19 DOI: 10.1145/1882486.1882531

S. Hauger

引用次数: 1

Co-match: fast and efficient packet inspection for multiple flows 协同匹配:对多个流进行快速高效的报文检测

Symposium on Architectures for Networking and Communications Systems Pub Date : 2009-10-19 DOI: 10.1145/1882486.1882538

Chao Zhu, Yingke Xie, Mingshu Wang, Jizhong Han, Chengde Han

{"title":"Co-match: fast and efficient packet inspection for multiple flows","authors":"Chao Zhu, Yingke Xie, Mingshu Wang, Jizhong Han, Chengde Han","doi":"10.1145/1882486.1882538","DOIUrl":"https://doi.org/10.1145/1882486.1882538","url":null,"abstract":"Packet inspection is widely employed in application-layer protocol analyzing systems to enable accurate protocol identification. Many existing systems, however, fail to meet the requirement of keeping up with wire speed in networking. There are two limitations: (1) software-based matching schemes are usually in a sequential manner which is slow and inefficient; (2) fast hardware-based matching schemes are inapplicable to network packet processing for lacking of intrinsic support for multiple flows.\u0000 This paper proposes a novel approach for application-layer protocol identification called Co-Match, which combines software and hardware together to achieve fast and efficient signature matching for multiple flows. First, a grouping scheme is adopted to organize signatures into several matching sets. With this scheme, each packet is only matched against a subset of signatures, bringing about a remarkable improvement of matching speed in software. Second, an FPGA-based coprocessor is developed in order to support fast parallel regular expression matching for multiple flows in hardware. Moreover, a hardware-based flow-level traffic load balancer is employed to parallel multi-flow processing on multiple CPU cores. Experimental results show that our approach is efficient to handle multiple flows while system throughput can achieve the wire speed of Gigabit Ethernet links with moderate CPU usage.","PeriodicalId":329300,"journal":{"name":"Symposium on Architectures for Networking and Communications Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129412857","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

Interfacing to a virtualized network infrastructure through network service abstractions 通过网络服务抽象连接到虚拟化的网络基础设施

Symposium on Architectures for Networking and Communications Systems Pub Date : 2009-10-19 DOI: 10.1145/1882486.1882526

Xin Huang, S. Shanbhag, T. Wolf

引用次数: 0

Hash-based routing for scalable datacenters 用于可扩展数据中心的基于哈希的路由

Symposium on Architectures for Networking and Communications Systems Pub Date : 2009-10-19 DOI: 10.1145/1882486.1882509

M. Schlansker, J. Tourrilhes, Yoshio Turner, J. R. Santos

引用次数: 0

SANS: a scalable architecture for network intrusion prevention with stateful frontend SANS:一个可扩展的网络入侵防御体系结构，具有有状态的前端

Symposium on Architectures for Networking and Communications Systems Pub Date : 2009-10-19 DOI: 10.1145/1882486.1882532

Fei He, Yaxuan Qi, Y. Xue, Jun Li

引用次数: 2

Progressive hashing for packet processing using set associative memory 使用集合关联内存进行分组处理的渐进散列

Symposium on Architectures for Networking and Communications Systems Pub Date : 2009-10-19 DOI: 10.1145/1882486.1882521

M. Hanna, Socrates Demetriades, Sangyeun Cho, R. Melhem

{"title":"Progressive hashing for packet processing using set associative memory","authors":"M. Hanna, Socrates Demetriades, Sangyeun Cho, R. Melhem","doi":"10.1145/1882486.1882521","DOIUrl":"https://doi.org/10.1145/1882486.1882521","url":null,"abstract":"As the Internet grows, both the number of rules in packet filtering databases and the number of prefixes in IP lookup tables inside the router are growing. The packet processing engine is a critical part of the Internet router as it is used to perform packet forwarding (PF) and packet classification (PC). In both applications, processing has to be at wire speed. It is common to use hash-based schemes in packet processing engines; however, the downside of classic hashing techniques such as overflow and worst case memory access time, has to be dealt with. Implementing hash tables using set associative memory has the property that each bucket of a hash table can be searched in one memory cycle outperforming the conventional Ternary CAMs in terms of power and scalability.\u0000 In this paper we present \"Progressive Hashing\" (PH), a general open addressing hash-based packet processing scheme for Internet routers using the set associative memory architecture. Our scheme is an extension of the multiple hashing scheme and is amendable to high-performance hardware implementation with low overflow and low memory access latency. We show by experimenting with real IP lookup tables and synthetic packet filtering databases that PH reduces the overflow over the multiple hashing. The proposed PH processing engine is estimated to achieve an average processing speed of 160 Gbps for the PC application and 320 Gbps for the PF application.","PeriodicalId":329300,"journal":{"name":"Symposium on Architectures for Networking and Communications Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130879272","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

Weighted random oblivious routing on torus networks 环面网络的加权随机遗忘路由

Symposium on Architectures for Networking and Communications Systems Pub Date : 2009-10-19 DOI: 10.1145/1882486.1882515

R. Ramanujam, Bill Lin

{"title":"Weighted random oblivious routing on torus networks","authors":"R. Ramanujam, Bill Lin","doi":"10.1145/1882486.1882515","DOIUrl":"https://doi.org/10.1145/1882486.1882515","url":null,"abstract":"Torus, mesh, and flattened butterfly networks have all been considered as candidate architectures for on-chip interconnection networks. In this paper, we study the problem of optimal oblivious routing for one of these architecture classes, namely, the torus network. We introduce a new closed-form oblivious routing algorithm called W2TURN that is worst-case throughput optimal for 2D-torus networks. W2TURN is based on a weighted random selection of paths that contain at most two turns. Restricting the maximum number of turns in routing paths to just two results in a simple deadlock-free implementation of W2TURN. In terms of average hop count, W2TURN outperforms the best previously known closed-form worst-case throughput optimal routing algorithm called IVAL [14]. We also provide another routing algorithm based on the weighted random selection of paths with at most two turns called I2TURN and show that it is equivalent to IVAL. However, I2TURN eliminates the need for loop removal at runtime and provides a closed-form analytical expression for evaluating the average hop count. The latter enables us to demonstrate analytically that W2TURN strictly outperforms IVAL (and I2TURN) in average hop count. Finally, we present a new optimal weighted random routing algorithm for rings called WRD (Weighted Random Direction). WRD provides a closed form expression for the the optimal distribution of traffic along the minimal and non-minimal directions in a ring topology to achieve minimum average hop count under maximum worst-case throughput.","PeriodicalId":329300,"journal":{"name":"Symposium on Architectures for Networking and Communications Systems","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134409106","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