Proactive Cache Placement on Cooperative Client Caches for Online Social Networks.
Saved in:
| Title: | Proactive Cache Placement on Cooperative Client Caches for Online Social Networks. |
|---|---|
| Authors: | Nikolaou, Stavros1, Van Renesse, Robbert1, Schiper, Nicolas1 |
| Source: | IEEE Transactions on Parallel & Distributed Systems. Apr2016, Vol. 27 Issue 4, p1174-1186. 13p. |
| Subjects: | Cache memory, Information storage & retrieval systems, Social network research, Online social networks research, Data warehousing |
| Abstract: | This paper investigates cache placement on a cooperative cache built from individual client caches in an online social network or web service. We use a service that maintains a mapping between content and the clients that cache it, and propose cache placement schemes that leverage relationships between clients (for example, social links) and workload statistics, proactively placing content on clients that are likely to access it. We evaluate efficacy through simulation, comparing our schemes against commonly used cache placement algorithms as well as optimal placement. We synthesize a workload to match characteristics of online social networks. Simulation results of our proposed caching schemes impose moderate network overhead and show considerable improvement to the client's cache hit ratio, even under churn. [ABSTRACT FROM PUBLISHER] |
| Copyright of IEEE Transactions on Parallel & Distributed Systems is the property of IEEE 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 | Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 113814296 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Proactive Cache Placement on Cooperative Client Caches for Online Social Networks. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Nikolaou%2C+Stavros%22">Nikolaou, Stavros</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Van+Renesse%2C+Robbert%22">Van Renesse, Robbert</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Schiper%2C+Nicolas%22">Schiper, Nicolas</searchLink><relatesTo>1</relatesTo> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22IEEE+Transactions+on+Parallel+%26+Distributed+Systems%22">IEEE Transactions on Parallel & Distributed Systems</searchLink>. Apr2016, Vol. 27 Issue 4, p1174-1186. 13p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Cache+memory%22">Cache memory</searchLink><br /><searchLink fieldCode="DE" term="%22Information+storage+%26+retrieval+systems%22">Information storage & retrieval systems</searchLink><br /><searchLink fieldCode="DE" term="%22Social+network+research%22">Social network research</searchLink><br /><searchLink fieldCode="DE" term="%22Online+social+networks+research%22">Online social networks research</searchLink><br /><searchLink fieldCode="DE" term="%22Data+warehousing%22">Data warehousing</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: This paper investigates cache placement on a cooperative cache built from individual client caches in an online social network or web service. We use a service that maintains a mapping between content and the clients that cache it, and propose cache placement schemes that leverage relationships between clients (for example, social links) and workload statistics, proactively placing content on clients that are likely to access it. We evaluate efficacy through simulation, comparing our schemes against commonly used cache placement algorithms as well as optimal placement. We synthesize a workload to match characteristics of online social networks. Simulation results of our proposed caching schemes impose moderate network overhead and show considerable improvement to the client's cache hit ratio, even under churn. [ABSTRACT FROM PUBLISHER] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of IEEE Transactions on Parallel & Distributed Systems is the property of IEEE 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=113814296 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1109/TPDS.2015.2425398 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 13 StartPage: 1174 Subjects: – SubjectFull: Cache memory Type: general – SubjectFull: Information storage & retrieval systems Type: general – SubjectFull: Social network research Type: general – SubjectFull: Online social networks research Type: general – SubjectFull: Data warehousing Type: general Titles: – TitleFull: Proactive Cache Placement on Cooperative Client Caches for Online Social Networks. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Nikolaou, Stavros – PersonEntity: Name: NameFull: Van Renesse, Robbert – PersonEntity: Name: NameFull: Schiper, Nicolas IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 04 Text: Apr2016 Type: published Y: 2016 Identifiers: – Type: issn-print Value: 10459219 Numbering: – Type: volume Value: 27 – Type: issue Value: 4 Titles: – TitleFull: IEEE Transactions on Parallel & Distributed Systems Type: main |
| ResultId | 1 |
