ダウンロード数: 161
このアイテムのファイル:
ファイル | 記述 | サイズ | フォーマット | |
---|---|---|---|---|
transcom.2018NVP0001.pdf | 1.74 MB | Adobe PDF | 見る/開く |
タイトル: | Program file placement problem for machine-to-machine service network platform |
著者: | Sato, Takehiro https://orcid.org/0000-0002-6253-0942 (unconfirmed) Oki, Eiji https://orcid.org/0000-0003-2177-5027 (unconfirmed) |
著者名の別形: | 佐藤, 丈博 大木, 英司 |
キーワード: | IoT M2M placement problem optimization NP-completeness heuristic algorithm |
発行日: | 1-Mar-2019 |
出版者: | Institute of Electronics, Information and Communication, Engineers, IEICE |
誌名: | IEICE Transactions on Communications |
巻: | E102B |
号: | 3 |
開始ページ: | 418 |
終了ページ: | 428 |
抄録: | 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. |
著作権等: | © 2019 IEICE. 許諾条件に基づいて掲載しています。 |
URI: | http://hdl.handle.net/2433/241072 |
DOI(出版社版): | 10.1587/transcom.2018NVP0001 |
関連リンク: | http://www.ieice.org/jpn/books/transaction.html |
出現コレクション: | 学術雑誌掲載論文等 |
このリポジトリに保管されているアイテムはすべて著作権により保護されています。