DocumentCode :
3432047
Title :
P2P caching sequences based on partial trust negotiation game
Author :
Chunzhi Wang ; Ruoxi Wang ; Hong Li ; Chen Hongwei
Author_Institution :
Inst. of Comput. Sci., Hubei Univ. of Technol., Wuhan, China
fYear :
2011
fDate :
3-5 Aug. 2011
Firstpage :
236
Lastpage :
239
Abstract :
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.
Keywords :
cache storage; game theory; peer-to-peer computing; resource allocation; Gambit simulation software; P2P caching sequence; mixed static game theory; partial trust negotiation game; peer-to-peer network; resource provider; resource requester; Computer science; Educational institutions; Games; Integrated circuit modeling; Nash equilibrium; Safety; mixed static game theory; part of caching sequence; peer to peer; trust negotiation;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Science & Education (ICCSE), 2011 6th International Conference on
Conference_Location :
Singapore
Print_ISBN :
978-1-4244-9717-1
Type :
conf
DOI :
10.1109/ICCSE.2011.6028625
Filename :
6028625
Link To Document :
بازگشت