2010 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS)最新文献

NetEx: Efficient and cost-effective internet bulk content delivery NetEx:高效、经济的互联网批量内容交付

2010 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS) Pub Date : 2010-10-25 DOI: 10.1145/1872007.1872045

M. Marcon, Nuno Santos, K. Gummadi, Nikolaos Laoutaris, P. Rodriguez, Amin Vahdat

引用次数: 9

Improving PC-based OpenFlow switching performance 改进基于pc的OpenFlow交换性能

2010 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS) Pub Date : 2010-10-25 DOI: 10.1145/1872007.1872023

Voravit Tanyingyong, M. Hidell, Peter Sjödin

引用次数: 37

Load balancing packets on a tile-based massive multi-core processor with S-NUCA 基于S-NUCA的大规模多核处理器上的负载均衡数据包

2010 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS) Pub Date : 2010-10-25 DOI: 10.1145/1872007.1872047

E. Musoll

引用次数: 0

Efficient lookahead routing and header compression for multicasting in networks-on-chip 片上网络中多播的高效向前看路由和报头压缩

2010 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS) Pub Date : 2010-10-25 DOI: 10.1145/1872007.1872028

Lei Wang, Poornachandran Kumar, R. Boyapati, K. H. Yum, Eun Jung Kim

{"title":"Efficient lookahead routing and header compression for multicasting in networks-on-chip","authors":"Lei Wang, Poornachandran Kumar, R. Boyapati, K. H. Yum, Eun Jung Kim","doi":"10.1145/1872007.1872028","DOIUrl":"https://doi.org/10.1145/1872007.1872028","url":null,"abstract":"As technology advanced, ChipMulti-processor (CMP) architectures have emerged as a viable solution for designing processors. Networks-on-Chip (NOCs) provide a scalable communication method for CMP architectures as the number of cores is increasing. Although there has been significant research on NOC designs for unicast traffic, the research on the multicast router design is still in infancy stage. Considering that one-to-many (multicast) and one-to-all (broadcast) traffic are more common in CMP applications, it is important to design a router providing efficient multicasting. In this paper, we propose an efficient lookahead routing with limited area overhead for a recently proposed multicast routing algorithm, Recursive Partitioning Multicast (RPM) [17]. Also, we present a novel compression scheme for a multicast packet header that becomes a big overhead in large networks. Comprehensive simulation results show that with our route computation logic design, providing lookahead routing in the multicast router only costs less than 20% area overhead and this percentage keeps decreasing with larger network sizes. Compared with the basic lookahead routing design, our design can save area by over 50%. With header compression and lookahead multicast routing, the network performance is improved by 22% in a (16 × 16) network on average.","PeriodicalId":262685,"journal":{"name":"2010 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123209101","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

Evolution of cache replacement policies to track heavy-hitter flows 缓存替换策略的演变以跟踪重要流

2010 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS) Pub Date : 2010-10-25 DOI: 10.1145/1872007.1872046

M. Zádník, M. Canini

引用次数: 16

Packet scheduling for deep packet inspection on multi-core architectures 多核结构下深度包检测的包调度

2010 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS) Pub Date : 2010-10-25 DOI: 10.1145/1872007.1872033

T. Nelms, M. Ahamad

{"title":"Packet scheduling for deep packet inspection on multi-core architectures","authors":"T. Nelms, M. Ahamad","doi":"10.1145/1872007.1872033","DOIUrl":"https://doi.org/10.1145/1872007.1872033","url":null,"abstract":"Multi-core architectures are commonly used for network applications because the workload is highly parallelizable. Packet scheduling is a critical performance component of these applications and significantly impacts how well they scale. Deep packet inspection (DPI) applications are more complex than most network applications. This makes packet scheduling more difficult, but it can have a larger impact on performance. Also, packet latency and ordering requirements differ depending on whether the DPI application is deployed inline. Therefore, different packet scheduling tradeoffs can be made based on the deployment. In this paper, we evaluate three packet scheduling algorithms with the Protocol Analysis Module (PAM) as our DPI application using network traces acquired from production networks where intrusion prevention systems (IPS) are deployed. One of the packet scheduling algorithms we evaluate is commonly used in production applications; thus, it is useful for comparison. The other two are of our own design. Our results show that packet scheduling based on cache affinity is more important than trying to balance packets. More specifically, for the three network traces we tested, our cache affinity packet scheduler outperformed the other two schedulers increasing throughput by as much as 38%.","PeriodicalId":262685,"journal":{"name":"2010 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128851090","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}

引用次数: 27

TED: Tool for testing and debugging uDAPL 用于测试和调试uDAPL的工具

2010 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS) Pub Date : 2010-10-25 DOI: 10.1145/1872007.1872049

Eva Mishra, Yogeshwar Sonawane

{"title":"TED: Tool for testing and debugging uDAPL","authors":"Eva Mishra, Yogeshwar Sonawane","doi":"10.1145/1872007.1872049","DOIUrl":"https://doi.org/10.1145/1872007.1872049","url":null,"abstract":"User Direct Access Programming Library (uDAPL) defines a single set of user APIs for Remote Direct Memory Access (RDMA) capable transports. Developers of uDAPL have to write test programs for verification of APIs and for integrated testing of software stack along with underlying hardware. The tools available for testing uDAPL suffer from the following limitations: they do not provide control at API level, offer very little control of input parameters of APIs and provide limited flexibility vis-à-vis test cases that can be executed. This paper describes a new tool `Test Environment for DAPL' (TED) that enables integrated testing and debugging of software stack and underlying hardware while providing more flexibility and control to user. It can be used over any implementation of uDAPL and is available as open source. In addition, this paper proposes a novel approach for flow control of RDMA operations. Since in RDMA operations responder side does not receive any completion, mechanisms generally rely on last byte of data buffer for notification of arrival of data. This scheme can fail if underlying transport does not ensure that data arrives in order. The proposed design ensures validity even over networks that do not guarantee in order arrival of data.","PeriodicalId":262685,"journal":{"name":"2010 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127862385","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

Fast regular expression matching in hardware using NFA-BDD combination 使用NFA-BDD组合在硬件中快速匹配正则表达式

2010 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS) Pub Date : 2010-10-25 DOI: 10.1145/1872007.1872022

D. Chasaki, T. Wolf

引用次数: 5

Galois field hardware architectures for network coding 用于网络编码的伽罗瓦现场硬件体系结构

2010 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS) Pub Date : 2010-10-25 DOI: 10.1145/1872007.1872051

Aishwarya Nagarajan, M. Schulte, P. Ramanathan

引用次数: 4

A new TCB cache to efficiently manage TCP sessions for web servers 一个新的TCB缓存，有效地管理TCP会话的web服务器

2010 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS) Pub Date : 2010-10-25 DOI: 10.1145/1872007.1872039

Guangdeng Liao, L. Bhuyan, Wei Wu, Heeyeol Yu, Steve R. King

{"title":"A new TCB cache to efficiently manage TCP sessions for web servers","authors":"Guangdeng Liao, L. Bhuyan, Wei Wu, Heeyeol Yu, Steve R. King","doi":"10.1145/1872007.1872039","DOIUrl":"https://doi.org/10.1145/1872007.1872039","url":null,"abstract":"TCP/IP, the most commonly used network protocol, consumes a significant portion of time in Internet servers. While a wide spectrum of studies has been done to reduce its processing overhead such as TOE and Direct Cache Access, most of them did studies solely from the per-packet perspective and concentrated on the packet memory access overhead. They ignored per-session data TCP Control Block (TCB), which poses a challenge in web servers with a large volume of concurrent sessions. In this paper, we start with challenge studies and show that the TCB data should be efficiently managed. We propose a new TCB cache addressed by session identifiers to address the challenge. We carefully design the TCB cache along two important axes: cache indexing and cache replacement policies. First, we study the performance of various hash functions and propose a new indexing scheme for the TCB cache by employing two Universal hash functions. We analyze session identifiers and choose some important bits as indexing bits to reduce hashing hardware complexity. Second, by leveraging characteristics of web sessions, we design a speculative cache replacement policy, which can effectively work on the TCB cache with two cache banks. Experimental results show that the new cache efficiently manages the per-session data. When it is used in TOEs or integrated into CPUs to manage the per-session data, TCP/IP processing time is significantly reduced, thus saving web server response time.","PeriodicalId":262685,"journal":{"name":"2010 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122685573","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