WEKO3
アイテム
{"_buckets": {"deposit": "30af0f8a-c37f-42a6-ae2e-8499680c65b3"}, "_deposit": {"id": "42574", "owners": [], "pid": {"revision_id": 0, "type": "depid", "value": "42574"}, "status": "published"}, "_oai": {"id": "oai:tsukuba.repo.nii.ac.jp:00042574", "sets": ["154", "6081"]}, "item_5_biblio_info_6": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2016-08", "bibliographicIssueDateType": "Issued"}, "bibliographicIssueNumber": "8", "bibliographicPageStart": "e3", "bibliographicVolumeNumber": "16", "bibliographic_titles": [{"bibliographic_title": "EAI Endorsed Transactions on Scalable Information Systems"}]}]}, "item_5_creator_3": {"attribute_name": "著者別名", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "張, 勇兵"}], "nameIdentifiers": [{"nameIdentifier": "170702", "nameIdentifierScheme": "WEKO"}, {"nameIdentifier": "80242353", "nameIdentifierScheme": "e-Rad", "nameIdentifierURI": "https://nrid.nii.ac.jp/ja/nrid/1000080242353"}, {"nameIdentifier": "0000000822", "nameIdentifierScheme": "筑波大学研究者総覧", "nameIdentifierURI": "http://trios.tsukuba.ac.jp/researcher/0000000822"}]}]}, "item_5_description_4": {"attribute_name": "抄録", "attribute_value_mlt": [{"subitem_description": "Thanks to the advance of cloud computing technologies, users can access the data stored at cloud data centers at any time and from any where. However, the data centers are usually sparsely distributed over the Internet and are far away from end users. In this paper, we consider to construct a cache network by a large number of cache nodes close to the end users in order to minimize the data access delay.We firstly formulate the problem of placing the replicas of data items to cache nodes as a mixed integer programming (MIP) problem. Then, we proposed an efficient heuristic algorithm that allocates at least one replica of each data item in the cache network and attempt to allocate more data items so as to minimize the total data access cost. The simulation results show that our proposed algorithm behaves much better than a well-known LRU algorithm and the computation complexity is limited.", "subitem_description_type": "Abstract"}]}, "item_5_publisher_27": {"attribute_name": "出版者", "attribute_value_mlt": [{"subitem_publisher": "EAI"}]}, "item_5_relation_11": {"attribute_name": "DOI", "attribute_value_mlt": [{"subitem_relation_type_id": {"subitem_relation_type_id_text": "10.4108/eai.9-8-2016.151632", "subitem_relation_type_select": "DOI"}}]}, "item_5_rights_12": {"attribute_name": "権利", "attribute_value_mlt": [{"subitem_rights": "© 2016 Mingcong Yang et al., licensed to EAI. This is an open access article distributed under the terms of the Creative Commons Attribution license (http://creativecommons.org/licenses/by/3.0/), which permits unlimited use, distribution and reproduction in any medium so long as the original work is properly cited."}]}, "item_5_select_15": {"attribute_name": "著者版フラグ", "attribute_value_mlt": [{"subitem_select_item": "publisher"}]}, "item_5_source_id_7": {"attribute_name": "ISSN", "attribute_value_mlt": [{"subitem_source_identifier": "2032-9407", "subitem_source_identifier_type": "ISSN"}]}, "item_5_subject_20": {"attribute_name": "NIIサブジェクト", "attribute_value_mlt": [{"subitem_subject": "情報学", "subitem_subject_scheme": "Other"}]}, "item_creator": {"attribute_name": "著者", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "Yang, Mingcong"}], "nameIdentifiers": [{"nameIdentifier": "168800", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Guo, Kai"}], "nameIdentifiers": [{"nameIdentifier": "168801", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Zhang, Yongbing"}], "nameIdentifiers": [{"nameIdentifier": "168802", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2017-09-11"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "EAI-ETSIS_16-8.pdf", "filesize": [{"value": "402.0 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_6", "mimetype": "application/pdf", "size": 402000.0, "url": {"label": "EAI-ETSIS_16-8", "url": "https://tsukuba.repo.nii.ac.jp/record/42574/files/EAI-ETSIS_16-8.pdf"}, "version_id": "868869f6-8b33-4feb-ac1c-773aeb6b63d6"}]}, "item_language": {"attribute_name": "言語", "attribute_value_mlt": [{"subitem_language": "eng"}]}, "item_resource_type": {"attribute_name": "資源タイプ", "attribute_value_mlt": [{"resourcetype": "journal article", "resourceuri": "http://purl.org/coar/resource_type/c_6501"}]}, "item_title": "Cooperative Data Caching for Cloud Data Servers", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "Cooperative Data Caching for Cloud Data Servers"}]}, "item_type_id": "5", "owner": "1", "path": ["154", "6081"], "permalink_uri": "http://hdl.handle.net/2241/00147473", "pubdate": {"attribute_name": "公開日", "attribute_value": "2017-09-11"}, "publish_date": "2017-09-11", "publish_status": "0", "recid": "42574", "relation": {}, "relation_version_is_last": true, "title": ["Cooperative Data Caching for Cloud Data Servers"], "weko_shared_id": 5}
Cooperative Data Caching for Cloud Data Servers
http://hdl.handle.net/2241/00147473
http://hdl.handle.net/2241/00147473d30d91d6-d5a1-4ab2-a1fe-a17dc439aef3
名前 / ファイル | ライセンス | アクション |
---|---|---|
EAI-ETSIS_16-8 (402.0 kB)
|
Item type | Journal Article(1) | |||||
---|---|---|---|---|---|---|
公開日 | 2017-09-11 | |||||
タイトル | ||||||
タイトル | Cooperative Data Caching for Cloud Data Servers | |||||
言語 | ||||||
言語 | eng | |||||
資源タイプ | ||||||
資源 | http://purl.org/coar/resource_type/c_6501 | |||||
タイプ | journal article | |||||
著者 |
Yang, Mingcong
× Yang, Mingcong× Guo, Kai× Zhang, Yongbing |
|||||
著者別名 |
張, 勇兵
× 張, 勇兵 |
|||||
抄録 | ||||||
内容記述タイプ | Abstract | |||||
内容記述 | Thanks to the advance of cloud computing technologies, users can access the data stored at cloud data centers at any time and from any where. However, the data centers are usually sparsely distributed over the Internet and are far away from end users. In this paper, we consider to construct a cache network by a large number of cache nodes close to the end users in order to minimize the data access delay.We firstly formulate the problem of placing the replicas of data items to cache nodes as a mixed integer programming (MIP) problem. Then, we proposed an efficient heuristic algorithm that allocates at least one replica of each data item in the cache network and attempt to allocate more data items so as to minimize the total data access cost. The simulation results show that our proposed algorithm behaves much better than a well-known LRU algorithm and the computation complexity is limited. | |||||
書誌情報 |
EAI Endorsed Transactions on Scalable Information Systems 巻 16, 号 8, p. e3, 発行日 2016-08 |
|||||
ISSN | ||||||
収録物識別子タイプ | ISSN | |||||
収録物識別子 | 2032-9407 | |||||
DOI | ||||||
識別子タイプ | DOI | |||||
関連識別子 | 10.4108/eai.9-8-2016.151632 | |||||
権利 | ||||||
権利情報 | © 2016 Mingcong Yang et al., licensed to EAI. This is an open access article distributed under the terms of the Creative Commons Attribution license (http://creativecommons.org/licenses/by/3.0/), which permits unlimited use, distribution and reproduction in any medium so long as the original work is properly cited. | |||||
著者版フラグ | ||||||
値 | publisher | |||||
出版者 | ||||||
出版者 | EAI |