P2P caching sequences based on partial trust negotiation game

Trust negotiation is the process of revealing the certificates and the strategy set of the resource requester and the resource provider with each other, while after negotiation succeeding cache selectively the sequence of revealing the certificates according to the their use ratio and showing directly at the next time, which can save plenty of time costing. This paper makes a split of the negotiation process to many steps and cache part in order to improve the whole performance. Via the mixed static game theory to construct the model of the caching sequence, using the ratio as a label, simulate the situation of part of caching sequence, and then analyze to obtain the measure of optimal performance of the system via adjust the use ratio of certificates. At last, the simulation software, Gambit, checks the correctness of the model of the game theory.