Distributed web service selection method based on QoS (Quality of Service)

A web service and distributed technology, applied in the computer field, can solve problems affecting user experience, low efficiency of service selection technology, long response time, etc., and achieve the effect of reducing cost and response time

Active Publication Date: 2011-08-17
ZHEJIANG UNIV
View PDF2 Cites 14 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0006] Aiming at the shortcomings of the service selection technology in the prior art, such as low efficiency, long response time, and affecting user experience, the present invention provides a skyline

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Distributed web service selection method based on QoS (Quality of Service)
  • Distributed web service selection method based on QoS (Quality of Service)
  • Distributed web service selection method based on QoS (Quality of Service)

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0071] Distributed web service selection method based on QoS, such as Figure 1 to Figure 2 shown, including the following steps:

[0072] Step a: The master server manages all data servers and assigns tasks. During this process, K map (mapping) tasks, S pre-prune (pre-prune) tasks and 1 refine (refining) tasks are assigned (K>0, S>0), the master server assigns a map task, pre-prune task or refine task to an idle machine;

[0073] Step b: Map process: The machine assigned the map task reads the list of related web services as input data, then parses the input data into QoS vectors, generates intermediate temporary key / value pairs (key / value pairs), and caches them in In memory, the input to this process is the list of web services, and the output is the QoS vector;

[0074] Step c: The key / value pairs cached in the memory are divided into S regions by the partition function, and then periodically written to the local disk, and the cached key / value pairs are sent back to the ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention relates to the field of a computer and particularly discloses a distributed web service selection method based on QoS (Quality of Service). The web service selection is performed in a distributed way in the method and the method comprises the following steps: dividing the web service selection which is a big problem requiring extremely huge computing power into many small parts; distributing the small parts to many computers to be processed in parallel; and finally, combining all computing results to obtain a final result. In the invention, different machines perform high-efficiency parallel computing through a pre-prune-refine model, some web services which do not meet conditions are deleted in advance by the pre-prune course and the response time is shortened remarkably, thereby rapidly and flexibly finding the service which meets the requirements of users. Because the input and output in the middle of the course are temporary files, the additional input and output overhead is not generated, the transmission efficiency of a network can be obviously strengthened, and the selection efficiency is greatly enhanced.

Description

technical field [0001] The invention relates to the computer field, in particular to a QoS-based distributed web service selection method. Background technique [0002] Distributed computing is a new computing method proposed in recent years. It studies how to decompose a problem that requires huge computing power into many small parts, and then distribute these small parts to many computers for parallel processing. , and finally combine the results of each calculation to get the final result. Through distributed computing, the program can be run on the most suitable computer to run it. [0003] Web service selection is such a big problem that needs very huge computing power to solve. Web service selection is to choose a service with better quality from a large number of service sets with equivalent functions to meet the needs of service requesters. With the development of service computing and cloud computing, a large number of services with similar functions but differe...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): H04L29/08
Inventor 吴健潘李敏陈亮尹建伟李莹邓水光
Owner ZHEJIANG UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap