{"created":"2025-01-19T01:17:00.716827+00:00","updated":"2025-01-19T15:49:23.276085+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00216371","sets":["581:10784:10786"]},"path":["10786"],"owner":"44499","recid":"216371","title":["NDNにおけるキャッシュの冗長性排除を目的とした人気コンテンツ集約"],"pubdate":{"attribute_name":"公開日","attribute_value":"2022-02-15"},"_buckets":{"deposit":"b772753b-b49f-4397-b10f-5b024a5dd393"},"_deposit":{"id":"216371","pid":{"type":"depid","value":"216371","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"NDNにおけるキャッシュの冗長性排除を目的とした人気コンテンツ集約","author_link":["558583","558581","558582","558580"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"NDNにおけるキャッシュの冗長性排除を目的とした人気コンテンツ集約"},{"subitem_title":"A New Method for Estimating Popular Content Category to Reducing Cache Redundancy on NDN","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"[特集:ネットワークサービスと分散処理(特選論文)] NDN,人気コンテンツ推定,コンテンツ集約","subitem_subject_scheme":"Other"}]},"item_type_id":"2","publish_date":"2022-02-15","item_2_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"県立広島大学大学院総合学術研究科"},{"subitem_text_value":"県立広島大学経営情報学科"}]},"item_2_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Comprehensive Scientific Research, Prefectural University of Hiroshima","subitem_text_language":"en"},{"subitem_text_value":"Department of Management Information Systems, Prefectural University of Hiroshima","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/216371/files/IPSJ-JNL6302033.pdf","label":"IPSJ-JNL6302033.pdf"},"date":[{"dateType":"Available","dateValue":"2024-02-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-JNL6302033.pdf","filesize":[{"value":"1.4 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"8"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"21841e82-8d5b-4f1c-874c-124f9c755aa9","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2022 by the Information Processing Society of Japan"}]},"item_2_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"中田, 有哉"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"重安, 哲也"}],"nameIdentifiers":[{}]}]},"item_2_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Yuya, Nakata","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Tetsuya, Shigeyasu","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_2_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00116647","subitem_source_identifier_type":"NCID"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_6501","resourcetype":"journal article"}]},"item_2_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7764","subitem_source_identifier_type":"ISSN"}]},"item_2_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"NDNはユーザからの要求に応じてCRに蓄積したキャッシュを再利用することでトラフィックを削減する.しかし,CRの有限バッファに同一コンテンツを複数箇所で蓄積するとキャッシュ利用効率が低下するため,重複の少ないキャッシュが必要となる.そのため,我々はコンテンツ種別ごとの要求間隔をもとに人気度の高いコンテンツのカテゴリを推定し,より多くのユーザからのコンテンツ取得要求を処理できるCRにそれらのコンテンツを集約する手法を提案する.また,提案手法によりキャッシュヒット率が向上することをシミュレーション評価によって明らかにする.","subitem_description_type":"Other"}]},"item_2_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"NDN reduces the content delivery traffic by using cached contents on CRs. For this purpose, it is needed to make small cache overlapping for avoiding cache underutilization. In this paper, we propose a new method for effectively content gathering on the CRs those can deal with many users' content request. In our proposal, popular content category is estimated according to the content request intervals. By the results of computer simulations, we clarify the effectiveness of our proposal in terms of cache hit ratio.","subitem_description_type":"Other"}]},"item_2_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"558","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌"}],"bibliographicPageStart":"549","bibliographicIssueDates":{"bibliographicIssueDate":"2022-02-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"2","bibliographicVolumeNumber":"63"}]},"relation_version_is_last":true,"item_2_identifier_registration":{"attribute_name":"ID登録","attribute_value_mlt":[{"subitem_identifier_reg_text":"10.20729/00216263","subitem_identifier_reg_type":"JaLC"}]},"weko_creator_id":"44499"},"id":216371,"links":{}}