CN108650121A - A kind of more attribute Web service demands and supplier's comprehensive score and distribution method - Google Patents
A kind of more attribute Web service demands and supplier's comprehensive score and distribution method Download PDFInfo
- Publication number
- CN108650121A CN108650121A CN201810420060.7A CN201810420060A CN108650121A CN 108650121 A CN108650121 A CN 108650121A CN 201810420060 A CN201810420060 A CN 201810420060A CN 108650121 A CN108650121 A CN 108650121A
- Authority
- CN
- China
- Prior art keywords
- supplier
- attribute
- service
- qos
- service requester
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/50—Network service management, e.g. ensuring proper service fulfilment according to agreements
- H04L41/5003—Managing SLA; Interaction between SLA and QoS
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/50—Network service management, e.g. ensuring proper service fulfilment according to agreements
- H04L41/5041—Network service management, e.g. ensuring proper service fulfilment according to agreements characterised by the time relationship between creation and deployment of a service
- H04L41/5054—Automatic deployment of services triggered by the service manager, e.g. service implementation by automatic configuration of network components
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/56—Provisioning of proxy services
- H04L67/562—Brokering proxy services
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/60—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources
- H04L67/61—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources taking into account QoS or priority requirements
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a kind of more attribute Web service demands and supplier's comprehensive score and distribution method, include the following steps：(1) each QoS (Quality of Service) attribute of service requester and supplier is inputted, and each QoS attribute is standardized；(2) according to the QoS attributes of each service requester and supplier, the weights of each QoS are determined；(3) it is scored with supplier each service requester；(4) the distance between each service requester and supplier are calculated；(5) according to the minimum distribution principle of distance, distribution ISP and demand for services person.The present invention can be standardized the QoS attributes of multiregion, overcome the skimble-scamble problem of multiregion, weights are determined according to the relation between supply and demand of each attribute, and unified score is carried out to service requester and supplier, it takes in the minimum distance method met the requirements, service waste is avoided, the maximization of system service utilization benefit is advantageously implemented.
Description
Technical field
The present invention relates to computer Web service distribution field more particularly to a kind of more attribute Web service demands and suppliers
Comprehensive score and distribution method.
Background technology
With cloud computing, information service, Web2.0, SaaS, internet+etc. theories and technology fast development, increasingly
More software appears in internet in the form of servicing, cloud, on the different platform such as big data, while the physics in a large amount of reality
Resource, Virtual Service, manual service are added into also by virtualization technology in internet, are cooperateed with online service and integrated,
These trend make available service quantity on internet increase sharply.Traditional services combined method is mostly with small grain size, general, dispersion
Services component and resource be unit, in the service clearance for being considered " unlimited " find service, these methods often ignore or
The characteristic of industry service is weakened, i.e., only theoretically considers Services Composition cost, is the background unrelated in general, field
Under conduct a research.In the case of candidate service enormous amount, under especially present multiple cloud environments, traditional Services Composition
Problem is influenced by multiple shot array, and the optimization efficiency of many Service Combination Algorithms drastically reduces, it is difficult in finite time
To satisfactory solution.
Largely there is probabilistic Web service due to having on Internet, and these Web services are with different
QoS (Quality of Service), Manual analysis these service and generate Composite service planning cannot meet it is actual
Application demand.Existing service combining method seldom considers the randomness of Web service and the dynamic of Internet environment,
Planning to be generated in service selection process is all static programming.Static programming causes result that cannot use random environment
Variation, as a result, combination failure occur with greater probability in Services Composition.As the quantity of user and service is continuously increased,
How to carry out services selection becomes particularly important.Existing distribution method does not account for the demand relation of market supply, especially
It is, in distribution, service point cannot to be carried out according to the supply-demand relationship of some attribute factor for the supply-demand relationship to some attribute
Match.
Invention content
Goal of the invention：It is an object of the present invention to provide a kind of market situations of the requestor for Web service and provider, really
The scoring of fixed different providers and demander, and the Web service distribution method based on supply and demand is realized according to this scoring.
Technical solution：The present invention includes the following steps：
(1) each QoS attributes of service requester and supplier are inputted, and place is standardized to each QoS attribute
Reason；
(2) according to the QoS attributes of each service requester and supplier, the weights of each QoS are determined；
(3) it is scored with supplier each service requester；
(4) the distance between each service requester and supplier are calculated；
(5) according to the minimum distribution principle of distance, ISP and service requester are allocated.
The step (1) and the QoS attributes in (2) include price, execute time, reliability, availability and credit worthiness.
The QoS attributes are divided into positive attribute and negative attribute, and the positive attribute includes reliability, credit worthiness and availability,
Its index is the bigger the better；The negative attribute includes price and execution time, and index is the smaller the better, by negative attribute in calculating process
It is converted into positive attribute.
Standardization in the step (1) is to be placed on the same QoS attributes of service requester and ISP
Together, it is averaged and variance.
After the standardization, it is 99% that the numerical value of each QoS attributes, which falls the probability between [0,1], if some value
Less than 0, then it is assumed that be 0；If some value is more than 1, then it is assumed that be 1.
The distance between service requester and supplier are indicated using Weighted distance in the step (4).
The distribution principle of distance minimum refers in the case where meeting dispatching requirement in the step (5), service requester with
Score difference between supplier is minimum.
Advantageous effect：The present invention can be standardized the QoS attributes of multiregion, overcome that multiregion is skimble-scamble to ask
Topic determines weights according to the relation between supply and demand of each attribute, and carries out unified score to service requester and supplier, takes full
Minimum distance method in the case of foot requirement avoids service waste, is advantageously implemented the maximization of system service utilization benefit.
Description of the drawings
Fig. 1 is the flow chart of the present invention；
Fig. 2 is the implementing procedure figure of the present invention.
Specific implementation mode
The invention will be further described below in conjunction with the accompanying drawings.
As shown in Figure 1, the present invention includes the following steps：
(1) each QoS attributes of service requester and supplier are inputted, and place is standardized to each QoS attribute
Reason, QoS attributes are divided into positive attribute and negative attribute, including price, execution time, reliability, availability and credit worthiness, wherein reliably
Property, credit worthiness and availability belong to positive attribute, and index is the bigger the better；Price is negative attribute with the time is executed, and index is smaller
Better.
Course of standardization process is that the same QoS attributes of service requester and ISP are put together, asks it flat
Mean and variance, specific method are：
Assuming that service request intend n executed on ISP m, the executions time be Et (n, m), reliability for Rel (n,
M), availability is Av (n, m), and credit worthiness is Rep (n, m), and price is Pr (n, m),
ET=Et (n, m) | 1≤n≤N, 1≤m≤M } (1)
REL=Rel (n, m) | 1≤n≤N, 1≤m≤M } (2)
AV=Av (n, m) | 1≤n≤N, 1≤m≤M } (3)
REP=Rep (n, m) | 1≤n≤N, 1≤m≤M } (4)
PR=Pr (n, m) | 1≤n≤N, 1≤m≤M } (5)
Since these attributes have different digital scopes, in order to have same range, adopt in the following method to belonging to
Property is standardized.This method makes probability of its value between [0,1] be 99%, if some value is less than 0, then it is assumed that be 0；Such as
Some value of fruit is more than 1, then it is assumed that its value is 1.For n-th of operation (i.e. Web service is asked), for executing the time, mark
Standardization formula noEt (n, m) is：
Wherein,For the average performance times provided in each Web service, and σETFor corresponding variance, for other
Attribute, using the identical method with execution time Et (n, m)：
Since there are two attribute：Positive attribute and negative attribute, positive attribute exponential quantity is the bigger the better, including reliability, prestige
Degree, availability；Negative attribute is the smaller the better, such as price, executes time etc..In order to there is unified expression, to negative attribute (when execution
Between and price) adopt and rewritten in the following method：
(2) according to the QoS attributes of each service requester and supplier, the weights of each QoS are determined；
(3) it is scored with supplier each service requester：
For service request m, it is calculated using following formula and services score when executing at n：
Wherein,AndIt indicates to execute time, reliability, availability, prestige respectively
The weights of degree and price, value are determined by following equation：
In these formula, for service request m,It is indicated respectively from execution
Time, reliability, availability, credit worthiness and price angle, can meet the quantity of service of user, and tot is the sum of these quantity.
(4) the distance between each service requester and supplier are calculated：
This methods of marking is not directed to the gap between service request and supplier, in other words, be not it is more big more
It is good.In the case where meeting user demand, the high quality wasting of resources is reduced to the greatest extent, system resource can be made widely sharp in this way
With.Assuming that the request of service request m is as follows：QoSrm={ Etrm,Relrm,Avrm,Reprm,Prrm}
Etrm,Relrm,Avrm,Reprm,PrrmIt indicates (to execute time, reliability, availability, letter to different attribute respectively
Reputation degree and price angle) requirement, indicate service request m at a distance from ISP n with Weighted distance：
Regulation goal is:
min:d(n,m)
(5) according to the minimum distribution principle of distance, distribution ISP and demand for services person, the minimum distribution of distance is former
Then refer in the case where meeting dispatching requirement, the score difference between service requester and supplier is minimum.
According to target as above, the dispatching algorithm of use is as follows：
Input：M service request, N number of ISP；
QoSrm={ Etrm, Relrm, AvrmRepm, PrrmIndicate requirement of the service request to association attributes；
Service request is intended n and is executed on ISP m, and time Et (n, m) is executed, and reliability Rel (n, m) can be used
Property Av (n, m), credit worthiness Rep (n, m) and price Pr (n, m)；
Output：N-M scheduling queues
While (scheduling queue is not sky)
Mins=+ ∞；// current service requester is with ISP apart from minimum value
Npos=0；// the service request currently selected
Mpos=0；// the ISP currently selected
For n=1:N
Calculate each weightsAnd
Form=1：M
Calculate d (n, m)；
Ifd (n, m) ＜ mins
Npos=n；// the service request currently selected
Mpos=m；// the service currently selected provides
D (n, m)=mins；
EndIf
EndFor
EndFor
If npos！=0
Distribute the n-th pos service requests, the mpos service.
Mins=+ ∞；// current minimum value
Npos=0；// the service request currently selected
Mpos=0；// the ISP currently selected
Update N, M；
EndIf
EndWhile
Specific service distribution method is：QoS standardization first is carried out to the service of each ISP and requestor, and right
Each attribute calculates weights, calculates the score of each supplier and demander, with score closest to person and meet demand
For final choice scheme, until all service requests are completed.
It is illustrated in figure 2 specific implementation flow：
1) (price executes the time, and reliability can be used by respective QoS attributes for service requester and ISP first
Property, credit worthiness) it is registered to data center；
2) service request of collection and service provision information are submitted to control centre by data center；
3) control centre concentrates all service requests and the information of ISP, and carries out standard to each QoS
Change is handled, and standardisation process is that service request and the same attribute of ISP are put together, is averaged and variance,
It recycles formula (6)-(10) in specification to calculate separately the value after standardization, for negative attribute (value is the smaller the better), then presses
It is converted into positive attribute according to formula (11)-(12) processing；
4) control centre calculates the weight of each QoS according to the information of all service requesters and ISP, for
Different relation between supply and demand calculates separately different attribute weight according to formula (14)-(19)；
5) control centre obtains the weight of standardized QoS and each attribute according to step 3) and step 4), calculates each
A service requester and the final score of ISP；
6) control centre calculates each service requester and ISP in the case where meeting QoS scheduling requirements
Between score difference；
7) control centre matches the service requester for meeting dispatching requirement and score difference minimum with ISP
Pair and distribute；
8) and so on, until the demand of all service requesters is met, or without until ISP.
Claims (7)
1. a kind of more attribute Web service demands and supplier's comprehensive score and distribution method, which is characterized in that including following step
Suddenly：
(1) each QoS attributes of service requester and supplier are inputted, and each QoS attribute is standardized；
(2) according to the QoS attributes of each service requester and supplier, the weights of each QoS are determined；
(3) it is scored with supplier each service requester；
(4) the distance between each service requester and supplier are calculated；
(5) according to the minimum distribution principle of distance, ISP and service requester are allocated.
2. a kind of more attribute Web service demands according to claim 1 and supplier's comprehensive score and distribution method, special
Sign is：The step (1) and the QoS attributes in (2) include price, execute time, reliability, availability and credit worthiness.
3. a kind of more attribute Web service demands according to claim 1 or 2 and supplier's comprehensive score and distribution method,
It is characterized in that：The QoS attributes are divided into positive attribute and negative attribute, and the positive attribute includes reliability, credit worthiness and can be used
Property, index is the bigger the better；The negative attribute includes price and execution time, and index is the smaller the better, will be born in calculating process
Attribute is converted into positive attribute.
4. a kind of more attribute Web service demands according to claim 1 and supplier's comprehensive score and distribution method, special
Sign is：Standardization in the step (1) is that the same QoS attributes of service requester and ISP are placed on one
It rises, is averaged and variance.
5. a kind of more attribute Web service demands according to claim 1 or 4 and supplier's comprehensive score and distribution method,
It is characterized in that：After the standardization, it is 99% that the numerical value of each QoS attributes, which falls the probability between [0,1],.
6. a kind of more attribute Web service demands according to claim 1 and supplier's comprehensive score and distribution method, special
Sign is：The distance between service requester and supplier are indicated using Weighted distance in the step (4).
7. a kind of more attribute Web service demands according to claim 1 and supplier's comprehensive score and distribution method, special
Sign is：The distribution principle of distance minimum refers in the case where meeting dispatching requirement in the step (5), service requester with carry
Score difference between donor is minimum.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810420060.7A CN108650121B (en) | 2018-05-04 | 2018-05-04 | Comprehensive scoring and distributing method for multiple attribute Web service demand and provider |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810420060.7A CN108650121B (en) | 2018-05-04 | 2018-05-04 | Comprehensive scoring and distributing method for multiple attribute Web service demand and provider |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108650121A true CN108650121A (en) | 2018-10-12 |
| CN108650121B CN108650121B (en) | 2021-02-26 |
Family
ID=63749348
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810420060.7A Active CN108650121B (en) | 2018-05-04 | 2018-05-04 | Comprehensive scoring and distributing method for multiple attribute Web service demand and provider |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108650121B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111222903A (en) * | 2018-11-27 | 2020-06-02 | 北京嘀嘀无限科技发展有限公司 | System and method for processing data from an online on-demand service platform |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101399707A (en) * | 2008-11-20 | 2009-04-01 | 北京邮电大学 | Method and device for selecting internet service based on credit |
| CN101404589A (en) * | 2008-11-14 | 2009-04-08 | 北京邮电大学 | WEB service single Qos attribute appraisement method based on user requirement |
| CN101637006A (en) * | 2007-03-14 | 2010-01-27 | 艾利森电话股份有限公司 | Be used to use UDDI to reconcile WEB service method and equipment |
| US20150121552A1 (en) * | 2011-06-08 | 2015-04-30 | International Business Machines Corporation | Software utilization privilege brokering in a networked computing environment |
| CN104883366A (en) * | 2015-05-15 | 2015-09-02 | 南京邮电大学 | Method for updating Web service reliability predicating values by utilizing user real-time feedback information |
-
2018
- 2018-05-04 CN CN201810420060.7A patent/CN108650121B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101637006A (en) * | 2007-03-14 | 2010-01-27 | 艾利森电话股份有限公司 | Be used to use UDDI to reconcile WEB service method and equipment |
| CN101404589A (en) * | 2008-11-14 | 2009-04-08 | 北京邮电大学 | WEB service single Qos attribute appraisement method based on user requirement |
| CN101399707A (en) * | 2008-11-20 | 2009-04-01 | 北京邮电大学 | Method and device for selecting internet service based on credit |
| US20150121552A1 (en) * | 2011-06-08 | 2015-04-30 | International Business Machines Corporation | Software utilization privilege brokering in a networked computing environment |
| CN104883366A (en) * | 2015-05-15 | 2015-09-02 | 南京邮电大学 | Method for updating Web service reliability predicating values by utilizing user real-time feedback information |
Non-Patent Citations (4)
| Title |
|---|
| 李迎秋: "基于QoS的Web服务选择关键技术研究", 《中国博士学位论文全文数据库信息科技辑》 * |
| 杜精益: "Web服务选择的研究", 《中国优秀硕士学位论文全文数据库信息科技辑》 * |
| 胡启平: "基于QoS线性化和最短路径思想的Web服务组合选择体系", 《中国科技论文》 * |
| 马亮，钱雪忠: "基于QoS的Web服务调用最短路径确定方法", 《计算机工程》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111222903A (en) * | 2018-11-27 | 2020-06-02 | 北京嘀嘀无限科技发展有限公司 | System and method for processing data from an online on-demand service platform |
| WO2020107509A1 (en) * | 2018-11-27 | 2020-06-04 | Beijing Didi Infinity Technology And Development Co., Ltd. | Systems and methods for processing data from an online on-demand service platform |
| US11140531B2 (en) | 2018-11-27 | 2021-10-05 | Beijing Didi Infinity Technology And Development Co., Ltd. | Systems and methods for processing data from an online on-demand service platform |
| CN111222903B (en) * | 2018-11-27 | 2023-04-25 | 北京嘀嘀无限科技发展有限公司 | System and method for processing data from an online on-demand service platform |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108650121B (en) | 2021-02-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Gill et al. | BULLET: particle swarm optimization based scheduling technique for provisioned cloud resources | |
| US9542223B2 (en) | Scheduling jobs in a cluster by constructing multiple subclusters based on entry and exit rules | |
| Liu et al. | Resource preprocessing and optimal task scheduling in cloud computing environments | |
| Mekala et al. | A DRL-based service offloading approach using DAG for edge computational orchestration | |
| US20110010456A1 (en) | Recording medium storing load-distribution program, load-distribution apparatus, and load-distribution method | |
| Kaur et al. | A multi-objective optimization scheme for job scheduling in sustainable cloud data centers | |
| Delavar et al. | A synthetic heuristic algorithm for independent task scheduling in cloud systems | |
| US20170243268A1 (en) | Method and system for determining an optimized service package model for market participation | |
| Ben Alla et al. | A priority based task scheduling in cloud computing using a hybrid MCDM model | |
| Manikandan et al. | Virtualized load balancer for hybrid cloud using genetic algorithm | |
| Goudarzi et al. | Joint customer/provider evolutionary multi-objective utility maximization in cloud data center networks | |
| CN103970612A (en) | Load balancing method and device based on pre-division of virtual machine | |
| CN108650121A (en) | A kind of more attribute Web service demands and supplier's comprehensive score and distribution method | |
| CN114564313A (en) | Load adjustment method and device, electronic equipment and storage medium | |
| Tarafdar et al. | Energy-efficient scheduling of deadline-sensitive and budget-constrained workflows in the cloud | |
| CN113791890A (en) | Container distribution method and device, electronic equipment and storage medium | |
| Zhu et al. | Truthful online auction toward maximized instance utilization in the cloud | |
| CN107589980A (en) | A kind of dispatching method of cloud computing resources | |
| JP2017215933A5 (en) | ||
| CN116647560A (en) | Method, device, equipment and medium for coordinated optimization control of Internet of things computer clusters | |
| Kusuma | Hybrid make-to-stock and make-to-order (mts-mto) scheduling model in multi-product production system | |
| CN111522843B (en) | Control method, system, equipment and storage medium of data platform | |
| Haque et al. | A priority-based process scheduling algorithm in cloud computing | |
| Cao et al. | OPT-Min-Min Scheduling Algorithm of Grid Resources. | |
| CN105577760A (en) | Cloud calculation graded management method and system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| CB02 | Change of applicant information | ||
| CB02 | Change of applicant information |
Address after: 210044 No. 219 Ningliu Road, Jiangbei New District, Nanjing City, Jiangsu Province Applicant after: Nanjing University of Information Science and Technology Address before: 211500 Yuting Square, 59 Wangqiao Road, Liuhe District, Nanjing City, Jiangsu Province Applicant before: Nanjing University of Information Science and Technology |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant |