437 0

Full metadata record

DC FieldValueLanguage
dc.contributor.author한진영-
dc.date.accessioned2019-11-21T06:31:56Z-
dc.date.available2019-11-21T06:31:56Z-
dc.date.issued2019-04-
dc.identifier.citationJOURNAL OF NETWORK AND COMPUTER APPLICATIONS, v. 132, Page. 1-9en_US
dc.identifier.issn1084-8045-
dc.identifier.urihttps://www.sciencedirect.com/science/article/pii/S108480451930044X-
dc.identifier.urihttps://repository.hanyang.ac.kr/handle/20.500.11754/113225-
dc.description.abstractAs the majority of Internet traffic today is attributed to content-centric applications, there has been ever-increasing demand for highly scalable and efficient content delivery. An accurate prediction on future content consumption is essential for such demand. To address such an issue, this paper introduces a new computational approach, Content Network (CN) that can capture the relations among contents, and its potential applications. We conduct a measurement study to investigate how contents are inter-related from the viewpoint of content spreading on one of the popular BitTorrent portals: The Pirate Bay. Based on the large-scale dataset that contains 18 K torrents and 9 M users, we construct the CN and investigate its structural properties. Our key finding is that contents in the same community in the CN (i) belong to the same content category with 94% probability, (ii) are uploaded by the same content publisher with 76% probability, and (iii) have the similar titles with 51% probability, which implies that contents in the same community collectively contain common (shared) interests of users. Our trace-driven study demonstrates that the proposed CN model is useful in (i) content recommendation for increasing sales and (ii) content caching for networking efficiency. We believe our work can provide an important insight for content stakeholders, e.g., content providers for efficient publishing strategies, network engineers for networking efficiency, or content marketers for accurate recommendation.en_US
dc.description.sponsorshipThis research was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education (NRF-2016R1D1A1A09919378, NRF-2018R1D1A1A02085647).en_US
dc.language.isoen_USen_US
dc.publisherACADEMIC PRESS LTD- ELSEVIER SCIENCE LTDen_US
dc.subjectContent sharingen_US
dc.subjectPeer-to-peeren_US
dc.subjectBitTorrenten_US
dc.titlePredicting content consumption from content-to-content relationshipsen_US
dc.typeArticleen_US
dc.relation.volume132-
dc.identifier.doi10.1016/j.jnca.2019.01.030-
dc.relation.page1-9-
dc.relation.journalJOURNAL OF NETWORK AND COMPUTER APPLICATIONS-
dc.contributor.googleauthorHan, Jinyoung-
dc.contributor.googleauthorChoi, Daejin-
dc.contributor.googleauthorChung, Taejoong-
dc.contributor.googleauthorChuah, Chen-Nee-
dc.contributor.googleauthorKim, Hyun-chul-
dc.contributor.googleauthorKwon, Ted Taekyoung-
dc.relation.code2019040194-
dc.sector.campusE-
dc.sector.daehakCOLLEGE OF COMPUTING[E]-
dc.sector.departmentDIVISION OF MEDIA, CULTURE, AND DESIGN TECHNOLOGY-
dc.identifier.pidjinyounghan-
Appears in Collections:
COLLEGE OF COMPUTING[E](소프트웨어융합대학) > MEDIA, CULTURE, AND DESIGN TECHNOLOGY(ICT융합학부) > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE