{"title":"Queue Network Modeling Approach to Analysis of the Optimal Stripe Unit Size for Disk Arrays under Synchronous I/O Workloads","authors":"Wu Ming, Xiao-ming Dong, Huai-yang Li","doi":"10.1109/IWNAS.2006.38","DOIUrl":"https://doi.org/10.1109/IWNAS.2006.38","url":null,"abstract":"Storage systems represent a growing market. In recent years there has been an explosion of applications that use enormous amounts of data. Disk arrays are today's standard solution for enterprise class storage systems. One of the most crucial parameters in designing a disk array is the size of the striping unit. The paper presents and validates a performance model for RAID level 5. The model is created as a closed fork-join queue network (CFJQN) under synchronous I/O workloads. It can be used to compute the optimal strip unit size for disk arrays","PeriodicalId":439264,"journal":{"name":"2006 International Workshop on Networking, Architecture, and Storages (IWNAS'06)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123316949","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}
Jianzhong Huang, C. Xie, Guangxi Zhu, Zhou Gang, Wu Wei
{"title":"Design and analysis of a third-party security protocol for storage system","authors":"Jianzhong Huang, C. Xie, Guangxi Zhu, Zhou Gang, Wu Wei","doi":"10.1109/IWNAS.2006.24","DOIUrl":"https://doi.org/10.1109/IWNAS.2006.24","url":null,"abstract":"The large-scale storage system has the requirements of high scalability and strong security. In order to meet the both requirements, we propose a third-party storage security system and design a capability-based third-party security protocol. The protocol is based on the third-party mode, which separates transfer security from access control mechanism. After the formal analysis, the deduced results logically demonstrate the integrity of requested capability, correctness of transfers process and authenticity of message, thus guaranteeing the feasibility of the third-party security protocol","PeriodicalId":439264,"journal":{"name":"2006 International Workshop on Networking, Architecture, and Storages (IWNAS'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129799267","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}
{"title":"An Improved Direct Digital Frequency Synthesis System Design","authors":"Qingdong Wang, C. Xie, Haiwei Wang, Chun Liu","doi":"10.1109/IWNAS.2006.16","DOIUrl":"https://doi.org/10.1109/IWNAS.2006.16","url":null,"abstract":"This paper researches a programmable signal device by an improved direct digital frequency synthesis technology on DSP and FPGA to simulate servo signal for read-write channel of micro hard disk. This device has wide frequency range from 1 Hz to 10MHz, high frequency resolution of 0.001 Hz, high precision of frequency, phase and amplitude of output wave, good reliability, little distortion. Compared with general devices, this device can generate all kinds of servo signal, and circuit is simply, reliable, and programmable","PeriodicalId":439264,"journal":{"name":"2006 International Workshop on Networking, Architecture, and Storages (IWNAS'06)","volume":"32 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122541942","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}
{"title":"An Analytical Model for Scheduling Policies in Storage Networks","authors":"D. Hu, Q. Cao, C. Xie","doi":"10.1109/IWNAS.2006.14","DOIUrl":"https://doi.org/10.1109/IWNAS.2006.14","url":null,"abstract":"The I/O routine in network storage has longer transferring time and overhead than local I/O. To well make use of the storage network bandwidth and meet demand of concurrent I/O requests, we need to find the appropriate schedule policy for I/O requests at the level of the network. The focus in the paper is on how to schedule concurrent I/O data transferring in share storage network, and to improve performance such as the response time affected by scheduling method. Our objective is to analysis the response time of concurrent requests as function their schedule order such as the sequenced, parallel and hybrid policies. We then verify our results by both the analytical method and experiment","PeriodicalId":439264,"journal":{"name":"2006 International Workshop on Networking, Architecture, and Storages (IWNAS'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130879852","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}
{"title":"Smart file system: embedded file system based on NAND-flash","authors":"Tianzhou Chen, Hu Wei, Xiangsheng Wang","doi":"10.1109/IWNAS.2006.42","DOIUrl":"https://doi.org/10.1109/IWNAS.2006.42","url":null,"abstract":"With the prevalence of embedded system, especially mobile system, flash-memory storage which has high capacity and low energy consumption has become the primary external storage for embedded systems. Some file system based on flash memory have been designed and implemented such as JFFS2 and YAFFS2. But they all have some defects: long boot time, high memory consumption and so on. In this paper, SmartFS (smart file system) is presented and described. SmartFS can improve the performance of flash memory management and make good use of large capacity flash memory","PeriodicalId":439264,"journal":{"name":"2006 International Workshop on Networking, Architecture, and Storages (IWNAS'06)","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131147742","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}
Zifeng Xiao, Hongwei Zhang, Yonghao Zhou, Jizhong Han
{"title":"Design and Performance Evaluation of IPoIB Gateway","authors":"Zifeng Xiao, Hongwei Zhang, Yonghao Zhou, Jizhong Han","doi":"10.1109/IWNAS.2006.26","DOIUrl":"https://doi.org/10.1109/IWNAS.2006.26","url":null,"abstract":"InfiniBand provides a high-bandwidth, low-latency network, and has been widely adopted in modern storage and computing systems. However, Ethernet fabric is still widely used which has different characteristics in protocol and performance. Therefore, an Ethernet-to-InfiniBand gateway must be built to implement protocol conversion and bandwidth aggregation. This paper introduces a software implementation of Ethernet-to-InfiniBand gateway based on IPoIB protocol. Moreover, several network test tools are compared and used to evaluate the performance of IPoIB gateway. Performance evaluation results show that IP fragmentation operations and high CPU utilization of software interruption are the bottlenecks of the system, and they are good references for the design of hardware Ethernet-to-InfiniBand gateway","PeriodicalId":439264,"journal":{"name":"2006 International Workshop on Networking, Architecture, and Storages (IWNAS'06)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121956573","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}
{"title":"A novel technique of recognizing multi-stage attack behaviour","authors":"Li Wang, Yao Li, Zhitang Li","doi":"10.1504/IJHPCN.2010.037791","DOIUrl":"https://doi.org/10.1504/IJHPCN.2010.037791","url":null,"abstract":"Since security audit data increased so dramatically, management and analysis of these security data become a critical and challenge issue. SATA (security alerts and threat analysis project) aims at analyzing the security events and detecting the security threat. In this paper, we proposed a novel method of constructing attack scenarios model in order to recognize multi-stage attack behaviour and predict potential attack steps of the attacker. Our method based on statistical method using the feature of time consecution association of contextual attack steps. Besides, we proposed a new method of computing the correlativity between two contextual attacks which enhances the correlationship of the attack scenarios model and ensures the accuracy of the final correlation result. The idea is easy to implement and it can be used to detect novel multi-stage attacks. Experiment shows that our method is effective and feasible","PeriodicalId":439264,"journal":{"name":"2006 International Workshop on Networking, Architecture, and Storages (IWNAS'06)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117155735","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}
{"title":"Supporting time-critical clients in scalable pub-sub systems","authors":"S. Ray, M. Linderman, Danyang Zhang","doi":"10.1504/IJHPCN.2010.037796","DOIUrl":"https://doi.org/10.1504/IJHPCN.2010.037796","url":null,"abstract":"In a pub/sub (publish/subscribe) environment like JBI (Joint Battlespace Infosphere), information/data has to be efficiently and reliably transmitted between servers and clients. However, due to various reasons such as unexpected network traffic, hardware/software failure, etc., the overlay network of the system needs to be reconfigured, thus intolerable service interruption may occur to time critical applications. This paper proposed theoretical methods for providing temporary respite to the time-critical clients while the backbone network is under repair","PeriodicalId":439264,"journal":{"name":"2006 International Workshop on Networking, Architecture, and Storages (IWNAS'06)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123152057","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}
{"title":"Automatic selection of redundancy scheme in cluster-based storage systems","authors":"Gang Liu, Jing-li Zhou, Yu Wang","doi":"10.1109/IWNAS.2006.19","DOIUrl":"https://doi.org/10.1109/IWNAS.2006.19","url":null,"abstract":"Self-management is an attractive work for storage systems. In this paper, we introduce some methods of self-tuning RAID into cluster-based storage system. An iterative approach is used to dynamically select an optimal redundancy scheme for a workload and move data to corresponding storage devices","PeriodicalId":439264,"journal":{"name":"2006 International Workshop on Networking, Architecture, and Storages (IWNAS'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114465876","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}
{"title":"Hint-based routing in WSNs using scope decay bloom filters","authors":"Xiuqi Li, Jie Wu, Jun Xu","doi":"10.1109/IWNAS.2006.30","DOIUrl":"https://doi.org/10.1109/IWNAS.2006.30","url":null,"abstract":"In existing query-based routing protocols in wireless sensor networks (WSNs), a node either keeps precise route information to desired events, such as in event flooding, or does not keep any route to desired events such as in query flooding. In this paper, we propose a routing protocol, called Hint-based Routing by Scope Decay Bloom Filter (HR-SDBF), that employs probabilistic hints. In HR-SDBF, each node maintains some probabilistic hints about events and utilizes these hints to route queries intelligently. We also put forward a data structure, scope decay bloom filter (SDBF) to encode the probabilistic hints. With SDBF, the amount of information about an event is propagated, without any loss, within the k-hop neighborhood of an event source but decreases outside the k-hop neighborhood as the distance from the event source increases. Compared to existing query-based protocols, HR-SDBF greatly reduces the amortized network traffic without compromising the query success rate and achieves a higher energy efficiency. To the best of our knowledge, this is the first query routing protocol in WSNs that utilizes probabilistic hints encoded in a variant of the bloom filter. Both the analytic and the experimental results support the performance improvement of our protocol","PeriodicalId":439264,"journal":{"name":"2006 International Workshop on Networking, Architecture, and Storages (IWNAS'06)","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128811161","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}