<?xml version='1.0' encoding='UTF-8'?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-03-08T00:29:23Z</responseDate>
  <request identifier="oai:gifu-cwc.repo.nii.ac.jp:00000234" metadataPrefix="oai_dc" verb="GetRecord">https://gifu-cwc.repo.nii.ac.jp/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:gifu-cwc.repo.nii.ac.jp:00000234</identifier>
        <datestamp>2023-05-15T09:57:09Z</datestamp>
        <setSpec>7:20</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns="http://www.w3.org/2001/XMLSchema" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>データ更新回数によるレプリケーションの最適方策</dc:title>
          <dc:title>Optimal policy of a replication scheme considering the number of data update</dc:title>
          <dc:creator>木村, 充位</dc:creator>
          <dc:creator>キムラ, ミツタカ</dc:creator>
          <dc:creator>今泉, 充啓</dc:creator>
          <dc:creator>イマイズミ, ミツヒロ</dc:creator>
          <dc:creator>中川, 覃夫</dc:creator>
          <dc:creator>ナカガワ, トシオ</dc:creator>
          <dc:creator>Kimura, Mitsutaka</dc:creator>
          <dc:creator>Imaizumi, Mitsuhiro</dc:creator>
          <dc:creator>Nakagawa, Toshio</dc:creator>
          <dc:subject>Disaster</dc:subject>
          <dc:subject>Asynchronous Replication</dc:subject>
          <dc:subject>Synchronous Replication</dc:subject>
          <dc:subject>Optimal Policy</dc:subject>
          <dc:description>This paper considers the problem of reliability in a server system with replication considering the number of data update. Our previous paper have formulated a model of a server system with replication that the server transmits the database content to a backup site after the number of times data update in a main site. In this paper, we derive the probability of migrating routine work to the backup site and the probability of the system down. Further, we calculate the cost effectiveness and discuss an optimal replication interval to minimize it. Finally, in asynchronous and in synchronous replications, numerical examples are given to compare the performance of them.</dc:description>
          <dc:description>This paper considers the problem of reliability in a server system with replication considering the number of data update. Our previous paper have formulated a model of a server system with replication that the server transmits the database content to a backup site after the number of times data update in a main site. In this paper, we derive the probability of migrating routine work to the backup site and the probability of the system down. Further, we calculate the cost effectiveness and discuss an optimal replication interval to minimize it. Finally, in asynchronous and in synchronous replications, numerical examples are given to compare the performance of them.</dc:description>
          <dc:description>departmental bulletin paper</dc:description>
          <dc:publisher>岐阜市立女子短期大学</dc:publisher>
          <dc:date>2009</dc:date>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>岐阜市立女子短期大学研究紀要</dc:identifier>
          <dc:identifier>59</dc:identifier>
          <dc:identifier>23</dc:identifier>
          <dc:identifier>30</dc:identifier>
          <dc:identifier>Bulletin of Gifu City Women's College</dc:identifier>
          <dc:identifier>AN10208264</dc:identifier>
          <dc:identifier>09163174</dc:identifier>
          <dc:identifier>https://gifu-cwc.repo.nii.ac.jp/record/234/files/Data_Kimura.pdf</dc:identifier>
          <dc:identifier>https://doi.org/10.24516/00000216</dc:identifier>
          <dc:identifier>https://gifu-cwc.repo.nii.ac.jp/records/234</dc:identifier>
          <dc:language>jpn</dc:language>
          <dc:relation>110007589407</dc:relation>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
