WO2006063623A1 - Method and devices for distributing service requests to service providers - Google Patents

Method and devices for distributing service requests to service providers Download PDF

Info

Publication number
WO2006063623A1
WO2006063623A1 PCT/EP2004/053546 EP2004053546W WO2006063623A1 WO 2006063623 A1 WO2006063623 A1 WO 2006063623A1 EP 2004053546 W EP2004053546 W EP 2004053546W WO 2006063623 A1 WO2006063623 A1 WO 2006063623A1
Authority
WO
WIPO (PCT)
Prior art keywords
value
service
service provider
vector
distribution function
Prior art date
Application number
PCT/EP2004/053546
Other languages
French (fr)
Inventor
Ake Arvidsson
Original Assignee
Telefonaktiebolaget Lm Ericsson (Publ)
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Telefonaktiebolaget Lm Ericsson (Publ) filed Critical Telefonaktiebolaget Lm Ericsson (Publ)
Priority to US11/721,463 priority Critical patent/US8036667B2/en
Priority to EP04804892A priority patent/EP1825649B1/en
Priority to ES04804892T priority patent/ES2329802T3/en
Priority to DE602004022094T priority patent/DE602004022094D1/en
Priority to PCT/EP2004/053546 priority patent/WO2006063623A1/en
Priority to CN2004800446229A priority patent/CN101080912B/en
Publication of WO2006063623A1 publication Critical patent/WO2006063623A1/en

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/40Network security protocols
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/01Protocols
    • H04L67/10Protocols in which an application is distributed across nodes in the network
    • H04L67/1001Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/50Network services
    • H04L67/53Network services using third party service providers

Definitions

  • the present invention relates to a method and devices for distributing service requests to service providers.
  • One example for such request for distribution is the pooling of devices like mobile services switching centre or base station controller.
  • devices with basically the same capabilities although perhaps different capacity are grouped.
  • the pool comprises entities that are similar in a certain respect that is relevant for a connection.
  • speech codecs may differ by the coding schemes they support, by the supplier they originate from and by their capacity, however, they may build a pool if they support the requested coding scheme for a particular connection. If a device from such pool is needed, it has to be selected.
  • IMSI International Mobile Subscriber Identity
  • EMSI div 10 International Mobile Subscriber Identity
  • the hash values between 0 and 999 are then distributed to the respective devices, e.g. mobile services switching centres.
  • this way requires either that each of the IMSI values and any group of IMSI occurs with the same probability.
  • the method has the advantage that only steps that do require a lower number of processor cycles have to be repeated if a system related to the distribution function is modified.
  • the invented method for setting up or adapting a device for distributing service requests to service providers comprises the steps of defining an arbitration vector that comprises at least one element for each element of a result space of a distribution function, defining a preference vector for a service provider, taking a value of the arbitration vector, determining the intended accumulated probabilities of selection for each service provider, wherein each probability is assigned to a respective rage between 0 and 1.
  • It comprises the further steps of determining the range into that the value of the arbitration vector belongs, and the service provider to that the range is assigned, which will be called selected service provider in the following, taking a value from the preference vector assigned to the selected service provider, assigning in the result space of the distribution function an identity of the selected service provider to a value corresponding to the value of the preference vector, and repeating the steps of determining the intended accumulated probabilities, of determining the range, of taking a value from the preference vector, of assigning in the result space, and of taking the next value until each value of the result space is assigned to a service provider.
  • the device for distributing is a device for determining a network node of a pool of network nodes that shall be used when handling a service request.
  • the method may comprise the additional steps of determining that a service provider identity has been already assigned to a value in the result space of the distribution function corresponding to the value taken from the preference vector and selecting a different value from the preference vector.
  • the distribution function can be implemented for example as a hash function and the result space may be a hash table.
  • the arbitration vector is determined only once for a telecommunications network, and the determination of a preference vector is done once for each service provider in a telecommunications network.
  • the distribution function is set-up or adapted by the method.
  • the device further comprises an input randomiser unit for performing a pseudo random function with an identity of a service requesting entity.
  • the randomiser unit can be adapted to scale the result to a range that corresponds with an input value range of the determining function of the determining unit.
  • Fig. 1 depicts a flow of a method according to the invention
  • Fig. 2 depicts a device according to the invention.
  • FIG. 1 depicts a flow of a method according to the invention.
  • the invented method starts in a first step 101.
  • an arbitration vector is defined.
  • the arbitration vector is comprises elements in a range that corresponds to accumulated probabilities.
  • the arbitration vector comprises elements with values between 0 and 1 wherein 0 and 1 may be included.
  • the arbitration vector comprises one element for each result value of the distribution function.
  • the arbitration vector values can be determined for example by means of a PRNG (Pseudo Random Number Generator).
  • PRNG Physical Random Number Generator
  • the first function leads to the following arbitration vector ⁇ 0.40, 0.84, 0.35, 0.45, 0.32, 0.89, 0.02, 0.58, 0.16, 0.38 ⁇ .
  • a preference vector is defined.
  • one preference vector is defined for each service instance.
  • the preference vector comprises a sequence of distribution function values, wherein the sequence reflects an order of preference in which values of the distribution function shall be assigned to a service provider.
  • the preference vector values can be determined for example by means of a PRNG.
  • the preference vector for a service instance is determined once and then kept for said service instance.
  • each preference vector comprises all values of the distribution function, however, not in the same sequence. If the capacities of the different service instances are known, then conflict free preference tables may be generated. However, using an arbitration vector instead of generating conflict free tables has the advantage that the tables do not have to be modified if the number or capacities of service providers change.
  • the function receives an input and generates a result within said result space.
  • it is more particular one of: 0, 1, 2, 3, 4, 5, 6, 7, 8, or 9.
  • Each of these vectors is assigned to a service instance, which is one of the mobile services switching centre MSCl, MSC2, and MSC2.
  • a service instance could be any other entity used for providing a service, in particular any of a pooled device used in a cellular telecommunications network.
  • MSCl For simplicity reasons we assign pvi to MSCl, pv 2 to MSC2 and pv 3 to MSC3.
  • the capacities of the MSCs relate to each other as 1 to 2 to 3.
  • the probability that a device is selected for serving should correspond to its capability; therefore it should be 1/6 for MSCl, 2/6 for MSC2 and 3/6 for MSC3. In a good appreciation it is 17% or 0.17 for MSCl , 0.33 for MSC2 and 0.5 for MSC3.
  • the accumulated probability is then for MSCl 0.17, for MSC3 it is 0.5 that is 0.17 + 0.33; and for MSC3 it is 1 as the sum of 0.17 + 0.33 + 0.5.
  • conflict free preference vectors are generated using the knowledge that for MSCl 2 values often, for MSC3 three values often and five values often for MSC3 should be selected.
  • a value is taken from the arbitration vector.
  • the values of the arbitration vector are taken consecutively from the first to the last value.
  • a step 106 the range is determined, the value of the arbitration vector falls within.
  • Example: the value of 0.40 is above the value of 0.17 but below the value of 0.5, thus it falls into the range of MSC2.
  • a value is selected from the associated preference vector.
  • the values of a preference vector are selected consecutively. Then it is checked whether the respective value is already assigned to a service instance. If it is already assigned, the consecutive value is selected, if not the value is kept.
  • the first value in the preference vector of MSC2 is 6.
  • an identification of the service provider is assigned to the corresponding value of the distribution function.
  • an identification of MSC2 for example an address of MSC2, is assigned to the value 6 of the distribution function.
  • the steps 104 to 108 are repeated until an identity of a service instance is assigned to any of the distribution function values.
  • the next value of the arbitration vector is 0.84, which is above 0.44. Thus a value is selected from the preference vector assigned to MSC3.
  • the first pv3 value is 4. Thus an identity of MSC3 is assigned to the result value 4 of the distribution function.
  • the values of the result space are assigned to MSC IDs as defined after the first two steps is depicted as follows: ⁇ x, x, x, x, 3, x, 2, x, x, x ⁇ .
  • x means not defined
  • 2 is an ID of MSC2
  • 3 is an ID of MSC3
  • the first x represents what is assigned to 0
  • the last one what is assigned to 9.
  • the other determination of the further values is depicted by means of the following table. It depicts in the first three columns the respective accumulated probabilities, in the forth column the respective arbitration vector value. Column five shows the MSC that is assigned to the range the arbitration vector value falls within.
  • Column six comprises the preference vector value of the preference vector, which is the next one to select.
  • the last column comprises the selected value that differs from the preference vector value if the preference vector value has already been assigned to an MSC. This is the case for three values of MSC3. Then the consecutive value is selected, unless, as for 0, with successor 5, this value has also already been assigned, here to MSC2.
  • the method ends in a step 109.
  • the hash table has to be modified. To that end only the steps 104 to 108 have to be repeated. It should be noted that the method for generating a distribution table is deterministic, that is that a given input, like load distribution factors, leads to a particular, reproducible result.
  • Figure 2 depicts a device according to the invention.
  • the device DEV2 for distributing service requests to service providers comprising an input output unit IOU2, a processing unit PU2 and a distribution function DF2.
  • the distribution function is set-up or adapted by a method according to claim 1.
  • the distribution function is a hash function that maps an input value to a result value of 0 to 9.
  • the assignment of hash result value to the three MSCs has been defined with the following vector ⁇ 1, 3, 1, 3, 3, 2, 2, 3, 2, 3 ⁇ as described for figure 1.
  • the device further comprises an input randomiser unit RU2.
  • the unit randomises an input e.g. an identity of a service requester.
  • the input randomiser unit is adapted to scale the result to a range that corresponds with an input value range of the determining function of the determining unit. This increases the randomness of the input value and thus compensates a potential lack of equal distribution of input values.
  • the units and means of the control node, the device and the mobile station can be implemented by means of software, e.g. a software module, hardware, or a combination of both.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer Security & Cryptography (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Telephonic Communication Services (AREA)

Abstract

The invention relates to methods and devices for generating a distribution function. To that end preference vectors are defined for each instance something is distributed to from which elements are selected by means of an arbitration vector.

Description

Method and Devices for Distributing service requests to service providers
[technical field]
The present invention relates to a method and devices for distributing service requests to service providers.
[related art]
In past years methods have been developed for distributing service requests to service providers. In particular in telecommunications networks there is a request for distributing traffic or, put into other words, to share load among network entities.
One example for such request for distribution is the pooling of devices like mobile services switching centre or base station controller. In such pools, devices with basically the same capabilities although perhaps different capacity are grouped. Or in other words, the pool comprises entities that are similar in a certain respect that is relevant for a connection. E.g. speech codecs (Coder/DECoder) may differ by the coding schemes they support, by the supplier they originate from and by their capacity, however, they may build a pool if they support the requested coding scheme for a particular connection. If a device from such pool is needed, it has to be selected.
One way to achieve this is for example to take an identity of a party involved, for example an IMSI (International Mobile Subscriber Identity), and to calculate a hash function from the IMSI according to the following formula (EMSI div 10) mod 1000. The hash values between 0 and 999 are then distributed to the respective devices, e.g. mobile services switching centres. However, this way requires either that each of the IMSI values and any group of IMSI occurs with the same probability.
Λ further suggestion for a distribution is to share equal fractions of the area from 0 to 999 among the mobile services switching centres. To that end, for M mobile services switching centres, a number n is mapped to an mobile services switching centre m by means of m=n mod M. This increases the probability that each mobile services switching centre receives a share of 1 div M of the whole traffic because the distribution of n mod M is inmost cases more randomly then the distribution of the IMSI. However, this solution has the shortcoming that it lacks means for introducing different capacities of the mobile services switching centre.
Another suggestion is to define certain ranges for each mobile services switching centre by command, for example a range from a to b for mobile services switching centre 1, and b+1 to c for mobile services switching centre 2 and so on. This has the advantage that different capacities can be introduced and taken care of. However, the method is quite cumbersome in the case that a further mobile services switching centre is added, a capacity change occurred or a mobile services switching centre is removed from the pool.
Therefore it is object of the invention to provide methods and devices to overcome the shortcomings of the prior art.
[summary]
This is achieved by the method of claim 1 , and the device of claim 6.
The method has the advantage that only steps that do require a lower number of processor cycles have to be repeated if a system related to the distribution function is modified. The invented method for setting up or adapting a device for distributing service requests to service providers, comprises the steps of defining an arbitration vector that comprises at least one element for each element of a result space of a distribution function, defining a preference vector for a service provider, taking a value of the arbitration vector, determining the intended accumulated probabilities of selection for each service provider, wherein each probability is assigned to a respective rage between 0 and 1. It comprises the further steps of determining the range into that the value of the arbitration vector belongs, and the service provider to that the range is assigned, which will be called selected service provider in the following, taking a value from the preference vector assigned to the selected service provider, assigning in the result space of the distribution function an identity of the selected service provider to a value corresponding to the value of the preference vector, and repeating the steps of determining the intended accumulated probabilities, of determining the range, of taking a value from the preference vector, of assigning in the result space, and of taking the next value until each value of the result space is assigned to a service provider.
In an embodiment of the invention, the device for distributing is a device for determining a network node of a pool of network nodes that shall be used when handling a service request.
The method may comprise the additional steps of determining that a service provider identity has been already assigned to a value in the result space of the distribution function corresponding to the value taken from the preference vector and selecting a different value from the preference vector.
The distribution function can be implemented for example as a hash function and the result space may be a hash table.
In a preferred embodiment of the invention, the arbitration vector is determined only once for a telecommunications network, and the determination of a preference vector is done once for each service provider in a telecommunications network.
It is further object of the invention to provide a device for distributing service requests to service providers comprising an input output unit, a processing unit and a distribution function. The distribution function is set-up or adapted by the method.
In an embodiment of the invention, the device further comprises an input randomiser unit for performing a pseudo random function with an identity of a service requesting entity.
The randomiser unit can be adapted to scale the result to a range that corresponds with an input value range of the determining function of the determining unit.
[brief description of the drawings] The following figures show:
Fig. 1 depicts a flow of a method according to the invention, and
Fig. 2 depicts a device according to the invention.
[detailed description]
In the following the invention will be further described by means of examples and by means of figures. In the following an example is combined with the description of figure 1 in order to make it easier to understand a particular embodiment of the invention.
Figure 1 depicts a flow of a method according to the invention. The invented method starts in a first step 101. In a succeeding step 102 an arbitration vector is defined. The arbitration vector is comprises elements in a range that corresponds to accumulated probabilities. In a preferred embodiment of the invention, the arbitration vector comprises elements with values between 0 and 1 wherein 0 and 1 may be included. In the preferred embodiment the arbitration vector comprises one element for each result value of the distribution function. The arbitration vector values can be determined for example by means of a PRNG (Pseudo Random Number Generator). There exist embodiments of the invention, wherein an arbitration vector is not needed, in particular in the case that conflict free preference vectors are used. Example, an arbitration vector is generated with 10 elements by using a PRNG. The values used with said PRNG are M=2736731631558, A=138, R=248, Zo=13070439814660, wherein Zk+] is calculated as «M*Zk+A) mod R)/R or ((M*Zk+Λ) mod R)/(R-1) . The first function leads to the following arbitration vector {0.40, 0.84, 0.35, 0.45, 0.32, 0.89, 0.02, 0.58, 0.16, 0.38}.
In a further step 103 a preference vector is defined. In a preferred embodiment of the invention, one preference vector is defined for each service instance. The preference vector comprises a sequence of distribution function values, wherein the sequence reflects an order of preference in which values of the distribution function shall be assigned to a service provider. The preference vector values can be determined for example by means of a PRNG. In an embodiment of the invention the preference vector for a service instance is determined once and then kept for said service instance. In a preferred embodiment of the invention, each preference vector comprises all values of the distribution function, however, not in the same sequence. If the capacities of the different service instances are known, then conflict free preference tables may be generated. However, using an arbitration vector instead of generating conflict free tables has the advantage that the tables do not have to be modified if the number or capacities of service providers change.
Example: in a distribution function with result space from 0 to 9, i.e. the function receives an input and generates a result within said result space. In the example it is more particular one of: 0, 1, 2, 3, 4, 5, 6, 7, 8, or 9. Three preference vectors ρvi={2, 0, 6, 7, 5, 9, 8, 3, 4, 1}, pv2={6, 5, 8, 1, 7, 4, 2, 0, 3, 9}, and pv3={4, 9, 2, 7, 6, 1, 0, 5, 3, 8} are defined. Each of these vectors is assigned to a service instance, which is one of the mobile services switching centre MSCl, MSC2, and MSC2. Certainly, a service instance could be any other entity used for providing a service, in particular any of a pooled device used in a cellular telecommunications network. For simplicity reasons we assign pvi to MSCl, pv2 to MSC2 and pv3 to MSC3. The capacities of the MSCs relate to each other as 1 to 2 to 3. The probability that a device is selected for serving should correspond to its capability; therefore it should be 1/6 for MSCl, 2/6 for MSC2 and 3/6 for MSC3. In a good appreciation it is 17% or 0.17 for MSCl , 0.33 for MSC2 and 0.5 for MSC3. The accumulated probability is then for MSCl 0.17, for MSC3 it is 0.5 that is 0.17 + 0.33; and for MSC3 it is 1 as the sum of 0.17 + 0.33 + 0.5. In another embodiment of the invention conflict free preference vectors are generated using the knowledge that for MSCl 2 values often, for MSC3 three values often and five values often for MSC3 should be selected. Conflict free vectors are then for example vl={0,l } for MSCl; v2={2, 3, 4} for MSC2, and v3={5, 6, 7, 8, 9} for MSC3.
In a step 105 a value is taken from the arbitration vector. In a preferred embodiment the values of the arbitration vector are taken consecutively from the first to the last value. Example: the first value of the arbitration vector is 0.40.
In a step 106 the range is determined, the value of the arbitration vector falls within. Example: the value of 0.40 is above the value of 0.17 but below the value of 0.5, thus it falls into the range of MSC2.
In a step 107, a value is selected from the associated preference vector. In a preferred embodiment of the invention the values of a preference vector are selected consecutively. Then it is checked whether the respective value is already assigned to a service instance. If it is already assigned, the consecutive value is selected, if not the value is kept. Example: the first value in the preference vector of MSC2 is 6.
In a step 108 an identification of the service provider is assigned to the corresponding value of the distribution function. Example: an identification of MSC2, for example an address of MSC2, is assigned to the value 6 of the distribution function.
In a preferred embodiment of the invention the steps 104 to 108 are repeated until an identity of a service instance is assigned to any of the distribution function values. Example: In a second execution of the steps the probabilities of 2/9 for MSCl, 2/9 for MSC2, because only two further values have to be selected from 9 for MSC2, and 5/9 for MSC3 are determined. This gives the rounded accumulated probabilities of 0.22 for MSCl, 0.44 for MSC2 and 1 for MSC3. The last value is always 1 and is not necessarily calculated. The next value of the arbitration vector is 0.84, which is above 0.44. Thus a value is selected from the preference vector assigned to MSC3. The first pv3 value is 4. Thus an identity of MSC3 is assigned to the result value 4 of the distribution function. The values of the result space are assigned to MSC IDs as defined after the first two steps is depicted as follows: {x, x, x, x, 3, x, 2, x, x, x} . Therein x means not defined, 2 is an ID of MSC2 and 3 is an ID of MSC3, the first x represents what is assigned to 0 and the last one what is assigned to 9. The other determination of the further values is depicted by means of the following table. It depicts in the first three columns the respective accumulated probabilities, in the forth column the respective arbitration vector value. Column five shows the MSC that is assigned to the range the arbitration vector value falls within. Column six comprises the preference vector value of the preference vector, which is the next one to select. The last column comprises the selected value that differs from the preference vector value if the preference vector value has already been assigned to an MSC. This is the case for three values of MSC3. Then the consecutive value is selected, unless, as for 0, with successor 5, this value has also already been assigned, here to MSC2.
Figure imgf000009_0001
The assignment of MSC IDs to distribution function values is then as follows: {1, 3, 1, 3, 3, 2, 2, 3, 2, 3}
The method ends in a step 109.
In the case that a change occurs in the system related to the distribution function, for example if the system is a telecommunications system if a further mobile services switching centre is introduced, the capacities are modified or a mobile services switching centre is removed from the pool, the hash table has to be modified. To that end only the steps 104 to 108 have to be repeated. It should be noted that the method for generating a distribution table is deterministic, that is that a given input, like load distribution factors, leads to a particular, reproducible result.
Figure 2 depicts a device according to the invention. The device DEV2 for distributing service requests to service providers comprising an input output unit IOU2, a processing unit PU2 and a distribution function DF2. The distribution function is set-up or adapted by a method according to claim 1. Example: the distribution function is a hash function that maps an input value to a result value of 0 to 9. According to the method of claim 1 , the assignment of hash result value to the three MSCs has been defined with the following vector {1, 3, 1, 3, 3, 2, 2, 3, 2, 3} as described for figure 1.
In an embodiment of the invention, the device further comprises an input randomiser unit RU2. The unit randomises an input e.g. an identity of a service requester. In an embodiment of the invention, the input randomiser unit is adapted to scale the result to a range that corresponds with an input value range of the determining function of the determining unit. This increases the randomness of the input value and thus compensates a potential lack of equal distribution of input values.
The units and means of the control node, the device and the mobile station can be implemented by means of software, e.g. a software module, hardware, or a combination of both.

Claims

Claims
1. Method for setting up or adapting a device for distributing service requests to service providers, wherein the method comprises the steps of:
Λl) Defining an arbitration vector that comprises one element for each element of a result space of a distribution function, A2) Defining a preference vector for a service provider, Bl) Taking a value of the arbitration vector, B2) Determining the intended accumulated probabilities of selection for each service provider, wherein each probability is assigned to a respective rage between 0 and 1, B3) determining the range into that the value of the arbitration vector belongs, and the service provider to that the range is assigned, B4) taking a value from the preference vector assigned to the service provider of step B2), B5) assigning in the result space of the distribution function an identity of the service provider to a value corresponding to the value of the preference vector, and repeating the steps Bl), B2), B3), B4), and B5) until each value of the result space is assigned to a service provider.
2. Method according to claim 1 , wherein the device for distributing is a device for determining a network node of a pool of network nodes that shall be used when handling a service request.
3. Method according to any of the preceding claims, with the additional steps of determining that a service provider identity has been already assigned to a value in the result space of the distribution function corresponding to the value taken from the preference vector and selecting a different value from the preference vector.
4. Method according to any of the preceding claims, wherein the distribution function is a hash function and the result space is a hash table.
5. Method according to any of the preceding claims, wherein the step Al ) is performed only once and the step A2) is performed once for each service provider in a telecommunications network.
6. Device for distributing service requests to service providers comprising an input output unit, a processing unit and a distribution function, characterised by that the distribution function is set-up or adapted by a method according to claim 1.
7. Device according to claim 6 further comprising an input randomiser unit for performing a pseudo random function with an identity of a service requesting entity.
8. Device according to claim 6 or 7, wherein the randomiser unit is adapted to scale the result to a range that corresponds with an input value range of the determining function of the determining unit.
PCT/EP2004/053546 2004-12-16 2004-12-16 Method and devices for distributing service requests to service providers WO2006063623A1 (en)

Priority Applications (6)

Application Number Priority Date Filing Date Title
US11/721,463 US8036667B2 (en) 2004-12-16 2004-12-16 Method and devices for distributing service requests to service providers
EP04804892A EP1825649B1 (en) 2004-12-16 2004-12-16 Method and devices for distributing service requests to service providers
ES04804892T ES2329802T3 (en) 2004-12-16 2004-12-16 METHOD AND DEVICES FOR DISTRIBUTING SERVICE REQUESTS TO SERVICE PROVIDERS.
DE602004022094T DE602004022094D1 (en) 2004-12-16 2004-12-16 METHOD AND EQUIPMENT FOR DISTRIBUTING SERVICE REQUIREMENTS TO SERVICE PROVIDERS
PCT/EP2004/053546 WO2006063623A1 (en) 2004-12-16 2004-12-16 Method and devices for distributing service requests to service providers
CN2004800446229A CN101080912B (en) 2004-12-16 2004-12-16 Method and device for distributing service requests to service providers

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/EP2004/053546 WO2006063623A1 (en) 2004-12-16 2004-12-16 Method and devices for distributing service requests to service providers

Publications (1)

Publication Number Publication Date
WO2006063623A1 true WO2006063623A1 (en) 2006-06-22

Family

ID=34959633

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/EP2004/053546 WO2006063623A1 (en) 2004-12-16 2004-12-16 Method and devices for distributing service requests to service providers

Country Status (6)

Country Link
US (1) US8036667B2 (en)
EP (1) EP1825649B1 (en)
CN (1) CN101080912B (en)
DE (1) DE602004022094D1 (en)
ES (1) ES2329802T3 (en)
WO (1) WO2006063623A1 (en)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20020143945A1 (en) * 2001-01-29 2002-10-03 Shahabuddin Johara Shireen System for optimal resource allocation and planning for hosting computing services
US20030125059A1 (en) * 2001-12-31 2003-07-03 Samsung Electronics Co., Ltd. Distributed identity server for use in a telecommunication switch
US6611859B1 (en) * 1999-03-08 2003-08-26 Sony Corporation Address setting method, client apparatus, server apparatus and client-server system
US20040073640A1 (en) * 2002-09-23 2004-04-15 Cricket Technologies Llc Network load management apparatus, system, method, and electronically stored computer product

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6078943A (en) * 1997-02-07 2000-06-20 International Business Machines Corporation Method and apparatus for dynamic interval-based load balancing
US6553420B1 (en) * 1998-03-13 2003-04-22 Massachusetts Institute Of Technology Method and apparatus for distributing requests among a plurality of resources
US6629176B1 (en) * 1999-11-02 2003-09-30 Agilent Technologies, Inc. Arbiter architecture allowing rapid implementation of arbitration policies
US7197566B1 (en) * 2000-09-29 2007-03-27 Intel Corporation Method and apparatus for selecting server to distribute multimedia data via a network

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6611859B1 (en) * 1999-03-08 2003-08-26 Sony Corporation Address setting method, client apparatus, server apparatus and client-server system
US20020143945A1 (en) * 2001-01-29 2002-10-03 Shahabuddin Johara Shireen System for optimal resource allocation and planning for hosting computing services
US20030125059A1 (en) * 2001-12-31 2003-07-03 Samsung Electronics Co., Ltd. Distributed identity server for use in a telecommunication switch
US20040073640A1 (en) * 2002-09-23 2004-04-15 Cricket Technologies Llc Network load management apparatus, system, method, and electronically stored computer product

Also Published As

Publication number Publication date
EP1825649A1 (en) 2007-08-29
CN101080912A (en) 2007-11-28
ES2329802T3 (en) 2009-12-01
DE602004022094D1 (en) 2009-08-27
US20090298506A1 (en) 2009-12-03
US8036667B2 (en) 2011-10-11
CN101080912B (en) 2011-11-23
EP1825649B1 (en) 2009-07-15

Similar Documents

Publication Publication Date Title
US10452621B2 (en) Network coded storage with multi-resolution codes
CN101815033B (en) Method, device and system for load balancing
CN108023794B (en) Equipment access control method and device
US10728050B2 (en) Method of terminal-based conference load-balancing, and device and system utilizing same
CN112948120A (en) Load balancing method, system, device and storage medium
CN114928578B (en) Chip structure
KR20080006596A (en) Methods and apparatus for enhanced delivery of content over a data network
CN115002050B (en) Workload proving chip
CN109800236A (en) Support the distributed caching method and equipment of multinode
CN103425684A (en) Method and device for database operation
US8036667B2 (en) Method and devices for distributing service requests to service providers
EP3770784B1 (en) Api topology hiding method, device and system
US20170024346A1 (en) Apparatus and method for on-chip crossbar design in a network switch using benes network
CN107528884B (en) User request processing method and device of aggregation server
WO2013012873A1 (en) Mobile-to-mobile call determination
CN114296869A (en) Server node service method and device based on TCP long connection
US10419432B2 (en) Method and apparatus for use with different memory maps
WO2012167443A1 (en) Address pool reassignment method and network management system entity device
CN115801787B (en) Road end data transmission method and device, electronic equipment and storage medium
CN114629862B (en) Port connection system, method and computer equipment
US12113708B2 (en) Provisioning memory resources on flexible hardware platforms
CN114978892B (en) Target node determining method and device
KR20100020093A (en) System and method for registering location of terminal in mobile radio communication network
CN118678305A (en) Method and system for maintaining short message conversation
KR970031534A (en) Authentication key generation method used in authentication center of digital mobile communication network

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BW BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE EG ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NA NI NO NZ OM PG PH PL PT RO RU SC SD SE SG SK SL SM SY TJ TM TN TR TT TZ UA UG US UZ VC VN YU ZA ZM ZW

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): BW GH GM KE LS MW MZ NA SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LT LU MC NL PL PT RO SE SI SK TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG

121 Ep: the epo has been informed by wipo that ep was designated in this application
WWE Wipo information: entry into national phase

Ref document number: 2004804892

Country of ref document: EP

WWE Wipo information: entry into national phase

Ref document number: 11721463

Country of ref document: US

WWE Wipo information: entry into national phase

Ref document number: 200480044622.9

Country of ref document: CN

NENP Non-entry into the national phase

Ref country code: DE

WWP Wipo information: published in national office

Ref document number: 2004804892

Country of ref document: EP