EP1901191B1 - Method and system for administration of licences - Google Patents

Description

The invention relates to a computer-implemented method for managing licenses according to the preamble of patent claim 1 and an arrangement according to claim 10 for carrying out the computer-implemented method.

In the case of technical devices and arrangements, it often happens that a license for the use of a resource must be available. Thus, for example, with the acquisition of a data carrier with a computer program is not automatically associated with the "permission" to use this computer program. Another common example of the use of licenses is modern communication systems, which are factory-equipped with a certain number of resources, such as interfaces, channels, services, etc. A number of licenses acquired by a user determines the extent to which the resources provided by the manufacturer may be used. The term "resource" is to be seen in the context of this patent application very far and refers to any technical device, service, function, computer program o. Ä., The use of a license for use, ie a license requires.

Ideally, a manufacturer will provide its customers with as many resources with the same number of licenses as it needs to meet the customer's actual needs. In the example of the communication systems that would mean that a customer for the operation of twenty extensions also receives a communication system with twenty subscriber interfaces and of course a license to operate the twenty subscriber interfaces (and thus the use of 20 channels). In this example, however, this has the disadvantage that as the customer's demand increases, both individual resources (here: physical subscriber interfaces) as well as the operating licenses necessary for the operation must be retrofitted. This is both logistically and technically unfavorable. As a result, technical equipment, including the communications equipment under consideration, is often "oversized" in terms of resources, ie, for example, twenty or thirty resources (subscriber lines) are supplied instead of the originally required twenty resources, but only twenty licenses. For an extension of the telecommunications system then only the acquisition of additional licenses and the associated "activation" of already vorgeleisteten additional resources is required. Another example is computer programs that are distributed in a full version on a disk or even can be downloaded from the Internet, but their use requires the purchase of a so-called "installation key" and thus the purchase of a license required do. Depending on the activation code (type of license), a more or less large range of functions of the computer program is activated for the customer. This means that in this example too, the resources (here: functions of the computer program) are present (pre-led) to the customer from the outset, but their use can only take place with the grant of a license. In short, the use of licenses is an instrument to release or block services, resources as needed.

As an example of a license-based usage scenario, a communication network with three communication nodes is now assumed, wherein a license must be present in each communication node for the purpose of using each channel (that is to say, for example, for each telephone call). For example, if thirty terminals are connected to each of the three communication systems, thirty licenses may be awarded for each communication system. This would have the advantage that there are enough licenses for the resources (here: channels) always and in every communication system, even if all participants are telephoning at the same time, kidney, that is, use their resources. However, such a constellation would have the disadvantage for the operator of the communications network of having to acquire ninety licenses, although it is highly unlikely that in fact all ninety subscribers will make calls at the same time and thus most likely not need to acquire such a high license count. To solve the problem, of course, the license number for each communication system can be reduced, for example, halved. However, it may then happen that, for example, in a first of the communication systems the number of granted licenses is insufficient, while in another of the communication systems free, unused licenses are available. This would mean that a function is not possible due to "license deficiencies" in a first location, although in total enough licenses are available.

To solve this "distribution problem", it is known to use flexible licenses always exactly where they are needed right now; One speaks of a "floating licenses" concept or also of a "central licensing". This is usually done by using a central instance, a so-called "licensing server", on which all available (releasable) licenses for the network or arrangement are stored. As soon as a resource is to be used (in the above example, this means: as soon as a channel is to be used), this resource or the technical equipment that makes this resource available (here: communication system) establishes a connection to the license server and obtain a free license from it for the duration of use. As soon as the resource is no longer used, this license is released by a renewed exchange of data with the license server, so that this license is available again to the other resources. This procedure has the advantage that not every communication system of the network has a maximum number of licenses for security reasons, ie in the event of an unusually high utilization but the available licenses can be used flexibly for different resources or in different places. The disadvantage of the described method, however, is that the network load in a network increases due to the constant allocation and re-release of licenses. In addition, in the event of a malfunction or unavailability of the central license server, the functionality of the entire network can be greatly restricted.

From the publication WO 01/18710 A2 - Redding et al "License Management System and Method with Multiple License Servers" is an arrangement in which license management is performed by a distributed system according to a method according to the preamble of claim 1. In this case, subordinate license issue instances (clients) and higher-level license issue instances (servers) are provided, whereby in cases in which one of the clients lacks licenses, these can be retrieved (borrowed) by means of one server from another of the clients.

Also the publication US Pat. No. 6,859,792 B1 - Marjadi et al "Product suite licensing method" shows a process for managing licenses for software products. It is intended to grant users licenses for software packages, such a software package consists of a variety of individual applications. In this case, each of the individual applications is assigned a score of required license points, for each used application, the corresponding number of points from a points account of the user is deducted or re-booked at the end of use. The commissioning of an application is only possible if the points account of the user has a sufficient points credit.

It is therefore an object of the present invention to make the assignment of licenses to resources more flexible and even in the event of a disruption or unavailability of the central one License servers to improve the operational reliability of centralized licensing orders.

The object is achieved by a computer-implemented method according to the patent claim 1 and by an arrangement according to the patent claim 10.

The solution of the task provides a method for the management of licenses, wherein for the use of a resource that resource is assigned a license, and this license is released after use of the resource. In this case, the number of releasable licenses is registered in a first central instance, the resource to be used is assigned by a second instance a registered in this releasable license for use and / or one of these second instance of the resource assigned license is when not in use in the second instance again registered as a releasable. In a synchronization step, the difference from the number of licenses issued since a previous synchronization step for use and released again in this time period is repeatedly reported by the second instance to the first instance, the number of times in the first instance being used according to this difference Instance of registered releasable licenses is reduced, and conversely the resulting number of releasable licenses from the first instance to the second instance is reported and registered there as a number of releasable licenses. This procedure ensures that in the second instance, after completion of the synchronization step, the releasable licenses currently available in an array are available, with several second instances being provided and the synchronization step being performed successively with each of the second instances. Thus, after completion of each synchronization step in the majority of second instances, the releasable licenses are fully available for each of these second instances. This means that every second instance can access all releasable licenses be in which the connection to the first instance (central instance) is not possible or only to a limited extent, the synchronization steps are repeatedly executed in a given time frame.

The solution to the problem further provides an arrangement for carrying out the above-described computer-implemented method, which has a first instance and a plurality of second instances.

In particular, the arrangement according to the invention has a plurality of resources, wherein for the use of a resource it is assigned a respective license for the duration of its use. Means are provided for assigning one of these licenses to a resource to be used from a reserve of releasable licenses and, after using the resource, reassigning the no longer required license to the supply. The arrangement is provided with a first instance, with a first database for registering the releasable licenses. Furthermore, the arrangement is provided with a plurality of second instances, with second databases for the administration of the releasable licenses, wherein the second entities are set up to perform a synchronization step with the first entity and wherein the second entities assign licenses to the resources and set up for the re-release of unused licenses. The first instance and the second instances are set such that when performing a synchronization step between the first instance and one of the second instances in each case in a first sub-step by the second instance to the first instance at least the difference from the number since the number of licenses issued since the last sync and the number of licenses released since the last sync. The instances are further set up so that in a second sub-step of the synchronization by the central entity, the number of releasable licenses registered there is reduced by the reported difference is increased, and in a third step by the central entity to the second instance, the so newly determined number of releasable licenses is transmitted, the second instance is set such that this newly determined number of releasable licenses in the second instance to the site the previously registered number of releasable licenses occurs. Such an arrangement advantageously ensures that the reaction time between requesting a license and allocating a license to a resource is reduced because a connection to a central license server, ie the first instance, is not established for each license assignment must become. In addition, in such an arrangement, the releasable licenses are simultaneously available to all second instances, with the means for the synchronization step accomplishing the goal of matching the databases of the second instances with the first instance respectively. In such an arrangement, it is also possible, in the case of "load peaks", to license a large number of resources even if only a few releasable licenses are available in the overall arrangement. This avoids the need to maintain an unnecessarily high number of releasable licenses in the overall arrangement for security reasons.

Advantageous embodiments of the method according to the invention are specified in the dependent claims. The features and advantages shown are mutatis mutandis to apply to the inventive arrangement.

Since the synchronization step is performed successively with each of the second instances, it is statistically ensured that the releasable licenses registered in the second instances correspond to the number of releasable licenses registered in the first instance. If, in the meantime, no releasable licenses are assigned to the resources or licenses are returned from the resources, this corresponds to a twofold increase Synchronization cycle of the value of the releasable licenses stored in every other instance, even the exact value in the first instance. This ensures that, for an overall arrangement, essentially only the number of licenses required in the statistical average must be maintained.

If the resource to be used causes the allocation of a license by a second instance to which this resource is assigned prior to its use or at the beginning of its use, and if so by the second instance, in cases where at least one releasable license exists in the second instance is registered, the resource is assigned this license and this license is blocked for further resources until this license is released by the resource that uses it, it is ensured by a second instance of each releasable license at the same time only is assigned to a single one of the resources, thus avoiding the multiple assignment of a releasable license within one and the same second instance.

It is advantageous if different types of resources are defined, then different license types are defined for the different resource types, and these different types of licenses are managed separately by the first instance and by the second instances. This allows different resources with different licenses to be linked by the same first and second instances.

It is advantageous that, according to the invention, the synchronization step is repeatedly executed in a predetermined time interval. The predetermined time frame can thus directly influence the network load of a network, with shorter synchronization steps shortening the period during which licenses can be released in addition to the actual number of releasable licenses, but also a higher network load due to the synchronization data leads. It is advantageous if in cases where the number of registered releasable licenses in the first instance and / or in at least one of the second instances falls below a predefined threshold value, the synchronization step is performed more frequently than specified in the time frame. This ensures that re-released licenses are reported back to the first instance in the shortest possible time, not only to the second instance to which this license was returned, but also promptly, and thus to be reported again to the subsequently synchronized second instances.

Consistent utilization of the second instances can be achieved by assigning each resource to exactly one of the second instances. Advantageously, additional substitute assignments can be made, which apply in the event that one or more of the second instances fails.

The first instance and / or the second instances may be preset such that for a predefined period of time, the number of licenses in use may exceed the number of registered releasable licenses. As a result, such an arrangement becomes "overload-tolerant", thereby avoiding operational disturbances as a result of non-usable resources at peak loads. If this predefined period of time is the period until the conclusion of the next synchronization step, by entering a single time constant, namely the synchronization distance, the overload behavior of an arrangement according to the invention can be well controlled. Strategies of the so-called "fuzzy logic" can be advantageously used to control the license volume.

Embodiments of the method according to the invention are explained below with reference to the drawings. They also serve to explain an embodiment of the arrangement according to the invention.

Figur 1

eine Anordnung aus mehreren Datenbank-Knoten, mehreren Applikations-Knoten und mehreren Client-Systemen mit Ressourcen,

Figur 2

die Verteilung freigebbarer und allokierter Lizenzen während verschiedener Lastzustände,

Figur 3

in schematischer Darstellung einen Datentransfer während eines Synchronisationsschrittes,

Figur 4

das Hinzufügen freigebbarer Lizenzen zu der Anordnung,

Figur 5

die Situation bei einer Unter-Versorgung mit freigebbaren Lizenzen,

Figur 6

einen Sonderfall mit nur einem Applikations-Knoten, und

Figur 7

ein Szenario mit dem Ausfall eines Applikations-Knotens.

Showing:

FIG. 1

an arrangement of several database nodes, multiple application nodes and multiple client systems with resources,

FIG. 2

the distribution of releasable and allocated licenses during different load conditions,

FIG. 3

a schematic representation of a data transfer during a synchronization step,

FIG. 4

adding releasable licenses to the device,

FIG. 5

the situation of a sub-supply of releasable licenses,

FIG. 6

a special case with only one application node, and

FIG. 7

a scenario with the failure of an application node.

In the FIG. 1 schematically is an arrangement of a network NW (communication network, data network, intranet, Internet, etc.) with database node DBN1, DBN2, DBN3, with application nodes A, B, C, with client systems CL1, CL2 and represented with resources R1A, R1B, R2A, R2B. The components shown here schematically represent a so-called "distributed arrangement"("distributedsystem"), wherein the individual components in the network NW freely "movable", ie at any point, can be arranged. This is especially true for the database nodes DBN1, DBN2, DBN3, which logically form a single database, but physically distributed among different hardware units for reasons of load distribution and redundancy (reliability) are. Likewise, in the FIG. 1 Although the resources R1A, R1B shown as belonging to the client system CL1 - corresponding to the resources R2A, R2B to the client system CL2 -; however, the resources considered here may also be located on different and entirely different hardware platforms.

The resources R1A, R1B, R2A, R2B are functions ("services") that can be used in clients or by clients in the context of the distributed system, which is also known as SOA ("Service Orientated Architecture"). In the present embodiment, these are communication channels that can be occupied in a telephony arrangement; Of course, any other service, any functionality or device can be considered as a "resource". A subscriber must use such a channel for each call that he wants to make to transmit his call. For the use of such a communication channel, a so-called protocol stack (eg a so-called "SIP stack" for the session initiation protocol) is used. However, such a protocol stack may only be used if the license holder grants this protocol stack permission, ie a license to use. In the present exemplary embodiment, it is initially assumed that the operator of the illustrated arrangement has acquired a license for the simultaneous operation of resources R1A, R1B, R2a, R2B. The resources R1A, R1B, R2A, R2B are in the FIG. 1 Representing a much larger number of similar resources (here: protocol stacks) shown.

For the discussion of the method according to the invention or the arrangement according to the invention, it is unimportant in or from which of the client systems CL1, CL2 one of the resources R1A, R1B, R2A, R2B is to be used. For this reason, the resources R1A, R1B, R2A, R2B are not shown further in the following figures. In the following, therefore, the term "resource" is always used generally.

To use a resource requires - as already explained - each a license, while a license at the same time only ever a certain number (here: exactly one) can be assigned using resource. This means that prior to the use or at the beginning of the use of a resource of this resource from a stock of available ("releasable") licenses, one of these licenses must be assigned to the "license pool" after completion of the use of the resource Should be made available. Each resource is assigned to one of the application nodes A, B, C. Each resource to be used obtains from the assigned one of the application nodes A, B, C the necessary license for the duration of use. In this case, either the resource can apply for the license automatically at the application node A, B, C, or else the process of the license allocation can be performed by an external entity (not shown). The administration of the licenses within the application nodes A, B, C is made there in each case by a special computer program, the so-called "resource broker". The central instrument for the administration of licenses, the so-called first instance, will be referred to below as the "resource store"RS; As already described, this first, central instance "resource store" RS can be formed by a multiplicity of database nodes DBN1, DBN2, DBN3. The resource store RS is the central point at which licenses for the use of the resources can be added to or removed from the entire communication arrangement ("deleted"). In the FIGS. 2A to 7 are schematically only the application nodes A, B, C with the there "cached" number of releasable and allocated licenses and (each right in the figure) of the resource store RS shown with the licenses registered there.

In an alternative embodiment, the resources are not located on the client systems CL1, CL2, but on other nodes, for example directly to the application node A, B, C. Of course, in these cases for the subscription or the release of a license, no accesses to the network NW necessary, if the corresponding resource is installed on the same application node A, B, C, on which that of this resource associated resource broker is arranged.

In the following it is assumed that in the resource store RS 20 releasable licenses have been set. For the sake of simplicity, it is assumed that all considered resources require licenses of the same type; otherwise each resource type or each assigned different type of license would have to be considered separately. In the right part of the FIG. 2A For this purpose, the resource store RS is shown schematically, where the indication "Total = 20" means that a total of 20 licenses are managed. The statement "Available = 20" also states that 20 of the managed 20 licenses can be released, ie no license is currently in use.

The resource brokers of the application nodes A, B, C are in the left part of the FIG. 2A shown. These perform a synchronization step with the resource store RS at fixed, configurable time intervals. Furthermore, such a synchronization step is also carried out when each resource broker is switched on again, wherein the resource brokers respectively establish a connection to the resource store RS. In this synchronization step, each resource broker reads the number of releasable licenses (here initially: "Available = 20") from the resource store RS and stores this information. These indications "20" are in the left part of the FIG. 2A each shown.

The following is a time period in which no further synchronization step takes place. During this time period, various resources request licenses from their respective assigned resource brokers. Of course, a resource can fail if a resource broker or in the case of non-accessibility of the corresponding application node A, B, C to another of the resource brokers of another of the application nodes A, B, C. For the resource broker of application node A, five licenses are booked, for application node B three licenses and for application node C no license is initially requested. The resulting condition is in the FIG. 2B shown. In the illustration, the number of licenses allocated since the last synchronization step is entered on the right side of the respective resource broker in the upper column; in the column below it is still, as from the description too FIG. 2A known, the number of releasable licenses listed. This number is initially unaffected by the mere allocation of licenses.

The difference between the number of licenses allocated and the number of licenses that can be released results in the number of licenses that could still be awarded by the respective resource broker; fifteen licenses for application node A, seventeen licenses for application node B, and the original twenty licenses for application node C.

The in the Figure 2C The situation shown results when the resource broker of the application node A is returned a license and that of the application node B two licenses again ("released"). Accordingly, the respectively stored number of allocated licenses is reduced.

The following describes the changes that result as a result of a synchronization cycle. First, the resource broker of the application node B is synchronized. In the present exemplary embodiment, it is left to chance which of the resource brokers synchronizes first, because in the present case it depends on which of the application nodes is switched on first has been. However, a great variety of scenarios and procedures are conceivable for the sequence and frequency of the synchronization steps. The synchronization step of the resource broker of the application node B is in the FIG. 3A shown schematically. In a first sub-step, the corresponding resource broker transmits the balance of the licenses issued by it since the last synchronization step to the resource store RS. Since this is the first synchronization step in the present case, this is equal to the balance since switching on or restarting the resource broker of the application node B. As of this application node B initially three licenses were issued and then two Resources have been decommissioned and two licenses have been returned (released), this balance is "-1". This reduces the number of available, releasable licenses in the resource store RS by 1 to "19"; this value is transmitted in the second sub-step of the synchronization step to the resource broker of the application node B and entered there instead of the "20" as a new value for the number of releasable licenses. At the same time, the new "balance" for the number of released licenses in this resource broker is reset to zero because the resource broker is now fully synchronized.

In the FIG. 3B it is shown how the next resource broker of the application node C is synchronized. As a result, there is also a new value "19" for the number of licenses available for release. Finally, the resource broker of the application node A is also synchronized; this process is in the FIG. 3C shown schematically. In the Figures 3A, 3B and 3C It can be seen that the resource store RS records the ("booked") number of licenses issued by each resource broker. It follows that in addition to the total number of licenses ("Total = 20"), the number of available licenses ("Available = 15") in FIG. 3C must be stored; this value can be based on the total number and the individual values ("Booked A = 4, B = 1, C = 0") can also be recalculated at any time. In the FIG. 3C It can be seen that, due to the four licenses assigned by the resource broker of the application node A, both the number of releasable licenses in the resource store RS and the corresponding value in the resource broker of the application node A newly set to "fifteen". This value initially remains at the value of "19" for the other resource brokers because there has not yet been a resync step performed there. This means that there are still nineteen licenses available for these two remaining resource brokers, although of the total number "20" there are actually only fifteen licenses remaining. This condition persists until that in the Figures 3D and 3E shown synchronization steps have been performed. In the meantime, there is the possibility that more than the "allowed" twenty licenses will be awarded. In the meantime, if no resources are allocated or released, and thus the allocations associated with these resources will be allocated or released, it will take a maximum of two complete synchronization cycles until all resource brokers are fully synchronized with the resource store RS. In the meantime, more resources can be used than provided by the total number of releasable licenses without denying a resource a license.

In the FIG. 4 a scenario is presented in which at first twenty licenses are stored in total in the resource store RS, of which six are still available ("available = 6"). In the event that the operator of the arrangement acquires ten more licenses, these ten licenses are only re-registered in one place, namely in the resource store RS. This increases the number of licenses to thirty ("Total = 30"), after which the number of releasable licenses is recalculated ("Available = 16"). This number is transferred to the respective synchronized resource broker at each subsequent synchronization step. Corresponding This is done if licenses are withdrawn from the network or arrangement. It should be noted that as a result of the procedure described by repeated synchronization cycles on a statistical average, all resource brokers have the same number of releasable licenses, irrespective of how many licenses have already been assigned or recovered by the respective resource broker. Alternatively, instructions can also be inserted in the resource store RS, which cause an uneven distribution of the releasable licenses, for example, depending on authorizations assigned to the various application nodes or their users.

The method described is known to have the advantage that in each application node A, B, C or each resource broker in each case a high number, in the ideal case even in each case the actual number of releasable licenses available, without that for the award licenses must be established in each case a connection to the resource store RS. The granting of licenses and the release of licenses can therefore be carried out quickly and safely. In addition, it ensures that in cases where ever releasable licenses are present in the overall arrangement, licenses can be freely distributed anywhere in the framework of this number and thus "cushioned" peak loads that can exceed the total number of licenses , This means, on the one hand, that the number of licenses to be kept in the system need not be much higher than the number of licenses required on average, without losing the ability to handle peak loads. On the other hand, this has the disadvantage that in the extreme case ("worst case scenario") the number of allocated licenses can even exceed a multiple of the total number of available licenses (releasable licenses), depending on the number of resource brokers, depending on the time interval for the synchronization steps or synchronization cycles and the usage behavior (ie the allocation of resources).

In the FIG. 5A is the starting point for such a "worst case" scenario shown. The total number of releasable licenses has been reduced to three ("total = 20") available licenses ("available = 3") because there are a total of seventeen licenses allocated. In addition, the resource brokers of the application nodes A and B have each awarded a further license, so that - theoretically - only one license may be assigned network-wide. Nevertheless, the resource broker of application node A can still book two licenses, in case B two more licenses and in the case of application node C three licenses. Assuming that such license requirements actually take place before the next synchronization steps, the result after the next two synchronization cycles, ie in the state of a complete synchronization, in the FIG. 5B illustrated state. The number of available licenses ("Available = -4") is negative ("-4") both in the resource store RS and in the individual resource brokers. The method can respond to this condition through various strategies; In this embodiment, several strategies are used. A first reaction possibility is that the synchronization of the resource brokers is carried out more frequently, so that any licenses released in the meantime can be used system-wide as quickly as possible. However, instead of a shortened time interval for the synchronization steps, the resource brokers of the application nodes A, B, C can also be set so that any released license is immediately reported to the resource store RS. Furthermore, the resource brokers can be set so that licenses are only issued if a positive value for the releasable licenses is stored in the respective resource brokers. Alternatively, however, the resource brokers can also be set in such a way that "non-existent" licenses can be allocated within predetermined limits and for a given "tolerance time". In the worst case, so for example shortly after a system start, linked to a long sync interval and a maximum Network load, the number of "over-allocated" licenses can reach the number of application nodes multiplied by the total number of licenses minus 1.

In the FIG. 6 is shown not belonging to the invention special case in which there is exactly one resource broker. In such a case, the synchronization process is only needed to make newly added licenses available to the resource store RS or to remove these removed licenses from the resource broker. The "tolerance mechanisms" described last, which ensure that even with long synchronization cycles that all "purchased" licenses can actually be awarded to the resource broker, are not necessary in this scenario.

Finally, in the FIG. 7 the case is shown in which an application node B and thus the resource broker installed there fails. In the FIG. 7 it can be seen that the resource broker of the application node B has provided another resource with another license before its failure and after the last synchronization step; this shows the number "-1" in the upper column of the middle block in the figure. At the time of the failure, the information is present in the resource store that five licenses are allocated in application node B, because this corresponds to the state of affairs of the last synchronization.

The failure of the application node B is registered by a monitoring device (watchdog). The registration of the failure can lead to various reactions, for example, the monitoring device can try to restart the application node B. If this attempt is unsuccessful, it is assumed that the resources managed by B are also unreachable or failed. This assessment is particularly realistic in cases where a resource renews or validates a license in use at periodic intervals got to. In the light of this assumption, the number of booked licenses "Booked B = 5" allocated in the resource store RS to the application node B is deleted; the allocated licenses will be released in the overall system. After the next complete synchronization cycle, these licenses will be available to the resource brokers of application nodes A and C again. The above-described possibility that resources in the case of failure of a resource broker or the associated hardware direct their license requests to other resource brokers, leads to an automatic "load balancing", ie an automatic new load distribution, where all further license requests are directed to the resource brokers of the application nodes A and C. This happens until the resource broker of the application node B is reachable again; During the next synchronization cycles and during the subsequent next resource allocations and resource releases and the associated allocation and release actions for the licenses, the license distribution in the overall system will "settle" again into a normal state.

The measures described above ensure that even with individual failures of application nodes A, B, C and / or the resource store RS, a largely trouble-free further operation of resources is ensured. In addition, the concept of decentralized licensing avoids frequent data exchange with a central instance (here: resource store RS), which further minimizes network load.

Claims (10)

1. Computer-implemented method for the administration of licences in a network (NW) with a first instance (RS) and at least one second instance (A, B, C), wherein for the use of one resource (R1A, R1B, R2A, R2B) from a plurality of resources (R1A, R1B, R2A, R2B) this resource (R1A, R1B, R2A, R2B) is assigned one licence from a plurality of licences, the licence is approved again after use of the resource (R1A, R1B, R2A, R2B), the number of approvable licences is registered in the first instance (RS), the resource (R1A, R1B, R2A, R2B) to be used is assigned by the at least one second instance (A, B, C) an approvable licence registered in it for use and / or a licence assigned to the resource (R1A, R1B, R2A, R2B) by one of these second instances (A, B, C) is registered in the second instance (A, B, C) as approvable again if it is not used, and in a synchronisation step the difference from the number of the licences awarded for use since a preceding synchronisation step and the licences approved again in this time by the second instance (A, B, C) is reported to the first instance (RS), wherein according to this difference the number of the approvable licences registered in the first instance (RS) is reduced, and vice versa the resulting number of approvable licences is reported by the first instance (RS) to the second instance and registered there as the number of approvable licences, and wherein several second instances (A, B, C) are provided and the synchronisation step is carried out repeatedly in turn with each of the second instances (A, B, C), characterised in that after the end of each synchronisation step each of the second instances (A, B, C) approves all the currently approvable licences registered in them upon request even in cases in which the connection to the first instance (RS) is not possible or is only possible to a limited extent, and the synchronisation steps are carried out repeatedly in a specified time reference.
2. Method according to claim 1 characterised in that, by the resource (R1A, R1B, R2A, R2B) to be used, before its use or at the start of its use, the issue of a licence is prompted by a second instance (A, B, C) to which this resource (R1A, R1B, R2A, R2B) is assigned, wherein in cases in which at least one approvable licence is registered in the second instance by the second instance (A, B, C), this licence is assigned to the resource (R1A, R1B, R2A, R2B) and this licence is blocked for further resources (R1A, R1B, R2A, R2B) until this licence is approved again by the resource (R1A, R1B, R2A, R2B) using it.
3. Method according to any one of the preceding claims characterised in that different types of resources (R1A, R1B, R2A, R2B) are defined, wherein for the different resource types difference licence types are defined and the licences of different types are each administered separately from each other by the first instance (RS) and by the second instances (A, B, C).
4. Method according to claim 1 characterised in that in cases in which the number of registered approvable licences in the first instance (RS) and / or in at least one of the second instances (A, B, C) is below a pre-defined threshold, the synchronisation step is carried out more frequently than specified in the time reference.
5. Method according to any one of the preceding claims characterised in that each resource (R1A, R1B, R2A, R2B) is assigned precisely to one of the second instances (A, B, C).
6. Method according to claim 5 characterised in that in cases in which one of the second instances (A, B, C) is not functioning and / or is not accessible, the resources (R1A, R1B, R2A, R2B) assigned to this second instance (A, B, C) are assigned to another of the second instances (A, B, C).
7. Method according to any one of the preceding claims characterised in that the first instance (RS) and / or the second instances (A, B, C) are pre-set such that for a pre-defined period the number of licences in use can exceed the number of registered approvable licences.
8. Method according to claim 7 characterised in that the pre-defined period is the period up to the end of the next synchronisation step.
9. Method according to claim 7 or 8 characterised in that the number of the licences in use which exceeds the number of approvable licences is specified.
10. Arrangement for carrying out a computer-implemented method according to one of the foregoing claims, having a first instance (RS) and a plurality of second instances (A, B, C).

Images