CN104253830B - A kind of location Based service system of selection - Google Patents
A kind of location Based service system of selection Download PDFInfo
- Publication number
- CN104253830B CN104253830B CN201310258396.5A CN201310258396A CN104253830B CN 104253830 B CN104253830 B CN 104253830B CN 201310258396 A CN201310258396 A CN 201310258396A CN 104253830 B CN104253830 B CN 104253830B
- Authority
- CN
- China
- Prior art keywords
- service
- candidate
- selection
- services
- communication
- 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.)
- Active
Links
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
- Telephonic Communication Services (AREA)
Abstract
The invention discloses a kind of location Based service system of selection, this method determines to treat first the domain environment belonging to the service of selection, and the position of the service is determined by its domain environment, communication overhead between service is just determined that communication overhead is zero between belonging to two services of same domain environment as the communication overhead between the domain environment belonging to it.Data volume distribution situation in service procedure, determine the weight coefficient to be communicated between each two service, candidate service is replaced into the abstract service in original service procedure, node is used as using each candidate service, latticing side between the service that each two needs communicate, the product of communication overhead and weight coefficient of the length of side between the two services, find and take data, services to the shortest path the service of write back data storehouse from database on this figure, the service passed through on path is exactly the service chosen, that is, the result of services selection.
Description
Technical field
The present invention relates to location Based service Selecting research field, specifically according to service position reselection
The method for service selection for some services that preferred position is more concentrated when service.
Background technology
With the rise that service calculates, the increasing existing service of developer's Selection utilization passes through the hair serviced
It is existing, selection, an operation flow completed is combined into, to meet the needs of Complicated Flow and function.Such development process is past
Toward needing by three links, 1. flows determine, developer it needs to be determined that each link of whole operation flow to be done it is assorted
, it is desirable to provide which resource, which is calculated.The flow determined is in series by the service being abstracted one by one, is each taken out
The service of elephant all represents the imagination for the service that developer needs to this link, and this both includes functional characteristic, also including NOT function
Energy characteristic, typically this flow is to read data from database, is termination to write back data storehouse.2. service discovery,
Developer selects the specific service that can meet each abstract service, referred to as candidate service in registered service library, often
Individual abstract service all corresponds to one group of candidate service.3. services selection, optimal service conduct is selected from each candidate service group
One ring of final service procedure.
Traditional method determines the selection of service using absolute indexs such as the confidence levels of service, and in big data environment
Under, the expense that the transmission belt on network of mass data is come be can not look down upon, and conventional method is all no to be considered selecting
How the communication overhead of whole service procedure is reduced when selecting service.This method from the domain environment where candidate service,
The position of service is introduced, by the scattered and aggregation properties of the location expression service of service, is preferentially selected when selecting and servicing
Select greater concentration of service so that overall communication expense is minimum.
The content of the invention
It is an object of the invention to solve the problems, such as that in traditional services selection service procedure communication overhead can not be taken into account, there is provided
A kind of location Based service system of selection, the position that it had both considered service have also contemplated that data volume is uneven in service procedure
The weight distribution brought, the selection service of optimization.
Related notion and definition：
Abstract service：It is not executable service, has simply indicated that a kind of service for possessing specific function, abstract service
It is a ring of service procedure, after services selection, abstract service substitutes the service being selected.
Specific service：There is developer of services exploitation, the service that can be run, be usually deployed on the internet.
Candidate service：Alternative specific service for possessing function defined in abstract service.
Candidate service group：The set of the candidate service of an abstract service can be corresponded to, is generally taken by certain amount of candidate
Business composition, Services Composition are exactly to select service to replace corresponding abstract service in service procedure from each candidate service group
Process.
Service procedure：Developer sets the concatermer for needing to call or realize the service of function one by one in advance, generally from data
Storehouse extraction service is set out, by abstract service one by one, the service of most Zhongdao write back data storehouse.Service procedure services selection it
Before can not perform, could perform upon selection.
Domain environment：The domain environment of service refers to the network environment of the high speed connection belonging to it, and a domain can be a clothes
Business device, a Small-scale LAN, can be a private clound.
The present invention is achieved through the following technical solutions：
A kind of location Based service system of selection, comprises the following steps：Firstth, the domain where all candidate services is determined
Communication delay between environment, and these domain environment.The communication between candidate service is determined using the communication delay of domain environment
Delay；Secondth, according to communication overhead weight coefficient between each link of the data volume of each link of service procedure distribution；The
Three, each in service procedure is treated that the abstract service of selection expands into candidate service, forms digraph；4th, find out from
Shortest path of one service to last one service.By the service of the candidate service passed through on shortest path alternatively.
Preferably, in the step (1), the communication delay between candidate service is true as the domain environment where candidate service
Fixed, in this method for expressing, the distance between distant two services can be weighed by the distance in domain where it, and
Belong between two of domain services that then communication overhead can be ignored.The domain serviced by introducing, and its distance
Concept, there is provided weigh the quantitative target of the communication overhead of service, foundation is provided for services selection；The step (2) also includes,
The communication overhead of whole flow process is not only determined by the communication delay between two be in communication with each other service, and also can specifically be communicated
Data volume influence, distribute weight coefficient by the data volume size in whole flow process preferably to reflect whole flow process
Communication overhead；In the step (3), for original service procedure from database D B1, reading database is one
Special service is designated as S0, it is serial to call service S1,S2,S3…SMA total of M candidate service group, most data at last
DB2 is write, that write into Databasce is another special service S herein0’.This process is launched into digraph by this method, often
Abstract service S in one service procedureiAll replaced with its candidate service group, it is assumed that each service group has N number of candidate service, then
I-th of candidate service group can Si1,Si2,Si3…SiNRepresent.Each candidate service is a node on figure, each
Individual candidate service SijAll and S(i+1)kConnection, wherein j=1,2,3 ... N, k=1,2,3,4 ... N form digraph, along with S0With
S0', formed and entirely schemed, each edge length on figure is determined by the product of corresponding unit service communication overhead and weight coefficient
It is fixed.
Preferably, determined in the step (4) using the shortest path first of figure from S0To S0' most short one of the length of side
Path, each candidate service passed through on path is optimal services selection result.
The beneficial effects of the invention are as follows：
(1) selection is accurate：This method consider service between due to the communication overhead that network environment is brought for service select
The influence selected, so as to more accurately select optimal service.
(2) selection is efficient：There is linear relationship in the time complexity of the service of this method selection, i.e., with abstract service quantity
It linear time complexity, can greatly reduce operation time, be better than existing method.
Brief description of the drawings
In order to illustrate more clearly about the embodiment of the present invention or technical scheme of the prior art, below will be to embodiment or existing
There is the required accompanying drawing used in technology description to be briefly described, it should be apparent that, drawings in the following description are only this
Some embodiments of invention, for those of ordinary skill in the art, on the premise of not paying creative work, can be with
Other accompanying drawings are obtained according to these accompanying drawings.
Fig. 1:Treat the service flow diagram of selection.
Fig. 2:Generate digraph.
Embodiment
Detailed and example carefully describes the present invention below in conjunction with the accompanying drawings.
Unselected service procedure is as shown in figure 1, it includes two special service S0,S0', represent to read data respectively
Storehouse DB1 is serviced and write back data storehouse DB2 services, what the two services were to determine, it is not necessary to select.Flow also includes M group candidates
Service group, every group of N number of candidate service.Optimal one is selected from this every group of candidate service, M specific service is amounted to and is formed most
Service procedure afterwards.The present invention is exactly to select optimal M to service in the case of the communication overhead between considering to service.
The first step is it needs to be determined that domain environment where each candidate service, by inquiring about the unit between these domain environment
Communication overhead determines the unit communication overhead between each two service, i.e., the distance of two services：When two services are in same
During individual domain environment, unit communication overhead is 0, that is to say, that the distance of the two services is 0；When two services are in two differences
Domain environment when, the two service unit communication overheads be equal to the two domain environment unit communication overhead (also referred to as this two
The distance of individual domain environment).By determining the domain environment of all candidate services, and the distance between these domain environment, it becomes possible to
Determine the distance of any two candidate service, that is, its unit communication overhead.It should be noted that referring herein to unit lead to
Believe expense (being designated as q), be the cost (mainly time cost) that every a certain amount of data of transmission are spent.The calling serviced every time
Caused communication overhead w=q*d, wherein d are the current data volumes called and need to transmit.And whole service procedure
In communication overhead W be any two service between communication overhead w sums.
Second step is the weight coefficient e distributed in service procedure, because the flowing of data in service procedure is not equivalent
, it is possible to the data volume for entering second service from first service is very big, and the data volume from second to the 3rd is very
It is small, so weight coefficient of the needs between each two link is ginseng when the communication overhead of overall service procedure is weighed
Examine, the ratio between weight coefficient of each two link is exactly the ratio between data volume that the two links are passed through.That is any two e it
Than being exactly the ratio between corresponding data volume d, i.e. e is proportional to d, also just says and causes d=k*e in the presence of a k, so w=k*e*q.Institute
With by e with regard to influences of the data volume d for integrated communication expense W can be portrayed.When a services selection is done, for any
Selection scheme, what k was just as, so using this parameter as constant processing.
3rd step is that Fig. 1 service procedure expanded into digraph shown in Fig. 2, the abstract clothes in each service procedure
Business Si is replaced with its candidate service group, Si1,Si2,Si3…SiN, M candidate service group altogether, each group has N number of candidate service.
Each candidate service SijAll it is a node on figure, represents the j-th candidates service of i-th of candidate service group, each time
Choosing service SijAll and S(i+1)kConnection, j and k represent the label in service group internal services, and its scope should be from 1 to N one
Individual a total of N number of service of service group.And M is the quantity of candidate service group, i represent be exactly candidate service group numbering, its model
It is the S herein from 1 to M to encloseijWhat is represented is j-th of service of i-th of candidate service group, and S(i+1)kWhat is represented is i+1
K-th of service of candidate service group, forms M components, and wherein k has generality, that is to say, that SijNeed to take with i+1 candidate
The node of each service in business group establishes a line.These sides are all directed edges, and it is big that candidate service group # is pointed in direction
That node, from SijPoint to S(i+1)k.The unit communication overhead q that length of side c is equal between the two services, which is multiplied by, to be previously mentioned
Weight coefficient e, c=e*q, form digraph after reallocated all nodes and the length of side.
4th step is found out on figure from S0To S0' shortest path.Every paths on figure are passed through on this paths
The length of side sum on all sides, and shortest path is exactly one most short by selecting node to select for specific beginning and end
Path.It can be found from S using the shortest path first of figure0To S0' shortest path, due to the particularity of this digraph, often
One candidate service group necessarily only has a service selected, that is to say, that shortest path is exactly one and passes through each candidate from S0
A service in service group, eventually arrives at S0' chain, each candidate service group has one, and only one service is at this
On bar chain, this service is exactly the minimum service of communication overhead, is passed through on this chain, except S0With S0' each service be
The optimal service that this is selected is (because S0With S0' be to determine, it is not necessary to by selection).By these optimal services
Replace corresponding abstract service in the service procedure service procedure minimum with regard to executable communication overhead can be obtained, by with
Upper step, finally from all candidate service groups and service procedure to be done, obtained completely performing leads to
Believe the minimum service procedure of expense.
Finally it should be noted that above example is only to illustrative and not limiting technical scheme, although reference
The present invention is described in detail above-described embodiment, it will be understood by those within the art that, still can be to this hair
It is bright to modify or equivalent substitution, any modification without departing from the spirit and scope of the present invention or it is local replace, its is equal
It should cover among scope of the presently claimed invention.
Claims (2)
1. a kind of location Based service system of selection, it is characterised in that this method comprises the following steps：
1) communication delay between the domain environment where all candidate services, and these domain environment is determined, utilizes domain environment
Communication delay determines the communication delay between candidate service, and the communication delay between candidate service is as the domain ring where candidate service
Border determine, in this method for expressing, distant two service the distance between can pass through its where domain distance weigh
Amount, and the domain that then communication overhead can be ignored, and be serviced by introducing is belonged between two services in a domain, and its away from
From concept, there is provided weigh the quantitative target of the communication overhead of service, foundation provided for services selection；
2) the communication overhead weight coefficient between each link is distributed according to the data volume of each link of service procedure, entirely
The communication overhead of flow not only determines by the communication delay between be in communication with each other two services, the number that also can be specifically communicated
According to the influence of amount, weight coefficient is distributed preferably to reflect the communication of whole flow process by the data volume size in whole flow process
Expense；
3) each in service procedure is treated that the abstract service of selection expands into candidate service, forms digraph, original service
For flow from database D B1, reading database is that a special service is designated as S0, it is serial to call service S1, S2, S3…SM
A total of M candidate service group, finally writes data into DB2, and that write into Databasce is another special service S herein0',
This process is launched into digraph by this method, the abstract service S in each service procedureiAll with its candidate service group generation
Replace, it is assumed that each service group has N number of candidate service, then i-th of candidate service group can Si1, Si2, Si3…SiNRepresent, often
Individual candidate service is all a node on figure, each candidate service SijAll and S(i+1)kConnection, wherein j=1,2,3 ... N, k
=1,2,3,4 ... N form digraph, along with S0And S0', formed and entirely schemed, each edge length on figure is all by corresponding unit
Communication for service expense and the product of weight coefficient determine；
4) find out from first service to last one service shortest path, using the candidate service passed through on shortest path as
The service of selection.
2. location Based service system of selection according to claim 1, it is characterised in that figure is utilized in the step 4)
Shortest path first determine from S0To S0' the most short paths of the length of side, each candidate service passed through on path is optimal
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 CN104253830A (en) | 2014-12-31 |
| CN104253830B true 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) |
Families Citing this family (4)
| 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 |
| CN104581788B (en) * | 2015-01-26 | 2018-09-14 | 中国科学院微电子研究所 | Multi-user services selection method and system |
| CN104780061B (en) * | 2015-03-10 | 2018-05-29 | 浙江大学 | A kind of communication-cost Forecasting Methodology based on daily record |
| CN110896344B (en) * | 2019-11-15 | 2021-03-19 | 北京邮电大学 | Redundant service deployment method and device |
Citations (4)
| 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 |
| 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 |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7596583B2 (en) * | 2007-03-29 | 2009-09-29 | International Business Machines Corporation | Dynamic learning in redesigning a composition of web services |
-
2013
- 2013-06-26 CN CN201310258396.5A patent/CN104253830B/en active Active
Patent Citations (4)
| 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 |
| 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 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104253830A (en) | 2014-12-31 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105224606B (en) | A kind of processing method and processing device of user identifier | |
| CN104683488B (en) | Streaming computing system and its dispatching method and device | |
| CN105550268B (en) | Big data process modeling analysis engine | |
| CN104965761B (en) | A kind of more granularity divisions of string routine based on GPU/CPU mixed architectures and dispatching method | |
| CN104253830B (en) | A kind of location Based service system of selection | |
| CN110348571A (en) | A kind of neural network model training method, device, chip and system | |
| CN110263938A (en) | Method and apparatus for generating information | |
| CN104281611A (en) | User flow distribution method and device in website testing system | |
| CN107395674A (en) | A kind of application system accesses the method and device of isomery block platform chain | |
| CN102855153B (en) | Towards the stream compile optimization method of chip polycaryon processor | |
| CN106648556A (en) | Front end and back end integrated development testing method and device | |
| CN103873318A (en) | Website automated testing method and automated testing system | |
| CN109976915A (en) | The optimization method and system of side cloud coordination requirement based on edge calculations | |
| CN109791492A (en) | Assembly line association tree query optimizer and scheduler | |
| CN105471770B (en) | A kind of message processing method and device based on multi-core processor | |
| CN110375728A (en) | A kind of GYK railcar air navigation aid and system based on chart database | |
| CN110335165A (en) | A kind of link prediction method and apparatus | |
| CN107168795B (en) | Codon deviation factor model method based on CPU-GPU isomery combined type parallel computation frame | |
| CN110046636A (en) | Prediction technique of classifying and device, prediction model training method and device | |
| CN102855278B (en) | A kind of emulation mode and system | |
| CN107316246A (en) | A kind of method for digging of social networks key user | |
| CN103605573A (en) | Reconfigurable architecture mapping decision-making method based on expense calculation | |
| Heiland et al. | Design Patterns for AI-based Systems: A Multivocal Literature Review and Pattern Repository | |
| CN102567845B (en) | Online migration method and equipment for running example during combined service evolution | |
| CN106296420A (en) | A kind of community discovery method |
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 |