An Improved Global Trust Value Computing Method in P2P System

Yu, F. Richard; Zhang, Huanguo; Yan, Fei; Gao, Song

doi:10.1007/11839569_25

Cited by 8 publications

(8 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Some other trust and reputation models more specific for P2P are [17], DWTrust [7], TPOD [14], GroupRep [15], PTM [1,2] and TDTM [20]. An ant colony system is used as well in TDTM in order to manage trust.…”

Section: Related Workmentioning

confidence: 99%

TACS, a Trust Model for P2P Networks

Mármol

Pérez

Skarmeta

2008

Wireless Pers Commun

View full text Add to dashboard Cite

Many researchers are working hard in order to improve the capabilities of P2P networks. In this way, one of the main factors slowing down the improvement and development of P2P networks is the need to guarantee a minimum level of trust between two interacting nodes. This paper presents an innovative trust model providing a solution to this problem. Our trust model, which is based on the ant colony system, is able to select the best server to interact with, in terms of being the most trustworthy, in a very high percentage. Here, the traces of pheromone left by the ants correspond to the amount of trust that a node has on its neighbors.

show abstract

Section: Related Workmentioning

confidence: 99%

TACS, a Trust Model for P2P Networks

Mármol

Pérez

Skarmeta

2008

Wireless Pers Commun

View full text Add to dashboard Cite

show abstract

“…In GroupRep [16], a peer evaluates the credibility of a given peer by its local trust information or the reference from the group it belongs to. An improved computing method to calculate the global trust value is proposed by Fajiang Yu [17]. However, most models do not suit highly dynamic and personalized trust environment.…”

Section: Related Workmentioning

confidence: 99%

A dynamic file replication based on CPU load and consistency mechanism in a trusted distributed environment

Vardhan

Kushwaha

2017

Teh. vjesn.

View full text Add to dashboard Cite

Original scientific paper An effort has been made to propose a CPU load based dynamic, cooperative, trust based, and secure file replication approach based along with consistency among file replicas for distributed environment. Simulation results consisting of 100 requesting nodes, three file servers and file size ranging from 677 KB to 11 MB establishes that, when the CPU load is taken into consideration, the average decrease in file request completion time is about 22,04 ÷ 24,81 % thus optimizing the CPU load and minimizing the file request completion time. The CPU load decreases by 4,25 ÷ 5,58 %. Results show that, the average write latency with proposed mechanism decreases by 6,12 % as compared to Spinnaker writes and the average read latency is 3 times better than Cassandra Quorum Read (CQR). The proposed partial update propagation for maintaining file consistency stands to gain up to 69,67 % in terms of time required to update stale replicas. Thus the integrity of files and behaviour of the requesting nodes and file servers is guaranteed within even lesser time. Finally, a relationship between the formal aspects of simple security model and secure reliable CPU load based file replication model is established through process algebra. Keywords Dinamička replikacija datoteke zasnovana na mehanizmu opterećenosti i konzistencije CPU u pouzdanom distribuiranom okruženjuIzvorni znanstveni članak Pokušalo se predložiti dinamički, kooperativni, pouzdani i sigurni pristup replikaciji datoteke utemeljen na opterećenosti CPU uz konzistenciju među replikama datoteke za distribuirano okruženje. Rezultati simulacije koja se sastoji od 100 potrebnih čvorova, tri servera datoteke i datoteke veličine od 677 KB to 11 MB pokazuju da kada se uzme u obzir opterećenje CPU, prosječno smanjenje vremena potrebnog za popunjavanje datoteke je oko 22,04 ÷ 24,81 %. Tako se optimiziralo opterećenje CPU i smanjilo traženo vrijeme popunjavanja datoteke. Opterećenje CPU smanjuje se za 4,25 ÷ 5,58 %. Rezultati pokazuju da se prosječno kašnjenje upisa (write latency) s predloženim mehanizmom smanjuje za 6,12 % u usporedbi sa Spinnakerovim, a prosječno vrijeme čekanja čitanja (read latency) je 3 puta bolje od Cassandra Quorum Read (CQR). Predložena parcijalna propagacija ažuriranja za održavanje konzistencije datoteke povećava se do 69,67 % u odnosu na vrijeme potrebno za ažuriranje zastarjelih replika. Tako je integritet datoteka i ponašanje zahtijevanih čvorova i servera datoteke zagarantirano za čak manje vremena. Konačno, kroz algebra postupak uspostavljen je odnos između formalnih aspekata jednostavnog modela sigurnosti i sigurnog pouzdanog modela replikacije datoteke zasnovanog na sigurnom pouzdanom opterećenju datoteke.

show abstract

“…Instead of concentrating local trust value of a node, by accumulating the local trust values, the global trust value of a node is evaluated as given in [5,6,7]…”

Section: Global Trustmentioning

confidence: 99%