Research Article
Task Placement on Fog Computing Made Efficient for IoT Application Provision
Table 1
Notation and description of terms in the proposed task placement model.
| Notation ∖ Parameter | Notation | Description |
| Fog landscape | DS | Distributed services | F | Fog orchestration node | | a Fog cell (node) | | Fog cell th belongs to Fog colony controlled by the fog orchestration node | | The set of fog neighbors of | | Node | | Link delay between a fog cell and its colony’s orchestration node | | Link delay between a fog orchestration node and its neighbor | | Link delay between a fog orchestration node and the cloud | | Maximum power consumption of node in the fog landscape | | Power consumption of node when it is idle |
| Cloud | | Power consumption of a node on the cloud when it is idle | | Power consumption per instruction when executing tasks on the cloud |
| Application | A | Set of applications to be executed | | The application | | The task | J | The set of all tasks that need to be executed | | Response time of the application | | Deadline of the application | | Deployment time of the task | | Execution time (makespan) of the task | | The communication time of the task | | The size (MIPS) of the task | | Memory required by the task | | The total amount of data exchanged when running the task |
|
|