2011 IEEE Sixth International Conference on Networking, Architecture, and Storage最新文献_第3页

Energy Efficient Buffer Cache Replacement for Data Servers 数据服务器的节能缓冲缓存替换

2011 IEEE Sixth International Conference on Networking, Architecture, and Storage Pub Date : 2011-07-28 DOI: 10.1109/NAS.2011.49

Jianhui Yue, Yifeng Zhu, Zhao Cai, Lin Lin

{"title":"Energy Efficient Buffer Cache Replacement for Data Servers","authors":"Jianhui Yue, Yifeng Zhu, Zhao Cai, Lin Lin","doi":"10.1109/NAS.2011.49","DOIUrl":"https://doi.org/10.1109/NAS.2011.49","url":null,"abstract":"Power consumption is an increasingly impressing concern for data servers as it directly affects running costs and system reliability. Prior studies have shown that most memory space on data servers is used for buffer caching and thus cache replacement becomes critical. Two conflicting factors of buffer caching impacts memory energy efficiency: (1) a higher hit rate reduces memory traffic and thus saves energy, (2) temporally concentrating memory accesses to a smaller set of memory chips increases the chances of \"free riding\" through DMA overlapping and also makes more memory chips have opportunities to power down. This paper investigates the tradeoff between these two interacting, sometimes conflicting factors and proposes three energy-aware buffer cache replacement algorithms: On a cache miss for a new block b in a file f, evict an victim block from (1)the most recently accessed memory chip, (2) the memory chip that is accessed most recently by file f, or (3) the memory chip that is accessed most recently by file f and whose last access block belongs to the same hot or cold categories as block b. Simulation results based on three real-world I/O traces, including TPC-R, MSN-BEFS and Exchange, show that our algorithms can save up to 24.9% energy with marginal degradation in hit rates. Our algorithms show degradation in response time in some experiments. We propose an off-line energy sub optimal replacement algorithm that serves as a theortical reference.","PeriodicalId":263887,"journal":{"name":"2011 IEEE Sixth International Conference on Networking, Architecture, and Storage","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134060138","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

Using Entropy to Classify Traffic More Deeply 利用熵对流量进行更深入的分类

2011 IEEE Sixth International Conference on Networking, Architecture, and Storage Pub Date : 2011-07-28 DOI: 10.1109/NAS.2011.18

Yipeng Wang, Zhibin Zhang, Li Guo, Shuhao Li

{"title":"Using Entropy to Classify Traffic More Deeply","authors":"Yipeng Wang, Zhibin Zhang, Li Guo, Shuhao Li","doi":"10.1109/NAS.2011.18","DOIUrl":"https://doi.org/10.1109/NAS.2011.18","url":null,"abstract":"The network community always pays its attention to find better methods for traffic classification, which is crucial for Internet Service Providers (ISPs) to provide better QoS for users. Prior works on traffic classification mainly focus their attentions on dividing Internet traffic into different categories based on application layer protocols (such as HTTP, Bit Torrent etc.). Making traffic classification from another point of view, we divide Internet traffic into different content types. Our technology is an attempt to solve the classification problem of network traffic, which contains unknown and proprietary protocols (i.e., no publicly available protocol specification). In this paper, we design a classifier which can distinguish Internet traffic into different content types using machine learning techniques. Features of our classifier are entropy of consecutive bytes and frequencies of characters. Our method is capable of classifying real-world traces into different content types (including Text, Picture, Audio, Video, Compressed, Base 64-encoded image, Base 64-encoded text and Encrypted). The chief features of our classifier are small computing space (about 1K Bytes) and high classification accuracy (about 81%).","PeriodicalId":263887,"journal":{"name":"2011 IEEE Sixth International Conference on Networking, Architecture, and Storage","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129594658","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}

引用次数: 20

An Integrated System Solution for Secure P2P Content Distribution Based on Network Coding 基于网络编码的安全P2P内容分发集成系统解决方案

2011 IEEE Sixth International Conference on Networking, Architecture, and Storage Pub Date : 2011-07-28 DOI: 10.1109/NAS.2011.47

Heng He, Ruixuan Li, Guoqiang Gao, Zhiyong Xu, Weijun Xiao

{"title":"An Integrated System Solution for Secure P2P Content Distribution Based on Network Coding","authors":"Heng He, Ruixuan Li, Guoqiang Gao, Zhiyong Xu, Weijun Xiao","doi":"10.1109/NAS.2011.47","DOIUrl":"https://doi.org/10.1109/NAS.2011.47","url":null,"abstract":"Network coding has been demonstrated to be able to improve the performance of P2P content distribution. However, it is vulnerable to pollution attacks, leading to substantial performance degradation. Moreover, existing corruption detection schemes for network coding are not applied well to P2P systems. More efficient scheme based on attacker identification is required to thwart such attacks. In this paper, we propose an integrated system solution for secure P2P content distribution based on network coding, referred to as ISNC. In ISNC, we first design our system architecture based on extended uniform bipartite networks that can achieve high throughput with network coding. Based on the architecture, we present a secure network coding signature scheme and an identity-based malicious peer identification scheme. The two schemes can cooperate to thwart pollution attacks effectively in P2P network, not only detecting corrupted blocks, but also identifying all the malicious peers. Simulation results show that ISNC can effectively limit the pollution spread and identify malicious peers quickly, even when they collude to launch attacks. Compared with existing related schemes, ISNC is especially applicable for P2P content distribution, and can achieve both high security and overall efficiency.","PeriodicalId":263887,"journal":{"name":"2011 IEEE Sixth International Conference on Networking, Architecture, and Storage","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129703106","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}

引用次数: 5

Applying Modified TAM to Privacy Setting Tools on SNS 改进TAM在社交网络隐私设置工具中的应用

2011 IEEE Sixth International Conference on Networking, Architecture, and Storage Pub Date : 2011-07-28 DOI: 10.1109/NAS.2011.40

Yuxuan Bao, Xueping Wang, Da Deng

引用次数: 4

Performance and Power Analysis of ATI GPU: A Statistical Approach ATI GPU的性能和功耗分析:一种统计方法

2011 IEEE Sixth International Conference on Networking, Architecture, and Storage Pub Date : 2011-07-28 DOI: 10.1109/NAS.2011.51

Ying Zhang, Yue Hu, Bin Li, Lu Peng

引用次数: 82

Error Detection by Redundant Transaction in Transactional Memory System 事务性内存系统中冗余事务的错误检测

2011 IEEE Sixth International Conference on Networking, Architecture, and Storage Pub Date : 2011-07-28 DOI: 10.1109/NAS.2011.8

Wei Song, Jia Jia, Yuanxi Peng

引用次数: 1

TMTLS: Combine TM with TLS to Limit the Memory Contentions and Exploit the Parallelism in the Long-Running Transactions TMTLS:结合TM和TLS来限制内存争用并利用长时间运行事务中的并行性

2011 IEEE Sixth International Conference on Networking, Architecture, and Storage Pub Date : 2011-07-28 DOI: 10.1109/NAS.2011.35

Zhichao Yan, D. Feng, Yujuan Tan

{"title":"TMTLS: Combine TM with TLS to Limit the Memory Contentions and Exploit the Parallelism in the Long-Running Transactions","authors":"Zhichao Yan, D. Feng, Yujuan Tan","doi":"10.1109/NAS.2011.35","DOIUrl":"https://doi.org/10.1109/NAS.2011.35","url":null,"abstract":"As more threads added to execute the multi-threaded applications in the many-core era, memory contentions among different threads impose a severe challenge to both the programmability and performance. Existing studies show that Transactional Memory (TM) is able to solve the programmability problem and scale well on the fine-grained applications in the SPLASH-2 benchmark suite. As more investigations on the coarse-grained applications in the STAMP benchmark suite, the long-running transactions block the parallelism among the concurrent transactions and failed to obtain the performance returns when the number of threads is beyond 4. In order to address this problem, we propose TMTLS, which combines TM with Thread-Level Speculation (TLS) to limit the number of concurrent executing transactions due to the memory contention in the runtime, divides the coarse-grained transactions into several epochs and assigns them to the available threads to speculatively exploit the parallelism in the coarse-grained transactions. This proposal not only alleviates the memory contention among the threads but also shortens the execution period of the coarse-grained transactions. Moreover, it further reduces the serializing overheads due to the transactional conflicts among the transactions. Our evaluation show this method achieves an average speedup of 2.27 over the baseline TM system under the 4 high-contention and coarse-grained applications selected from the STAMP benchmark suite on a 16-core CMP.","PeriodicalId":263887,"journal":{"name":"2011 IEEE Sixth International Conference on Networking, Architecture, and Storage","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123800262","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}

引用次数: 2

Exploring the Difference of Power-Aware Cluster Schedulers 探索功率感知集群调度器的差异

2011 IEEE Sixth International Conference on Networking, Architecture, and Storage Pub Date : 2011-07-28 DOI: 10.1109/NAS.2011.48

Xiaohua Meng, Yang Hu, Yuhui Deng

引用次数: 0

Request Load Balancing for Highly Skewed Traffic in P2P Networks P2P网络中高倾斜流量的请求负载均衡

2011 IEEE Sixth International Conference on Networking, Architecture, and Storage Pub Date : 2011-07-28 DOI: 10.1109/NAS.2011.25

A. Brinkmann, Yan Gao, M. Korzeniowski, Dirk Meister

引用次数: 1

Efficient, Modular Metadata Management with Loris 使用Loris进行高效、模块化元数据管理

2011 IEEE Sixth International Conference on Networking, Architecture, and Storage Pub Date : 2011-07-28 DOI: 10.1109/NAS.2011.32

Richard van Heuven van Staereling, Raja Appuswamy, D. V. Moolenbroek, A. Tanenbaum

引用次数: 12