An Efficient Decentralized Grid Service Discovery Approach based on Service Ontology
WI '04 Proceedings of the 2004 IEEE/WIC/ACM International Conference on Web Intelligence
Ant colony optimization inspired resource discovery in P2P Grid systems
The Journal of Supercomputing
A scheduling algorithm for parallel tasks in peer-to-peer systems
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part II
Single Attestation Image for a Trusted and Scalable Grid
International Journal of Grid and High Performance Computing
| Hi-index | 0.00 |
Service location based on greedy search is studied in this paper. A model is built to analyze the influence of the network topologies on this location method, and different network topologies are constructed to validate the model by ways of simulation. The results show that, though the model assumes an uniform degree distribution, it agrees with the simulation result well if the average degree of the network is reasonably big. Hops and relative QoS index of the node found in a service location process are used to evaluate the effectiveness of the location method as well as the probability of locating the first 5% nodes with higher QoS level. Both model and simulation result show that, the performance of greedy search based servicelocation improves significantly with the increase of the average degree of the network. If changes of both topology and the QoS level of nodes can be ignored during a location process, it can be guaranteed that the location has high probability of finding the nodes withrelatively high QoS level in small number of hops in a big service community. Model extension under arbitrary network degree distribution is further studied. A "Two-phase" topology construction and service location based on greedy-search is also put forward.