2011 ACM/IEEE Seventh Symposium on Architectures for Networking and Communications Systems最新文献_第3页

Predictive Model-Based Thermal Management for Network Applications 基于预测模型的网络应用热管理

2011 ACM/IEEE Seventh Symposium on Architectures for Networking and Communications Systems Pub Date : 2011-10-03 DOI: 10.1109/ANCS.2011.16

Jilong Kuang, L. Bhuyan

{"title":"Predictive Model-Based Thermal Management for Network Applications","authors":"Jilong Kuang, L. Bhuyan","doi":"10.1109/ANCS.2011.16","DOIUrl":"https://doi.org/10.1109/ANCS.2011.16","url":null,"abstract":"As processor power density has increased at an alarming rate, chip/core temperature control becomes critical in satisfying given thermal constraint and avoiding hotspots. Unlike \"run-to-finish\" applications whose temperature will simply rise to saturation point and then stabilize, network applications do periodic packet processing, which causes temperature to rise and fall over time. However, no existing studies have focused on characterizing the temperature variation for periodic tasks. We envision that volatile thermal behavior has to be well understood in order to optimize thermal management. In this paper, we first build a novel predictive thermal model for generic periodic tasks running on a single core. This model can dynamically derive the core temperature at any time quickly and accurately. To verify the model, we use both Hot Spot simulator and a real Linux machine to run six network applications chosen from Net Bench. Then, we propose an online model update strategy using on-chip thermal sensors, which can effectively correct incidental errors by adjusting model parameters \"on-the-fly\". Finally, by combining the thermal model and the online update, we design, implement and evaluate a predictive model-based thermal management scheme on an Intel Xeon E5335 core for network applications based on the Stop & Go technique. Compared with two other alternatives, our scheme achieves lower temperature, higher throughput, no thermal constraint violation, and negligible overhead cost.","PeriodicalId":124429,"journal":{"name":"2011 ACM/IEEE Seventh Symposium on Architectures for Networking and Communications Systems","volume":"133 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114828996","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

A Dynamically Adapting Network Programming Framework 动态适应网络规划框架

2011 ACM/IEEE Seventh Symposium on Architectures for Networking and Communications Systems Pub Date : 2011-10-03 DOI: 10.1109/ANCS.2011.37

Ben Wun, Mike Wilson, P. Crowley

引用次数: 0

FIFO Service with Differentiated Queueing 差分排队FIFO服务

2011 ACM/IEEE Seventh Symposium on Architectures for Networking and Communications Systems Pub Date : 2011-10-03 DOI: 10.1109/ANCS.2011.29

M. Karsten

{"title":"FIFO Service with Differentiated Queueing","authors":"M. Karsten","doi":"10.1109/ANCS.2011.29","DOIUrl":"https://doi.org/10.1109/ANCS.2011.29","url":null,"abstract":"This paper presents a novel approach to minimally invasive service differentiation in packet-switched networks. Instead of actively managing service allocation, a simple differentiated queueing algorithm provides traffic classes with essentially the same best-effort service that would result from plain FIFO service using a single queue for all traffic. However, each class is served from a separate virtual queue, which is configured with an individual deterministic delay bound that is enforced in the presence of dynamically varying packet arrival rates. The main advantage of such a scheme for service differentiation is administrative simplicity, because it only needs minimal configuration by a network operator and does not necessarily require control plane functionality. Further, it does not inherently prefer some traffic classes over others and thus satisfies even the most radical definitions of network neutrality. In the paper, the basic approach is motivated with the help of various use case scenarios. A fairly simple and efficient algorithm is presented to implement the differentiated queueing scheme. Finally, a number of simulation experiments and results are shown that confirm the intuitive functionality of the algorithm.","PeriodicalId":124429,"journal":{"name":"2011 ACM/IEEE Seventh Symposium on Architectures for Networking and Communications Systems","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128134868","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

A Passive Network Appliance for Real-Time Network Monitoring 用于实时网络监控的被动网络设备

2011 ACM/IEEE Seventh Symposium on Architectures for Networking and Communications Systems Pub Date : 2011-10-03 DOI: 10.1109/ANCS.2011.46

Michael J. Schultz, Ben Wun, P. Crowley

引用次数: 10

Routing Optimization for Ensemble Routing 集成路由的路由优化

2011 ACM/IEEE Seventh Symposium on Architectures for Networking and Communications Systems Pub Date : 2011-10-03 DOI: 10.1109/ANCS.2011.26

Wenfei Wu, Yoshio Turner, M. Schlansker

引用次数: 7

Split: Optimizing Space, Power, and Throughput for TCAM-Based Classification 分割:优化空间、功率和吞吐量的基于tcam的分类

2011 ACM/IEEE Seventh Symposium on Architectures for Networking and Communications Systems Pub Date : 2011-10-03 DOI: 10.1109/ANCS.2011.36

C. Meiners, A. Liu, E. Torng, Jignesh Patel

引用次数: 56

Fast and Compact Regular Expression Matching Using Character Substitution 快速和紧凑的正则表达式匹配使用字符替换

2011 ACM/IEEE Seventh Symposium on Architectures for Networking and Communications Systems Pub Date : 2011-10-03 DOI: 10.1109/ANCS.2011.20

Xingkui Liu, Xinchun Liu, Ninghui Sun

引用次数: 5

AC-Suffix-Tree: Buffer Free String Matching on Out-of-Sequence Packets AC-Suffix-Tree:对乱序报文进行缓冲区自由字符串匹配

2011 ACM/IEEE Seventh Symposium on Architectures for Networking and Communications Systems Pub Date : 2011-10-03 DOI: 10.1109/ANCS.2011.14

Xinming Chen, Kailin Ge, Zhen Chen, Jun Li

{"title":"AC-Suffix-Tree: Buffer Free String Matching on Out-of-Sequence Packets","authors":"Xinming Chen, Kailin Ge, Zhen Chen, Jun Li","doi":"10.1109/ANCS.2011.14","DOIUrl":"https://doi.org/10.1109/ANCS.2011.14","url":null,"abstract":"TCP and IP fragmentation can be used to evade signature detection at Intrusion Detection/Prevention System (IDS / IPS). Such fragments may arrive out-of-sequence to escape from being detected by the string matching algorithm of IDS / IPS. The common defense is buffering and reassembling packets. However, buffering of out-of-sequence packets can become impractical on high speed links due to limited fast memory capacity, especially when the concurrent flows are in large quantity, or extremely disordered in circumstances such as attacks. So such buffering strategy is vulnerable to memory exhausting denial of service (DoS). In this paper, AC-Suffix-Tree, a buffer free scheme for string matching is proposed, which detects patterns across out-of-sequence packets without buffering and reassembly. This novel algorithm associates the classical Aho-Corasick (AC) algorithm with a pattern suffix tree to search patterns with only the state numbers of AC automaton and suffix tree stored. It demands significantly less memory than buffering the packets themselves. Therefore the IDS can resist memory exhausting DoS attack. AC-Suffix-Tree consumes 1-2 orders of magnitude less memory than buffering the entire packet, and it has the same temporal complexity as AC algorithm when there are no out-of-sequence packets.","PeriodicalId":124429,"journal":{"name":"2011 ACM/IEEE Seventh Symposium on Architectures for Networking and Communications Systems","volume":"579 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115973369","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

Efficient Implementation of Dynamic Protocol Stacks 动态协议栈的有效实现

2011 ACM/IEEE Seventh Symposium on Architectures for Networking and Communications Systems Pub Date : 2011-10-03 DOI: 10.1109/ANCS.2011.19

A. Keller, Daniel Borkmann, W. Mühlbauer

引用次数: 4

Accelerating Sketch-Based Computations with GPU: A Case Study for Network Traffic Change Detection 利用GPU加速基于草图的计算:网络流量变化检测的案例研究

2011 ACM/IEEE Seventh Symposium on Architectures for Networking and Communications Systems Pub Date : 2011-10-03 DOI: 10.1109/ANCS.2011.18

Theophilus Wellem, Yu-Kuen Lai, Chun-Chieh Lee, Kuei-Sheng Yang

引用次数: 5