(Enter summary)
Abstract: Designing a storage area network (SAN) fabric requires
devising a set of hubs, switches and links to connect hosts
to their storage devices. The network must be capable
of simultaneously meeting specified data flow requirements
between multiple host-device pairs, and it must
do so cost-effectively, since large-scale SAN fabrics can
cost millions of dollars. Given that the number of data
flows can easily number in the hundreds, simple overprovisioned
manual designs are often not attractive:
... (Update)
Context of citations to this paper: More
.... designing and implementing the storage system, adapting to changes in workloads and device status, designing the storage area network [32], and backing up the data [27] In this paper, we concentrate on the important problem of storage system configuration: designing and...
...allocation framework is based on an economic model that factors in the trade offs between the service quality and the cost. The Appia [32] system automatically generates network fabric designs. It uses significantly simpler performance models, and substantially different...
Cited by: More
Balancing Confidentiality and Efficiency - In Untrusted Relational
(Correct)
Implementation of a Storage Mechanism for Untrusted DBMSs - Ernesto Damiani Universita (2003)
(Correct)
SANFS Maestro: Resource Planning for Enterprise Storage - Area Network San
(Correct)
Similar documents (at the sentence level):
18.1%: Appia and the HP SAN Designer: automatic storage.. - Ward, O'Sullivan, .. (2003)
(Correct)
Active bibliography (related documents): More All
0.5: Generalized Network Design Problems - Feremans, Labbé, Laporte (2002)
(Correct)
0.5: On Network Design Problems: Fixed Cost Flows and the.. - Even, Kortsarz, Slany (2001)
(Correct)
0.5: Modeling and Solving the Airline Schedule Generation.. - Erdmann, Nolte.. (1999)
(Correct)
Similar documents based on text: More All
0.4: Implicit Computation: an Output-Polynomial Algorithm for.. - Shahoumian (1999)
(Correct)
0.3: Selecting RAID levels for disk arrays - Anderson, Swaminathan, Veitch, A. (2002)
(Correct)
0.3: The HP AutoRAID hierarchical storage system - Wilkes, al. (1995)
(Correct)
Related documents from co-citation: More All
2: Selecting RAID levels for disk arrays
- Anderson, Swaminathan et al. - 2002
2: Minerva: an automated resource provisioning tool for large-scale storage systems
- Alvarez, Borowsky et al.
2: Ergastulum: An approach to solving the workload and device configuration problem (context) - Anderson, Kallahalla et al.
BibTeX entry: (Update)
J. Ward, M. O'Sullivan, T. Shahoumian, and J. Wilkes. Appia: Automatic storage area network fabric design. In Conference on File and Storage Technologies (FAST), Monterey, CA, January 2002. http://citeseer.ist.psu.edu/ward02appia.html More
@misc{ ward02appia,
author = "J. Ward and M. O'Sullivan and T. Shahoumian and J. Wilkes",
title = "Appia: Automatic storage area network fabric design",
text = "J. Ward, M. O'Sullivan, T. Shahoumian, and J. Wilkes. Appia: Automatic
storage area network fabric design. In Conference on File and Storage Technologies
(FAST), Monterey, CA, January 2002.",
year = "2002",
url = "citeseer.ist.psu.edu/ward02appia.html" }
Citations (may not include all citations):
4212
Computers and intractability: A guide to the theory of NP-co.. (context) - Garey, Johnson - 1979
33
Minimum cost capacity installation for multicommodity networ..
- Bienstock, Chopra et al. - 1998 ACM
33
Minerva: an automated resource provisioning tool for large-s..
- Alvarez, Borowsky et al. - 2001 DBLP
29
Network design using cut inequalities (context) - Barahona - 1996 ACM
15
Degree-constrained minimum spanning tree (context) - Narula, Ho - 1980
14
Multicommodity capacitated network design
- Gendron, Crainic et al. - 1999
6
On capacitated network design cut-set polyhedra
- Atamturk - 2000
6
Modeling and solving the capacitated network loading problem (context) - Magnanti, Mirchandani et al. - 1995
5
Source sink flows with capacity installation in batches (context) - Chopra, Gilboa et al. - 1998 ACM DBLP
4
The shortest generalized Hamiltonian tree (context) - Deo, Hakimi - 1968
4
Handbooks in Operations Research and Management Science (context) - Ahuja, Magnanti et al. - 1995
4
Handbooks in Operations Research and Management Science (context) - Magnanti, Wolsey et al. - 1995
3
Dynamic degree constrained network design: a genetic algorit.. (context) - Chu, Premkumar et al. - 1999 DBLP
3
A dual ascent approach to the fixed-charge capacitated netwo.. (context) - Herrmann, Ioannou et al. - 1996
2
A system for the design of packet-switched communication net.. (context) - Amiri - 1998
2
The appia topology solver: implementation (context) - Peh - 1998
2
A Lagrangian relaxation technique for optimizing interconnec.. (context) - Fetterolf, Anandalingam - 1992 ACM
2
Benders-and-cut algorithm for fixed-charge capacitated netwo.. (context) - Sridhar, Park - 2000
2
polyhedral structure and computation (context) - Bienstock, Gunluk et al. - 1996
2
A Lagrangean heuristic based branch-and-bound method for the.. (context) - Holmberg - 1996
1
European Journal of Operational Research (context) - of, networks-the et al. - 1992
1
Single source unsplittable flow (context) - Kleinburg - 1996
1
Network design and transportation planning (context) - Magnanti, Wong - 1984
1
Hippodrome: running circels around storage administration (context) - Anderson, Hobbs et al. - 2002
1
A general model for the topological design of computer netwo.. (context) - Gavish - 1986
1
comSANpdf CoreEdgeRev (context) - generation, Brocade et al. - 2001
Documents on the same site (http://www.hpl.hp.com/research/itc/csl/ssp/papers/): More
A comparison of Protection Lookaside Buffers and the PA-RISC.. - Wilkes, Sears (1992)
(Correct)
Hamlyn - an Interface for sender-based communications - Wilkes (1992)
(Correct)
A Trace-Driven Analysis of Disk Working Set Sizes - Ruemmler (1993)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC