EP2095650B1 - Dynamische netzauswahl unter verwendung von kernels - Google Patents

Dynamische netzauswahl unter verwendung von kernels Download PDF

Info

Publication number
EP2095650B1
EP2095650B1 EP07839879A EP07839879A EP2095650B1 EP 2095650 B1 EP2095650 B1 EP 2095650B1 EP 07839879 A EP07839879 A EP 07839879A EP 07839879 A EP07839879 A EP 07839879A EP 2095650 B1 EP2095650 B1 EP 2095650B1
Authority
EP
European Patent Office
Prior art keywords
network
utility value
communication network
function
predicted utility
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
EP07839879A
Other languages
English (en)
French (fr)
Other versions
EP2095650A2 (de
EP2095650A4 (de
Inventor
Brian Lyles
Praveen Gopalakrishnan
Byungsuk Kim
Eric Van Den Berg
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Telcordia Licensing Co LLC
Original Assignee
Telcordia Licensing Co LLC
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 Telcordia Licensing Co LLC filed Critical Telcordia Licensing Co LLC
Publication of EP2095650A2 publication Critical patent/EP2095650A2/de
Publication of EP2095650A4 publication Critical patent/EP2095650A4/de
Application granted granted Critical
Publication of EP2095650B1 publication Critical patent/EP2095650B1/de
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W36/00—Hand-off or reselection arrangements
    • H04W36/24—Reselection being triggered by specific parameters
    • H04W36/30—Reselection being triggered by specific parameters by measured or perceived connection quality data
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W36/00—Hand-off or reselection arrangements
    • H04W36/14—Reselecting a network or an air interface
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W36/00—Hand-off or reselection arrangements
    • H04W36/24—Reselection being triggered by specific parameters

Definitions

  • This invention relates to mobile communication devices, mobile network managements, and handoff between multiple networks. More particularly, the invention relates to a method of determining whether to switch to a different network.
  • Mobile communication devices are commonly used in today's society. Most of these devices are capable of telecommunication using at least one network. Many of the newer mobile devices are now capable of telecommunication using multiple networks. The ability to switch between multiple networks in an efficient manner is essential for these newer devices. Future multiple networks are expected to combine several different radio-access technologies, such as 3G cellular, WLAN, and WiMax. This variety of access options gives a user with a multi-interface device the possibility of being “always best connected", using 'vertical' handoffs between the heterogeneous network technologies.
  • Vertical handoff is the process by which a mobile device switches between two different networks.
  • US 2005/083840 moreover discloses a method for a handoff process based on future quality of service.
  • the method described in US 2005/083840 provides for evaluating network conditions at a predetermined future time of interest to ensure that a complete handoff can be facilitated.
  • a method for determining whether to perform handoff from a current communication network to another communication network comprising the steps of: obtaining, for the other communication network, one or more first selection metrics, being network attributes; calculating, for the other communication network, a first predicted utility value from the first selection metrics using a first function corresponding to the other communication network at a first predetermined future time; obtaining, for the current communication network, one or more second selection metrics, being network attributes; calculating a second predicted utility value for the current communication network from the second selection metrics using a second function corresponding to the current network at a second predetermined future time, wherein the second predetermined future time is different from the first predetermined future time, and wherein the second function is different from the first function; comparing the first predicted utility value for the other communication network with the second predicted utility value; and switching to the other communication network, if the first predicted utility value is greater than the second predicted utility value.
  • the first and the second functions comprise a first and a second variable kernel regression function, for the first and the second predetermined future times, respectively.
  • the selection metrics include availability of a communication network, quality of service, and cost, wherein the quality of service is a function of packet delay and wherein cost is monetary cost and energy cost.
  • the method further comprises the step of: determining a switching cost for switching between the current communication network and each of a plurality of other communication networks; and switching to one of the plurality of other communication networks having the highest first predicted utility value, if the highest first predicted utility value is greater than the sum of the second predicted utility values and the switching cost for switching between the current network and the communication network with the highest first predicted utility value.
  • the first and second predetermined future times are based on makeup time and handover latency of the other and current communication networks, respectively, wherein makeup time is the time to make up the loss in utility due to loss of network connectivity.
  • the plurality of selection metrics are periodically received from a communication network manager and are known a priori.
  • the method further comprises the step of calculating an actual utility value for the current communication network, wherein the step of calculating an actual utility value may comprise the sub-steps of: mapping each of the second plurality of metrics to attribute preference values; multiplying each of the attribute preference values by a variable weighting factor; and adding linearly all of the multiplied attribute preference values.
  • the first and the second functions comprise a first and a second variable kernel regression function, for the first and the second predetermined future times, respectively; further comprising the steps of: comparing an actual utility value with the second predicted utility value; calculating a difference between an actual utility value with the second predicted utility value based upon the comparing; and updating the second variable kernel regression function if the difference is greater than a loss tolerance value, wherein the loss tolerance value is updated based upon the difference.
  • the first function is different from functions used for each of a plurality of other communication networks.
  • the method further comprises the step of storing the first plurality of selection metrics for a number, n, of previous periods of time.
  • the method further comprises the step of aging each of the previous first plurality of selection metrics by multiplying a regression coefficient of the first kernel regression function by an aging coefficient, that is variable.
  • the first and second predetermined future times are a function of a network latency for the other and current communication networks, respectively.
  • default metrics are used for the first plurality of selection metrics.
  • the method comprises the further steps of: determining a pending application running on a device; obtaining an application threshold for the pending application; calculating a difference between the second predicted utility value and the first predicted utility value; comparing the calculated difference with the application threshold; and switching to the other network when it has a first predicted utility value greater than the selected application threshold.
  • each of the application thresholds is different for each pending application.
  • the first and the second functions comprise a first and a second variable kernel regression function, for the first and the second predetermined future times, respectively; and wherein the step of calculating an actual utility value for the current communication network comprises of step of: evaluating the second variable kernel regression function of the current communication network with current values obtained for each of the first plurality of selection metrics.
  • the first plurality of selection metrics includes at least information regarding a network policy, wherein the information regarding the network policy includes short and/or long term policies such as user classification, user priority, emergency needs and network conditions.
  • a mobile communication device for determining whether to perform handoff from a current communication network to another communication network, comprising: means for obtaining, for the other communication network, one or more first selection metrics, being network attributes; means for calculating, for the other communication network, a first predicted utility value from the first selection metrics using a first function corresponding to the other network at a first predetermined future time; means for obtaining, for the current communication network, one or more second selection metrics, being network attributes; means for calculating a second predicted utility value for the current communication network from the second selection metrics using a second function corresponding to the current network at a second predetermined future time, wherein the second predetermined time is different from the first predetermined future time, and wherein the second function is different from the first function; means for comparing the first predicted utility value for the other communication network with the second predicted utility value; and means for switching to the other communication network, if the first predicted utility value is greater than the second predicted utility value.
  • Fig. 1 illustrates a flow diagram of a method of determining handoff according to an embodiment of the invention
  • Fig. 2 illustrates a flow diagram of a method for calculating a utility of a network
  • Fig. 3 illustrates a learning process according to an embodiment of the invention.
  • Fig. 4 illustrates a flow chart of an handoff decision method according to a second embodiment of the invention.
  • Fig. 1 illustrates a flow diagram of a method of determining handoff according to an embodiment of the invention.
  • the method considers multiple attributes and metrics for each network that a mobile device is capable of using for communication.
  • the method also accounts for any dynamic change in the preferences.
  • the networks can be any available communication network such as, but not limited to, 30 cellular, WLAN, and WiMax.
  • the attributes or metrics for each network is obtained.
  • the metrics can be calculated or are a priori known.
  • the actual values for each of the network attributes are not always known for all networks. For example, attributes of networks other than the current network may not be known. However, in an embodiment several of the attributes and metrics have default values. For example, a default packet delay for a network will be used if the actual packet delay is not known. Additionally, a default coverage range will also be used if the actual coverage range is not known.
  • the attributes are divided into three main categories: availability, quality of service, and cost.
  • 'Availability' means satisfaction of basic connectivity requirements.
  • Availability is determined based upon the signal strength, signal strength RSS i > minimum threshold ⁇ i .
  • other input information such as input about the signal strength, observed packet delay, stability period, user speed, and additional information such as nominal coverage area, or coverage maps (if available) can also be used.
  • 'Quality' is typically measured in (available) bandwidth that a network can offer. The nominal bandwidth of a network may be known a priori , but available bandwidth is hard or time-consuming to measure.
  • packet delay for the network is used.
  • the average delays and delay variance is used, as well as maximum allowable values.
  • the 'Cost' has two components: Monetary cost and Energy cost.
  • the Energy cost for a network interface is determined by two quantities: stationary energy (for just having the interface up) and transmission/reception energy.
  • the Monetary cost is determined by the rate plan, and the cost per month, minute, or KB transferred
  • a network policy includes short and/or long term policies such as user classifications, user priority, emergency service needs and network conditions.
  • Fig. 2 illustrates one method for calculating the actual utility, using a multiple attribute utility function.
  • the utility function maps value of the attributes and metric to preference values. Specifically, the metrics are mapped to build a multi-attribute utility function, at Step 200.
  • weights are multiplied to each preference value. The weights are variable to account for different hierarchy for each attribute.
  • the weights are c1, c2, and c3. At Step 210, all of the weighted values are added together.
  • an expected utility is determined for each of the attributes, using a multiple attribute expected utility function.
  • the expected utility and a predicted utility are determined for a predetermined time period in the future T+ ⁇ T i .
  • the predetermined time period is network specific and is a function of a stability period.
  • Make-up time is the time to make up the loss (in utility) due to loss of network connectivity during handoff L handover .
  • the make-up time and handover latency is also network specific. Only if an alternative network is predicted to be sufficiently better than the current one for a period greater than the stability period is a handoff worthwhile. Therefore, the expected utility is calculated for a period after the stability period.
  • P is the probability. The probability is based upon coverage maps, user speed and variance.
  • the expected utility at a future time T + ⁇ T i is used as a means to predict future utility.
  • the actual utility of the current network can be calculated using a kernel regression function with the inputs for the kernel regression function being the obtained metrics for the current network.
  • the future utility for each network is predicted.
  • the future or expected utility is predicted using equation 5 (the multiple attribute expected utility function).
  • the determination uses a kernel learning process with the selection of a kernel "K” and a kernel regression function "f". The kernel learning process allows the method and prediction to adapt to a change in the environment or network condition. The kernel learning process will be described later in detail.
  • the cost of switching between networks is determined.
  • the cost of switching is a function of the stability period. The greater the stability period is, the higher the costs of switching.
  • the expected utility can be calculated using either the multiple attribute expect utility function or the kernal learning process with the kernal regression function.
  • the values and weights of the attributes and metrics can vary over time; therefore, the predicted utility must be dynamic and learned based upon prior mapping of input to utility.
  • the kernel regression function for predicting the utility is variable and can be different for each network. Additionally, the kernel regression function for predicting the utility can also be varied based upon a determined difference between an actual utility and an estimated utility.
  • the kernel regression function is used to predict the utility of a network because all of the metrics, coefficients, loss tolerance, and expectations are not perfectly known.
  • the mapping f : X ⁇ R is determined.
  • the output f of the algorithm is a hypothesis.
  • the set of all possible hypotheses is denoted H .
  • H is a Reproducing Kernel Hilbert Space (RKHS) induced by a positive semi-definite kernel k (.,.) : X ⁇ X ⁇ R .
  • RKHS Kernel Hilbert Space
  • ⁇ f,k ( x , ⁇ ) > H f ( x ), ⁇ x ⁇ X
  • H is the closure of the span of all k ( x , ⁇ ), x ⁇ X .
  • the hypotheses space H a Reproducing Kernel Hibert Space (RKHS)
  • RKHS Kernel Hibert Space
  • ( x 1 , y 1 ),..., ( x n , y n ) x i ⁇ x, y i ⁇ Y are the observed (input,outcome) pairs, e.g. (metrics,utility) pairs.
  • This loss function is called " ⁇ -insensitive loss". ⁇ is a loss tolerance.
  • the ⁇ -insensitive loss function ignores small errors, i.e., if the difference between the predicted value and the actual value is less than the tolerance, then the difference can be ignored.
  • the advantage of using this loss function is that it creates a sparser kernel regression function f, which is therefore less computationally intensive to evaluate, e.g. more coefficients are zero.
  • ⁇ can be adapted during the learning process.
  • the kernel k is defined in terms of the expected utility function EU(t) and its components A(t), Q(t) and C(t), which are given in formulas (1)-(5) above.
  • the kernel regression function "f" is equvalent to the multiple attribute expected utility function.
  • x t i represents the state of network i at time t
  • Fig. 3 illustrates the adaptive learning process for predicting the utility for each network.
  • a predicted value for the current network is compared with the actual utility value that is determined in Step 110.
  • a difference between the two values is calculated.
  • the difference is compared with a variable loss tolerance, at Step 310. If the difference is less than the loss tolerance, the regression function is not updated, at Step 315.
  • Step 320 varies the coefficients as will be defined below and Step 325 varies the loss tolerance as defined herein.
  • ⁇ t ⁇ 1/ ⁇ is a learning parameter, where ⁇ > 0 is a penalty parameter that regularizes the risk, by penalizing the norm of the kernel regression function "f". If ⁇ > 0 is large, the learning parameter ⁇ t ⁇ 1/ ⁇ is smaller, as are the resulting coefficients ⁇ i .
  • the parameter ⁇ is used to control the storage requirements for the kernel expansion.
  • the loss tolerance i.e., ⁇ -insensitive loss
  • l ( f ( x ), y ) : max(0,
  • Varying the value v varies the losss tolerance.
  • v controls the fraction of points f ( x i ) which have a loss exceeding the loss tolerance ⁇ .
  • the older input values e.g., attributes
  • the ⁇ i coefficient may be initialized to a non-zero value, and the coefficients for the t -1 earlier terms decay by a factor depending on ⁇ t .
  • the decision to switch between networks is application based. For example, if an application is expected to be used for a long period of time, an increase in a predicted utility from the current network to a new network could be small. However, if the application will be used for a short period of time, the increase in a predicted utility from the current network to a new network could be much larger to make the switch worthwhile.
  • multiple different utility thresholds are used to determine whether to switch networks.
  • the thresholds can be in "percentage increases" between networks. For example, if the application is streaming video for a movie, the threshold can be a 5% increase between networks (accounting for switching costs). If the application is a text message, the threshold can be a 30% or larger increase between networks (accounting for switching costs).
  • the weights for the metrics are different.
  • Fig. 4 illustrates a flow chart of an handoff decision method according to the second embodiment of the invention. As illustrated, Steps 100-130 are the same as the first embodiment of the invention and, therefore, will not be described again.
  • Application threshold values are retrieved for all pending applications.
  • the predicted utility value for the current network is compared with each of the predicted utility values for the other networks and to calculate a utility difference for between the current network and each network.
  • each utility difference is compared with the application threshold value.
  • the smallest threshold value among application threshold values for the pending application is selected for comparision.
  • largest threshold value among application threshold values for the pending application is selected for comparision.
  • an average of the application threshold values for the pending applications is selected for comparision.
  • Step 420 If, at Step 420, a utility difference is larger than the selected application threshold, then the other network remains a candidate for handoff. The network that has the highest utility difference among the remaining candidates is selected for handoff and handoff occurs at Step 425. If none of the utility differences are larger than the selected application threshold, at Step 420, handoff does not occur, at Step 430.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Claims (18)

  1. Ein Verfahren zur Bestimmung, ob ein sogenannter vertikaler Handoff von einem derzeitigen Netzwerk auf ein anderes Kommunikationsnetzwerk stattfinden sollte, wobei sich das Verfahren aus folgenden zusammensetzt:
    Einholen von einer oder mehreren ersten Metriken für das andere Kommunikationsnetzwerk, wobei es sich um Netzwerkattribute handelt; Errechnen eines ersten vorhergesagten Nutzwerts aus den erstgewählten Metriken für das andere Kommunikationswerkwerk unter Verwendung einer ersten Funktion, die dem anderen Kommunikationsnetzwerk zu einen ersten, vorbestimmten zukünftigen Zeitpunkt entspricht; Einholen, von einen oder mehreren zweiten Metriken für das derzeitige Kommunikationsnetzwerk, wobei es sich um Netzwerkattribute handelt;
    Errechnen eines zweiten vorhergesagten Nutzwerts für das derzeitige Netzwerk aus der zweiten Metrikwahl unter Verwendung einer zweiten Funktion, die dem derzeitigen Kommunikationsnetzwerk zu einen zweiten, vorbestimmten zukünftigen Zeitpunkt entspricht, wobei sich der zweite vorbestimmte zukünftige Zeitpunkt vom ersten, vorbestimmten zukünftigen Zeitpunkt unterscheidet, und wobei sich die zweite Funktion von der ersten Funktion unterscheidet;
    Vergleich des ersten vorhergesagten Nutzwerts für das andere Kommunikationsnetzwerk mit dem zweiten vorhergesagten Nutzwert; und
    umschalten auf das andere Kommunikationsnetzwerk, wenn der erste vorhergesagte Nutzwert größer als der zweite vorhergesagte Nutzwert ist.
  2. Das Verfahren entsprechend Anspruch 1, wobei die erste und zweite Funktion jeweils für den ersten und den zweiten vorbestimmten zukünftigen Zeitpunkt eine erste und eine zweite Kernregressionsfunktion umfassen.
  3. Das Verfahren entsprechend Anspruch 1, wobei zu den Auswahlmetriken die Verfügbarkeit eines Kommunikatlonsnetzwerks, Qualität des Services und Kosten gehören, wobei die Qualität des Services eine Funktion von Paketverzögerung ist und wobei es sich bei den Kosten um finanzielle Kosten und Energiekosten handelt.
  4. Das Verfahren entsprechend Anspruch 1, zu dem zudem der folgende Schritt gehört:
    Bestimmung von Umschaltkosten für das Schalten zwischen dem derzeitigen Kommunikationsnetzwerk und jeweils einer Reihe anderer Kommunikationsnetzwerke; und
    Schalten auf eine der Reihe anderer Kommunikationsnetzwerke mit dem höchsten, ersten, vorhergesagten Nutzwert, wenn der höchste, erste, vorhergesagte Nutzwert größer als die Summe der zweiten, vorhergesagten Nutzwerte und die Umschaltkosten für das Schalten zwischen dem derzeitigen Netzwerk und dem Kommunikationsnetzwerk mit dem höchsten, ersten, vorhergesagten Nutzwert ist.
  5. Das Verfahren entsprechend Anspruch 1, wobei der erste und zweite vorbestimmte zukünftige Zeitpunkt jeweils auf Ausgleichszeit und Übergabewartezeit des anderen und des derzeitigen Netzwerks basiert, wobei die Ausgleichszeit die Zeit für den Ausgleich des Nutzungsverlusts infolge von Verlust von Netzwerkverbindung ist.
  6. Das Verfahren entsprechend Anspruch 1, wobei die Reihe von Auswahlmetriken regelmäßig von einem Kommunikationsnetzmanager empfangen wird und a priori bekannt sind.
  7. Das Verfahren entsprechend Anspruch 1, zudem weiterhin der Schritt der Errechnung des tatsächlichen Nutzwerts für das derzeitige Kommunikationsnetzwerk gehört, wobei sich der Schritt der Errechnung des tatsächlichen Nutzwerts aus folgenden Nebenschritten zusammensetzen kann
    Zuordnung jeder der zweiten Reihe an Metriken zu bevorzugten Attributwerten;
    Multiplikation jedes der bevorzugten Attributwerte durch einen variablen Gewichtungsfaktor; und lineare Addition aller multiplizierten bevorzugten Attributwerte.
  8. Das Verfahren entsprechend Anspruch 7,
    wobei die erste und zweite Funktion eine erste und eine zweite Kernregressionsfunktion für jeweils den ersten und den zweiten vorbestimmten zukünftigen Zeitpunkt umfassen, wozu zudem die folgenden Schritte gehören:
    Vergleich eines tatsächlichen Nutzwerts mit einem zweiten, vorhegesagten Nutzwert;
    Errechnen des Unterschieds zwischen einem tatsächlichen Nutzwerts und dem zweiten, vorhegesagten Nutzwert auf Vergleichsbasis; und
    Aktualisierung der zweiten variablen Kernregressionsfunktion, wenn der Unterschied größer als ein Verlusttoleranzwert ist;
    wobei der Verlusttoleranzwert basierend auf den Unterschied aktualisiert wird.
  9. Das Verfahren entsprechend Anspruch 1, wobei sich die erste Funktion von den Funktionen, die für jede der Reihe der anderen Kommunikationsnetzwerke verwendet werden, unterscheidet.
  10. Das Verfahren entsprechend Anspruch 1, zu dem zudem der Schritt des Speicherns der ersten Reihe an Auswahlmetriken für eine Zahl n an vorangegangenen Zeiträumen gehört.
  11. Das Verfahren entsprechend Anspruch 2, zu dem zudem der Schritt der Alterung jeder der vorherigen ersten Reihe von Auswahlmetriken gehört, indem ein Regressionskoeffizient der ersten Kernregressionsfunktion mit einem Alterungskoeffizient, der variabel ist, multipliziert wird.
  12. Das Verfahren entsprechend Anspruch 1, wobei der erste und zweite vorbestimmte, zukünftige Zeitpunkt jeweils eine Funktion einer Netzwerkwartezeit für die anderen und derzeitigen Kommunikationsnetzwerke sind.
  13. Das Verfahren entsprechend Anspruch 1, wobei Vorgabemetriken für die erste Reihe an Auswahlmetriken verwendet werden.
  14. Das Verfahren entsprechend Anspruch 1, zum dem zudem die folgenden Schritte gehören:
    Bestimmung eines bevorstehenden Applikationsablaufs auf einem Gerät;
    Einholen einer Applikationsschwelle für die bevorstehende Applikation;
    Errechnen eines Unterschieds zwischen dem zweiten vorhergesagten Nutzwert und dem ersten vorhergesagten Nutzwert;
    Vergleich des errechneten Unterschieds mit der Applikationsschwelle; und
    Schalten auf das andere Netzwerk, wenn es einen ersten vorhergesagten Nutzwert aufweist, der größer als die gewählten Applikationsschwelle ist.
  15. Das Verfahren entsprechend Anspruch 14, wobei sich jede der Applikationsschwellen von jeder bevorstehenden Applikation unterscheidet.
  16. Das Verfahren entsprechend Anspruch 7, wobei die erste und die zweite Funktion eine erste und eine zweite variable Kernregressionsfunktion für jeweils den ersten und den zweiten vorbestimmten, zukünftigen Zeitpunkt umfassen, und wobei der Schritt der Errechnung eines tatsächlichen Nutzwerts für das derzeitige Kommunikationsnetzwerk den folgenden Schritt umfasst:
    Auswertung der zweiten variablen Kernregressionsfunktion des derzeitigen Kommunikationsnetzwerks mit derzeitigen Werten, die für jede der ersten Reihe von Auswahlmetriken eingeholt wurden.
  17. Das Verfahren entsprechend Anspruch 1, wobei zur ersten Reihe an Auswahlmetriken zumindest Information hinsichtlich von Netzwerkrichtlinien gehört, wobei die Information hinsichtlich der Netzwerkrichtlinien kurz und/oder langfristige Richtlinien umfasst, wie z.B. Userklassifizierung, Userpriorität, Erfordernisse in Notfällen und Netzwerkbedingungen.
  18. Ein Mobilkommunikationsgerät zur Bestimmung, ob ein sogenannter vertikaler Handoff von einem derzeitigen Netzwerk auf ein anderes Kommunikationsnetzwerk stattfinden sollte, bestehend aus:
    Möglichkeiten zum Einholen, für das andere Kommunikationsnetzwerk, von einer oder mehreren ersten Metriken, wobei es sich um Netzwerkattribute handelt;
    Möglichkeiten zum Errechnen eines ersten vorhergesagten Nutzwerts aus den erstgewählten Metriken unter Verwendung einer ersten Funktion für das andere Kommunikationsnetzwerk, die dem anderen Kommunikationsnetzwerk zu einem ersten, vorbestimmten zukünftigen Zeitpunkt entspricht;
    Möglichkeiten zum Einholen von einer oder mehreren zweiten Metriken für das derzeitige Kommunikationsnetzwerk, wobei es sich um Netzwerkattribute handelt;
    Möglichkeiten zum Errechnen eines zweiten vorhergesagten Nutzwerts für das derzeitige Netzwerk aus der zweiten Metrikwahl unter Verwendung einer zweiten Funktion, die dem derzeitigen Netzwerk zu einen zweiten, vorbestimmten zukünftigen Zeitpunkt entspricht, wobei sich der zweite vorhebestimmte zukünftige Zeitpunkt vom ersten, vorbestimmten zukünftigen Zeitpunkt unterscheidet, und wobei sich die zweite Funktion von der ersten Funktion unterscheidet;
    Möglichkeiten zum Vergleich des ersten vorhergesagten Nutzwerts für das andere Kommunikationsnetzwerk mit dem zweiten vorhergesagten Nutzwert; und
    Möglichkeiten zum Umschalten auf das andere Kommunikationsnetzwerk, wenn der erste vorhergesagte Nutzwert größer als der zweite vorhergesagte Nutzwert ist.
EP07839879A 2006-10-31 2007-10-31 Dynamische netzauswahl unter verwendung von kernels Active EP2095650B1 (de)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US85570906P 2006-10-31 2006-10-31
PCT/US2007/023038 WO2008054800A2 (en) 2006-10-31 2007-10-31 Dynamic network selection using kernels

Publications (3)

Publication Number Publication Date
EP2095650A2 EP2095650A2 (de) 2009-09-02
EP2095650A4 EP2095650A4 (de) 2010-11-03
EP2095650B1 true EP2095650B1 (de) 2012-07-25

Family

ID=39344912

Family Applications (1)

Application Number Title Priority Date Filing Date
EP07839879A Active EP2095650B1 (de) 2006-10-31 2007-10-31 Dynamische netzauswahl unter verwendung von kernels

Country Status (6)

Country Link
US (2) US8611302B2 (de)
EP (1) EP2095650B1 (de)
JP (1) JP4977762B2 (de)
KR (1) KR101437192B1 (de)
CN (1) CN101647310B (de)
WO (1) WO2008054800A2 (de)

Families Citing this family (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
FI20065562A0 (fi) * 2006-09-13 2006-09-13 Nokia Corp Vertikaalinen yhteysvastuun vaihto
US9445312B2 (en) * 2007-12-31 2016-09-13 United States Cellular Corporation Enhanced configuration and handoff scheme for Femto systems
EP2245869B1 (de) * 2008-01-17 2019-08-07 Alcatel-Lucent USA Inc. Verfahren zur weiterreichung eines endgeräts, netzelement, basisstation und kommunikationssystem
GB2472537B (en) * 2008-10-15 2011-06-22 Nomad Spectrum Ltd Network communication
GB2464480B (en) * 2008-10-15 2011-01-12 Nomad Spectrum Ltd Network communication
CN101754226B (zh) * 2009-12-21 2012-06-20 西安电子科技大学 认知无线网络环境下终端的重构方法
US20110182272A1 (en) 2010-01-25 2011-07-28 Qualcomm Incorporated Application-layer handoff of an access terminal from a first system of an access network to a second system of the access network during a communication session within a wireless communications system
KR101154336B1 (ko) * 2010-11-04 2012-06-13 강원대학교산학협력단 이종망에서의 버티컬 핸드오버를 수행하는 이동단말 및 이를 이용한 핸드오버 방법
EP2962485B1 (de) * 2013-03-01 2019-08-21 Intel IP Corporation Wlan-verkehr-offload
CN105491611B (zh) * 2016-01-25 2019-02-05 广东顺德中山大学卡内基梅隆大学国际联合研究院 无线网络切换方法和系统
CN106658588A (zh) * 2016-12-21 2017-05-10 广东欧珀移动通信有限公司 网络质量检测方法、装置和计算机设备
CN109121149B (zh) * 2018-09-29 2021-12-28 闻泰通讯股份有限公司 无线网络自主优化方法、装置、设备和存储介质
US10659190B1 (en) 2019-02-25 2020-05-19 At&T Intellectual Property I, L.P. Optimizing delay-sensitive network-based communications with latency guidance
CN112788688B (zh) * 2021-01-11 2022-05-06 中南大学 异构网络间的垂直切换方法、装置、设备及存储介质
CN115002859B (zh) * 2022-06-28 2023-10-03 亿航智能设备（广州）有限公司 一种飞行器的运营商网络切换方法、设备及存储介质

Family Cites Families (21)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP3442320B2 (ja) * 1999-08-11 2003-09-02 日本電信電話株式会社 通信方式切替無線端末及び通信方式切替方法
EP1670234A3 (de) * 2000-05-19 2006-08-30 Lucent Technologies Inc. Drahtloses, lokales Netzwerk mit Lastverteilung
US6633761B1 (en) * 2000-08-11 2003-10-14 Reefedge, Inc. Enabling seamless user mobility in a short-range wireless networking environment
US20020181419A1 (en) * 2001-06-01 2002-12-05 Tao Zhang Method for handoff in multimedia wireless networks
US7463890B2 (en) * 2002-07-24 2008-12-09 Herz Frederick S M Method and apparatus for establishing ad hoc communications pathways between source and destination nodes in a communications network
US20040266442A1 (en) * 2001-10-25 2004-12-30 Adrian Flanagan Method and system for optimising the performance of a network
KR100421169B1 (ko) * 2002-01-29 2004-03-04 삼성전자주식회사 사설 무선망에서 대화형 단문 메시지 서비스 시스템과그를 위한 라우팅방법
US7096022B2 (en) * 2002-10-08 2006-08-22 Ntt Docomo, Inc. System and method for supporting quality of service in vertical handovers between heterogeneous networks
US7020087B2 (en) * 2003-01-13 2006-03-28 Motorola, Inc. Segmented and distributed path optimization in a communication network
US6982949B2 (en) * 2003-02-28 2006-01-03 Microsoft Corporation Vertical roaming in wireless networks through improved wireless network cell boundary detection
US7103024B2 (en) * 2003-10-17 2006-09-05 Motorola, Inc. Wireless local area network future service quality determination method
US7610057B2 (en) * 2004-04-23 2009-10-27 Microsoft Corporation Selecting a wireless networking technology on a device capable of carrying out wireless network communications via multiple wireless technologies
FI20045375A0 (fi) * 2004-10-06 2004-10-06 Nokia Corp Kova yhteysvastuunvaihtomenetelmä, kontrolleri ja tiedonvälitysjärjestelmä
KR101277016B1 (ko) * 2004-11-05 2013-07-30 텔코디아 테크놀로지스, 인코포레이티드 네트워크 발견 메커니즘
US7821924B2 (en) * 2004-11-18 2010-10-26 Alcatel-Lucent Usa Inc. Method and apparatus for timeout reduction and improved wireless network performance by delay injection
FR2880505B1 (fr) * 2004-12-31 2007-05-11 Evolium Sas Soc Par Actions Si Procede et systeme pour l'exploitation d'un reseau de communications mobiles
US20060182061A1 (en) * 2005-02-17 2006-08-17 Nokia Corporation Interworking between wireless WAN and other networks
US20060221933A1 (en) * 2005-03-29 2006-10-05 Bauer Markus G Managing internet protocol based resources in a packet-based access network
US20060268756A1 (en) * 2005-05-03 2006-11-30 Hong Kong Applied Science And Technology Research Institute Co., Ltd. Systems and methods for efficient hand-off in wireless networks
US20070160007A1 (en) * 2006-01-11 2007-07-12 Li-Chun Wang Method and device for cost-function based handoff determination using wavelet prediction in vertical networks
US7643830B2 (en) * 2006-07-17 2010-01-05 Qualcomm Incorporated Methods and apparatus for soft-decision based inter-radio access technology handover triggering

Also Published As

Publication number Publication date
US20080137613A1 (en) 2008-06-12
JP4977762B2 (ja) 2012-07-18
WO2008054800A2 (en) 2008-05-08
KR20100014246A (ko) 2010-02-10
WO2008054800A3 (en) 2008-09-04
EP2095650A2 (de) 2009-09-02
CN101647310B (zh) 2014-08-27
JP2010508709A (ja) 2010-03-18
CN101647310A (zh) 2010-02-10
US20140098794A1 (en) 2014-04-10
KR101437192B1 (ko) 2014-09-03
US8611302B2 (en) 2013-12-17
US9264969B2 (en) 2016-02-16
EP2095650A4 (de) 2010-11-03

Similar Documents

Publication Publication Date Title
EP2095650B1 (de) Dynamische netzauswahl unter verwendung von kernels
Nguyen-Vuong et al. On utility models for access network selection in wireless heterogeneous networks
Lahby et al. Optimal vertical handover based on TOPSIS algorithm and utility function in heterogeneous wireless networks
US10091785B2 (en) System and method for managing wireless frequency usage
EP3474619A1 (de) Verstärkungslernverfahren zur zuweisung von übertragungsbetriebsmitteln
Kim et al. Dynamic bandwidth provisioning using ARIMA-based traffic forecasting for Mobile WiMAX
Berthold et al. Detection of spectral resources in cognitive radios using reinforcement learning
Aibinu et al. Development of hybrid artificial intelligent based handover decision algorithm
US20080279152A1 (en) Method and apparatus for performing power consumption based handover between hybrid networks
Zineb et al. QoE-based vertical handover decision management for cognitive networks using ANN
CN111294812A (zh) 一种资源扩容规划的方法及系统
Kumar et al. A spectrum handoff scheme for optimal network selection in nemo based cognitive radio vehicular networks
Ezz-Eldien et al. Handover performance improvement in heterogeneous wireless network
Bari et al. Network selection with imprecise information in heterogeneous all-IP wireless systems
Huang et al. A generalized quasi-stationary approximation for analysis of an integrated service system
EP3595362B1 (de) Optimierung eines wi-fi-netzwerks mit mehreren range-extendern und zugehörige vorrichtungen
Giacomini et al. Optimizing end user QoS in heterogeneous network environments using reputation and prediction
Bendaoud Markov model and a modified-saw for network selection in a heterogeneous wireless environment
Wang et al. Solving the incertitude of vertical handovers in heterogeneous mobile wireless network using MDP
Charilas et al. Fuzzy-based handover decision with multi-attribute auctions in heterogeneous network environments
van den Berg et al. Dynamic network selection using kernels
Mohanan et al. Network selection problems-QoE vs QoS who is the winner?
CN112839366B (zh) 认知异构无线网络垂直切换方法
CN114449604B (zh) 基于图论和多属性决策联合的低轨卫星切换方法和装置
Tang et al. A Long-Term Utility Optimization-Based Heterogeneous Network Selection and Handover Algorithm

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20090602

AK Designated contracting states

Kind code of ref document: A2

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LI LT LU LV MC MT NL PL PT RO SE SI SK TR

RIN1 Information on inventor provided before grant (corrected)

Inventor name: VAN DEN BERG, ERIC

Inventor name: LYLES, BRIAN

Inventor name: GOPALAKRISHNAN, PRAVEEN

Inventor name: KIM, BYUNGSUK

DAX Request for extension of the european patent (deleted)
REG Reference to a national code

Ref country code: HK

Ref legal event code: DE

Ref document number: 1134732

Country of ref document: HK

A4 Supplementary search report drawn up and despatched

Effective date: 20101006

17Q First examination report despatched

Effective date: 20101015

RAP1 Party data changed (applicant data changed or rights of an application transferred)

Owner name: TELCORDIA LICENSING COMPANY LLC

REG Reference to a national code

Ref country code: DE

Ref legal event code: R079

Ref document number: 602007024226

Country of ref document: DE

Free format text: PREVIOUS MAIN CLASS: H04Q0007200000

Ipc: H04W0036140000

RIC1 Information provided on ipc code assigned before grant

Ipc: H04W 36/14 20090101AFI20111221BHEP

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LI LT LU LV MC MT NL PL PT RO SE SI SK TR

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: CH

Ref legal event code: EP

REG Reference to a national code

Ref country code: AT

Ref legal event code: REF

Ref document number: 568134

Country of ref document: AT

Kind code of ref document: T

Effective date: 20120815

Ref country code: IE

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: DE

Ref legal event code: R096

Ref document number: 602007024226

Country of ref document: DE

Effective date: 20120920

REG Reference to a national code

Ref country code: NL

Ref legal event code: VDEP

Effective date: 20120725

REG Reference to a national code

Ref country code: AT

Ref legal event code: MK05

Ref document number: 568134

Country of ref document: AT

Kind code of ref document: T

Effective date: 20120725

REG Reference to a national code

Ref country code: LT

Ref legal event code: MG4D

Effective date: 20120725

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: FI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120725

Ref country code: LT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120725

Ref country code: CY

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120725

Ref country code: AT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120725

Ref country code: IS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20121125

Ref country code: BE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120725

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120725

Ref country code: GR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20121026

Ref country code: SE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120725

Ref country code: LV

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120725

Ref country code: PT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20121126

Ref country code: PL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120725

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: NL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120725

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: DK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120725

Ref country code: RO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120725

Ref country code: CZ

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120725

Ref country code: EE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120725

Ref country code: ES

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20121105

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120725

Ref country code: SK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120725

Ref country code: MC

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20121031

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

26N No opposition filed

Effective date: 20130426

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: CH

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20121031

Ref country code: BG

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20121025

Ref country code: LI

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20121031

REG Reference to a national code

Ref country code: IE

Ref legal event code: MM4A

REG Reference to a national code

Ref country code: DE

Ref legal event code: R097

Ref document number: 602007024226

Country of ref document: DE

Effective date: 20130426

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20121031

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120725

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: TR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120725

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LU

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20121031

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: HU

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20071031

REG Reference to a national code

Ref country code: HK

Ref legal event code: WD

Ref document number: 1134732

Country of ref document: HK

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 10

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 11

REG Reference to a national code

Ref country code: DE

Ref legal event code: R082

Ref document number: 602007024226

Country of ref document: DE

Representative=s name: DTS PATENT- UND RECHTSANWAELTE SCHNEKENBUEHL U, DE

Ref country code: DE

Ref legal event code: R081

Ref document number: 602007024226

Country of ref document: DE

Owner name: TTI INVENTIONS A LLC, WILMINGTON, US

Free format text: FORMER OWNER: TELCORDIA LICENSING COMPANY LLC, PISCATAWAY, N.J, US

Ref country code: DE

Ref legal event code: R081

Ref document number: 602007024226

Country of ref document: DE

Owner name: NYTELL SOFTWARE LLC, BELLEVUE, US

Free format text: FORMER OWNER: TELCORDIA LICENSING COMPANY LLC, PISCATAWAY, N.J, US

REG Reference to a national code

Ref country code: GB

Ref legal event code: 732E

Free format text: REGISTERED BETWEEN 20171214 AND 20171222

REG Reference to a national code

Ref country code: DE

Ref legal event code: R082

Ref document number: 602007024226

Country of ref document: DE

Representative=s name: DTS PATENT- UND RECHTSANWAELTE SCHNEKENBUEHL U, DE

Ref country code: DE

Ref legal event code: R081

Ref document number: 602007024226

Country of ref document: DE

Owner name: NYTELL SOFTWARE LLC, BELLEVUE, US

Free format text: FORMER OWNER: TTI INVENTIONS A LLC, WILMINGTON, DEL., US

REG Reference to a national code

Ref country code: GB

Ref legal event code: 732E

Free format text: REGISTERED BETWEEN 20180201 AND 20180207

REG Reference to a national code

Ref country code: FR

Ref legal event code: TP

Owner name: TTI INVENTIONS A LLC, US

Effective date: 20180305

REG Reference to a national code

Ref country code: FR

Ref legal event code: TP

Owner name: NYTELL SOFTWARE LLC, US

Effective date: 20180622

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 12

P01 Opt-out of the competence of the unified patent court (upc) registered

Effective date: 20230522

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: GB

Payment date: 20230914

Year of fee payment: 17

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: FR

Payment date: 20230914

Year of fee payment: 17

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: DE

Payment date: 20230915

Year of fee payment: 17