Optimizing Fog Service Placement Algorithms

Average of the execution time of the placement algorithm in each colony

placement time = Σ placement timeCi / |Lx|

It is NP-hard and directly impacted by the number of application instances and fog devices.

<p>In parallel by each coordinator independently.</p> Signup and view all the answers

<p>Using the real execution time of the placement.</p> Signup and view all the answers

<p>Emulation or simulation</p> Signup and view all the answers

<p>The overall response time is defined as the mean value of the single response times for all the users.</p> Signup and view all the answers

<p>The assumption is made to avoid the influence of fog device resource heterogeneity and focus on network communication times.</p> Signup and view all the answers

<p>It is calculated as the network path between the user and the first service of the application added to the sum of the single network paths for each pair of related services.</p> Signup and view all the answers

<p>Communication inside the same colony, between different colonies, and between a colony and the cloud.</p> Signup and view all the answers

<p>It is calculated as the sum of three shortest paths between specific points: origin device and origin coordinator, origin coordinator and target coordinator of the closest colony, and target coordinator and target device.</p> Signup and view all the answers

<p>The two shortest paths between origin device and origin coordinator, and origin coordinator and cloud.</p> Signup and view all the answers