WEKO3
アイテム
{"_buckets": {"deposit": "46ca5f72-7ecf-4ba0-911c-a6737c40d1ca"}, "_deposit": {"created_by": 13, "id": "8834", "owners": [13], "pid": {"revision_id": 0, "type": "depid", "value": "8834"}, "status": "published"}, "_oai": {"id": "oai:uec.repo.nii.ac.jp:00008834", "sets": ["2"]}, "author_link": ["23964", "23965", "23966"], "control_number": "8834", "item_10003_biblio_info_30": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2018-11", "bibliographicIssueDateType": "Issued"}, "bibliographic_titles": [{"bibliographic_title": "Proceedings of the Sixth International Symposium on Computing and Networking", "bibliographic_titleLang": "en"}]}]}, "item_10003_description_28": {"attribute_name": "抄録", "attribute_value_mlt": [{"subitem_description": "We propose Templatized Elastic Assignment (TEA), a light-weight scheme for mobile cooperative caching networks. It consists of two components, (1) one to calculate a sub-optimal distribution of each situation and (2) finegrained ID management by base stations (BSs) to achieve the calculated distribution. The former is modeled from findings that the desirable distribution plotted in a semilog graph forms a downward straight line with which the slope and Yintercept epend on the bias of request and total cache capacity, respectively. The latter is inspired from the identifier (ID)-based scheme, which ties devices and content by a randomly associated ID. TEA achieved the calculated distribution with IDs by using the annotation from base stations (BSs), which is preliminarily calculated by the template in a fine-grained density of devices. Moreover, such fine-grained management secondarily standardizes the cached content among multiple densities and enables the reuse of the content in devices from other BSs. Evaluation results indicate that our scheme reduces (1) 8.3 times more traffic than LFU and achieves almost the same amount of traffic reduction as with the genetic algorithm, (2) 45 hours of computation into a few seconds, and (3) at most 70% of content replacement across multiple BSs.", "subitem_description_type": "Abstract"}]}, "item_10003_publisher_31": {"attribute_name": "出版者", "attribute_value_mlt": [{"subitem_publisher": "IEEE"}]}, "item_10003_version_type_43": {"attribute_name": "著者版フラグ", "attribute_value_mlt": [{"subitem_version_resource": "http://purl.org/coar/version/c_ab4af688f83e57aa", "subitem_version_type": "AM"}]}, "item_creator": {"attribute_name": "著者", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "Shiroma, Takayuki", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "23964", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Wu, Celumuge", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "23965", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Yoshinaga, Tsutomu", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "23966", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2019-01-04"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "shiroma-candar18-2019-01-04.pdf", "filesize": [{"value": "238.5 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 238500.0, "url": {"label": "shiroma-candar18-2019-01-04", "url": "https://uec.repo.nii.ac.jp/record/8834/files/shiroma-candar18-2019-01-04.pdf"}, "version_id": "605c010f-8f00-4b31-a09b-b53240bebf66"}]}, "item_keyword": {"attribute_name": "キーワード", "attribute_value_mlt": [{"subitem_subject": "D2D", "subitem_subject_scheme": "Other"}, {"subitem_subject": "mobile cooperative caching", "subitem_subject_scheme": "Other"}, {"subitem_subject": "lightweight computation", "subitem_subject_scheme": "Other"}, {"subitem_subject": "traffic reduction", "subitem_subject_scheme": "Other"}]}, "item_language": {"attribute_name": "言語", "attribute_value_mlt": [{"subitem_language": "eng"}]}, "item_resource_type": {"attribute_name": "資源タイプ", "attribute_value_mlt": [{"resourcetype": "conference paper", "resourceuri": "http://purl.org/coar/resource_type/c_5794"}]}, "item_title": "A template-based sub-optimal content distribution for D2D content sharing networks", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "A template-based sub-optimal content distribution for D2D content sharing networks", "subitem_title_language": "en"}]}, "item_type_id": "10003", "owner": "13", "path": ["2"], "permalink_uri": "https://uec.repo.nii.ac.jp/records/8834", "pubdate": {"attribute_name": "PubDate", "attribute_value": "2018-12-19"}, "publish_date": "2018-12-19", "publish_status": "0", "recid": "8834", "relation": {}, "relation_version_is_last": true, "title": ["A template-based sub-optimal content distribution for D2D content sharing networks"], "weko_shared_id": -1}
A template-based sub-optimal content distribution for D2D content sharing networks
https://uec.repo.nii.ac.jp/records/8834
https://uec.repo.nii.ac.jp/records/883446fb4ac9-b7d1-4bb6-8421-370c16addfe4
名前 / ファイル | ライセンス | アクション |
---|---|---|
shiroma-candar18-2019-01-04 (238.5 kB)
|
|
Item type | 会議発表論文 / Conference Paper(1) | |||||
---|---|---|---|---|---|---|
公開日 | 2018-12-19 | |||||
タイトル | ||||||
言語 | en | |||||
タイトル | A template-based sub-optimal content distribution for D2D content sharing networks | |||||
言語 | ||||||
言語 | eng | |||||
キーワード | ||||||
主題 | D2D | |||||
キーワード | ||||||
主題 | mobile cooperative caching | |||||
キーワード | ||||||
主題 | lightweight computation | |||||
キーワード | ||||||
主題 | traffic reduction | |||||
資源タイプ | ||||||
資源タイプ識別子 | http://purl.org/coar/resource_type/c_5794 | |||||
資源タイプ | conference paper | |||||
著者 |
Shiroma, Takayuki
× Shiroma, Takayuki× Wu, Celumuge× Yoshinaga, Tsutomu |
|||||
抄録 | ||||||
内容記述タイプ | Abstract | |||||
内容記述 | We propose Templatized Elastic Assignment (TEA), a light-weight scheme for mobile cooperative caching networks. It consists of two components, (1) one to calculate a sub-optimal distribution of each situation and (2) finegrained ID management by base stations (BSs) to achieve the calculated distribution. The former is modeled from findings that the desirable distribution plotted in a semilog graph forms a downward straight line with which the slope and Yintercept epend on the bias of request and total cache capacity, respectively. The latter is inspired from the identifier (ID)-based scheme, which ties devices and content by a randomly associated ID. TEA achieved the calculated distribution with IDs by using the annotation from base stations (BSs), which is preliminarily calculated by the template in a fine-grained density of devices. Moreover, such fine-grained management secondarily standardizes the cached content among multiple densities and enables the reuse of the content in devices from other BSs. Evaluation results indicate that our scheme reduces (1) 8.3 times more traffic than LFU and achieves almost the same amount of traffic reduction as with the genetic algorithm, (2) 45 hours of computation into a few seconds, and (3) at most 70% of content replacement across multiple BSs. | |||||
書誌情報 |
en : Proceedings of the Sixth International Symposium on Computing and Networking 発行日 2018-11 |
|||||
出版者 | ||||||
出版者 | IEEE | |||||
著者版フラグ | ||||||
出版タイプ | AM | |||||
出版タイプResource | http://purl.org/coar/version/c_ab4af688f83e57aa |