1,708 Hits in 4.1 sec

Evaluation of P2P Search Algorithms for Discovering Trust Paths [chapter]

Emerson Ribeiro de Mello, Aad van Moorsel, Joni da Silva Fraga
2007 Lecture Notes in Computer Science  
In this paper we systematically evaluate the application of P2P search algorithms to the trust path discovery problem.  ...  Since peer-to-peer (P2P) networks share various characteristics with the web of trust, P2P search algorithms can potentially be exploited to find trust paths.  ...  Conclusions P2P search algorithms are obvious candidates for discovering trust paths in distributed versions of the web of trust, and we therefore present in this paper a performance comparison of P2P  ... 
doi:10.1007/978-3-540-75211-0_9 fatcat:fdayislqoff7jloygplzwktxuy

Heuristic Discovery of Role-Based Trust Chains in Peer-to-Peer Networks

Ke Chen, Kai Hwang, Gang Chen
2009 IEEE Transactions on Parallel and Distributed Systems  
Our method discovers successive edges of a trust chain, adaptively, to match with the demands in any given P2P application.  ...  New heuristic chaining algorithms are developed for backward, forward, and bi-directional discovery of trust chains.  ...  With multiple expansion paths, the goal of a heuristic algorithm is to search for the credential chain out of the most likely edge paths on the trust graph.  ... 
doi:10.1109/tpds.2008.60 fatcat:2byn5xtyd5h2bon6ssiedu5kry

Reliable Peer Discovery in Content-Aware Overlay Network

Jayashree D, Yogesh P
2012 International Journal of Computer Applications  
This efficient content delivering system reduces the search latency of content peer selection. Also the reliable path for sharing content with trust calculation has been proposed.  ...  With the popularity of p2p application for resource sharing and the availability of resources has motivated the researchers to examine the potentials of p2p applications in a dynamic environment.  ...  The path selected is the one, which has the maximum path trust. n is the total number of path discovered from s to d. Wt i is the weight assigned to the i th path.  ... 
doi:10.5120/9794-4398 fatcat:3e6ffxntijbvvj5uxilvnkwh6a

TBSearch: Trust based Search in Unstructured Peer-to-peer Networks

Hoda Mashayekhi, Jafar Habibi, Habib Rostami
2008 2008 Fourth International Conference on Semantics, Knowledge and Grid  
In this paper we propose TBSearch, a robust and efficient trust based search algorithm for unstructured P2P networks.  ...  Effectiveness of P2P systems highly depends on efficiency of their search algorithms.  ...  Section 3 presents the search algorithm and the required data structures. In section 4 the trust evaluation scheme for determining trustworthiness of query results are elaborated.  ... 
doi:10.1109/skg.2008.99 dblp:conf/skg/MashayekhiHR08 fatcat:ehwc6rbvu5e2bj2624z4s2krou

Evaluation of P2P Algorithms for Probabilistic Trust Inference in a Web of Trust [chapter]

Huqiu Zhang, Aad van Moorsel
2008 Lecture Notes in Computer Science  
We study the use of peer-to-peer algorithms for finding trust paths and probabilistically assessing trust values in systems where trust is organised similar to the 'web of trust'.  ...  We study the use of peer-topeer algorithms for finding trust paths and probabilistically assessing trust values in systems where trust is organised similar to the 'web of trust'.  ...  Acknowledgements We thank Emerson Ribeiro de Mello for the earlier PeerSim implementation [2] , and for discussions on the current paper.  ... 
doi:10.1007/978-3-540-87412-6_18 fatcat:wcmkn45bl5bddaqmtfgeaon7pi

A decentralised public key infrastructure for customer-to-customer e-commerce

Karl Aberer, Anwitaman Datta, Manfred Hauswirth
2005 International Journal of Business Process Integration and Management  
In this paper we argue that C2C e-commerce is an application domain that maps naturally onto the emerging field of peer-to-peer (P2P) systems simply by its underlying interaction model of customers, i.e  ...  Since security (authenticity, non-repudiation, trust, etc.) is key to any e-commerce infrastructure, our envisioned P2P e-commerce platform has to address these security issues adequately.  ...  Then search is defined by the following recursive algorithm: Algorithm 1 Search in P-Grid: search(t, loc(p)) 1 if path(p) ⊆ t then 2 return(loc(p)); 3 else 4 determine maximal l such that t 1 ...t l-1  ... 
doi:10.1504/ijbpim.2005.006962 fatcat:2njhyj4javhabdenz3uu463lvi

A Novel Dynamic Trust Model for P2P NetWork

Liao Jian, Li Zhi
2015 Open Automation and Control Systems Journal  
In P2P network the trust evaluation between groups are obtained by using a method of global trust.  ...  The experiments in simulation have shown our model has strong ability for defending malicious peers and it has fewer errors in targets searching.  ...  ACKNOWLEDGEMENTS This work is sponsored by scientific research project in 2014, the Education Department of Hunan province (N0. 14C0403).  ... 
doi:10.2174/1874444301507010893 fatcat:2s4plxx73nbszb2endgb4so4ii


K.Ramalakshmi .
2014 International Journal of Research in Engineering and Technology  
P2P systems require a sufficient amount of trust from their nodes which are all participates in the network for AAA (Authentication, Authorization and Availability).  ...  From the analysis it aims to provide the prediction of optimized path in the network for efficient file sharing and the identification of necessary security methods in the network to provide security to  ...  FUTURE WORK In order to improve the QoS and security advanced P2PHBA algorithm can be used with scout bee implementation for the prediction of optimized path to efficient file sharing, better sources to  ... 
doi:10.15623/ijret.2014.0304081 fatcat:lhin4gxxvbddhol5ela2s3jluy

Trust-based probabilistic search with the view model of peer-to-peer networks

Hai Zhuge, Xue Chen, Xiaoping Sun
2006 Concurrency and Computation  
The P-Walk mechanism works effectively in a P2P view model that provides appropriate views of the P2P network for queries of different types.  ...  To improve search efficiency, this paper proposes the trust-based probabilistic search mechanism, called the Preferential Walk (P-Walk).  ...  ACKNOWLEDGEMENTS The authors thank all of the team members of the China Knowledge Grid Research Group ( for their help and cooperation.  ... 
doi:10.1002/cpe.1033 fatcat:ybfnp7qnhra6lh43ujdnn2rwoq

CSA: A Credibility Search Algorithm Based on Different Query in Unstructured Peer-to-Peer Networks

Hongyan Mei, Yujie Zhang, Xiangwu Meng
2014 Mathematical Problems in Engineering  
As for this problem, considering the similarity between social networks and unstructured P2P networks, we present a credibility search algorithm based on different queries according to the trust production  ...  However, the performances of the searches for nonrepetition or low-repetition or rare resources need to be improved.  ...  Acknowledgments This study is supported by the National Natural Science Foundation of China (Grant no. 60872051) and the Program of the Co-Construction with Beijing Municipal Commission of Education of  ... 
doi:10.1155/2014/197878 fatcat:x3hk3nlkufd5zdhlcqwnthiiei

Structuring Peer-to-Peer Networks Using Interest-Based Communities [chapter]

Mujtaba Khambatti, Kyung Dong Ryu, Partha Dasgupta
2004 Lecture Notes in Computer Science  
We provide a mechanism to generate realistic peer-to-peer network topologies that can be used in simulations that evaluate the operation of our algorithms.  ...  Interest-based communities are a natural arrangement of distributed systems that prune the search space and allow for better dissemination of information to participating peers.  ...  The performance of CBS was evaluated against the performance of two well-known search techniques: (1) Gnutella search, a hop-limited breadth-first search of the P2P network beginning from the querying  ... 
doi:10.1007/978-3-540-24629-9_5 fatcat:tlsywefqnjb4veq7ykbzceg73u

TACS, a Trust Model for P2P Networks

Félix Gómez Mármol, Gregorio Martínez Pérez, Antonio F. Gómez Skarmeta
2008 Wireless personal communications  
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.  ...  Many researchers are working hard in order to improve the capabilities of P2P networks.  ...  The choice of using ant colony systems to solve the problem of computing trust values in a P2P network was taken, among other factors, because of the ability of this algorithm to adapt itself to dynamic  ... 
doi:10.1007/s11277-008-9596-9 fatcat:rv5x565vqjbmdo4jcc5au4yswq

Discovering Trust Networks for the Selection of Trustworthy Service Providers in Complex Contextual Social Networks

Guanfeng Liu, Yan Wang, Mehmet A. Orgun, Huan Liu
2012 2012 IEEE 19th International Conference on Web Services  
of which has an important influence on trust evaluation.  ...  Online Social Networks (OSNs) have provided an infrastructure for a number of emerging applications in recent years, e.g., for the recommendation of service providers, where trust is one of the most important  ...  They further proposed a heuristic algorithm for the selection of K (K ≥ 2) social trust paths [23] and a novel trust transitivity model in social networks [24] .  ... 
doi:10.1109/icws.2012.47 dblp:conf/icws/LiuWOL12 fatcat:gopwjpfjazethnkfans5xkgsbe

Improving peer-to-peer search performance through intelligent social search

Stephen J.H. Yang, Jia Zhang, Leon Lin, Jeffrey J.P. Tsai
2009 Expert systems with applications  
In addition, our method also enhances the trustworthiness of search results because searches go through trusted peers.  ...  As a large amount of information is added onto the Internet on a daily basis, the efficiency of peer-to-peer (P2P) search has become increasingly important.  ...  Performance evaluation For each query using an algorithm, we record its hit path number as its search distance, which is the number of hops (peers) the query travels before it finds a matched resource.  ... 
doi:10.1016/j.eswa.2009.01.045 fatcat:f7476rakhzgwlpu4fuo6djgxvq

Survey of Search and Replication Schemes in Unstructured P2P Networks [article]

Sabu M. Thampi, Chandra Sekaran K
2010 arXiv   pre-print
In this paper, we provide a comprehensive theoretical survey of various state-of-the-art search and replication schemes in unstructured P2P networks for file-sharing applications.  ...  Finally, the various issues on searching and replication for unstructured P2P networks are discussed.  ...  Preferential Walk: Preferential walk (P-walk) [45] is a trust-based probabilistic search algorithm which utilises a trust evaluation method to rate neighbours according to the feedback from previous  ... 
arXiv:1008.1629v1 fatcat:iqgaryfqwrakrkrb4q7qzhq3l4
« Previous Showing results 1 — 15 out of 1,708 results