QoS Improvement Using In-Network Caching Based on Clustering and Popularity Heuristics in CCN

. 2021 Oct 29;21(21):7204. doi: 10.3390/s21217204

Algorithm 1: Proposed network clustering scheme

Input: All the network routers

R_{j}

, where

j = 1, 2, \dots, | R |

Output: Set of “

k

” clusters

(C_{i})

, where

i = 1, 2, \dots, k

Sort the routers according to their decreasing order of degree centrality.
Designate top “ $k$ ” routers as initial centroids that have higher degree centrality $(C e n t r o i d_{i} \in C_{i})$ .
Iterate step-3(a), 3(b) and step-4, till there is a change in centroids:
- (a)
  Determine the distance between the routers $(R_{j})$ and each of the centroid $(C e n t r o i d_{i})$ using following equation:
  $D i s t (C e n t r o i d_{i}, R_{j}) = \frac{H (C e n t r o i d_{i}, R_{j})}{M i n (B (C e n t r o i d_{i}, R_{j}))}$ (1)
- (b)
  Assign each router $(R_{j})$ to the closest centroid $(C e n t r o i d_{i})$ , i.e., $R_{j} \in C_{i}$ .
Determine the new centroid $(C e n t r o i d_{i})$ in each cluster that has minimum distance from the intra-cluster routers.