Search Images Maps Play YouTube News Gmail Drive More »
Sign in
Screen reader users: click this link for accessible mode. Accessible mode has the same essential features but works better with your reader.

Patents

  1. Advanced Patent Search
Publication numberUS20060247937 A1
Publication typeApplication
Application numberUS 11/116,717
Publication dateNov 2, 2006
Filing dateApr 28, 2005
Priority dateApr 28, 2005
Also published asUS8738779, US20080243535
Publication number11116717, 116717, US 2006/0247937 A1, US 2006/247937 A1, US 20060247937 A1, US 20060247937A1, US 2006247937 A1, US 2006247937A1, US-A1-20060247937, US-A1-2006247937, US2006/0247937A1, US2006/247937A1, US20060247937 A1, US20060247937A1, US2006247937 A1, US2006247937A1
InventorsCarl Binding, Francois Dolivo, Reto Hermann, Christian Hoertnagl, Andreas Schade
Original AssigneeInternational Business Machines Corporation
Export CitationBiBTeX, EndNote, RefMan
External Links: USPTO, USPTO Assignment, Espacenet
Method and apparatus for a context-based service look up
US 20060247937 A1
Abstract
The present invention relates to a context-based service look up, wherein a service instance, having a scope (O), comprises at least one service instance data set (b) having a hierarchy of levels. A service consumer data set (a), having a hierarchy of levels is received from a service consumer (1), having a situation (S). Comparisons are made of each service consumer data set with each service instance data set, for the same level. Dependent on results of the comparisons, it is determined whether said situation (S) of said service consumer (1) matches said scope (O) of said service instance.
Images(3)
Previous page
Next page
Claims(21)
1. Method for a context-based service lookup, wherein a service instance, having a scope (Ω), comprises at least one service instance data set (b) having a hierarchical state structure, with each state of each hierarchy level being contained in the respective higher-level state of the hierarchy, wherein the method comprises:
a reception step for receiving from a service consumer (1), having a situation (Σ), at least one service consumer data set (a) having said hierarchical state structure, and wherein said service instance data set (b) contains an amount (m) of state levels independent from an amount (n) of levels contained in said service consumer data set (a),
a comparison step for comparing each service consumer data set (a) with each service instance data set (b) by performing comparisons of the respective state values (v, w) of states of the same level of hierarchy,
an aggregation step for aggregating the results of the comparisons
a determining step for determining, depending on the aggregate results, whether said situation (Σ) of said service consumer (1) matches said scope (Ω) of said service instance.
2. Method according to claim 1, wherein the comparison step comprises comparing the respective state values (v, w) of states of the same level of hierarchy starting with the highest level in the hierarchy and then going down the hierarchy until the lowest level state in the hierarchy of either of said service consumer data set (a) or said service instance data set (b) has been compared.
3. Method according to claim 1, further comprising an assignment step of assigning a match value (MATCH) to a compare variable (COMP_V), if said state values (v, w) of said respective states of the same level in the hierarchy of said service consumer data set (a) and said service instance data set (b) match each other or if both have a wild card value (*) or if only said state value (w) of said respective state of said service instance data set (b) has said wild card value (*).
4. Method according to claim 3, further comprising an accumulation step for accumulating said results of the comparisons by first initializing an accumulation variable (ACC_V) with said match value (MATCH), second keeping said match value (MATCH) for the accumulation variable (ACC_V) only as long as while going down the state hierarchy, said compare variable (COMP_V) has said match value (MATCH).
5. Method according to claim 4, wherein the aggregation step further comprises first initializing an aggregation variable (AGG_V) with said match value (MATCH) and second, keeping said match value (MATCH) of said aggregation variable (AGG_V) only as long as said accumulation variable (ACC_V) has said match value (MATCH) after said comparison of the respective service consumer data set (a) with the respective service instance data set (b).
6. Method according to one of the claim 3, wherein the aggregation step further comprises assigning a partial match value (PARTIAL) to said compare variable (COMP_V), if only said state value (v) of said respective state of said service consumer data set (a) has said wildcard value (*).
7. Method according to claim 6, wherein the aggregation step further comprises assigning said partial match value (PARTIAL) to said accumulation variable (ACC_V), if, while going down said state hierarchy the compare variable (COMP_V) has said match value (MATCH) or said partial match value (PARTIAL) and said accumulation variable (ACC_V) has said match value (MATCH) or said partial match value (PARTIAL).
8. Method according to claim 7, wherein the aggregation step further comprises assigning said partial match value (PARTIAL) to said aggregation variable (AGG_V), if, while aggregating said results of said comparison of each respective service consumer data set (a) with each respective service instance data set (b):
said aggregation variable (AGG_V) has said match value (MATCH) and said accumulation value (ACC_V) has said partial match value (PARTIAL) or a fail value (FAIL) or
said aggregation variable (AGG_V) has said partial match value (PARTIAL) or
said aggregation variable (AGG_V) has said fail value (FAIL) and said accumulation variable (ACC_V) has said match value (MATCH) or said partial-match value (PARTIAL), and otherwise assigning to said aggregation variable (AGG_V) said fail value (FAIL).
9. Method according to claim 1, wherein said states are locations or time intervals.
10. Apparatus for a context-based service lookup, the apparatus comprising:
a service instance, having a scope (Ω), comprising at least one service instance data set (b) having a hierarchical state structure, with each state of each hierarchy level being contained in the respective higher level state of hierarchy, and
wherein the apparatus is designed to receive from a service consumer (1), having a situation (Σ), at least one service consumer data set (a) having said hierarchical state structure, and
said service instance data set (b) contains an amount (m) of hierarchy levels which are independent from an amount (n) of hierarchy levels contained in said service consumer data set (a), and
wherein the apparatus is further designed to perform comparisons of each service consumer data set (a) with each service instance data set (b) by comparing the respective state values (v, w) of states of the same hierarchy level, and aggregate the results of the comparisons, and determine, depending on the aggregate results, whether said situation (Σ) of said service consumer (1) matches said scope (Ω) of said service instance.
11. Apparatus according to claim 10, wherein said comparing of the respective state values (v, w) of states of the same hierarchy level, comprises starting with the highest level in hierarchy and then going down the hierarchy until the lowest level in hierarchy state of either of said service consumer data set (a) or said service instance data set (b) has been compared.
12. Apparatus according to claim 10, designed to assign a match value (MATCH) to a compare variable (COMP_V), if said state values (v, w) of said respective states of the same hierarchy of said service consumer data set (a) and said service instance data set (b) match each other or if both have a wild card value (*) or if only said state value (w) of said respective state of said service instance data set (b) has said wild card value (*).
13. Apparatus according to claim 12, designed to accumulate said comparison results by first initializing an accumulation variable (ACC_V) with said match value (MATCH), second keeping said match value (MATCH) for the accumulation variable (ACC_V) only as long as while going down the state hierarchy, said compare variable (COMP_V) has said match value (MATCH).
14. Apparatus according to claim 13, designed to aggregate the results of the comparison of each respective service consumer data set (a) with each respective service instance data set (b) by first initializing an aggregation variable (AGG_V) with said match value (MATCH), second keeping said match value (MATCH) of said aggregation variable (AGG_V) only as long as said accumulation variable (ACC_V) has said match value (MATCH) after said comparison of the respective service consumer data set (a) with the respective service instance data set (b).
15. Apparatus according to claim 12, designed to assign a partial match value (PARTIAL) to said compare variable (COMP_V), if only said state value (v) of said respective state of said service consumer data set (a) has said wildcard value (*).
16. Apparatus according to claim 15, designed to assign said partial match value (PARTIAL) to said accumulation variable (ACC_V), if, while going down said state hierarchy, the compare variable (COMP_V) has said match value (MATCH) or said partial match value (PARTIAL) and said accumulation variable (ACC_V) has said match value (MATCH) or said partial match value (PARTIAL).
17. Apparatus according to claim 16, designed to assign said partial match value (PARTIAL) to said aggregation variable (AGG_V), if, while aggregating said results of said full comparison of each respective service consumer data set (a) with each respective service instance data set (b):
said aggregation variable (AGG_V) has said match value (MATCH) and said accumulation value (ACC_V) has said partial match value (PARTIAL) or a fail value (FAIL) or
said aggregation variable (AGG_V) has said partial match value (PARTIAL) or
said aggregation variable (AGG_V) has said fail value (FAIL) and said accumulation variable (ACC_V) has said match value (MATCH) or said partial match value (PARTIAL), and otherwise assigning to said aggregation variable (AGG_V) said fail value (FAIL).
18. Apparatus according to claim 10, wherein said states are locations or time intervals.
19. A computer program element comprising a computer program code means which, when loaded in a processor of a data processing system, configures the processor to perform a method comprising the steps recited in claims 1-9.
20. A storage medium encoded with machine-readable program code for a context-based service look up, said program code including instructions for causing a server to implement a method, comprising the steps recited in claims 1-9.
21. A method of equipping a client system with a context-based service lookup comprising the steps of:
providing the system with a capability to
compare each service consumer data set (a) of a service consumer with each service instance data set (b) of a service instance by comparing respective state values (v, w) of states of the same level of hierarchy of said service consumer data set (a) or said service instance data set (b), starting with the highest level in the hierarchy and then going down the hierarchy,
aggregate the results of the comparisons of each respective service consumer data set (a) with each respective service instance data set (b) and
determine, depending on the aggregate results, whether a situation (Σ) of said service consumer (1) matches a scope (Ω) of said service instance.
Description
TECHNICAL FIELD

The present invention relates to a method for a context-based service look up. It further relates to an apparatus for a context-based service look up.

BACKGROUND OF THE INVENTION

More and more mobile computing devices become commonplace in every day life. Such mobile computing devices include cell phones, personal digital assistance (PDA) and notebooks all of which have achieved a high penetration rate in modern society. With such mobile computing devices it has become of interest to discover computing services, for example, in the geographical vicinity of the current location of the mobile computing device. In this respect context-based services may be, for example, location-based services or, for example, time-based services. Location-based services include printing services, weather forecast applications, travel guidance, assistance and emergency services for example.

Context-based service look up takes place in a system comprising a service consumer being represented by, for example, a mobile computing device, further comprising a service provider and a registry server. The service consumer looks up services in the registry server and consumes service functionality by invoking operations on a service instance. The service provider publishes service instances on the registry server for look up.

A service is an abstract entity encapsulating functional behaviour accessible via a well-defined service interface. A service has a service type, which defines a set of named operations, the generic semantics, and the abstract input and output messages.

A service instance is a concrete entity implementing a service. Associated with a service instance is a set of attributes describing additional aspects of the service. Binding information is a set of mandatory attributes and describes the service instances, for example an access point in terms of network address, protocol and messages format. Additional attributes may be service qualifiers, which further differentiate service instances.

The service consumer looking up a service is situated in some context. This context may be expressed by a set of attributes, which may be referred to as context qualifiers. The set of all context qualifiers applicable to the service consumer is its situation. The set of all context qualifiers applicable to a particular service instance is the service instance's scope.

Context-based service look up is the process of matching a service consumer's situation with the published service instances' scopes. A match occurs, if the service consumer situation is within a service instance's scope.

Under “http://www.cs.usy.ac.cy/courses/EPL603/gini-3.ppt” a presentation is made available to the public concerning the matching of object-oriented data structures, in particular Java objects. It discloses an example printer attribute location (floor, “3”, “1234”, building “A1”).

It is a challenge to provide a method for a context-based service look up, which enables an efficient context-based service look up. It is further a challenge to provide a device for a context-based service look up which enables an efficient context-based service look up.

SUMMARY OF THE INVENTION

According to one aspect of the invention there is a method for a context-based service lookup, wherein a service instance, having a scope (Ω), comprises at least one service instance data set (b) having a hierarchical state structure, with each state of each hierarchy level being contained in the respective higher-level state of the hierarchy, wherein the method comprises a reception step for receiving from a service consumer (1), having a situation (Σ), at least one service consumer data set (a) having said hierarchical state structure, and wherein said service instance data set (b) contains an amount (m) of state levels independent from an amount (n) of levels contained in said service consumer data set (a), a comparison step for comparing each service consumer data set (a) with each service instance data set (b) by performing comparisons of the respective state values (v, w) of states of the same level of hierarchy, an aggregation step for aggregating the results of the comparisons, a determining step for determining, depending on the aggregate results, whether said situation (Σ) of said service consumer (1) matches said scope (Ω) of said service instance. The hierarchical state structure of the service instance data set and of the service consumer data set makes possible in an easy way an intuitive characterisation of the scope and of the situation, respectively. In addition, it enables a very effective matching of the service consumer's situation with the service instance's scope.

The method is simple to implement without consuming a lot of computational power and requiring complex computational operations, as the main computational task conducted is the comparing operation between the respective state values of states of the same hierarchy of the respective service consumer data set and the respective service instance data set.

In a preferred embodiment of the method, the comparison step comprises comparing the respective state values of states of the same hierarchy level starting with the highest level and then going down the hierarchy until a lowest-level hierarchy state in the service consumer data set or the service instance data set has been compared. This reduces the computational effort, if the amount of state hierarchies contained in the service consumer data set differs from that of the service instance data set.

In a further preferred embodiment the method comprises an assignment step of assigning a match value to a compare variable, if the state values of the respective states of the same level in the hierarchy of the service consumer data set and the service instant data set match each other, if both have a wildcard value, or, if only the state value of the respective state of the service instance data set has the wildcard value. The wildcard value is a value that stands for all possible state values of the respective state. This has the advantage of a shortened context representation and a simple conduction of the comparison.

In a further preferred embodiment of the method an accumulation step comprises accumulating the results of the comparisons by first initializing an accumulation variable with the match value, second keeping the match value for the accumulation variable only as long as the compare-variable has the match value while going down the state hierarchy. This enables a very efficient accumulation.

In a further preferred embodiment of the method the aggregation step further comprises first initialising an aggregation variable with the match value, and second keeping the match value of the aggregation variable only as long as the accumulation variable has the matched value after the full comparison of the respective service consumer data set with the respective service instance data set. This enables a very efficient aggregation of results across multiple datasets of the full comparisons.

In a further preferred embodiment of the method, the aggregation step further comprises assigning a partial match value to the compare variable, if only the state value of respective states of the service consumer data set has the wildcard value. This enables an even more refined matching of the scope and the situation.

According to a further preferred embodiment of the method, the aggregation step further comprises assigning the partial match value to the accumulation variable, if, while going down the state hierarchy, the compare variable has the match value of the partial match value and the accumulation variable has the match value or the partial match value. This also very efficiently allows a more refined matching.

In a further preferred embodiment of the method, the aggregation step further comprises assigning the partial match value to the aggregation variable, if, while aggregating the results of the full comparisons of each respective service consumer data set with each respective service instance data set, the aggregation variable has the match value, the accumulation value has the partial match value or a fail value or the aggregation variable has the partial match value or the aggregation variable has the fail value and the accumulation variable has the match value or the partial match value. Otherwise the aggregation variable is assigned the fail value. This also enables a very efficient refined matching.

In a further preferred embodiment of the method the states are locations. This enables a location based service look up with location as the context in a very efficient way. In a further preferred embodiment of the method the states are time intervals.

According to a second aspect of the invention, an apparatus for a context-based service look up is provided, which corresponds to the method for the context-based service look up and its preferred embodiments. The respective advantages also correspond.

According to a third aspect of the present invention, a computer program element comprising a computer program code, is provided. The computer program element, when loaded in a processor of a data processing system, configures the processor to perform the method for the context-based service look up.

According to a fourth aspect of the present invention, a storage medium encoded with machine-readable program code for a context-based service look up is provided, wherein said program code includes instructions for causing a server to implement the method for the context-based service look up.

According to a fifth aspect of the present invention, there is provided a method of equipping a client system with a context-based service look up, wherein the client system is provided with a capability to compare each service consumer data set (a) of a service consumer with each service instance data set (b) of a service instance by comparing respective state values (v, w) of states of the same level of hierarchy of said service consumer data set (a) or said service instance data set (b), starting with the highest level in the hierarchy and then going down the hierarchy, aggregate the results of the comparisons of each respective service consumer data set (a) with each respective service instance data set (b) and determine, depending on the aggregate results, whether a situation (Σ) of said service consumer (1) matches a scope (Ω) of said service instance.

BRIEF DESCRIPTION OF THE DRAWINGS

The invention and its embodiments will be more fully appreciated by reference to the following detailed description of presently preferred but nonetheless illustrative embodiments in accordance with the present invention when taken in conjunction with the accompanying drawings.

FIG. 1, a system for context-based service look up,

FIG. 2, a flowchart of a program that is stored on a registry server and is run on the registry server,

FIG. 3, an input/output table for a compare function,

FIG. 4, an input/output table for an accumulation function and

FIG. 5, an input/output table for an aggregation function.

DETAILED DESCRIPTION OF THE DRAWINGS

FIG. 1 shows a system for conducting a context-based look up. The system comprises a service consumer which may, for example, be a cell phone, a PDA or a notebook. The system further comprises a service provider, which offers various services referred to as service instances, such as a printing service, weather forecast applications, travel guidance or assistance or emergency services. The service provider 3 is designed for publishing its service instances on the registry server 5 for look up. The context of the service look up is location information in this case for illustrative purposes.

The service consumer may have the need to print out a given document, stored on the service consumer 1, on a printer. The person carrying the service consumer 1 may be interested in printing the document on a nearby printer. The matching of the right printer takes place in the registry server 5 by running the program according to FIG. 2.

The service consumer 1 may be designed for communicating with the registry server 5, for example, via a cell phone connection or a wireless LAN.

Service instances are published on the registry server 5 by the service provider 3. Service instances have a scope Ω. The scope Ω is characterized by at least one service instance data set b having a hierarchical state structure, with each state of each hierarchy-level being fully contained in the respective higher-level state of hierarchy. The service instance is therefore characterized by a set of service instance data sets b1 to by (see FIG. 2). Each of these service instance data sets bk comprises the hierarchical states with given respective state values w which have been marked with indices k1 to km, whereas k is a counter for the respective service instance data set b and m is the amount of state hierarchies of the respective service instance data set b. The exact value of the amount m of state hierarchies of the service instance data set b may vary from each individual service instance data set b to another. The state structure is hierarchical, from which follows that each state of a lower level in the hierarchy is fully contained in the respective state of the higher level in the hierarchy.

The service instance data set may, by way of example, comprise hierarchical symbolic realms classifying, for example, locations on a company campus. Each service instance data set may in that way comprise the states “campus”, “building”, “floor”, and “room”. A specific service instance data set b may, for example, have the state values w of /ZRL/C/3/27 denoting the Zurich laboratory campus of IBM, building C in the campus, third floor of building C, and room No. 27. The state values of another service instance data set b may, for example, be /ZRL/*/*/12 denoting the set of rooms with the number “12” on all floors in all buildings of the Zurich laboratory campus of IBM. Another example for a possible service instance data set b would be in this case /ZRL/C/*/* denoting the entire C building on the Zurich laboratory campus of IBM. Another service instance data set b may, by way of example, have the state values /ZRL/C denoting the entire C building on the IBM Zurich laboratory campus. In this case, the amount m of state hierarchies would only be 2 instead of 4 regarding the previous examples. The scope Ω of the respective service instance may, for example, be characterized by six service instance data sets b having state values being representative for adjacent rooms on the same floor of the same building on the same campus.

The service consumer 1 has its situation, which is characterized by at least one service consumer data set a having the hierarchical state structure. The service instance data set b contains an amount n of state hierarchies independent from the amount m of state hierarchies contained in said service consumer data set a. Therefore, the service consumer 1 is characterized by its situation Σ (FIG. 2), which comprises the service consumer data sets a1 to ax. The respective service consumer data sets ak have allocated state values v, where k denotes the respective service consumer data set and 1 to n the respective state values in the hierarchy, where n is the amount of state hierarchies. The examples given for the service instance data sets b may in part also be valid for the respective service consumer data sets a. The situation Σ of the service consumer may, for example, be characterized by four different room numbers on a given floor of a given building on a given campus and may result from a cell phone receiver being responsible for communicating with all cell phones in these respective rooms or also a wireless LAN station coordinating all wireless LAN connections in these rooms.

The scope Ω with its service instance data sets and also the situation with its service consumer data sets a may, by way of the symbolical hierarchical state structure, be in a simple way allocated with the respective state values w, v as in the case by way of example described above. The respective campus, building, floor, and room may in a simple way be assigned with the respective state values v, w. For that purpose, the service consumer 1 may have a respective man/machine interface for inputting these things. However, it may also comprise, for example, a GPS positioning system for determining the exact geographic location and have then means for translating these geographic coordinates in the respective state values v of the respective service consumer data sets a.

A computer program for matching the service instance with the service consumer in respect of the context based service lookup, is described by the symbolic program code of FIG. 2 and in the following.

The computer program has as input the respective situation Σ of the service consumer 1 and the scope Ω of the respective service instance. In addition to that, it may have as input a partial match enabled flag PME, which when set to TRUE accelerates the computation of the matching result if also a partial match PARTIAL is one of the desired outputs of the program.

The output of the program is an aggregation variable AGG_V, which may have a match value MATCH or the partial match value PARTIAL or a fail value FAIL. In case the aggregation variable AGG_V has as output of the program the match value MATCH, then the situation of the service consumer matches the scope of the service instance. If the output of the program is the fail value FAIL of the aggregation variable AGG_V, then the situation Σ of the service consumer 1 does not match the scope Ω of the service instance. If the output of the program is the partial value PARTIAL of the aggregation variable AGG_V, then the situation Σ of the service consumer 1 matches partially the scope Ω of the service instance. It should be noted that the input parameter PME does not constrain the output of the program to the values MATCH or FAIL. The matching result PARTIAL may be interpreted optimistically as a possible match, or pessimistically as a possible fail.

The program is started then in a line 10, where the aggregation variable AGG_V is initialized with the match value MATCH. In line 12, a first “FOR” loop is started with a counter i being the first time of going through the FOR loop initialized to a value 1 and with the FOR condition being true up to the counter having a value x being the amount of service consumer data sets a characterizing the situation Σ of the service consumer 1. After that, a second FOR loop is included in the first FOR loop comprising a counter j, being initialized with 1 on the first time the four loop is started, that is for every consecutive run through the first FOR loop j is again initialized with 1. The second FOR loop is then run for y times, y being assigned the value of the amount of service instance data sets b characterizing the scope Ω. Within this second FOR loop in line 14, an accumulation variable ACC_V is first initialized with the match value MATCH. Then in line 15, a third FOR loop is started with a counter k being assigned the value 1 and is run until after the counter k has reached a value being characterized by a minimum of the amount n of levels in the state hierarchies of the respective service consumer data set a and the amount m of levels in the state hierarchies of the respective service instance data set b.

Within this third FOR loop first in line 16, a compare variable COMP_V is allocated an output of a compare function COMP_FCT with the inputs of the respective state values Vik, Wjk. The input/output characteristic of the compare function COMP_FCT is shown in the table of FIG. 3. The symbolic star symbolizes a wildcard * meaning, that all state values within the respective state are valid values. A partial match value PARTIAL is assigned to the compare variable COMP_V, if the respective state value wjk of the respective service instance data set bj has a specific value. This is the case as, for example, the wildcard value * may stand for all possible rooms whereas the state value wjk may stand, for example, for room No. 25. In this case, room No. 25 is, of course, one of the rooms covered by the wildcard value * but it may not be the exact location of the service consumer.

In line 17, then the accumulation variable ACC_V is assigned the output of the accumulation function, which has as inputs the compare variable COMP_V and the accumulation variable ACC_V. FIG. 4 shows the resulting outputs of the accumulation function ACC_V depending on the values of the compare variable COMP_V and the accumulation variable ACC_V.

After the third FOR loop, it is checked in line 19 whether the accumulation variable ACC_V has the match value MATCH and the amount n of state hierarchies of the respective service consumer data set a is smaller than the amount m of state hierarchies of the respective service instance data set b. If this is the case, then in line 20 the accumulation variable ACC_V is assigned the partial match value PARTIAL as the respective service instance data set b has a lower resolution (less levels) in its state hierarchy than the respective service consumer data set a and therefore, for example, it is just possible to determine that both match, for example, the Zurich laboratory campus of IBM and the building C. However, the respective service instance may only be available on a specific floor. However, the respective service consumer data set a does not specify the floor.

Then, in line 21, it is checked whether the accumulation variable ACC_V has the match value MATCH or the partial match enable flag PME has the true value TRUE and the accumulation variable ACC_V has the partial match value PARTIAL. In this case, a break is conducted meaning that the second FOR loop is terminated.

After terminating the second FOR loop, the aggregation variable AGG_V is assigned the output of an aggregation function AGG_FCT in line 25. The aggregation function AGG_FCT has as input the accumulation variable ACC_V and the aggregation variable AGG_V. Its output table dependent on the values of its inputs, the accumulation variable ACC_V and the aggregation variable AGG_V are shown in the table of FIG. 5.

When the first FOR loop is then terminated, the then up-to-date value of the aggregation value variable AGG_V is output by the program and is then the result of the whole matching procedure.

The program has the advantage that it is fairly simple and enables a well-structured comparison. In contrast to this, when a purely geographic approach would be taken in which both the current location of the service consumer 1 and the service instance would be given in a global coordinate system such as WGS84, shapes would need to be defined, which may be approximated by a polygon defined by a set of points given as coordinates in the global coordinate system. This geographic approach would probably require a location sensing mechanism that reports its reading with respect to the selected global coordinate system. This is natural for a system such as GPS but requires additional mapping steps if location sensing is based on cell IDs or base station IDs, as available in cellular telephony or local area network systems. The mapping steps would then map the cell or base station ID to the geographic location. Likewise, all service instances would likely be attributed with their service area in the global coordinate system. This probably requires either the capturing of geographic areas in the global coordinate system or the transformation of area maps or floor plans from some local coordinate system to the global geographic coordinate system. The data capture and processing and the data volume would pose severe data management problems. Furthermore, determining inclusion of an arbitrary polygon within another arbitrary polygon usually requires computational geometry, which is costly.

The present invention can be realized in hardware, software, or a combination of hardware and software. Any kind of computer system—or other apparatus adapted for carrying out the method described herein—is suited. A typical combination of hardware and software could be a general purpose computer system with a computer program that, when being loaded and executed, controls the computer system such that it carries out the methods described herein. The present invention can also be embedded in a computer program product, which comprises all the features enabling the implementation of the methods described herein, and which when loaded in a computer system—is able to carry out these methods.

Computer program element or computer program in the present context mean any expression, in any language, code or notation, of a set of instructions intended to cause a system having an information processing capability to perform a particular function either directly or after either or both of the following a) conversion to another language, code or notation; b) reproduction in a different material form.

Referenced by
Citing PatentFiling datePublication dateApplicantTitle
US8185128 *Nov 29, 2006May 22, 2012Qualcomm IncorporatedMethod and apparatus for supporting location services with roaming
US8504064Feb 8, 2012Aug 6, 2013Qualcomm IncorporatedMethod and apparatus for supporting location services with roaming
US8548500Feb 8, 2012Oct 1, 2013Qualcomm IncorporatedMethod and apparatus for supporting location services with roaming
Classifications
U.S. Classification705/1.1
International ClassificationG06Q99/00
Cooperative ClassificationG06F2209/5015, G06F9/5027
European ClassificationG06F9/50A6
Legal Events
DateCodeEventDescription
Jun 7, 2005ASAssignment
Owner name: INTERNATIONAL BUSINESS MACHINES CORPORATION, NEW Y
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:BINDING, CARL;DOLIVO, FRANCOIS BERNARD;HERMANN, RETO JOSEF;AND OTHERS;REEL/FRAME:016307/0176;SIGNING DATES FROM 20040504 TO 20050504