Load-Balancing of Kubernetes-Based Edge Computing Infrastructure Using Resource Adaptive Proxy

View full-text article in PMC

. 2022 Apr 8;22(8):2869. doi: 10.3390/s22082869

Algorithm 1 Resource Adaptive Proxy (RAP)

/* Define global variables*/
BestNode ▹ Most powerful resource remote worker
EndpointsMap ▹ List of endpoints of each endpoint
NextEndpoints ▹ Endpoints used in the load-balancing
ResLists ▹ Resource list including CPU, RAM, and latency

1:
functionResourceAdaptiveProxy
2:
/* Create separate endpoint list based on name of node*/
3:
$C u r r e n t E n d p o i n t s = G e t A p p I n f o (a p p) . e n d p o i n t s$
4:
if $C u r r e n t E n d p o i n t s \neq L a s t e s t E n d p o i n t s$ then
5:
for endpoints, node in GetAppInfo(app).Item[] do
6:
$E n d p o i n t s M a p [n o d e] . a d d (e n d p o i n t s)$
7:
end for
8:
$L a s t e s t E n d p o i n t s = C u r r e n t E n d p o i n t s$
9:
end if
10:
/* Calculate resources and return the best remote node*/
11:
$M e t r i c S e r v e r . I n i t i a l i z e ()$
12:
for node in GetAppInfo(app).Item[] do
13:
$A p p R e s [n o d e] . c p u \leftarrow M e t r i c S e r v e r . R e s L i s t s . C P U$
14:
$A p p R e s [n o d e] . r a m \leftarrow M e t r i c S e r v e r . R e s L i s t s . R A M$
15:
//Calculate score by summing normalized resource.
16:
if $n o d e \neq G e t H o s t n a m e ()$ then
17:
if $A p p R e s [n o d e] . c p u < T h r e s h o l d$ && $A p p R e s [n o d e] . r a m < T h r e s h o l d$ then
18:
$S c o r e [n o d e] = \sum_{r \in R e s o u r c e s} W_{r} * (N o r m a l i z e (A p p R e s [n o d e])$
19:
if $S c o r e [n o d e] > H i g h e s t S c o r e$ then
20:
$H i g h e s t S c o r e = S c o r e [n o d e]$
21:
$B e s t N o d e \leftarrow n o d e$
22:
end if
23:
end if
24:
end if
25:
end for
26:
end function
27:
functionLoadbalancer
28:
/*Incoming requests are forwarded to NextEndpoint.*/
29:
if $I n c o m i n g R e q u e s t \neq N u l l$ then
30:
$L o c a l N o d e \leftarrow G e t H o s t n a m e ()$
31:
if $A p p R e s [L o c a l N o d e] . c p u < T h r e s h o l d$ && $A p p R e s [L o c a l N o d e] . r a m < T h r e s h o l d$ then
32:
$N e x t E n d p o i n t \leftarrow E n d p o i n t s M a p [L o c a l N o d e]$
33:
else
34:
$N e x t E n d p o i n t \leftarrow E n d p o i n t s M a p [B e s t W o r k e r]$
35:
end if
36:
//Forward Incoming Request to NextEndpoint
37:
end if
38:
end function