Reputation Revision Method for Selecting Cloud Services Based on Prior Knowledge and a Market Mechanism

Algorithm 1

Trading between buyers and sellers.

(1)   buyer = {𝑏₁,𝑏₂,…,𝑏_𝑘}; //the buyer’s set

(2)   seller_service = {𝑠₁,𝑠₂,…,𝑠_𝑙}; //the service provider’s

(3)   services comprise the seller’s set.

(4)   maxProfitofBuyer = 0; //buyer pursues their best

  interests

(5)   maxReputationRepay = {0,0,…,0}; //the seller

(6)   receives a high payoff from the buyer, which forms

  a set

(7)   for 𝑖=1 to 𝑘

(8)     for 𝑗=1 to 𝑙do

(9)     if 𝑏_𝑖 has used 𝑠_𝑗

(10)      RS[𝑖𝑗] = the rating provided by 𝑏_𝑖 for 𝑠_𝑗;

(11)              //collect the

  ratings

(12)    else RS[𝑖𝑗] = null;

(13)    end if

(14)   end for

(15)  end for

(16)  for 𝑗=1 to 𝑙

(17)    for 𝑖=1 to 𝑘 do

(18)     RS[𝑗] = comput_reputation (RS[𝑖, 𝑗]);

(19)          //compute service 𝑗’s

  reputation

(20)  end for

(21) end for

(22) if same_function(service_set) //service_set includes

(23)      //several services with the same function

(24)  compare(maxProfitofBuyer, p_b (service_set));

(25)  //return the buyer pursues a better quality service

(26) end if

(27) for 𝑗=1 to 𝑙 do

(28)   𝐹_𝑠[𝑗] = check the recommendation frequency of 𝑠_𝑗;

(29)   if 𝐹_𝑠[𝑗]<LOW

(30)   change the service provider to update the

(31) service configuration;

(32) //then after the update, the service will be renewed;

(33)    end if

(34) end for