CN104253830A - Service selection method based on position - Google Patents
Service selection method based on position Download PDFInfo
- Publication number
- CN104253830A CN104253830A CN201310258396.5A CN201310258396A CN104253830A CN 104253830 A CN104253830 A CN 104253830A CN 201310258396 A CN201310258396 A CN 201310258396A CN 104253830 A CN104253830 A CN 104253830A
- Authority
- CN
- China
- Prior art keywords
- service
- services
- candidate
- communication
- candidate service
- 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
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
- Telephonic Communication Services (AREA)
Abstract
The invention discloses a service selection method based on position. According to the method, belonging domain environments of to-be-selected services are firstly determined, positions of the services are determined according to the domain environments, communication cost between the services is determined by communication cost between the belonging domain environments, and the communication cost of two services belonging to the same domain environment is zero. According to a data bulk distribution state in a service flow, the weight coefficient of communication between every two services is determined, abstract services in an original service flow are replaced by candidate services, each candidate service is taken as a node, edges of every two communication-needing services are connected, length of the connection edge is the product of the communication cost and the weight coefficient between the two services, the shortest path from acquiring data service from a database to writing back the database service is found on the figure, services on the path are the selected services, and the selected services are results of service selection.
Description
Technical field
The present invention relates to location Based service Selecting research field, the method for service selection of some services that preferred position is more concentrated when selecting again to serve according to service position specifically.
Background technology
Along with the rise of service compute, the existing service of increasing developer's Selection utilization, by the discovery of service, is selected, is combined into an operation flow completed, to meet the needs of Complicated Flow and function.Such development process often needs through three links, and 1. flow process is determined, developer needs each link determining whole operation flow what to do, and needs to provide which resource, and which calculates.The flow process determined is in series by service abstract one by one, each abstract service represents the imagination of developer to the service that this link needs, this both comprised functional characteristic, also nonfunctional characteristics is comprised, typically this flow process reads data from database, to writing back database for stopping.2. service discovery, developer selects the specific service that can meet each abstract service in registered service library, is called candidate service, the corresponding one group of candidate service of each abstract service.3. services selection, selects the ring of optimum service as final service procedure from each candidate service group.
Traditional method utilizes the absolute indexs such as the confidence level of service to determine the selection of serving, and under large data environment, the expense that the transmission on network of mass data brings can not look down upon, and conventional method does not all have to consider the communication overhead how reducing whole service procedure when selecting service.This method, from the territory environment at candidate service place, introduces the position of service, and by dispersion and the aggregation properties of the location expression service of service, the service that prioritizing selection is more concentrated when selecting service, makes overall communication expense minimum.
Summary of the invention
The object of the invention is to solve during traditional services is selected the problem cannot taking service procedure communication overhead into account, a kind of location Based service system of selection is provided, the position that it had both considered service have also contemplated that the uneven weight allocation brought of data volume in service procedure, optimized selection service.
Related notion and definition:
Abstract service: be not executable service, just indicate the service that a class has specific function, abstract service is a ring of service procedure, and after services selection, abstract service substitutes by by the service selected.
Specific service: have developer of services to develop, the service that can run, disposes on the internet usually.
Candidate service: alternative specific service having the function that abstract service defines.
Candidate service group: the set of the candidate service of the corresponding abstract service of energy, is made up of the candidate service of specific quantity usually, Services Composition is exactly from each candidate service group, select service to substitute the process of abstract service corresponding in service procedure.
Service procedure: developer reserves in advance to be needed to call one by one or the concatermer of service of practical function, usually extracts service from database, through abstract service one by one, most Zhongdao writes back database service.Service procedure cannot perform before services selection, could perform upon selection.
Territory environment: the territory environment of service refers to the network environment that the high speed belonging to it is communicated with, and a territory can be a server, a Small-scale LAN, can be a privately owned cloud.
The present invention is achieved through the following technical solutions:
A kind of location Based service system of selection, comprises the following steps: the territory environment the first, determining all candidate service places, and the communication delay between these territory environment.Communication delay between the communication delay determination candidate service utilizing territory environment; The second, communication overhead weight coefficient between each link is distributed according to the data volume of each link of service procedure; 3rd, each abstract service to be selected in service procedure is expanded into candidate service, forms directed graph; 4th, find out the shortest path from first service to last service.Using the candidate service of process on shortest path as the service selected.
As preferably, in described step (1), communication delay between candidate service is determined by the territory environment at candidate service place, in this method for expressing, distance between distant two services can be weighed by the distance in its territory, place, belong to two an of territory serve between then communication overhead is negligible.By introducing the territory of service, and the concept of distance, provide the quantitative target of the communication overhead of the service of measurement, for services selection provides foundation; Described step (2) also comprises, the communication overhead of whole flow process is not only determined by the communication delay between two services intercomed mutually, also can be subject to the impact of the data volume of current communication, assign weight coefficient to reflect the communication overhead of whole flow process better by the data volume size in whole flow process; In described step (3), original service procedure is from database D B1, reading database be that a special service is designated as S0, service s1 is called in serial, s2, s3 ... sM is total M candidate service group always, the most at last data write DB2, and that write into Databasce is another special service S0 ' herein.This process is launched into directed graph by this method, and its candidate service group of the abstract service si in each service procedure replaces, and suppose that each service group has N number of candidate service, then i-th candidate service group just can use si1, si2, si3 ... siN represents.Each candidate service is a node on figure, each candidate service sij is connected with s (i+1) k, wherein j=1,2,3 ... N, k=1,2,3,4 ... N forms directed graph, add S0 and S0 ', the every bar length of side formed on whole figure, figure is all determined by the product of the unit service communication overhead of correspondence and weight coefficient.
As preferably, in described step (4), the shortest path first of figure is utilized to determine from S0 to S0 ' the shortest paths of the length of side, on path, each candidate service of process is optimum services selection result.
The invention has the beneficial effects as follows:
(1) select accurately: this method considers the impact for services selection of the communication overhead that brings due to network environment between service, thus can select optimum service more accurately.
(2) select efficiently: the time complexity of the service that this method is selected and abstract service quantity exist linear relationship, i.e. linear time complexity, greatly can reduce operation time, be better than existing method.
Accompanying drawing explanation
In order to be illustrated more clearly in the embodiment of the present invention or technical scheme of the prior art, be briefly described to the accompanying drawing used required in embodiment or description of the prior art below, apparently, accompanying drawing in the following describes is only some embodiments of the present invention, for those of ordinary skill in the art, under the prerequisite not paying creative work, other accompanying drawing can also be obtained according to these accompanying drawings.
Fig. 1: service procedure figure to be selected.
Fig. 2: generate directed graph.
Embodiment
Below in conjunction with accompanying drawing in detail and example carefully the present invention is described.
As shown in Figure 1, it comprises two special service S0 to unselected service procedure, S0 ', and represent reading database DB1 service respectively and write back database D B2 service, these two services are determined, do not need to select.Flow process also comprises M group candidate service group, often organizes N number of candidate service.Often organize candidate service one that selects optimum from this, amount to M specific service and form last service procedure.The present invention selects M optimum service when considering the communication overhead between service.
The first step needs the territory environment determining each candidate service place, the unit communication overhead between every two services is being determined by the unit communication overhead between these territory environment of inquiry, the i.e. distance of two services: when two services are in same territory environment, unit communication overhead is 0, and the distance of that is these two services is 0; When two services are in two different territory environment, the unit communication overheads of these two services equal the unit communication overhead (being also called the distance of these two territory environment) of these two territory environment.By determining the territory environment of all candidate service, and the distance between these territory environment, just can determine the distance of any two candidate service, namely its unit communication overhead.It should be noted that (be designated as q), be often transmit the cost (mainly time cost) that a certain amount of data spend to the unit communication overhead mentioned herein.The communication overhead w=q*d produced during the calling of each service, wherein d calls the data volume needing transmission specifically.And the communication overhead W in whole service procedure is the communication overhead w sum between any two services.
Second step is the weight coefficient e in distribution services flow process, because the flowing of data in service procedure is not equivalent, likely from first service enter second service data volume very large, and it is very little from the data volume of second to the 3rd, so need with the weight coefficient between every two links for reference when the communication overhead weighing overall service procedure, the ratio of the weight coefficient of every two links is exactly the ratio of the data volume of these two link processes.That is the ratio of any two e is exactly the ratio of corresponding data volume d, and namely e is proportional to d, also just says that existence k makes d=k*e, so w=k*e*q.So the impact of data volume d for integrated communication expense W just can be portrayed by e.When doing a services selection, for any selection scheme, k is the same, so using this parameter as constant process.
3rd step is that the service procedure of Fig. 1 is expanded into the directed graph shown in Fig. 2, and its candidate service group of the abstract service si in each service procedure replaces, si1, si2, si3 ... siN, amount to M candidate service group, each group has N number of candidate service.Each candidate service sij is a node on figure, represent a jth candidate service of i-th candidate service group, each candidate service sij is connected with s (i+1) k, j and k represents the label in service group internal services, its scope should be from 1 to N, a service group always total N number of service.And M is the quantity of candidate service group, the numbering of candidate service group that what i represented is exactly, its scope is from 1 to M, a jth service of i-th candidate service group that what sij herein represented is, and s (i+1) k represents is the kth service of the i-th+1 candidate service group, form M component, wherein k has generality, and that is sij needs to set up a limit with each node of serving in the i-th+1 candidate service group.These limits are all directed edges, and that large node of candidate service group # is pointed in direction, points to s (i+1) k from sij.The unit communication overhead q that length of side c equals between these two services is multiplied by weight coefficient e, c=e*q mentioned above, forms directed graph after reallocated all nodes and the length of side.
4th step to find out on figure from S0 to S0 ' shortest path.Every paths on figure is all the length of side sum on all limits of process on this paths, and shortest path is exactly pass through to select sensor selection problem path the shortest for specific starting point and terminal.Utilize the shortest path first of figure to find from S0 to S0 ' shortest path, due to the particularity of this directed graph, each candidate service group must only have a service selected, that is shortest path be exactly one from the service of S0 through each candidate service group, the chain of final arrival S0 ', each candidate service group has one, and only have one to serve on this chain, this service is exactly the minimum service of communication overhead, process on this chain, except S0 and S0 ' each service be that the service of the optimum that this is selected is (because S0 and S0 ' determines, do not need through selection).The abstract service being replaced the correspondence in service procedure by the service of these optimums just can obtain the minimum service procedure of executable communication overhead, by above step, final from all candidate service groups and service procedure to be done, obtain the service procedure that the complete communication overhead that can perform is minimum.
Finally it should be noted that, above embodiment is the unrestricted technical scheme of the present invention in order to explanation only, although with reference to above-described embodiment to invention has been detailed description, those of ordinary skill in the art is to be understood that, still can modify to the present invention or equivalent replacement, and not departing from any amendment or the local replacement of the spirit and scope of the present invention, it all should be encompassed in the middle of right of the present invention.
Claims (3)
1. a location Based service system of selection, is characterized in that, the method comprises the following steps:
1) the territory environment at all candidate service places is determined, and the communication delay between these territory environment, the communication delay between the communication delay determination candidate service utilizing territory environment;
2) weight coefficient of the communication overhead between each link is distributed according to the data volume of each link of service procedure;
3) each abstract service to be selected in service procedure is expanded into candidate service, form figure;
4) shortest path from first service to last service is found out, using the candidate service of process on shortest path as the service selected.
2. location Based service system of selection according to claim 1, it is characterized in that, in described step (1), communication delay between candidate service is determined by the territory environment at candidate service place, in this method for expressing, distance between two distant services can be weighed by the distance in its territory, place, belong between two of territory services that then communication overhead is negligible, by introducing the territory of service, and the concept of distance, provide the quantitative target of the communication overhead of the service of measurement, for services selection provides foundation, described step (2) also comprises, the communication overhead of whole flow process is not only determined by the communication delay between two services intercomed mutually, also can be subject to the impact of the data volume of current communication, assign weight coefficient to reflect the communication overhead of whole flow process better by the data volume size in whole flow process, in described step (3), original service procedure is from database D B1, reading database be that a special service is designated as S0, service s1 is called in serial, s2, s3 ... sM is total M candidate service group always, data write DB2 the most at last, that write into Databasce is another special service S0 ' herein, this process is launched into directed graph by this method, its candidate service group of abstract service si in each service procedure replaces, suppose that each service group has N number of candidate service, then i-th candidate service group just can use si1, si2, si3 ... siN represents, each candidate service is a node on figure, each candidate service sij is connected with s (i+1) k, wherein j=1, 2, 3 ... N, k=1, 2, 3, 4 ... N forms directed graph, add S0 and S0 ', form whole figure, every bar length of side on figure is all determined by the product of the unit service communication overhead of correspondence and weight coefficient.
3. location Based service system of selection according to claim 2, it is characterized in that, the shortest path first of figure is utilized to determine from S0 to S0 in described step (4) ' the shortest paths of the length of side, on path, each candidate service of process is optimum services selection result.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310258396.5A CN104253830B (en) | 2013-06-26 | 2013-06-26 | A kind of location Based service system of selection |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310258396.5A CN104253830B (en) | 2013-06-26 | 2013-06-26 | A kind of location Based service system of selection |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104253830A true CN104253830A (en) | 2014-12-31 |
| CN104253830B CN104253830B (en) | 2018-03-16 |
Family
ID=52188363
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310258396.5A Active CN104253830B (en) | 2013-06-26 | 2013-06-26 | A kind of location Based service system of selection |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104253830B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104581788A (en) * | 2015-01-26 | 2015-04-29 | 中国科学院微电子研究所 | Service selecting method and system for multiple users |
| CN104598559A (en) * | 2015-01-06 | 2015-05-06 | 浙江大学 | Combined clustering method based on Web service tag data |
| CN104780061A (en) * | 2015-03-10 | 2015-07-15 | 浙江大学 | Log-based communication overhead prediction method |
| CN110896344A (en) * | 2019-11-15 | 2020-03-20 | 北京邮电大学 | Redundant service deployment method and device |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101170499A (en) * | 2007-11-22 | 2008-04-30 | 复旦大学 | A selection method for combined service execution path in self-organized network |
| US20080244526A1 (en) * | 2007-03-29 | 2008-10-02 | International Business Machines Corporation | Dynamic learning in redesigning a composition of web services |
| CN101742606A (en) * | 2008-11-14 | 2010-06-16 | 复旦大学 | Combination service execution path selection method based on location information in wireless self-organization network |
| CN102123175A (en) * | 2011-03-07 | 2011-07-13 | 浙江大学 | Service selection method based on Qos (Quality of Service) perception based on optimal similarity distance |
| CN103150336A (en) * | 2013-02-04 | 2013-06-12 | 浙江大学 | Sky line online calculation method based on user clustering |
-
2013
- 2013-06-26 CN CN201310258396.5A patent/CN104253830B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080244526A1 (en) * | 2007-03-29 | 2008-10-02 | International Business Machines Corporation | Dynamic learning in redesigning a composition of web services |
| CN101170499A (en) * | 2007-11-22 | 2008-04-30 | 复旦大学 | A selection method for combined service execution path in self-organized network |
| CN101742606A (en) * | 2008-11-14 | 2010-06-16 | 复旦大学 | Combination service execution path selection method based on location information in wireless self-organization network |
| CN102123175A (en) * | 2011-03-07 | 2011-07-13 | 浙江大学 | Service selection method based on Qos (Quality of Service) perception based on optimal similarity distance |
| CN103150336A (en) * | 2013-02-04 | 2013-06-12 | 浙江大学 | Sky line online calculation method based on user clustering |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104598559A (en) * | 2015-01-06 | 2015-05-06 | 浙江大学 | Combined clustering method based on Web service tag data |
| CN104581788A (en) * | 2015-01-26 | 2015-04-29 | 中国科学院微电子研究所 | Service selecting method and system for multiple users |
| CN104581788B (en) * | 2015-01-26 | 2018-09-14 | 中国科学院微电子研究所 | Multi-user services selection method and system |
| CN104780061A (en) * | 2015-03-10 | 2015-07-15 | 浙江大学 | Log-based communication overhead prediction method |
| CN104780061B (en) * | 2015-03-10 | 2018-05-29 | 浙江大学 | A kind of communication-cost Forecasting Methodology based on daily record |
| CN110896344A (en) * | 2019-11-15 | 2020-03-20 | 北京邮电大学 | Redundant service deployment method and device |
| CN110896344B (en) * | 2019-11-15 | 2021-03-19 | 北京邮电大学 | Redundant service deployment method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104253830B (en) | 2018-03-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11570271B2 (en) | Differentiated smart sidecars in a service mesh | |
| US9398081B2 (en) | Automating client development for network APIs | |
| CN105138793B (en) | Distribution network line QuickDraw method | |
| US9998550B2 (en) | Network based service composition with variable conditions | |
| CN101588518A (en) | A kind of transmission network topological structure safety analytical method and realization system | |
| CN104253830A (en) | Service selection method based on position | |
| CN110401706A (en) | Service request processing method, device, storage medium and terminal | |
| CN107395674A (en) | A kind of application system accesses the method and device of isomery block platform chain | |
| CN108121742A (en) | The generation method and device of user's disaggregated model | |
| CN113254100B (en) | Method for realizing dynamic loading of multistage route based on Vue | |
| CN110310100A (en) | Project management method, device, electronic equipment and storage medium | |
| CN108234319A (en) | The transmission method and device of a kind of data | |
| Yamato et al. | Context-aware service composition and component change-over using semantic Web techniques | |
| CN114428907A (en) | Information searching method and device, electronic equipment and storage medium | |
| CN109978380A (en) | A kind of workflow processing method and device | |
| Boutigny et al. | Solving security constraints for 5G slice embedding: A proof-of-concept | |
| CN110958666B (en) | Network slice resource mapping method based on reinforcement learning | |
| CN102855278B (en) | A kind of emulation mode and system | |
| CN108566429A (en) | A kind of high in the clouds sharing files method and apparatus | |
| CN108959294A (en) | A kind of method and apparatus accessing search engine | |
| CN106527979A (en) | Data migration method and device | |
| CN107453950A (en) | A kind of information processing method and monitoring system | |
| CN103558912A (en) | Personalized stepping setting device for input parameters of measuring instrument | |
| CN113077199A (en) | Method and device for determining distribution route | |
| CN103905534A (en) | Global load balancing method and device based on operator city information |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |