Algorithm 1 Cluster setup.

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

Let $\mathcal{A}:=\left\{\right\}$ be a global variable that stores the set of available nodes in the cluster.

Take a service $S=\{P,Q\}$ with processing unit P and related QoS Q 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{S}:=\left\{\right\}$ be the set of nodes in the cluster capable of providing a given service.

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

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

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

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

4:            $\mathcal{C}=\mathcal{C}\left\{(d_i,Q_j)\right\}$

5:       end if

6: end for

7: return $\mathcal{C}$