Algorithm 2 Dynamic adaptation to new services.

Let $\mathcal{N}$ be the node requesting the service $S_{new}$.

Given a new service $S_{new}=\{P_{new},Q_{new}\}$ with processing unit $P_{new}$ and related QoS $Q_{new}$ such that each $Q_{kj}$ is a finite set of n quality choices for the $j^{th}$ attribute, expressed in decreasing order of preference, for all k QoS dimensions. Let $\mathcal{A}$ be a global variable that stores the set of available nodes in the cluster.

Let $S_{\mathcal{C}}=\left\{\right\}$ be the sub cluster that will provide the new service.

Let $\mathcal{N}$ broadcast to the local network the request for nodes to register adding them to $\mathcal{A}$.

while $t < timeout$ do

for each $d_i\in \mathcal{A}$ do

Let $Q_j$ be the QoS delivered by node $d_i$

if $Q_j$ is higher (in all its dimensions) than Q then

if $d_i$ can accommodate such service along existing ones then

$S_{\mathcal{C}}=S_{\mathcal{C}}\cup \left\{d_i\right\}$

end if

end if

end for

end while

return $S_{\mathcal{C}}$