ダウンロード数: 161
このアイテムのファイル:
ファイル | 記述 | サイズ | フォーマット | |
---|---|---|---|---|
transcom.2018NVP0001.pdf | 1.74 MB | Adobe PDF | 見る/開く |
完全メタデータレコード
DCフィールド | 値 | 言語 |
---|---|---|
dc.contributor.author | Sato, Takehiro | en |
dc.contributor.author | Oki, Eiji | en |
dc.contributor.alternative | 佐藤, 丈博 | ja |
dc.contributor.alternative | 大木, 英司 | ja |
dc.date.accessioned | 2019-04-26T07:04:59Z | - |
dc.date.available | 2019-04-26T07:04:59Z | - |
dc.date.issued | 2019-03-01 | - |
dc.identifier.issn | 0916-8516 | - |
dc.identifier.issn | 1745-1345 | - |
dc.identifier.uri | http://hdl.handle.net/2433/241072 | - |
dc.description.abstract | The Machine-to-Machine (M2M) service network platform accommodates M2M communications traffic efficiently by using tree-structured networks and the computation resources deployed on network nodes. In the M2M service network platform, program files required for controlling devices are placed on network nodes, which have different amounts of computation resources according to their position in the hierarchy. The program files must be dynamically repositioned in response to service quality requests from each device, such as computation power, link bandwidth, and latency. This paper proposes a Program File Placement (PFP) method for the M2M service network platform. First, the PFP problem is formulated in the Mixed-Integer Linear Programming (MILP) approach. We prove that the decision version of the PFP problem is NP-complete. Next, we present heuristic algorithms that attain sub-optimal but attractive solutions. Evaluations show that the heuristic algorithm based on the number of devices that share a program file reduces the total number of placed program files compared to the algorithm that moves program files based on their position. | en |
dc.format.mimetype | application/pdf | - |
dc.language.iso | eng | - |
dc.publisher | Institute of Electronics, Information and Communication, Engineers, IEICE | en |
dc.publisher.alternative | 電子情報通信学会 | ja |
dc.rights | © 2019 IEICE. 許諾条件に基づいて掲載しています。 | ja |
dc.subject | IoT | en |
dc.subject | M2M | en |
dc.subject | placement problem | en |
dc.subject | optimization | en |
dc.subject | NP-completeness | en |
dc.subject | heuristic algorithm | en |
dc.title | Program file placement problem for machine-to-machine service network platform | en |
dc.type | journal article | - |
dc.type.niitype | Journal Article | - |
dc.identifier.jtitle | IEICE Transactions on Communications | en |
dc.identifier.volume | E102B | - |
dc.identifier.issue | 3 | - |
dc.identifier.spage | 418 | - |
dc.identifier.epage | 428 | - |
dc.relation.doi | 10.1587/transcom.2018NVP0001 | - |
dc.textversion | publisher | - |
dc.address | Graduate School of Informatics, Kyoto University | en |
dc.address | Graduate School of Informatics, Kyoto University | en |
dc.relation.url | http://www.ieice.org/jpn/books/transaction.html | - |
dcterms.accessRights | open access | - |
出現コレクション: | 学術雑誌掲載論文等 |
このリポジトリに保管されているアイテムはすべて著作権により保護されています。