Probabilistic Caching and Dynamic Delivery Policies for Categorized Contents and Consecutive User Demands
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Choi, M. | - |
dc.contributor.author | Molisch, A.F. | - |
dc.contributor.author | Han, D. | - |
dc.contributor.author | Kim, D. | - |
dc.contributor.author | Kim, J. | - |
dc.contributor.author | Moon, J. | - |
dc.date.accessioned | 2021-12-02T22:41:39Z | - |
dc.date.available | 2021-12-02T22:41:39Z | - |
dc.date.created | 2021-08-31 | - |
dc.date.issued | 2021-04 | - |
dc.identifier.issn | 1536-1276 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/128981 | - |
dc.description.abstract | Wireless caching networks have been extensively researched as a promising technique for supporting the massive data traffic of multimedia services. Many of the existing studies on real-data traffic have shown that users of a multimedia service consecutively request multiple contents and this sequence is strongly dependent on the related list of the first content and/or the top referrer in the category. This paper thus introduces the notion of 'temporary preference', characterizing the behavior of users who are highly likely to request the next content from a certain target category (i.e., related content list). Based on this observation, this paper proposes both probabilistic caching and dynamic delivery policies for categorized contents and consecutive user demands. The proposed caching scheme maximizes the minimum of the cache hit rates for all users. In the delivery phase, a dynamic helper association policy for receiving multiple contents in a row is designed to reduce the delivery latency. By comparing with the content placement optimized for one-shot requests, numerical results verify the effects of categorized contents and consecutive user demands on the proposed caching and delivery policies. © 2002-2012 IEEE. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | Institute of Electrical and Electronics Engineers Inc. | - |
dc.title | Probabilistic Caching and Dynamic Delivery Policies for Categorized Contents and Consecutive User Demands | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Kim, J. | - |
dc.identifier.doi | 10.1109/TWC.2020.3044076 | - |
dc.identifier.scopusid | 2-s2.0-85098748738 | - |
dc.identifier.wosid | 000639747400036 | - |
dc.identifier.bibliographicCitation | IEEE Transactions on Wireless Communications, v.20, no.4, pp.2685 - 2699 | - |
dc.relation.isPartOf | IEEE Transactions on Wireless Communications | - |
dc.citation.title | IEEE Transactions on Wireless Communications | - |
dc.citation.volume | 20 | - |
dc.citation.number | 4 | - |
dc.citation.startPage | 2685 | - |
dc.citation.endPage | 2699 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalResearchArea | Telecommunications | - |
dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
dc.relation.journalWebOfScienceCategory | Telecommunications | - |
dc.subject.keywordPlus | WIRELESS | - |
dc.subject.keywordPlus | ASSOCIATION | - |
dc.subject.keywordAuthor | and user preference | - |
dc.subject.keywordAuthor | consecutive user demands | - |
dc.subject.keywordAuthor | content delivery | - |
dc.subject.keywordAuthor | delay-sensitive communications | - |
dc.subject.keywordAuthor | Wireless caching | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
(02841) 서울특별시 성북구 안암로 14502-3290-1114
COPYRIGHT © 2021 Korea University. All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.