Research Article
GT-Bidding: Group Trust Model of P2P Network Based on Bidding
| | Input: request peer Ri | | | Output: final trading peer | | (1) | Ri ⟶ SBM | | (2) | for (j = 1 to k) //k is the number of peers | | (3) | if (Sj ⟶ answer) //provide service | | (4) | Sj add into {Service} //service peers | | (5) | end if | | (6) | end for | | (7) | Guarantee {Service} | | (8) | TOPSIS {Service} | | (9) | Max = 0 | | (10) | Maxid = 1; | | (11) | for (j = 1 to k/2) | | (12) | = Trust computation | | (13) | if (Max < ) | | (14) | Max = | | (15) | Maxid = j | | (16) | end if | | (17) | end for | | (18) | Transaction between Ri and SMaxid | | (19) | Ri ⟶ FM | | (20) | if (FM ∈ [confidence interval]) | | (21) | Reputation update | | (22) | else | | (23) | Break | | (24) | end if |
|
