<?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:54:33Z</responseDate>
  <request identifier="oai:gifu-cwc.repo.nii.ac.jp:00000234" metadataPrefix="jpcoar_2.0" 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>
        <jpcoar:jpcoar xmlns:datacite="https://schema.datacite.org/meta/kernel-4/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcndl="http://ndl.go.jp/dcndl/terms/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:jpcoar="https://github.com/JPCOAR/schema/blob/master/2.0/" xmlns:oaire="http://namespace.openaire.eu/schema/oaire/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:rioxxterms="http://www.rioxx.net/schema/v2.0/rioxxterms/" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns="https://github.com/JPCOAR/schema/blob/master/2.0/" xsi:schemaLocation="https://github.com/JPCOAR/schema/blob/master/2.0/jpcoar_scm.xsd">
          <dc:title>データ更新回数によるレプリケーションの最適方策</dc:title>
          <dc:title xml:lang="en">Optimal policy of a replication scheme considering the number of data update</dc:title>
          <jpcoar:creator>
            <jpcoar:creatorName>木村, 充位</jpcoar:creatorName>
            <jpcoar:creatorName xml:lang="ja-Kana">キムラ, ミツタカ</jpcoar:creatorName>
          </jpcoar:creator>
          <jpcoar:creator>
            <jpcoar:creatorName>今泉, 充啓</jpcoar:creatorName>
            <jpcoar:creatorName xml:lang="ja-Kana">イマイズミ, ミツヒロ</jpcoar:creatorName>
          </jpcoar:creator>
          <jpcoar:creator>
            <jpcoar:creatorName>中川, 覃夫</jpcoar:creatorName>
            <jpcoar:creatorName xml:lang="ja-Kana">ナカガワ, トシオ</jpcoar:creatorName>
          </jpcoar:creator>
          <jpcoar:creator>
            <jpcoar:creatorName xml:lang="en">Kimura, Mitsutaka</jpcoar:creatorName>
          </jpcoar:creator>
          <jpcoar:creator>
            <jpcoar:creatorName xml:lang="en">Imaizumi, Mitsuhiro</jpcoar:creatorName>
          </jpcoar:creator>
          <jpcoar:creator>
            <jpcoar:creatorName xml:lang="en">Nakagawa, Toshio</jpcoar:creatorName>
          </jpcoar:creator>
          <jpcoar:subject xml:lang="en" subjectScheme="Other">Disaster</jpcoar:subject>
          <jpcoar:subject xml:lang="en" subjectScheme="Other">Asynchronous Replication</jpcoar:subject>
          <jpcoar:subject xml:lang="en" subjectScheme="Other">Synchronous Replication</jpcoar:subject>
          <jpcoar:subject xml:lang="en" subjectScheme="Other">Optimal Policy</jpcoar:subject>
          <datacite:description descriptionType="Abstract">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.</datacite:description>
          <datacite:description descriptionType="Other">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.</datacite:description>
          <dc:publisher>岐阜市立女子短期大学</dc:publisher>
          <datacite:date dateType="Issued">2009</datacite:date>
          <dc:language>jpn</dc:language>
          <dc:type rdf:resource="http://purl.org/coar/resource_type/c_6501">departmental bulletin paper</dc:type>
          <jpcoar:identifier identifierType="DOI">https://doi.org/10.24516/00000216</jpcoar:identifier>
          <jpcoar:identifier identifierType="URI">https://gifu-cwc.repo.nii.ac.jp/records/234</jpcoar:identifier>
          <jpcoar:identifierRegistration identifierType="JaLC">10.24516/00000216</jpcoar:identifierRegistration>
          <jpcoar:relation>
            <jpcoar:relatedIdentifier identifierType="NAID">110007589407</jpcoar:relatedIdentifier>
          </jpcoar:relation>
          <jpcoar:sourceIdentifier identifierType="NCID">AN10208264</jpcoar:sourceIdentifier>
          <jpcoar:sourceIdentifier identifierType="ISSN">09163174</jpcoar:sourceIdentifier>
          <jpcoar:sourceTitle>岐阜市立女子短期大学研究紀要</jpcoar:sourceTitle>
          <jpcoar:sourceTitle xml:lang="en">Bulletin of Gifu City Women's College</jpcoar:sourceTitle>
          <jpcoar:volume>59</jpcoar:volume>
          <jpcoar:pageStart>23</jpcoar:pageStart>
          <jpcoar:pageEnd>30</jpcoar:pageEnd>
          <jpcoar:file>
            <jpcoar:URI label="Data_Kimura">https://gifu-cwc.repo.nii.ac.jp/record/234/files/Data_Kimura.pdf</jpcoar:URI>
            <jpcoar:mimeType>application/pdf</jpcoar:mimeType>
            <jpcoar:extent>394.4 kB</jpcoar:extent>
            <datacite:date dateType="Available">2020-06-30</datacite:date>
          </jpcoar:file>
        </jpcoar:jpcoar>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
