Zodiac: efficient impact analysis for storage area networks
|
Tools and ResourcesShare: |
||||||||||||||||||||||
ABSTRACTCurrently, the fields of impact analysis and policy based management are two important storage management topics that are not being treated in an integrated manner. Policy-based storage management is being adopted by most storage vendors because it lets system administrators specify high level policies and moves the complexity of enforcing these policies to the underlying management software. Similarly, proactive impact analysis is becoming an important aspect of storage management because system administrators want to assess the impact of making a change before actually making it. Impact analysis is increasingly becoming a complex task when one is dealing with a large number of devices and workloads. Adding the policy dimension to impact analysis (that is, what policies are being violated due to a particular action) makes this problem even more complex.
In this paper we describe a new framework and a set of optimization techniques that combine the fields of impact analysis and policy management. In this framework system administrators define policies for performance, interoperability, security, availability, and then proactively assess the impact of desired changes on both the system observables and policies. Additionally, the proposed optimizations help to reduce the amount of data and the number of policies that need to be evaluated. This improves the response time of impact analysis operations. Finally, we also propose a new policy classification scheme that classifies policies based on the algorithms that can be used to optimize their evaluation. Such a classification is useful in order to efficiently evaluate user-defined policies. We present an experimental study that quantitatively analyzes the framework and algorithms on real life storage area network policies. The algorithms presented in this paper can be leveraged by existing impact analysis and policy engine tools.
AUTHORS
|
|
||||||||||||||||||||||||||||||||||||||||
| View colleagues of Aameek Singh | |||||||||||||||||||||||||||||||||||||||||
|
|
||||||||||||||||||||||||||||||||||||||||
| View colleagues of Madhukar Korupolu | |||||||||||||||||||||||||||||||||||||||||
|
|
||||||||||||||||||||||||||||||||||||||||
| View colleagues of Kaladhar Voruganti | |||||||||||||||||||||||||||||||||||||||||
REFERENCESNote: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
|
1
|
{1} AGRAWAL, D., GILES, J., LEE, K., VORUGANTI, K., AND ADIB, K. Policy-Based Validation of SAN Configuration. POLICY'04 .
|
|
| |
2
|
Guillermo A. Alvarez , Elizabeth Borowsky , Susie Go , Theodore H. Romer , Ralph Becker-Szendy , Richard Golding , Arif Merchant , Mirjana Spasojevic , Alistair Veitch , John Wilkes, Minerva: An automated resource provisioning tool for large-scale storage systems, ACM Transactions on Computer Systems (TOCS), v.19 n.4, p.483-518, November 2001 [doi>10.1145/502912.502915]
|
|
3
|
{3} ANDERSON, E. Simple table-based modeling of storage devices. HP Labs Tech Report HPL-SSP-2001-4 (2001).
|
|
|
4
|
||
|
5
|
{5} ANDERSON, E., KALLAHALLA, M., SPENCE, S., SWAMINATHAN, R., AND WANG, Q. Ergastulum: Quickly finding near-optimal Storage System Designs. HP Tech Report HPL-SSP-2001-5 (2001).
|
|
|
6
|
{6} ASSOCIATES, C. BrightStor. http://www.ca.com (2005).
|
|
|
7
|
||
|
8
|
{8} BERENBRINK, P., BRINKMANN, A., AND SCHEIDELER, C. SimLab - A Simulation Environment for Storage Area Networks. In Workshop on Parallel and Distributed Processing (PDP) (2001).
|
|
|
9
|
{9} BUCY, J., GANGER, G., AND CONTRIBUTORS. The DiskSim Simulation Environment. CMU-CS-03-102 (2003).
|
|
|
10
|
{10} CHAUDHURI, S., AND NARASAYYA, V. AutoAdmin 'what-if' Index Analysis Utility. In SIGMOD (1998).
|
|
|
11
|
||
|
12
|
||
|
13
|
{13} DMTF. Common Information Model. http://www.dmtf.org.
|
|
|
14
|
||
|
15
|
{15} EMC. Control Center. http://www.emc.com (2005).
|
|
|
16
|
{16} EMC. SAN Advisor. http://www.emc.com (2005).
|
|
|
17
|
{17} FU, Z., WU, S., HUANG, H., LOH, K., GONG, F., BALDINE, I., AND XU, C. IPSec/VPN Security Policy: Correctness, Conflict Detection, and Resolution. In Workshop on Policies for Distributed Systems and Networks (2001).
|
|
|
18
|
{18} GANGER, G., STRUNK, J., AND KLOSTERMAN, A. Self-<sup>*</sup> Storage: Brick-based Storage with Automated Administration. CMU Tech Report CMU-CS-03-178 (2003).
|
|
|
19
|
{19} HP. StorageWorks SAN.
|
|
|
20
|
{20} IBM. TotalStorage Productivity Center.
|
|
|
21
|
{21} INTELLIMAGIC. Disc Magic. http://www.intellimagic.nl (2005).
|
|
|
22
|
||
|
23
|
||
|
24
|
||
|
25
|
||
|
26
|
{26} ONARO. SANscreen. http://www.onaro.com.
|
|
|
27
|
||
|
28
|
{28} SNIA. Storage Management Initiative. http://www.snia.org.
|
|
|
29
|
{29} THERESKA, E., NARAYANAN, D., AND GANGER, G. Towards self-predicting systems: What if you could ask "what-if"? In Workshop on Self-adaptive and Autonomic Comp. Systems (2005).
|
|
|
30
|
||
| |
31
|
|
|
32
|
||
|
33
|
||
|
34
|
{34} WILKES, J. The Pantheon Storage-System Simulator. HP Labs Tech Report HPL-SSP-95-14 (1995).
|
CITED BY3 Citations
INDEX TERMSThe ACM Computing Classification System (CCS rev.2012)
PUBLICATION| Title | FAST'05 Proceedings of the 4th conference on USENIX Conference on File and Storage Technologies - Volume 4 table of contents |
| Pages | 6-6 |
| Publication Date | 2005-12-13 (yyyy-mm-dd) |
| Sponsors | SIGOPS ACM Special Interest Group on Operating Systems |
| IEEE Mass Storage Systems Technical Committee (MSSTC) | |
| IEEE Technical Committee on Operating Systems (TCOS) | |
| USENIX USENIX Association | |
| Publisher | USENIX Association Berkeley, CA, USA ©2005 |
| Conference | FASTFile and Storage Technologies |
REVIEWS
COMMENTSBe the first to comment To Post a comment please sign in or create a free Web account
Table of Contents| A logic of file systems | |
| Muthian Sivathanu, Andrea C. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau, Somesh Jha | |
| Pages: 1-1 | |
Full text available:
Publisher Site
|
|
|
Years of innovation in file systems have been highly successful in improving their performance and functionality, but at the cost of complicating their interaction with the disk. A variety of techniques exist to ensure consistency and integrity of file ...
expand
|
|
| Providing tunable consistency for a parallel file store | |
| Murali Vilayannur, Partho Nath, Anand Sivasubramaniam | |
| Pages: 2-2 | |
Full text available:
Publisher Site
|
|
|
Consistency, throughput, and scalability form the backbone of a cluster-based parallel file system. With little or no information about the workloads to be supported, a file system designer has to often make a one-glove-fits-all decision regarding the ...
expand
|
|
| Microhash: an efficient index structure for fash-based sensor devices | |
| Demetrios Zeinalipour-Yazti, Song Lin, Vana Kalogeraki, Dimitrios Gunopulos, Walid A. Najjar | |
| Pages: 3-3 | |
Full text available:
Publisher Site
|
|
|
In this paper we propose the MicroHash index, which is an efficient external memory structure for Wireless Sensor Devices (WSDs). The most prevalent storage medium for WSDs is flash memory. Our index structure exploits the asymmetric read/write and wear ...
expand
|
|
| Adaptive data placement for wide-area sensing services | |
| Suman Nath, Phillip B. Gibbons, Srinivasan Seshan | |
| Pages: 4-4 | |
Full text available:
Publisher Site
|
|
|
Wide-area sensing services enable users to query data collected from multitudes of widely distributed sensors. In this paper, we consider the novel distributed database workload characteristics of these services, and present IDP, an online, adaptive ...
expand
|
|
| Ursa minor: versatile cluster-based storage | |
| Michael Abd-El-Malek, William V. Courtright, II, Chuck Cranor, Gregory R. Ganger, James Hendricks, Andrew J. Klosterman, Michael Mesnier, Manish Prasad, Brandon Salmon, Raja R. Sambasivan, Shafeeq Sinnamohideen, John D. Strunk, Eno Thereska, Matthew Wachs, Jay J. Wylie | |
| Pages: 5-5 | |
Full text available:
Publisher Site
|
|
|
No single encoding scheme or fault model is optimal for all data. A versatile storage system allows them to be matched to access patterns, reliability requirements, and cost goals on a per-data item basis. Ursa Minor is a cluster-based storage system ...
expand
|
|
| Zodiac: efficient impact analysis for storage area networks | |
| Aameek Singh, Madhukar Korupolu, Kaladhar Voruganti | |
| Pages: 6-6 | |
Full text available:
Publisher Site
|
|
|
Currently, the fields of impact analysis and policy based management are two important storage management topics that are not being treated in an integrated manner. Policy-based storage management is being adopted by most storage vendors because it lets ...
expand
|
|
| Journal-guided resynchronization for software RAID | |
| Timothy E. Denehy, Andrea C. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau | |
| Pages: 7-7 | |
Full text available:
Publisher Site
|
|
|
We investigate the problem of slow, scan-based, software RAID resynchronization that restores consistency after a system crash. Instead of augmenting the RAID layer to quicken the process, we leverage the functionality present in a journaling file system. ...
expand
|
|
| DULO: an effective buffer cache management scheme to exploit both temporal and spatial locality | |
| Song Jiang, Xiaoning Ding, Feng Chen, Enhua Tan, Xiaodong Zhang | |
| Pages: 8-8 | |
Full text available:
Publisher Site
|
|
|
Sequentiality of requested blocks on disks, or their spatial locality, is critical to the performance of disks, where the throughput of accesses to sequentially placed disk blocks can be an order of magnitude higher than that of accesses to randomly ...
expand
|
|
| Second-tier cache management using write hints | |
| Xuhui Li, Ashraf Aboulnaga, Kenneth Salem, Aamer Sachedina, Shaobo Gao | |
| Pages: 9-9 | |
Full text available:
Publisher Site
|
|
|
Storage servers, as well as storage clients, typically have large memories in which they cache data blocks. This creates a two-tier cache hierarchy in which the presence of a first-tier cache (at the storage client) makes it more difficult to manage ...
expand
|
|
| WOW: wise ordering for writes - combining spatial and temporal locality in non-volatile caches | |
| Binny S. Gill, Dharmendra S. Modha | |
| Pages: 10-10 | |
Full text available:
Publisher Site
|
|
|
Write caches using fast, non-volatile storage are now widely used in modern storage controllers since they enable hiding latency on writes. Effective algorithms for write cache management are extremely important since (i) in RAID-5, due to read-modify-write ...
expand
|
|
| Secure deletion for a versioning file system | |
| Zachary N. J. Peterson, Randal Burns, Joe Herring, Adam Stubblefield, Aviel D. Rubin | |
| Pages: 11-11 | |
Full text available:
Publisher Site
|
|
|
We present algorithms and an architecture for the secure deletion of individual versions of a file. The principal application of this technology is federally compliant storage; it is designed to eliminate data after a mandatory retention period. However, ...
expand
|
|
| TOCTTOU vulnerabilities in UNIX-style file systems: an anatomical study | |
| Jinpeng Wei, Calton Pu | |
| Pages: 12-12 | |
Full text available:
Publisher Site
|
|
|
Due to their non-deterministic nature, Time of Check To Time of Use (TOCTTOU) vulnerabilities in Unix-style file systems (e.g., Linux) are difficult to find and prevent. We describe a comprehensive model of TOCTTOU vulnerabilities, enumerating 224 file ...
expand
|
|
| A security model for full-text file system search in multi-user environments | |
| Stefan Büttcher, Charles L. A. Clarke | |
| Pages: 13-13 | |
Full text available:
Publisher Site
|
|
|
Most desktop search systems maintain per-user indices to keep track of file contents. In a multi-user environment, this is not a viable solution, because the same file has to be indexed many times, once for every user that may access the file, causing ...
expand
|
|
| Matrix methods for lost data reconstruction in erasure codes | |
| James Lee Hafner, Veera Deenadhayalan, K. K. Rao, John A. Tomlin | |
| Pages: 14-14 | |
Full text available:
Publisher Site
|
|
|
Erasures codes, particularly those protecting against multiple failures in RAID disk arrays, provide a code-specific means for reconstruction of lost (erased) data. In the RAID application this is modeled as loss of strips so that reconstruction algorithms ...
expand
|
|
| STAR: an efficient coding scheme for correcting triple storage node failures | |
| Cheng Huang, Lihao Xu | |
| Pages: 15-15 | |
Full text available:
Publisher Site
|
|
|
Proper data placement schemes based on erasure correcting code are one of the most important components for a highly available data storage system. For such schemes, low decoding complexity for correcting (or recovering) storage node failures is essential ...
expand
|
|
| WEAVER codes: highly fault tolerant erasure codes for storage systems | |
| James Lee Hafner | |
| Pages: 16-16 | |
Full text available:
Publisher Site
|
|
|
We present the WEAVER codes, new families of simple highly fault tolerant XOR-based erasure codes for storage systems (with fault tolerance up to 12). The design features of WEAVER codes are (a) placement of data and parity blocks on the same strip, ...
expand
|
|
| On multidimensional data and modern disks | |
| Steven W. Schlosser, Jiri Schindler, Stratos Papadomanolakis, Minglong Shao, Anastassia Ailamaki, Christos Faloutsos, Gregory R. Ganger | |
| Pages: 17-17 | |
Full text available:
Publisher Site
|
|
|
With the deeply-ingrained notion that disks can efficiently access only one dimensional data, current approaches for mapping multidimensional data to disk blocks either allow efficient accesses in only one dimension, trading off the efficiency of accesses ...
expand
|
|
| Database-aware semantically-smart storage | |
| Muthian Sivathanu, Lakshmi N. Bairavasundaram, Andrea C. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau | |
| Pages: 18-18 | |
Full text available:
Publisher Site
|
|
|
Recent research has demonstrated the potential benefits of building storage arrays that understand the file systems above them. Such "semantically-smart" disk systems use knowledge of file system structures and operations to improve performance, availability, ...
expand
|
|
| Managing prefetch memory for data-intensive online servers | |
| Chuanpeng Li, Kai Shen | |
| Pages: 19-19 | |
Full text available:
Publisher Site
|
|
|
Data-intensive online servers may contain a significant amount of prefetched data in memory due to large-granularity I/O prefetching and high execution concurrency. Using a traditional access recency or frequency-based page reclamation policy, memory ...
expand
|
|
| A scalable and high performance software iSCSI implementation | |
| Abhijeet Joglekar, Michael E. Kounavis, Frank L. Berry | |
| Pages: 20-20 | |
Full text available:
Publisher Site
|
|
|
In this paper we present two novel techniques for improving the performance of the Internet Small Computer Systems Interface (iSCSI) protocol, which is the basis for IP-based networked block storage today. We demonstrate that by making a few modifications ...
expand
|
|
| TAPER: tiered approach for eliminating redundancy in replica synchronization | |
| Navendu Jain, Mike Dahlin, Renu Tewari | |
| Pages: 21-21 | |
Full text available:
Publisher Site
|
|
|
We present TAPER, a scalable data replication protocol that synchronizes a large collection of data across multiple geographically distributed replica locations. TAPER can be applied to a broad range of systems, such as software distribution mirrors, ...
expand
|
|
| VXA: a virtual architecture for durable compressed archives | |
| Bryan Ford | |
| Pages: 22-22 | |
Full text available:
Publisher Site
|
|
|
Data compression algorithms change frequently, and obsolete decoders do not always run on new hardware and operating systems, threatening the long-term usability of content archived using those algorithms. Re-encoding content into new formats is cumbersome, ...
expand
|
|
| I/O system performance debugging using model-driven anomaly characterization | |
| Kai Shen, Ming Zhong, Chuanpeng Li | |
| Pages: 23-23 | |
Full text available:
Publisher Site
|
|
|
It is challenging to identify performance problems and pinpoint their root causes in complex systems, especially when the system supports wide ranges of workloads and when performance problems only materialize under particular workload conditions. This ...
expand
|
|
| TBBT: scalable and accurate trace replay for file server evaluation | |
| Ningning Zhu, Jiawu Chen, Tzi-Cker Chiueh | |
| Pages: 24-24 | |
Full text available:
Publisher Site
|
|
|
This paper describes the design, implementation, and evaluation of TBBT, the first comprehensive NFS trace replay tool. Given an NFS trace, TBBT automatically detects and repairs missing operations in the trace, derives a file system image required to ...
expand
|
|
| Accurate and efficient replaying of file system traces | |
| Nikolai Joukov, Timothy Wong, Erez Zadok | |
| Pages: 25-25 | |
Full text available:
Publisher Site
|
|
|
Replaying traces is a time-honored method for benchmarking, stress-testing, and debugging systems--and more recently--forensic analysis. One benefit to replaying traces is the reproducibility of the exact set of operations that were captured during a ...
expand
|