A novel dynamic network data replication scheme based on historical access record and proactive deletion.
Saved in:
| Title: | A novel dynamic network data replication scheme based on historical access record and proactive deletion. |
|---|---|
| Authors: | Wang, Zhe1 wangz84626@gmail.com, Li, Tao1 litao@scu.edu.cn, Xiong, Naixue2 nxiong@cs.gsu.edu, Pan, Yi2 pan@cs.gsu.edu |
| Source: | Journal of Supercomputing. Oct2012, Vol. 62 Issue 1, p227-250. 24p. |
| Subjects: | Data replication, Backup processing alternatives in electronic data processing, Back up systems, Digitization of archival materials, High performance computing, Algorithms |
| Abstract: | Data replication is becoming a popular technology in many fields such as cloud storage, Data grids and P2P systems. By replicating files to other servers/nodes, we can reduce network traffic and file access time and increase data availability to react natural and man-made disasters. However, it does not mean that more replicas can always have a better system performance. Replicas indeed decrease read access time and provide better fault-tolerance, but if we consider write access, maintaining a large number of replications will result in a huge update overhead. Hence, a trade-off between read access time and write updating cost is needed. File popularity is an important factor in making decisions about data replication. To avoid data access fluctuations, historical file popularity can be used for selecting really popular files. In this research, a dynamic data replication strategy is proposed based on two ideas. The first one employs historical access records which are useful for picking up a file to replicate. The second one is a proactive deletion method, which is applied to control the replica number to reach an optimal balance between the read access time and the write update overhead. A unified cost model is used as a means to measure and compare the performance of our data replication algorithm and other existing algorithms. The results indicate that our new algorithm performs much better than those algorithms. [ABSTRACT FROM AUTHOR] |
| Copyright of Journal of Supercomputing is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
| FullText | Links: – Type: pdflink Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 79371671 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: A novel dynamic network data replication scheme based on historical access record and proactive deletion. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Wang%2C+Zhe%22">Wang, Zhe</searchLink><relatesTo>1</relatesTo><i> wangz84626@gmail.com</i><br /><searchLink fieldCode="AR" term="%22Li%2C+Tao%22">Li, Tao</searchLink><relatesTo>1</relatesTo><i> litao@scu.edu.cn</i><br /><searchLink fieldCode="AR" term="%22Xiong%2C+Naixue%22">Xiong, Naixue</searchLink><relatesTo>2</relatesTo><i> nxiong@cs.gsu.edu</i><br /><searchLink fieldCode="AR" term="%22Pan%2C+Yi%22">Pan, Yi</searchLink><relatesTo>2</relatesTo><i> pan@cs.gsu.edu</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Journal+of+Supercomputing%22">Journal of Supercomputing</searchLink>. Oct2012, Vol. 62 Issue 1, p227-250. 24p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Data+replication%22">Data replication</searchLink><br /><searchLink fieldCode="DE" term="%22Backup+processing+alternatives+in+electronic+data+processing%22">Backup processing alternatives in electronic data processing</searchLink><br /><searchLink fieldCode="DE" term="%22Back+up+systems%22">Back up systems</searchLink><br /><searchLink fieldCode="DE" term="%22Digitization+of+archival+materials%22">Digitization of archival materials</searchLink><br /><searchLink fieldCode="DE" term="%22High+performance+computing%22">High performance computing</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: Data replication is becoming a popular technology in many fields such as cloud storage, Data grids and P2P systems. By replicating files to other servers/nodes, we can reduce network traffic and file access time and increase data availability to react natural and man-made disasters. However, it does not mean that more replicas can always have a better system performance. Replicas indeed decrease read access time and provide better fault-tolerance, but if we consider write access, maintaining a large number of replications will result in a huge update overhead. Hence, a trade-off between read access time and write updating cost is needed. File popularity is an important factor in making decisions about data replication. To avoid data access fluctuations, historical file popularity can be used for selecting really popular files. In this research, a dynamic data replication strategy is proposed based on two ideas. The first one employs historical access records which are useful for picking up a file to replicate. The second one is a proactive deletion method, which is applied to control the replica number to reach an optimal balance between the read access time and the write update overhead. A unified cost model is used as a means to measure and compare the performance of our data replication algorithm and other existing algorithms. The results indicate that our new algorithm performs much better than those algorithms. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of Journal of Supercomputing is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=79371671 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1007/s11227-011-0708-z Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 24 StartPage: 227 Subjects: – SubjectFull: Data replication Type: general – SubjectFull: Backup processing alternatives in electronic data processing Type: general – SubjectFull: Back up systems Type: general – SubjectFull: Digitization of archival materials Type: general – SubjectFull: High performance computing Type: general – SubjectFull: Algorithms Type: general Titles: – TitleFull: A novel dynamic network data replication scheme based on historical access record and proactive deletion. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Wang, Zhe – PersonEntity: Name: NameFull: Li, Tao – PersonEntity: Name: NameFull: Xiong, Naixue – PersonEntity: Name: NameFull: Pan, Yi IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 10 Text: Oct2012 Type: published Y: 2012 Identifiers: – Type: issn-print Value: 09208542 Numbering: – Type: volume Value: 62 – Type: issue Value: 1 Titles: – TitleFull: Journal of Supercomputing Type: main |
| ResultId | 1 |
