A Cost Model for Data Placement and Access Path Selection Problem in FC-SAN
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    Network storage methods (e.g. FC-SAN) with virtual storage technology are becoming a powerful substitution of DAS in digital libraries and other massive storage applications. However the efficiency of FC-SAN virtual storage strongly depends on some attributes of the stored documents. In some cases, FC-SAN may even perform no better than the sharing data on LAN. This paper illustrates this point by a study on the data placement and access path selection issues in a network storage environment. The paper first presents a linear timeconsuming model of data access through the analysis of the virtual storage principle and then gives a decision-making method for data placement and access path selection problem. In the development of this method, the concept of equivalent of virtual storage cost is defined to evaluate the data placement cost in the FC-SAN virtual storage environment. Finally, the theoretical analysis, methods, and assumptions are proved by the experimental results based on a massive storage subsystem in a digital library prototype.

    Reference
    Related
    Cited by
Get Citation

李超,周立柱,邢春晓. FC-SAN中的数据放置和访问路径选择的代价模型.软件学报,2004,15(5):741-751

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:November 15,2002
  • Revised:September 09,2003
  • Adopted:
  • Online:
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063