Nt1330 Unit 1 Algorithm Application Paper

Given $U$ as the set all the devices located at the edge of the network with physical proximity of the device that wants to request computational resources $D$. Therefore, the PAR problem can be modeled as a graph $G$, where the vertexes of this graph are elements of the set U, and the edges of G are the communication link between them. In our approach, the vertexes are classified according to into the following types:

The client device is defined as the devices that demand remote computing resources from Cloud/Fog or Mist computing infrastructure. Computational resources required by the device complying with a set of restriction requirements $r = \left\{ (r_{1},r_{2},...,r_{k})\textrm{ } | \textrm{ } k \in \mathbb{N} \right\}$. As an illustration, we can show as examples of restriction requirements: minimum link speed; Run time; maximum latency and cost associated with the use of the resource.
Represented in the model such as the set of vertexes: $$F = \left\{v_{i} \in U \textrm{ } | \textrm{ } i,n_{F} \in \mathbb{N}\textrm{ , } i \in \textrm{ }\left\{1,2,..,n_{F}\right\}