2006 Symposium on Architecture For Networking And Communications Systems最新文献

筛选
英文 中文
CAMP 营
2006 Symposium on Architecture For Networking And Communications Systems Pub Date : 2020-04-16 DOI: 10.1002/9783527809080.cataz02726
S. Kumar, M. Becchi, P. Crowley, J. Turner
{"title":"CAMP","authors":"S. Kumar, M. Becchi, P. Crowley, J. Turner","doi":"10.1002/9783527809080.cataz02726","DOIUrl":"https://doi.org/10.1002/9783527809080.cataz02726","url":null,"abstract":"A large body of research literature has focused on improving the performance of longest prefix match IP-lookup. More recently, embedded memory based architectures have been proposed, which delivers very high lookup and update throughput. These architectures often use a pipeline of embedded memories, where each stage stores a single or set of levels of the lookup trie. A stream of lookup requests are issued into the pipeline, one every cycle, in order to achieve high throughput. Most recently, Baboescu et al. [21] have proposed a novel architecture, which uses circular memory pipeline and dynamically maps parts of the lookup trie to different stages. In this paper we extend this approach with an architecture called circular, adaptive and monotonic pipeline (CAMP), which is based upon the key observation that circular pipeline allows decoupling the number of pipeline stages from the number of levels in the trie. This provides much more flexibility in mapping nodes of the lookup trie to the stages. The flexibility, in turn, improves the memory utilization and also reduces the total memory and power consumption. The flexibility comes at a cost however; since the requests are issued at an arbitrary stage, they may get blocked if their entry stage is busy. In an extreme case, a request may block for a time equal to the pipeline depth, which may severely affect the pipeline utilization. We show that fairly straightforward techniques can ensure nearly full utilization of the pipeline. These techniques, coupled with an adaptive mapping of trie nodes to the circular pipeline, create a pipelined architecture which can operate at high rates irrespective of the trie size.","PeriodicalId":310348,"journal":{"name":"2006 Symposium on Architecture For Networking And Communications Systems","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116876333","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
Advanced algorithms for fast and scalable deep packet inspection 先进的算法快速和可扩展的深度包检测
2006 Symposium on Architecture For Networking And Communications Systems Pub Date : 2006-12-03 DOI: 10.1145/1185347.1185359
S. Sushanth Kumar, J. Turner, John Williams
{"title":"Advanced algorithms for fast and scalable deep packet inspection","authors":"S. Sushanth Kumar, J. Turner, John Williams","doi":"10.1145/1185347.1185359","DOIUrl":"https://doi.org/10.1145/1185347.1185359","url":null,"abstract":"Modern deep packet inspection systems use regular expressions to define various patterns of interest in network data streams. Deterministic finite automata (DFA) are commonly used to parse regular expressions. DFAs are fast, but can require prohibitively large amounts of memory for patterns arising in network applications. Traditional DFA table compression only slightly reduces the memory required and requires an additional memory access per input character. Alternative representations of regular expressions, such as NFAs and delayed input DFAs (D2FA) require less memory but sacrifice throughput. In this paper we introduce the content addressed delayed input DFA (CD2FA), which provides a compact representation of regular expressions that match the throughput of traditional uncompressed DFAs. A CD2FA addresses successive states of a D2FA using their content, rather than a \"content-less\" identifier. This makes selected information available earlier in the state traversal process, which makes it possible to avoid unnecessary memory accesses. We demonstrate that such content-addressing can be effectively used to obtain automata that are very compact and can achieve high throughput. Specifically, we show that for an application using thousands of patterns defined by regular expressions, CD2FAs use as little as 10% of the space required by a conventional compressed DFA, and match the throughput of an uncompressed DFA.","PeriodicalId":310348,"journal":{"name":"2006 Symposium on Architecture For Networking And Communications Systems","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116779290","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}
引用次数: 205
Scalable network-based buffer overflow attack detection 可扩展的基于网络的缓冲区溢出攻击检测
2006 Symposium on Architecture For Networking And Communications Systems Pub Date : 2006-12-03 DOI: 10.1145/1185347.1185370
Fu-Hau Hsu, F. Guo, T. Chiueh
{"title":"Scalable network-based buffer overflow attack detection","authors":"Fu-Hau Hsu, F. Guo, T. Chiueh","doi":"10.1145/1185347.1185370","DOIUrl":"https://doi.org/10.1145/1185347.1185370","url":null,"abstract":"Buffer overflow attack is the main attack method that most if not all existing malicious worms use to propagate themselves from machine to machine. Although a great deal of research has been invested in defense mechanisms against buffer overflow attack, most of them require modifications to the network applications and/or the platforms that host them. Being an extension work of CTCP, this paper presents a network-based low performance overhead buffer overflow attack detection system called Nebula, which can detect both known and zero-day buffer overflow attacks based solely on the packets observed without requiring any modifications to the end hosts. Moreover, instead of deriving a specific signature for each individual buffer overflow attack instance, Nebula uses a generalized signature that can capture all known variants of buffer overflow attacks while reducing the number of false positives to a negligible level. In addition, Nebula is built on a centralized TCP/IP architecture that effectively defeats all existing NIDS evasion techniques. Finally, Nebula incorporates a payload type identification mechanism that reduces further the false positive rate and scales the proposed buffer overflow attack detection scheme to gigabit network links.","PeriodicalId":310348,"journal":{"name":"2006 Symposium on Architecture For Networking And Communications Systems","volume":"133 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116297357","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}
引用次数: 24
High-throughput sketch update on a low-power stream processor 低功耗流处理器上的高吞吐量草图更新
2006 Symposium on Architecture For Networking And Communications Systems Pub Date : 2006-12-03 DOI: 10.1145/1185347.1185364
Yu-Kuen Lai, G. Byrd
{"title":"High-throughput sketch update on a low-power stream processor","authors":"Yu-Kuen Lai, G. Byrd","doi":"10.1145/1185347.1185364","DOIUrl":"https://doi.org/10.1145/1185347.1185364","url":null,"abstract":"Sketch algorithms are widely used for many networking applications, such as identifying frequent items, top-k flows, and traffic anomalies. This paper explores the implementation of the Count-Min sketch update using Indexed SRF accesses on a SIMD stream processor (Imagine). Both the sketch data structure and the packet stream are modeled as streams, and in-lane accesses to the stream register file (SRF) support concurrent updates without explicit synchronization. The 500-MHz stream processor is capable of supporting sketch update at 10 Gbps throughput for minimum- sized IP packets. This is nearly the same performance as the 1.4-GHz Intel IXP2800 (13 Gbps), using significantly less power (2.89 W vs. 21 W).","PeriodicalId":310348,"journal":{"name":"2006 Symposium on Architecture For Networking And Communications Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128686934","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}
引用次数: 12
Fast packet classification using bloom filters 快速包分类使用布隆过滤器
2006 Symposium on Architecture For Networking And Communications Systems Pub Date : 2006-12-03 DOI: 10.1145/1185347.1185356
Sarang Dharmapurikar, Haoyu Song, J. Turner, J. Lockwood
{"title":"Fast packet classification using bloom filters","authors":"Sarang Dharmapurikar, Haoyu Song, J. Turner, J. Lockwood","doi":"10.1145/1185347.1185356","DOIUrl":"https://doi.org/10.1145/1185347.1185356","url":null,"abstract":"Ternary content addressable memory (TCAM), although widely used for general packet classification, is an expensive and high power-consuming device. Algorithmic solutions which rely on commodity memory chips are relatively inexpensive and power-efficient but have not been able to match the generality and performance of TCAMs. Therefore, the development of fast and power-efficient algorithmic packet classification techniques continues to be a research subject. In this paper we propose a new approach to packet classification which combines architectural and algorithmic techniques. Our starting point is the well-known crossproduct algorithm which is fast but has significant memory overhead due to the extra rules needed to represent the crossproducts. We show how to modify the crossproduct method in a way that drastically reduces the memory requirement without compromising on performance. Unnecessary accesses to the off-chip memory are avoided by filtering them through on- chip Bloom filters. For packets that match p rules in a rule set, our algorithm requires just 4+p+epsiv independent memory accesses to return all matching rules, where epsiv Lt 1 is a small constant that depends on the false positive rate of the Bloom filters. Using two commodity SRAM chips, a throughput of 38 million packets per second can be achieved. For rule set sizes ranging from a few hundred to several thousand filters, the average rule set expansion factor attributable to the algorithm is just 1.2 to 1.4. The average memory consumption per rule is 32 to 45 bytes.","PeriodicalId":310348,"journal":{"name":"2006 Symposium on Architecture For Networking And Communications Systems","volume":"12 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124335809","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}
引用次数: 131
A proposed architecture for the GENI backbone platform 提议的GENI骨干平台架构
2006 Symposium on Architecture For Networking And Communications Systems Pub Date : 2006-12-03 DOI: 10.1145/1185347.1185349
J. Turner
{"title":"A proposed architecture for the GENI backbone platform","authors":"J. Turner","doi":"10.1145/1185347.1185349","DOIUrl":"https://doi.org/10.1145/1185347.1185349","url":null,"abstract":"The GENI Project (global environment for network innovation) is a major NSF-sponsored initiative that seeks to create a national research facility to enable experimental deployment of innovative new network architectures on a sufficient scale to enable realistic evaluation. One key component of the GENI system will be the GENI backbone platform (GBP) that provides the resources needed to allow multiple experimental networks to co-exist within the shared GENI infrastructure. This paper reviews the objectives for the GBP, the key issues that affect its design and develops a reference architecture that provides a concrete example for how the objectives can be met, using commercially available subsystems.","PeriodicalId":310348,"journal":{"name":"2006 Symposium on Architecture For Networking And Communications Systems","volume":"139 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132365234","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}
引用次数: 62
WormTerminator WormTerminator
2006 Symposium on Architecture For Networking And Communications Systems Pub Date : 2006-12-03 DOI: 10.1145/1185347.1185371
Songqing Chen, Xinyuan Wang, Lei Liu, Xinwen Zhang
{"title":"WormTerminator","authors":"Songqing Chen, Xinyuan Wang, Lei Liu, Xinwen Zhang","doi":"10.1145/1185347.1185371","DOIUrl":"https://doi.org/10.1145/1185347.1185371","url":null,"abstract":"The fast spreading worm is becoming one of the most serious threats to today's networked information systems. A fast spreading worm could infect hundreds of thousands of hosts within a few minutes. In order to stop a fast spreading worm, we need the capability to detect and contain worms automatically in real-time. While signature based worm detection and containment are effective in detecting and containing known worms, they are inherently ineffective against previously unknown worms and polymorphic worms. Existing traffic anomaly pattern based approaches have the potential to detect and/or contain previously unknown and polymorphic worms, but they either impose too much constraint on normal traffic or allow too much infectious worm traffic to go out to the Internet before an unknown or polymorphic worm can be detected. In this paper, we present WormTerminator, which can detect and completely contain, at least in theory, almost all fast spreading worms in real-time while blocking virtually no normal traffic. WormTerminator detects and contains the fast spreading worm based on its denning characteristic - a fast spreading worm will start to infect others as soon as it successfully infects one host. WormTerminator also exploits the observation that a fast spreading worm keeps exploiting the same set of vulnerabilities when infecting new machines. To prove the concept, we have implemented a prototype of WormTerminator and have examined its effectiveness against the real Internet worm Linux/Slapper.","PeriodicalId":310348,"journal":{"name":"2006 Symposium on Architecture For Networking And Communications Systems","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132932419","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
Fast and memory-efficient regular expression matching for deep packet inspection 快速高效的正则表达式匹配深度包检测
2006 Symposium on Architecture For Networking And Communications Systems Pub Date : 2006-12-03 DOI: 10.1145/1185347.1185360
Fang Yu, Z. Chen, Y. Diao, T. V. Lakshman, R. Katz
{"title":"Fast and memory-efficient regular expression matching for deep packet inspection","authors":"Fang Yu, Z. Chen, Y. Diao, T. V. Lakshman, R. Katz","doi":"10.1145/1185347.1185360","DOIUrl":"https://doi.org/10.1145/1185347.1185360","url":null,"abstract":"Packet content scanning at high speed has become extremely important due to its applications in network security, network monitoring, HTTP load balancing, etc. In content scanning, the packet payload is compared against a set of patterns specified as regular expressions. In this paper, we first show that memory requirements using traditional methods are prohibitively high for many patterns used in packet scanning applications. We then propose regular expression rewrite techniques that can effectively reduce memory usage. Further, we develop a grouping scheme that can strategically compile a set of regular expressions into several engines, resulting in remarkable improvement of regular expression matching speed without much increase in memory usage. We implement a new DFA-based packet scanner using the above techniques. Our experimental results using real-world traffic and patterns show that our implementation achieves a factor of 12 to 42 performance improvement over a commonly used DFA- based scanner. Compared to the state-of-art NFA-based implementation, our DFA-based packet scanner achieves 50 to 700 times speedup.","PeriodicalId":310348,"journal":{"name":"2006 Symposium on Architecture For Networking And Communications Systems","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128612355","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}
引用次数: 495
Sequence-preserving adaptive load balancers 保持序列的自适应负载均衡器
2006 Symposium on Architecture For Networking And Communications Systems Pub Date : 2006-12-03 DOI: 10.1145/1185347.1185367
W. Shi, L. Kencl
{"title":"Sequence-preserving adaptive load balancers","authors":"W. Shi, L. Kencl","doi":"10.1145/1185347.1185367","DOIUrl":"https://doi.org/10.1145/1185347.1185367","url":null,"abstract":"Load balancing in packet-switched networks is a task of ever-growing importance. Network traffic properties, such as the Zipf-like flow length distribution and bursty transmission patterns, and requirements on packet ordering or stable flow mapping, make it a particularly difficult and complex task, needing adaptive heuristic solutions. In this paper, we present two main contributions: Firstly, we evaluate and compare two recently proposed algorithmic heuristics that attempt to adaptively balance load among the destination units. The evaluation on real life traces confirms the previously conjectured impact of the Zipf-like flow length distribution and traffic burstiness. Furthermore, we identify the distinction between the goals of preserving either the sequence order of packets, or the flow- to-destination mapping, showing different strengths of each algorithm. Secondly, we demonstrate a novel hybrid scheme that combines best of the flow-based and burst-based load balancing techniques and excels in both of the key metrics of flow remapping and packet reordering.","PeriodicalId":310348,"journal":{"name":"2006 Symposium on Architecture For Networking And Communications Systems","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131137629","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}
引用次数: 36
Towards an efficient switch architecture for high-radix switches 面向高基数交换机的高效交换机架构
2006 Symposium on Architecture For Networking And Communications Systems Pub Date : 2006-12-03 DOI: 10.1145/1185347.1185350
Gaspar Mora, J. Flich, J. Duato, P. López, Elvira Baydal, Olav Lysne
{"title":"Towards an efficient switch architecture for high-radix switches","authors":"Gaspar Mora, J. Flich, J. Duato, P. López, Elvira Baydal, Olav Lysne","doi":"10.1145/1185347.1185350","DOIUrl":"https://doi.org/10.1145/1185347.1185350","url":null,"abstract":"The interconnection network plays a key role in the overall performance achieved by high performance computing systems, also contributing an increasing fraction of its cost and power consumption. Current trends in interconnection network technology suggest that high-radix switches will be preferred as networks will become smaller (in terms of switch count) with the associated savings in packet latency, cost, and power consumption. Unfortunately, current switch architectures have scalability problems that prevent them from being effective when implemented with a high number of ports. In this paper, an efficient and cost-effective architecture for high-radix switches is proposed. The architecture, referred to as partitioned crossbar input queued (PCIQ), relies on three key components: a partitioned crossbar organization that allows the use of simple arbiters and crossbars, a packet-based arbiter, and a mechanism to eliminate the switch-level HOL blocking. Under uniform traffic, maximum switch efficiency is achieved. Furthermore, switch-level HOL blocking is completely eliminated under hot-spot traffic, again delivering maximum throughput. Additionally, PCIQ inherently implements an efficient congestion management technique that eliminates all the network-wide HOL blocking. On the contrary, the previously proposed architectures either show poor performance or they require significantly higher costs than PCIQ (in both components and complexity).","PeriodicalId":310348,"journal":{"name":"2006 Symposium on Architecture For Networking And Communications Systems","volume":"130 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133190141","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}
引用次数: 35
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学术官方微信
小红书