{"title":"Modelling Threshold Secret Sharing Schemes in Ad Hoc Networks","authors":"Weifeng Chen, Hu'an Li","doi":"10.1109/NAS.2008.60","DOIUrl":"https://doi.org/10.1109/NAS.2008.60","url":null,"abstract":"A threshold secret sharing scheme divides a secret key into multiple shares. The secret key can be constructed based on a certain number of shares, if the number is bigger than the threshold. Threshold secret sharing schemes increase the availability of service in ad hoc networks and avoid the single point of failure. Consequently, many security mechanisms have been proposed based on threshold secret sharing. However, research about how to choose an appropriate threshold is still missing. In this paper, we use fork/join queueing theories to develop a general model to evaluate the performance of a threshold secret sharing scheme in ad hoc networks. Specifically, we focus on the response time a requesting node needs to wait before it receives enough responded shares. Our proposed model allows one to numerically calculate the response time based on the threshold. It also provides a tool for people to choose an appropriate threshold when deploying a threshold secret sharing scheme in ad hoc networks.","PeriodicalId":153238,"journal":{"name":"2008 International Conference on Networking, Architecture, and Storage","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127043551","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":"Secure Remote Storage through Authenticated Encryption","authors":"Fangyong Hou, Dawu Gu, Nong Xiao, Yuhua Tang","doi":"10.1109/NAS.2008.48","DOIUrl":"https://doi.org/10.1109/NAS.2008.48","url":null,"abstract":"Storage systems are more distributed and more subject to attacks. Cryptographic file system gives a promising way to mitigate the danger of exposing data by using encryption and integrity protection methods and guarantee end-to-end security to clients. This paper describes SRSAE, a generic approach to cryptographic file system, as well as its realization in a distributed data storage environment. SRSAE applies authenticated encryption to each data block transferred between clients and the remote block devices. It provides strong data confidentiality and integrity protections through trusted IV (initialization vector) and MAC (message authentication code) comparison. Performance is optimized by buffering IV and MAC locally. Integration into original file system is presented with specific implementation. Related model, approach and system realization are elaborated, as well as testing results. Theoretical analysis and experimental simulations show that it is a practical and available way to build secure network storage system.","PeriodicalId":153238,"journal":{"name":"2008 International Conference on Networking, Architecture, and Storage","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130562997","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":"Optimal Implementation of Continuous Data Protection (CDP) in Linux Kernel","authors":"Xu Li, C. Xie, Qing Yang","doi":"10.1109/NAS.2008.44","DOIUrl":"https://doi.org/10.1109/NAS.2008.44","url":null,"abstract":"To protect data and recover data in case of failures, Linux operating system has built-in MD device that implements RAID architectures. Such device can recover data in case of single hardware failure among multiple disks. But it cannot recover data that were damaged by human errors, virus attack, and disastrous failures. In this paper, we present an implementation of a device driver that is capable of recovering data to any point-in-time in case of various failures. A simple mathematical model is used to guide the optimization of our implementation in terms of space usage and recovery time. Extensive experiments have been carried out to show that the implementation is fairly robust and numerical results demonstrate that the implementation is optimal.","PeriodicalId":153238,"journal":{"name":"2008 International Conference on Networking, Architecture, and Storage","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132167336","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":"Towards More Reliable Source Routing in Wireless Networks","authors":"I. Jawhar, Z. Trabelsi, J. Al-Jaroodi","doi":"10.1109/NAS.2008.63","DOIUrl":"https://doi.org/10.1109/NAS.2008.63","url":null,"abstract":"This paper presents a reliable routing protocol for wireless ad hoc and sensor networks which is based on the DSR routing protocol. The protocol achieves increased reliability through the maintenance of a reliability factor by the nodes in the network. During the route discovery process, the request messages are only propagated to nodes with a reliability factor that is above a threshold value specified by the application. Selection among multiple possible discovered routes is done through the use of a normalized cumulative path reliability factor that is calculated by the destination. Different methods for the maintenance of the reliability factor by the nodes, as well as other optimizations to enhance network performance and reduce path discovery overhead are also presented.","PeriodicalId":153238,"journal":{"name":"2008 International Conference on Networking, Architecture, and Storage","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130553541","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":"Fault Surviving Optimisation within Brick Based Storage System","authors":"Connor L. C. Gray, M. Hobbs","doi":"10.1109/NAS.2008.67","DOIUrl":"https://doi.org/10.1109/NAS.2008.67","url":null,"abstract":"The cost of providing an organization with enterprise class storage is continuing to rise, due primarily to the use of specialised components and the complex internal storage system structures. This high cost has resulted in researchers directing their efforts towards modular or 'brick' based storage, which utilise commodity components while employing autonomic principles for the management of the system, reducing the costs incurred during the lifetime of the storage system. While systems based upon this brick structure incorporate high levels of data reliability/availability, they fail to recognise the importance of ensuring the management services of a system are also tolerant of failures (such as optimisation). If system management services are not provided reliably, such storage systems which experience failures will degradedramatically in performance, especially when the node/s responsible for providing the management fails. This paper addresses the issue of providing fault tolerant management services within brick storage systems. We present in this paper our model of a system that can ensure the integrity and availability of data stored within brick based storage while ensuring the continual execution of the systems management services irrespective of failures within the system.","PeriodicalId":153238,"journal":{"name":"2008 International Conference on Networking, Architecture, and Storage","volume":"278 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123553101","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}
Zhong Jiang, Wen Luosheng, Feng Yong, Ye Chun Xiao
{"title":"Intrusion Detection Based on Density Level Sets Estimation","authors":"Zhong Jiang, Wen Luosheng, Feng Yong, Ye Chun Xiao","doi":"10.1109/NAS.2008.41","DOIUrl":"https://doi.org/10.1109/NAS.2008.41","url":null,"abstract":"Recently the machine learning-based intrusion detection approaches have been subjected to extensive researches because they can detect both misuse and anomaly. One way to describe anomalies is by saying that anomalies are not concentrated. It leads to the problem of finding level sets for the data generating density. This learning problem may be converted as a binary classification problem. In this paper, we propose a new method to design RBF classifier based on multiple granularities immune network, and apply this algorithm to detection the data density level set. Experimental results on the real network data set showed that the new classifier has higher detection rate and lower false positive rate than traditional RBF classifier.","PeriodicalId":153238,"journal":{"name":"2008 International Conference on Networking, Architecture, and Storage","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121920267","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 Dynamic Congestion Control Based Multipath Routing Protocol for Video Transmission over Ad Hoc Networks","authors":"Yang He, Zhenyong Chen, Yuheng Liu, Z. Xiong","doi":"10.1109/NAS.2008.28","DOIUrl":"https://doi.org/10.1109/NAS.2008.28","url":null,"abstract":"In wireless ad hoc networks, there are great challenges of supporting real-time video transmission due to the impact of frequent link interruptions, collisions, and bandwidth limitations and so on. Based on the analysis of the multipath routing and congestion control strategy, we propose a dynamic congestion control based multipath routing protocol (DccMR). DccMR establishes and maintains redundant multiple paths with very low routing overhead. A dynamic congestion control strategy is applied to adjust packets routing in a load-aware manner. When all shortest paths broken, a route update procedure will be initiated by the destination node, in which new paths will be reestablished whereas the video transmission will not be interrupted. Simulation results show that our protocol can decrease routing overhead significantly and improve the real-time video transmission quality.","PeriodicalId":153238,"journal":{"name":"2008 International Conference on Networking, Architecture, and Storage","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128200158","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":"Design and Implement of Snapshots in Linux Block Level","authors":"Huaiyang Li, C. Xie, Yan Liu, Q. Cao","doi":"10.1109/NAS.2008.43","DOIUrl":"https://doi.org/10.1109/NAS.2008.43","url":null,"abstract":"This paper presented the design and implement of snapshots device driver in Linux. Our implement was carried out at the block level as the device driver. It is available to all file systems and databases. We used industry standard benchmark to measure the performance and uncovered many important performance characteristics.","PeriodicalId":153238,"journal":{"name":"2008 International Conference on Networking, Architecture, and Storage","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126741791","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":"VDMS: A Vector Data Management System for GIS Applications","authors":"Xuhui Liu, Shubin Zhang, Jin He, Jizhong Han, Chengde Han, Zhiyong Xu","doi":"10.1109/NAS.2008.58","DOIUrl":"https://doi.org/10.1109/NAS.2008.58","url":null,"abstract":"Traditionally, vector data management in geographic information system (GIS) applications often relies on general purposed database systems. However, the strict ACID semantics kept by database systems are not always necessary for most GIS applications to handle data in read-only mode. With the increasing quantity of vector data, the semantics mismatch has been becoming a critical challenge in keeping efficiency of GIS data management. In this paper, we propose VDMS, a Vector Data Management System, which managing data directly based on file systems. We first provide an improved mechanism to store vector data as standard shapefiles in individual regions. And we present specific APIs for spatial and non-spatial queries. Our experiment results demonstrate that VDMS can benefit the importing and query operations of vector data significantly compared to PostgreSQL.","PeriodicalId":153238,"journal":{"name":"2008 International Conference on Networking, Architecture, and Storage","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132411103","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":"Efficient Event Matching in Publish/subscribe: Based on Routing Destination and Matching History","authors":"Xiangfeng Guo, Jun Wei, Dongli Han","doi":"10.1109/NAS.2008.35","DOIUrl":"https://doi.org/10.1109/NAS.2008.35","url":null,"abstract":"Efficient event matching in a content-based publish/subscribe system is an important problem. Most existing matching solutions focus on subscription relations, such as cover and merge. We observe that event matching can leverage matching history and routing destination as well. Once one of the subscriptions associated with a destination is matched, undecided subscriptions associated with the destination need not be evaluated. Since each different subscription has a different possibilities to match an event, different matching order of subscriptions can result in different matching time. We propose a new efficient event matching approach based on matching order, cover relation, matching history (matching possibility) and routing destination. Our solution indexes subscriptions in an efficient way. Based on event matching history, cover relation and routing destination, our matching approach can cause efficient matching with a special match order, and can easily register or cancel subscriptions. We also propose a highly efficient index structure for numeric filters, which can evaluate N numeric filters with O(logN) time complexity. Quantity analysis of our solution is given. We carry out detailed experimentations to verify the effectiveness of our approach. The results show that our approach achieves high matching efficiency.","PeriodicalId":153238,"journal":{"name":"2008 International Conference on Networking, Architecture, and Storage","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134513005","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}