By Topic

Networking, Architecture, and Storage, 2008. NAS '08. International Conference on

Date 12-14 June 2008

Filter Results

Displaying Results 1 - 25 of 75
  • [Front cover]

    Page(s): C1
    Save to Project icon | Request Permissions | PDF file iconPDF (218 KB)  
    Freely Available from IEEE
  • [Title page i]

    Page(s): i
    Save to Project icon | Request Permissions | PDF file iconPDF (11 KB)  
    Freely Available from IEEE
  • [Title page iii]

    Page(s): iii
    Save to Project icon | Request Permissions | PDF file iconPDF (32 KB)  
    Freely Available from IEEE
  • [Copyright notice]

    Page(s): iv
    Save to Project icon | Request Permissions | PDF file iconPDF (54 KB)  
    Freely Available from IEEE
  • Table of contents

    Page(s): v - ix
    Save to Project icon | Request Permissions | PDF file iconPDF (121 KB)  
    Freely Available from IEEE
  • Message from the General Chairs

    Page(s): x
    Save to Project icon | Request Permissions | PDF file iconPDF (25 KB)  
    Freely Available from IEEE
  • Message from the Program Co-Chairs

    Page(s): xi
    Save to Project icon | Request Permissions | PDF file iconPDF (74 KB)  
    Freely Available from IEEE
  • Program Committee

    Page(s): xii - xiii
    Save to Project icon | Request Permissions | PDF file iconPDF (53 KB)  
    Freely Available from IEEE
  • Organizing Committee

    Page(s): xiv
    Save to Project icon | Request Permissions | PDF file iconPDF (79 KB)  
    Freely Available from IEEE
  • Steering Committee

    Page(s): xv
    Save to Project icon | Request Permissions | PDF file iconPDF (45 KB)  
    Freely Available from IEEE
  • list-reviewer

    Page(s): xvi - xviii
    Save to Project icon | Request Permissions | PDF file iconPDF (63 KB)  
    Freely Available from IEEE
  • Secure Remote Storage through Authenticated Encryption

    Page(s): 3 - 9
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (299 KB) |  | HTML iconHTML  

    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. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reliability Assurance of RAID Storage Systems for a Wide Range of Latent Sector Errors

    Page(s): 10 - 19
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (300 KB) |  | HTML iconHTML  

    The low-cost disk drives, which are increasingly being adopted in today's data storage systems, have higher capacity but lower reliability, which leads to more frequent rebuilds and to a higher risk of unrecoverable or latent media errors. An intra-disk redundancy scheme has been proposed to cope with such errors and enhance the reliability of RAID systems. Empirical field results recently reported in the literature, however, suggest that the extent to which unrecoverable media errors occur is higher than the data sheet specifications provided by the disk manufacturers. Our results demonstrate that the reliability improvement due to intradisk redundancy is adversely affected because of the increase in the number of unrecoverable errors. We demonstrate that, by revising the parameter choice of the intradisk redundancy scheme, we can obtain essentially the same reliability as that of a system operating without unrecoverable sector errors. The I/O and throughput performance are evaluated by means of analysis and event-driven simulations. The effects of the spatial locality of errors and of the error-burst length distribution on the system reliability are also investigated. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design and Analysis of a Scalable Third-Party Storage Security Protocol

    Page(s): 20 - 27
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (314 KB) |  | HTML iconHTML  

    With the trend of networking and the growth of data value, networked storage security becomes hotpot of research. Aiming at the scalability and security requirement of massive storage system, we proposed a security storage service model combining storage mechanism and security policy and designed a set of scalable third-party security protocols. The protocols adopt public-key cryptography to guarantee the integrity of capability, avoiding the maintenance of shared key. The results of the formal analysis logically ensure the feasibility of the proposed security protocol. Furthermore, the overhead evaluation of the capability illustrates that the security protocol can meet the scalability requirement of storage system. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal Implementation of Continuous Data Protection (CDP) in Linux Kernel

    Page(s): 28 - 35
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (351 KB) |  | HTML iconHTML  

    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. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault Surviving Optimisation within Brick Based Storage System

    Page(s): 36 - 43
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (155 KB) |  | HTML iconHTML  

    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. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • EBEM: An Event-driven Bandwidth Estimation Method for Mobile Ad Hoc Network

    Page(s): 47 - 52
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (396 KB) |  | HTML iconHTML  

    Quality of Service (QoS) support has been well studied as a hotspot in mobile ad hoc network. However, since interference range is much larger than transmission range, estimating available bandwidth at each node remains a challenge. To address this problem, a novel Event-driven Bandwidth Estimation Method (EBEM) is proposed in this paper. By incorporating a comprehensive intra-flow interference predicting approach and an event-driven inter-flow collision detecting strategy, EBEM could estimate nodal available bandwidth substantially, preventing the network from being overloaded. Results from simulation verify that EBEM not only surpasses typical AODV protocol in both end-to-end delay and packet delivery rate, but it also outperforms latest QAR method in both total throughput and packet delivery rate. As such, EBEM can be applied to various QoS routing protocols to estimate nodal available bandwidth. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic Route Diversion in Connectionless Mobile Ad Hoc Networks

    Page(s): 53 - 61
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (512 KB) |  | HTML iconHTML  

    In a mobile ad hoc network (MANET), communication connections need to adapt to frequent unpredictable topology changes due to the mobility, energy constraints, and limited computing power of the mobile hosts. Early solutions address this fundamental requirement by employing techniques that can reconnect a broken link quickly with low overhead. This strategy, however, cannot cope with a high frequency of broken links in a high mobility environment. To address this problem, a few connectionless-oriented techniques, e.g., connectionless approach (CLA), have emerged. These schemes rely on any mobile hosts along the general direction towards the destination node to help forward the data packets. Extensive simulation results have shown that these methods are more robust, and perform significantly better than connection-oriented techniques. The current connectionless methods, however, may suffer from packet drops since traffic congestion is not considered in the packet forwarding policy. In this paper, we address this weakness by applying a cross-layer design, where the physical and MAC layer knowledge of the wireless medium is shared with higher layer, in order to provide efficient methods of establish and maintain routes. We proposed two connectionless-oriented dynamic route diversion techniques; and give simulation results, based on GloMoSim, to illustrate their performance advantage. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Dynamic Congestion Control Based Multipath Routing Protocol for Video Transmission over Ad Hoc Networks

    Page(s): 62 - 69
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1174 KB) |  | HTML iconHTML  

    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. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Joint Topology-Transparent Scheduling and QoS Routing in Mobile Ad Hoc Networks

    Page(s): 70 - 77
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (390 KB) |  | HTML iconHTML  

    In this paper, a framework for joint topology-transparent scheduling (TTS) and quality-of-service (QoS) routing in mobile ad hoc networks is proposed. Inspired by the fact that TTS can guarantee single-hop QoS support without the overhead due to the re-computation of transmission schedules when the network topology changes, TTS is chosen as the medium access control (MAC) in both the control and data channels. An interference model which captures the difference between communication and interference ranges is considered. Under this interference model, mechanisms in the control channel are designed to collect information of nodes outside a node's communication range in order to provide QoS support. Based on the information collected, bandwidth calculation and reservation at individual nodes are developed to efficiently utilize the data channel resources provided by TTS. A routing protocol with (end-to-end) QoS support is then proposed by giving routing access to bandwidth information. The proposed framework using TTS as the underlying MAC to design a QoS routing protocol is demonstrated by means of simulations. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • POND: The Power of Zone Overlapping in DHT Networks

    Page(s): 81 - 88
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (228 KB) |  | HTML iconHTML  

    Distributed hash table (DHT) based algorithms have been proposed to solve the routing issues in large-scale peer-to-peer (P2P) applications. DHT systems create an elegant peer-to-peer service model and work perfect in a homogeneous environment. Workload are evenly distributed on every participating peer and system is supposed to achieve the optimal performance. However, in the real world, the complicated scenarios such as peerspsila capability heterogeneity, diverse file popularities, and mismatching problem between physical network structure and logical routing data structure, jeopardize the efficiency of DHT infrastructure and may result in serious load imbalance problem. In this paper, we propose -- POND, a novel and efficient DHT algorithm to relieve the above problem. In POND, peers are divided into two types: main peers (MP) and shadow peers(SP). As other DHT systems, POND splits the name space into several disjointed zones. However, unlike other systems which only have one peer in charge of each zone, in POND, we use zone overlapping technique. In each zone, a MP and several SPs are used for services. Any of them is capable to handle service requests fallen into this zone. When a new request is coming,the peer with the minimal load has the high possibility to be chosen to provide the service. Thus, the risk of overload problem is reduced. With the introduction of shadow peers, POND also provides better failure tolerance and relieves the hot spot problem. Moreover, POND can improve the routing performance by reducing the average number of routing hops per request. We conduct extensive simulation experiments and the results show POND is superior to other DHT algorithms. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive Consistency Guarantees for Large-Scale Replicated Services

    Page(s): 89 - 96
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (346 KB) |  | HTML iconHTML  

    To maintain consistency, designers of replicated services have traditionally been forced to choose from either strong consistency guarantees or none at all. Realizing that a continuum between strong and optimistic consistencies is semantically meaningful for a broad range of network services, previous research has proposed a continuous consistency model for replicated services to support the tradeoff between the guaranteed consistency level, performance and availability. However, to meet changing application needs and to make the model useful for interactive users of large-scale replicated services, the adaptability and the swiftness of inconsistency resolution are important and challenging. This paper presents IDEA (an infrastructure for detection-based adaptive consistency guarantees) for adaptive consistency guarantees of large-scale, Internet-based replicated services. The main functions enabled by IDEA include quick inconsistency detection and resolution, consistency adaptation and quantified consistency level guarantees. Through experimentation on the Planet-Lab, IDEA is evaluated from two aspects: its adaptive consistency guarantees and its performance for inconsistency resolution. Results show that IDEA is able to provide consistency guarantees adaptive to userpsilas changing needs, and it achieves low delay for inconsistency resolution and incurs small communication overhead. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Applications of Bloom Filters in Peer-to-peer Systems: Issues and Questions

    Page(s): 97 - 103
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (227 KB) |  | HTML iconHTML  

    Bloom filter is a widely-used data structure that concisely represents a large set of contents for approximate membership queries. Due to its good space efficiency, Bloom filter has been applied or customized in a variety of P2P system designs. Although the basic idea of Bloom filter is explained each time it is used, elaborative details are ignored. However, we argue that it is no.t always a trivial task to make a good decision on specific design aspects when applying Bloom filters in P2P systems. If not well deployed, the overhead and side effects of Bloom filters may outweigh their benefits. In this paper we study Bloom filter in the context of P2P systems, and explore its design space on several important issues. Our goal is to provide an in-depth understanding on Bloom filter's strength and weakness, and gain an insight into its usagein P2P systems. In addition, we raise some open questions that deserve further discussion among theP2P community. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Effective Algorithm for Counting Active Flows Based on Loop Bloom Filter

    Page(s): 104 - 109
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (330 KB) |  | HTML iconHTML  

    Network traffic analysis based on flows plays an important role in network monitoring and P2P identification. They are all grounded in flow counting and differ in how to count. Timeout detecting is a major strategy to identify termination of flows and can influence the validity of flow counting. The algorithms for counting flow based on Hash method can't deal with timeout problems perfectly. In this paper, a novel algorithm based on loop bloom filter is proposed. It can estimate active flow with timeout detection on high speed links more accurately. Experiment results show that this algorithm can ensure accuracy while only consuming minimum time and memories. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Mobile Router Forwarding Scheme for Multicast in the NEMO

    Page(s): 113 - 120
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (615 KB) |  | HTML iconHTML  

    Multicast is an efficient method to transmit datagrams in the Internet. In this paper, we provide a multicast algorithm in a network mobility (NEMO) environment. We propose the mobile router forwarding scheme (MRFS) algorithm. There are two advantages in the MRFS algorithm. First, MRFS reduces the storages in every MR especially in the TLMR (top level MR). Second, MRFS transmits multicast datagrams more efficiently that because MRFS transmit multicast datagrams not only by TLMR but also by every MR. The above of two advantages are achieved using MRFS tables. In this paper, MRFS algorithm is analyzed. MRFS algorithm is more efficient than other multicast protocols in the NEMO according to the evaluation. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.