Program File Placement Strategies for Machine-to-Machine Service Network Platform in Dynamic Scenario

• SATO Takehiro

  Graduate School of Informatics, Kyoto University

• OKI Eiji

  Graduate School of Informatics, Kyoto University

Abstract

The machine-to-machine (M2M) service network platform that accommodates and controls various types of Internet of Things devices has been presented. This paper investigates program file placement strategies for the M2M service network platform that achieve low blocking ratios of new task requests and accommodate as many tasks as possible in the dynamic scenario. We present four strategies for determining program file placement, which differ in the computation method and whether the relocation of program files being used by existing tasks is allowed or not. Simulation results show that a strategy based on solving a mixed-integer linear programming model achieves the lowest blocking ratio, but a heuristic algorithm-based strategy can be an attractive option by allowing recomputation of the placement when the placement cannot be obtained at the timing of new task request arrival.

Journal

• IEICE Transactions on Communications

  IEICE Transactions on Communications E103.B (11), 1353-1366, 2020-11-01

  The Institute of Electronics, Information and Communication Engineers

Keywords

• machine to machine
• placement problem
• mixed-integer linear programming
• heuristic algorithm
• online algorithm

Details

• CRID: 1391975276373895936
• NII Article ID: 130007933915
• DOI: 10.1587/transcom.2020ebp3001
• ISSN: 17451345
• ISSN: 09168516
• Web Site: https://www.jstage.jst.go.jp/article/transcom/E103.B/11/E103.B_2020EBP3001/_pdf
• Text Lang: en
• Data Source:
  • JaLC
  • Crossref
  • CiNii Articles
  • KAKEN
• Abstract License Flag: Disallowed