Introduction to Grey system theory
The Journal of Grey System
Search and replication in unstructured peer-to-peer networks
ICS '02 Proceedings of the 16th international conference on Supercomputing
A local search mechanism for peer-to-peer networks
Proceedings of the eleventh international conference on Information and knowledge management
Routing Indices For Peer-to-Peer Systems
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Improving Search in Peer-to-Peer Networks
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Grey Information: Theory and Practical Applications (Advanced Information and Knowledge Processing)
Grey Information: Theory and Practical Applications (Advanced Information and Knowledge Processing)
IAC: Interest-Aware Caching for Unstructured P2P
SKG '06 Proceedings of the Second International Conference on Semantics, Knowledge, and Grid
Enhancing Search Performance in Unstructured P2P Networks Based on Users' Common Interest
IEEE Transactions on Parallel and Distributed Systems
An interest-based intelligent link selection algorithm in unstructured P2P environment
ICA3PP'07 Proceedings of the 7th international conference on Algorithms and architectures for parallel processing
Optimal search performance in unstructured peer-to-peer networks with clustered demands
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
As a major pattern for design of future heterogeneous Cloud and service-oriented networks, research on P2P networking is extremely important and could possibly significantly alter the way of implementation of large-scale of Internet applications-Cloud Computing. However, we will not reap all the benefits of utilising the distributed resources in future P2P Clouds, unless we have an efficient and scalable way to discover the desirable services regarding users' needs. Through analysis of peer node's multi-dimensional quality-of-service (QoS) attributes for resource discovery, it is found that peer node state's information is essential for improving search performance in distributed systems. This paper presents a novel efficient search algorithm, named State-Based Search (SBS), according to peer node's state information. This algorithm has been simulated and evaluated in dynamic P2P environments. By comparing other related interest-based algorithms, the experimental results show that the SBS algorithm is able to effectively improve performance by reducing search response time and achieving better load balance.