The Experts below are selected from a list of 1272 Experts worldwide ranked by ideXlab platform
Garth A Gibson - One of the best experts on this subject based on the ideXlab platform.
-
network attached storage architecture
Communications of The ACM, 2000Co-Authors: Garth A Gibson, Rodney Van MeterAbstract:SAN with Fibre Channel network hardware that has a greater effect on a user’s purchasing decisions. This article is about how emerging technology may blur the network-centric distinction between NAS and SAN. For example, the decreasing specialization of SAN protocols promises SAN-like devices on Ethernet network hardware. Alternatively, the increasing specialization of NAS systems may embed much of the file system into storage devices. For users, it is increasingly worthwhile to investigate networked storage core and emerging technologies. Today, bits stored online on magnetic disks are so inexpensive that users are finding new, previously unaffordable, uses for storage. At Dataquest’s storage2000 conference last June in Orlando, Fla., IBM reported that online disk storage is now significantly cheaper than paper or film, the dominant traditional information storage media. Not surprisingly, users are adding storage capacity at about 100% per year. Moreover, the rapid growth of e-commerce, with its huge global customer base and easy-to-use, online transactions, has introduced new market requirements, including bursty, unpredictable spurts in capacity, that demand vendors minimize the time from a user’s order to installation of new storage. In our increasingly Internet-dependent business and computing environment, network storage is the computer. network attached storage ARCHITECTURE
-
Embedded Security for network-attached storage (CMU-CS-99-154)
1999Co-Authors: Howard Gobioff, David F Nagle, Garth A GibsonAbstract:As storage interconnects evolve from single-host small-scale systems, such as traditional SCSI, to the multi-host Internet-based systems of network-attached Secure Disks (NASD), protecting the integrity of data transfers between client and storage becomes essential. However, it is also computationally expensive and can impose significant performance penalties on storage systems. This paper explores several techniques that can protect the communications integrity of storage requests and data transfers, imposing very little performance penalty and significantly reducing the amount of required cryptography. Central to this work is an alternative cryptographic approach, called “Hash and MAC”, that reduces the cost of protecting the integrity of read traffic in storage devices that are unable to generate a message authentication code at full data transfers rates. Hash and MAC does this by precomputing security information, using and reusing the precomputed information on subsequent read requests. We also present a refined “Hash and MAC” approach that uses incremental hash functions to improve the performance of small read and write operations as well as non-block-aligned operations. Embedded Security for network-attached storage Howard Gobioff1, David Nagle2, Garth Gibson1 June 1999 CMU-CS-99-154 School of Computer Science Carnegie Mellon University Pittsburgh, Pennsylvania 15213-3890 Contact: David Nagle (bassoon@cs.cmu.edu) Office: 412-268-3898 Fax: 412-268-6353 1. School of Computer Science, can be reached via email at {hgobioff,garth}@cs.cmu.edu 2. Department of Electrical and Computer Engineering, can be reached via email at bassoon@cs.cmu.edu This research is sponsored by DARPA/ITO through DARPA Order D306, and issued by Indian Head Division, NSWC under contract N00174-96-0002. Additional support was provided by the member companies of the Parallel Data Consortium, including: Hewlett-Packard Laboratories, Hitachi, IBM, Intel, Quantum, Seagate Technology, Siemens, storage Technology, Wind River Systems, 3Com Corporation, Compaq, Data General/Clariion, and LSI Logic. ACM Computing Reviews
-
ISHPC - Integrity and Performance in network attached storage
Lecture Notes in Computer Science, 1999Co-Authors: Howard Gobioff, David F Nagle, Garth A GibsonAbstract:Computer security is of growing importance in the increasingly networked computing environment. This work examines the issue of high-performance network security, specifically integrity, by focusing on integrating security into network storage system. Emphasizing the cost-constrained environment of storage, we examine how current software-based cryptography cannot support storage's Gigabit/sec transfer rates. To solve this problem, we introduce a novel message authentication code, based on stored message digests. This allows storage to deliver high-performance, a factor of five improvement in our prototype's integrity protected bandwidth, without hardware acceleration for common read operations. For receivers, where precomputation cannot be done, we outline an inline message authentication code that minimizes buffering requirements.
-
embedded security for network attached storage
1999Co-Authors: Howard Gobioff, David F Nagle, Garth A GibsonAbstract:Abstract : As storage interconnects evolve from single host small scale systems, such as traditional SCSI, to the multi-host Internet based systems of network attached Secure Disks (NASD), protecting the integrity of data transfers between client and storage becomes essential. However, it is also computationally expensive and can impose significant performance penalties on storage systems. This paper explores several techniques that can protect the communications integrity of storage requests and data transfers, imposing very little performance penalty and significantly reducing the amount of required cryptography. Central to this work is an alternative cryptographic approach, called Hash and MAC, that reduces the cost of protecting the integrity of read traffic in storage devices that are unable to generate a message authentication code at full data transfers rates. Hash and MAC does this by precomputing security information, using and reusing the precomputed information on subsequent read requests. We also present a refined Hash and MAC approach that uses incremental hash functions to improve the performance of small read and write operations as well as non-block aligned operations.
-
integrity and performance in network attached storage
IEEE International Conference on High Performance Computing Data and Analytics, 1999Co-Authors: Howard Gobioff, David F Nagle, Garth A GibsonAbstract:Computer security is of growing importance in the increasingly networked computing environment. This work examines the issue of high-performance network security, specifically integrity, by focusing on integrating security into network storage system. Emphasizing the cost-constrained environment of storage, we examine how current software-based cryptography cannot support storage's Gigabit/sec transfer rates. To solve this problem, we introduce a novel message authentication code, based on stored message digests. This allows storage to deliver high-performance, a factor of five improvement in our prototype's integrity protected bandwidth, without hardware acceleration for common read operations. For receivers, where precomputation cannot be done, we outline an inline message authentication code that minimizes buffering requirements.
Tzi-cker Chiueh - One of the best experts on this subject based on the ideXlab platform.
-
IEEE Symposium on Mass storage Systems - Implementation of a Fault-Tolerant Real-Time network-attached storage Device.
2020Co-Authors: Ashish Raniwala, Anindya Neogi, Srikant Sharma, Tzi-cker ChiuehAbstract:Phoenix is a fault-tolerant real-time network-attached storage device (NASD). Like other NASD architectures, Phoenix provides an object-based interface to data stored on network-attached disks. In addition, it features many functionalities not available in other NASDs. Phoenix supports both best-effort reads/writes and real-time disk read accesses required to support real-time multimedia applications. A standard cyclebased scan-order disk scheduling algorithm is used to provide guaranteed disk I/O performance. Phoenix ensures data availability through a RAID5-like parity mechanism, and supports service availability by maintaining the same level of quality of service (QoS) in event of single disk failures. Given a spare disk, Phoenix automatically reconstructs the failed disk data onto the spare disk while servicing on-going real-time clients without degradation in service quality. Phoenix speeds up this reconstruction process by dynamically maintaining additional redundancy beyond the RAID5-style parity on the unused space left on the disks. Phoenix attempts to improve the reliability of the disk subsystem by reducing its overall power consumption, using active prefetching techniques in conjunction with disk low-power modes. This paper describes the design and implementation details of the first Phoenix prototype.
-
Hot Interconnects - Stonehenge: a fault-tolerant real-time network-attached storage device
HOT 9 Interconnects. Symposium on High Performance Interconnects, 2001Co-Authors: Tzi-cker ChiuehAbstract:Stonehenge is a real-time network-attached storage device (NASD) that guarantees real-time data delivery to network clients even across single-disk failures. Stonehenge supports both best-effort and real-time disk read/write services, which are accessed through an object-based interface. Data access requests sent to Stonehenge can be serviced in a server push or a client pull mode. Stonehenge's ability to guarantee real-time disk performance results from a cycle-based scan-order disk scheduling mechanism. However, Stonehenge's disk I/O cycle is either completely utilized or completely idle. This on-off disk scheduling model effectively reduces the power consumption of the disk subsystem, without increasing the buffer size requirement. Finally Stonehenge exploits unused disk storage space and maintains additional redundancy dynamically beyond the RAIDS-style parity. This extra redundancy, typically in the form of disk block replication, reduces the time to reconstruct the data on the failed disk. This paper describes the system architecture of Stonehenge and reports preliminary performance measurements collected from an initial Linux-based prototype implementation using Fast Ethernet and UltraSCSI disks.
-
Stonehenge: a fault-tolerant real-time network-attached storage device
HOT 9 Interconnects. Symposium on High Performance Interconnects, 2001Co-Authors: Tzi-cker ChiuehAbstract:Stonehenge is a real-time network-attached storage device (NASD) that guarantees real-time data delivery to network clients even across single-disk failures. Stonehenge supports both best-effort and real-time disk read/write services, which are accessed through an object-based interface. Data access requests sent to Stonehenge can be serviced in a server push or a client pull mode. Stonehenge's ability to guarantee real-time disk performance results from a cycle-based scan-order disk scheduling mechanism. However, Stonehenge's disk I/O cycle is either completely utilized or completely idle. This on-off disk scheduling model effectively reduces the power consumption of the disk subsystem, without increasing the buffer size requirement. Finally Stonehenge exploits unused disk storage space and maintains additional redundancy dynamically beyond the RAIDS-style parity. This extra redundancy, typically in the form of disk block replication, reduces the time to reconstruct the data on the failed disk. This paper describes the system architecture of Stonehenge and reports preliminary performance measurements collected from an initial Linux-based prototype implementation using Fast Ethernet and UltraSCSI disks.
-
ACM Multimedia (1) - Phoenix: a low-power fault-tolerant real-time network-attached storage device
Proceedings of the seventh ACM international conference on Multimedia (Part 1) - MULTIMEDIA '99, 1999Co-Authors: Anindya Neogi, Ashish Raniwala, Tzi-cker ChiuehAbstract:Phoenix is a real-time network-attached storage device (NASD) that guarantees real-time data delivery to network clients even across single disk failure. The service interfaces that Phoenix provides are best-effort/real-time reads/writes based on unique object identifiers and block offsets. Data retrieval from Phoenix can be serviced in server push or client pull modes. Phoenix's real-time disk subsystem performance results from a standard cycle-based scan-order disk scheduling mechanism. However, the disk I/O cycle of Phoenix is either completely active or completely idle. This on-off disk scheduling model effectively reduces the power consumption of the disk subsystem, without increasing the buffer size requirement. Phoenix also exploits unused disk storage space and maintains additional redundancy beyond the generic RAID5-style parity. This extra redundancy, typically in the form of block replication, reduces the time to reconstruct the data on the failed disk. This paper describes the design, implementation, and evaluation of Phoenix, one of the first, if not the first, NASDs that support fault-tolerant, real-time, and low-power network storage service.
J.s. Hansen - One of the best experts on this subject based on the ideXlab platform.
-
Hot Interconnects - Flexible network attached storage using remote DMA
HOT 9 Interconnects. Symposium on High Performance Interconnects, 2001Co-Authors: J.s. HansenAbstract:We propose to make nodes in a cluster double as compute nodes and network attached storage (NAS) nodes. This allows for a flexible and customizable storage system as the NAS control software is handled by regular workstations. The nodes can still be efficient compute nodes if networks with remote DMA capabilities are used, as such networks remove the processor from the data forwarding loop. We demonstrate this through measurements of a prototype implementation.
-
Flexible network attached storage using remote DMA
HOT 9 Interconnects. Symposium on High Performance Interconnects, 2001Co-Authors: J.s. HansenAbstract:We propose to make nodes in a cluster double as compute nodes and network attached storage (NAS) nodes. This allows for a flexible and customizable storage system as the NAS control software is handled by regular workstations. The nodes can still be efficient compute nodes if networks with remote DMA capabilities are used, as such networks remove the processor from the data forwarding loop. We demonstrate this through measurements of a prototype implementation.
Yuhui Deng - One of the best experts on this subject based on the ideXlab platform.
-
Enlarge bandwidth of multimedia server with network attached storage system
Lecture Notes in Computer Science, 2020Co-Authors: Dan Feng, Yuhui Deng, Ke Zhou, Fang WangAbstract:network attached storage system is proposed to solve the bottleneck problem of the multimedia server. It adds a network channel to the RAID and data can be transferred between the Net-RAID and clients directly. The architecture avoids expensive store-and-forward data copying between the multimedia server and storage devices when clients download/upload data from/to the server. The system performance of the proposed architecture is evaluated through a prototype implementation with multiple network disk arrays. In multi-user environment, data transfer rate is measured 2∼3 times higher than that with a traditional disk array, and service time is about 3 times shorter. Experimental results show that the architecture removes the server bottleneck and dynamically increases system bandwidth with the expansion of storage system capacity.
-
OPTIMAL CLUSTERING SIZE OF SMALL FILE ACCESS IN network attached storage DEVICE
Parallel Processing Letters, 2020Co-Authors: Yuhui Deng, Dan Feng, Frank Wang, Na Helian, Ke ZhouAbstract:Email and short message service are pervasive on the Internet now and continue to grow rapidly, which propels the research on small file access in storage systems. The Clustering technology places logical data blocks of multiple small files on physically contiguous disk blocks and accesses them as a single unit, which is normally adopted to improve small file access performance. This paper constructs a mathematical analysis model to discover the optimal clustering size of small file access in network attached storage (NAS). The analysis results indicate that the optimal clustering size for small file access is the product of one cylinder size and disk number in NAS. Experimental results give a useful validation of our analysis. The analysis results can be applied to optimize the NAS oriented system software and the corresponding application software design.
-
deconstructing network attached storage systems
Journal of Network and Computer Applications, 2009Co-Authors: Yuhui DengAbstract:network attached storage (NAS) has been gaining general acceptance, because it can be managed easily and files shared among many clients, which run different operating systems. The advent of Gigabit Ethernet and high speed transport protocols further facilitates the wide adoption of NAS. A distinct feature of NAS is that NAS involves both network I/O and file I/O. This paper analyzes the layered architecture of a typical NAS and the data flow, which travels through the layers. Several benchmarks are employed to explore the overhead involved in the layered NAS architecture and to identify system bottlenecks. The test results indicate that a Gigabit network is the system bottleneck due to the performance disparity between the storage stack and the network stack. The tests also demonstrate that the performance of NAS has lagged far behind that of the local storage subsystem, and the CPU utilization is not as high as imagined. The analysis in this paper gives three implications for the NAS, which adopts a Gigabit network: (1) The most effective method to alleviate the network bottleneck is increasing the physical network bandwidth or improving the utilization of network. For example, a more efficient network file system could boost the NAS performance. (2) It is unnecessary to employ specific hardware to increase the performance of the storage subsystem or the efficiency of the network stack because the hardware cannot contribute to the overall performance improvement. On the contrary, the hardware methods could have side effect on the throughput due to the small file accesses in NAS. (3) Adding more disk drives to an NAS when the aggregate performance reaches the saturation point can only contribute to storage capacity, but not performance. This paper aims to guide NAS designers or administrators to better understand and achieve a cost-effective NAS.
-
Exploring the performance impact of stripe size on network attached storage systems
Journal of Systems Architecture, 2008Co-Authors: Yuhui Deng, Frank Z. WangAbstract:network attached storage (NAS) integrates redundant array of independent disks (RAID) subsystem that consists of multiple disk drives to aggregate storage capacity, I/O performance and reliability based on data striping and distribution. Traditionally, the stripe size is an important parameter that has a great influence on the RAID subsystem performance, whereas the performance impact has been changed due to the development of disk drive technologies and some I/O optimization methods. Based on disk drive access time, this paper constructs a performance analysis model to exploit the impact of some I/O optimization approaches including sub-commands combination, storage interface augment, and I/O scatter/gather on the stripe size of NAS. The analysis results and experimental validation indicate that due to the evolution of hardware and software, the stripe size has a negligible performance impact on NAS when the disk drives involved are organized in a RAID0 pattern.
-
NPC - Enlarge Bandwidth of Multimedia Server with network attached storage System
Lecture Notes in Computer Science, 2004Co-Authors: Dan Feng, Yuhui Deng, Ke Zhou, Fang WangAbstract:network attached storage system is proposed to solve the bottleneck problem of the multimedia server. It adds a network channel to the RAID and data can be transferred between the Net-RAID and clients directly. The architecture avoids expensive store-and-forward data copying between the multimedia server and storage devices when clients download/upload data from/to the server. The system performance of the proposed architecture is evaluated through a prototype implementation with multiple network disk arrays. In multi-user environment, data transfer rate is measured 2 3 times higher than that with a traditional disk array, and service time is about 3 times shorter. Experimental results show that the architecture removes the server bottleneck and dynamically increases system bandwidth with the expansion of storage system capacity.
Yiming Hu - One of the best experts on this subject based on the ideXlab platform.
-
SRDS - SNARE: a strong security scheme for network-attached storage
22nd International Symposium on Reliable Distributed Systems 2003. Proceedings., 2003Co-Authors: Yiming HuAbstract:This paper presents a strong security scheme for network-attached storage (NAS) that is based on capability and uses a key distribution scheme to keep network-attached storage from performing key management. Our system uses strong cryptography to protect data from spoofing, tampering, eavesdropping and replay attacks, and it also guarantees that the data stored on the storage is copy-resistant. In spite of this level of security, our system does not impose much performance penalty. Our experimental results shows that, using a relatively inexpensive CPU in the storage device, there are little performance penalty for random disk accesses and about 9-25% performance degradation for large sequential disk accesses (/spl ges/4 KB).
-
SNARE: a strong security scheme for network-attached storage
22nd International Symposium on Reliable Distributed Systems 2003. Proceedings., 2003Co-Authors: Yiming HuAbstract:This paper presents a strong security scheme for network-attached storage (NAS) that is based on capability and uses a key distribution scheme to keep network-attached storage from performing key management. Our system uses strong cryptography to protect data from spoofing, tampering, eavesdropping and replay attacks, and it also guarantees that the data stored on the storage is copy-resistant. In spite of this level of security, our system does not impose much performance penalty. Our experimental results shows that, using a relatively inexpensive CPU in the storage device, there are little performance penalty for random disk accesses and about 9-25% performance degradation for large sequential disk accesses (/spl ges/4 KB).