[Paper] Efficient In-advance Shared Content Deployment Method Using Popularity Prediction in Hybrid Peer-to-Peer Network with Cloud Storage
In content sharing with Peer-to-Peer (P2P) network systems, content has been smoothly acquired and prevented from being lost by replication of the content and deploying replicas on multiple peers. However, in some conventional methods, it takes a long time for the replicas of content to be spread ov...
Gespeichert in:
Veröffentlicht in: | ITE TRANSACTIONS ON MEDIA TECHNOLOGY AND APPLICATIONS 2022, Vol.10(4), pp.225-233 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 233 |
---|---|
container_issue | 4 |
container_start_page | 225 |
container_title | ITE TRANSACTIONS ON MEDIA TECHNOLOGY AND APPLICATIONS |
container_volume | 10 |
creator | Takahashi, Kazumasa Sugawara, Shinji |
description | In content sharing with Peer-to-Peer (P2P) network systems, content has been smoothly acquired and prevented from being lost by replication of the content and deploying replicas on multiple peers. However, in some conventional methods, it takes a long time for the replicas of content to be spread over the network, which makes stable content sharing difficult. In this paper, we propose a method to predict the change in popularity of each content item over time and to deploy an appropriate number of replicas of popular content evenly on the network before the supply becomes insufficient. The method also keeps the ratio of each content replica's total stored capacity to the whole storage capacity in P2P in proportion to its demand, while considering each replica's size of capacity. Furthermore, we confirm the effectiveness of the proposed method by computer simulations. |
doi_str_mv | 10.3169/mta.10.225 |
format | Article |
fullrecord | <record><control><sourceid>jstage_cross</sourceid><recordid>TN_cdi_crossref_primary_10_3169_mta_10_225</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>article_mta_10_4_10_225_article_char_en</sourcerecordid><originalsourceid>FETCH-LOGICAL-c346t-b7997c13ad7d1db4cf5d4cebd9b7828e3337ed0eb68ba687537b41fd13df5b3c3</originalsourceid><addsrcrecordid>eNpNkM1Kw0AURoMoWGo3PsGshdRMJskkCxcSqy1UDdSuRML83LRT05kymVryDL60CdXi6jvce7hcPs-7xsGY4CS73To27jgM4zNvEOI08SlJovN_fOmNmmYTBAEJwyCJwoH3_V6wHdgPNKkqJRRoh2baZ_KLaQFosWYWJMqNdv3mAXa1abc9PoNbG4mWjdIrVJjdvmZWuRYVna-EU0YjpdG05VZJVABY3xm_T_QC7mDsJzoot0Z5bfYSLZyxbAVX3kXF6gZGvzn0lo-Tt3zqz1-fZvn93BckSpzPaZZRgQmTVGLJI1HFMhLAZcZpGqZACKEgA-BJylmS0phQHuFKYiKrmBNBht7N8a6wpmksVOXOqi2zbYmDsm-y7JrsuWuyk--O8qZx3Y8nlVmnRA1_avTrn-aiq64ETX4Al1l_8Q</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>[Paper] Efficient In-advance Shared Content Deployment Method Using Popularity Prediction in Hybrid Peer-to-Peer Network with Cloud Storage</title><source>J-STAGE (Japan Science & Technology Information Aggregator, Electronic) Freely Available Titles - Japanese</source><source>EZB-FREE-00999 freely available EZB journals</source><creator>Takahashi, Kazumasa ; Sugawara, Shinji</creator><creatorcontrib>Takahashi, Kazumasa ; Sugawara, Shinji</creatorcontrib><description>In content sharing with Peer-to-Peer (P2P) network systems, content has been smoothly acquired and prevented from being lost by replication of the content and deploying replicas on multiple peers. However, in some conventional methods, it takes a long time for the replicas of content to be spread over the network, which makes stable content sharing difficult. In this paper, we propose a method to predict the change in popularity of each content item over time and to deploy an appropriate number of replicas of popular content evenly on the network before the supply becomes insufficient. The method also keeps the ratio of each content replica's total stored capacity to the whole storage capacity in P2P in proportion to its demand, while considering each replica's size of capacity. Furthermore, we confirm the effectiveness of the proposed method by computer simulations.</description><identifier>ISSN: 2186-7364</identifier><identifier>EISSN: 2186-7364</identifier><identifier>DOI: 10.3169/mta.10.225</identifier><language>eng</language><publisher>The Institute of Image Information and Television Engineers</publisher><subject>cloud storage ; content sharing ; in-advance replica deployment ; peer-to-peer network ; popularity prediction</subject><ispartof>ITE Transactions on Media Technology and Applications, 2022, Vol.10(4), pp.225-233</ispartof><rights>2022 The Institute of Image Information and Television Engineers</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c346t-b7997c13ad7d1db4cf5d4cebd9b7828e3337ed0eb68ba687537b41fd13df5b3c3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,1883,4024,27923,27924,27925</link.rule.ids></links><search><creatorcontrib>Takahashi, Kazumasa</creatorcontrib><creatorcontrib>Sugawara, Shinji</creatorcontrib><title>[Paper] Efficient In-advance Shared Content Deployment Method Using Popularity Prediction in Hybrid Peer-to-Peer Network with Cloud Storage</title><title>ITE TRANSACTIONS ON MEDIA TECHNOLOGY AND APPLICATIONS</title><addtitle>MTA</addtitle><description>In content sharing with Peer-to-Peer (P2P) network systems, content has been smoothly acquired and prevented from being lost by replication of the content and deploying replicas on multiple peers. However, in some conventional methods, it takes a long time for the replicas of content to be spread over the network, which makes stable content sharing difficult. In this paper, we propose a method to predict the change in popularity of each content item over time and to deploy an appropriate number of replicas of popular content evenly on the network before the supply becomes insufficient. The method also keeps the ratio of each content replica's total stored capacity to the whole storage capacity in P2P in proportion to its demand, while considering each replica's size of capacity. Furthermore, we confirm the effectiveness of the proposed method by computer simulations.</description><subject>cloud storage</subject><subject>content sharing</subject><subject>in-advance replica deployment</subject><subject>peer-to-peer network</subject><subject>popularity prediction</subject><issn>2186-7364</issn><issn>2186-7364</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><recordid>eNpNkM1Kw0AURoMoWGo3PsGshdRMJskkCxcSqy1UDdSuRML83LRT05kymVryDL60CdXi6jvce7hcPs-7xsGY4CS73To27jgM4zNvEOI08SlJovN_fOmNmmYTBAEJwyCJwoH3_V6wHdgPNKkqJRRoh2baZ_KLaQFosWYWJMqNdv3mAXa1abc9PoNbG4mWjdIrVJjdvmZWuRYVna-EU0YjpdG05VZJVABY3xm_T_QC7mDsJzoot0Z5bfYSLZyxbAVX3kXF6gZGvzn0lo-Tt3zqz1-fZvn93BckSpzPaZZRgQmTVGLJI1HFMhLAZcZpGqZACKEgA-BJylmS0phQHuFKYiKrmBNBht7N8a6wpmksVOXOqi2zbYmDsm-y7JrsuWuyk--O8qZx3Y8nlVmnRA1_avTrn-aiq64ETX4Al1l_8Q</recordid><startdate>2022</startdate><enddate>2022</enddate><creator>Takahashi, Kazumasa</creator><creator>Sugawara, Shinji</creator><general>The Institute of Image Information and Television Engineers</general><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>2022</creationdate><title>[Paper] Efficient In-advance Shared Content Deployment Method Using Popularity Prediction in Hybrid Peer-to-Peer Network with Cloud Storage</title><author>Takahashi, Kazumasa ; Sugawara, Shinji</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c346t-b7997c13ad7d1db4cf5d4cebd9b7828e3337ed0eb68ba687537b41fd13df5b3c3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>cloud storage</topic><topic>content sharing</topic><topic>in-advance replica deployment</topic><topic>peer-to-peer network</topic><topic>popularity prediction</topic><toplevel>online_resources</toplevel><creatorcontrib>Takahashi, Kazumasa</creatorcontrib><creatorcontrib>Sugawara, Shinji</creatorcontrib><collection>CrossRef</collection><jtitle>ITE TRANSACTIONS ON MEDIA TECHNOLOGY AND APPLICATIONS</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Takahashi, Kazumasa</au><au>Sugawara, Shinji</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>[Paper] Efficient In-advance Shared Content Deployment Method Using Popularity Prediction in Hybrid Peer-to-Peer Network with Cloud Storage</atitle><jtitle>ITE TRANSACTIONS ON MEDIA TECHNOLOGY AND APPLICATIONS</jtitle><addtitle>MTA</addtitle><date>2022</date><risdate>2022</risdate><volume>10</volume><issue>4</issue><spage>225</spage><epage>233</epage><pages>225-233</pages><issn>2186-7364</issn><eissn>2186-7364</eissn><abstract>In content sharing with Peer-to-Peer (P2P) network systems, content has been smoothly acquired and prevented from being lost by replication of the content and deploying replicas on multiple peers. However, in some conventional methods, it takes a long time for the replicas of content to be spread over the network, which makes stable content sharing difficult. In this paper, we propose a method to predict the change in popularity of each content item over time and to deploy an appropriate number of replicas of popular content evenly on the network before the supply becomes insufficient. The method also keeps the ratio of each content replica's total stored capacity to the whole storage capacity in P2P in proportion to its demand, while considering each replica's size of capacity. Furthermore, we confirm the effectiveness of the proposed method by computer simulations.</abstract><pub>The Institute of Image Information and Television Engineers</pub><doi>10.3169/mta.10.225</doi><tpages>9</tpages><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | ISSN: 2186-7364 |
ispartof | ITE Transactions on Media Technology and Applications, 2022, Vol.10(4), pp.225-233 |
issn | 2186-7364 2186-7364 |
language | eng |
recordid | cdi_crossref_primary_10_3169_mta_10_225 |
source | J-STAGE (Japan Science & Technology Information Aggregator, Electronic) Freely Available Titles - Japanese; EZB-FREE-00999 freely available EZB journals |
subjects | cloud storage content sharing in-advance replica deployment peer-to-peer network popularity prediction |
title | [Paper] Efficient In-advance Shared Content Deployment Method Using Popularity Prediction in Hybrid Peer-to-Peer Network with Cloud Storage |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-23T17%3A24%3A12IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-jstage_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=%5BPaper%5D%20Efficient%20In-advance%20Shared%20Content%20Deployment%20Method%20Using%20Popularity%20Prediction%20in%20Hybrid%20Peer-to-Peer%20Network%20with%20Cloud%20Storage&rft.jtitle=ITE%20TRANSACTIONS%20ON%20MEDIA%20TECHNOLOGY%20AND%20APPLICATIONS&rft.au=Takahashi,%20Kazumasa&rft.date=2022&rft.volume=10&rft.issue=4&rft.spage=225&rft.epage=233&rft.pages=225-233&rft.issn=2186-7364&rft.eissn=2186-7364&rft_id=info:doi/10.3169/mta.10.225&rft_dat=%3Cjstage_cross%3Earticle_mta_10_4_10_225_article_char_en%3C/jstage_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |