A METHOD AND ARRANGEMENTS FOR SCHEDULING WIRELESS RESOURCES IN A WIRELESS NETWORK

Description

TECHNICAL FIELD

[0001] The present invention relates to service aware scheduling of resources in a wireless network. The invention relates to a method, a network node and a system for such scheduling.

BACKGROUND

[0002] In typical wireless communication networks, also known as cellular radio networks, user equipment communicate via a radio access network to one or more core networks. The user equipments may be mobile telephones or other mobile units with wireless capability, e.g. mobile terminals, laptops, car-mounted mobile devices which communicate voice and/or data with the radio access network.

[0003] The radio access network covers a geographical area which is divided into cell areas, with each cell area being served by a base station, known as e.g., eNodeB, eNB, or RBS. A cell is a geographical area where radio coverage is provided by the radio base station equipment at the base station site. The base stations communicate over the air interface with the user equipments within range of the base stations; operating on radio frequencies. Each radio base station in the access network has a limited budget of radio transmission resources that may be used to provide radio/wireless connectivity.

[0004] Long Term Evolution (LTE) is a fourth generation mobile communication system, following the Global System for Mobile Communications (GSM) and Wideband Code Division Multiple Access (WCDMA).

[0005] Scheduling is a key function to manage the limited radio resources in the radio access network. The scheduling functionality is typically included in a scheduler located in each base station. Each scheduler includes a radio resource management mechanism that is used to allocate radio resources to user equipment in the corresponding cell. The scheduler selects the user equipment to be scheduled and distributes the available transmission resources, such as frequency and time slots, to different user equipment. The scheduler may base the scheduling decisions on some sort of priority or weight that changes over time based on for example the time since a user equipment last was scheduled or the current radio conditions. Some radio access technologies, e.g., E-UTRAN and UTRAN, include scheduling functionality supporting dynamic scheduling of uplink (UL) and /or downlink (DL) data. The communication from the base station to the user equipment is performed on downlink (DL) and the communication from the user equipment to the base station is performed on uplink (UL). The transmission resources may be assigned to users and radio bearers according to the users' momentary traffic demand, QoS requirements, and estimated channel quality. Conventional scheduling include efficiency-driven scheduling promoting a high data volume, fairness-driven scheduling promoting a sequential scheduling in accordance to the time of request for a service, or priority-driven scheduling according to assigned priorities for requesting user equipment or the requested services. In a fully loaded network, it will not be possible to schedule radio resources to all requesting user equipment.

[0006] Although many different scheduling methods are available today, the known solutions are inadequate in many aspects. While standardization has introduced a framework for service differentiation in the scheduling of different services, scheduling methods at hand are inflexible and do support dynamical value oriented resource assignment, aiming at maximizing user and/or operator value at every time.

[0007] US 2008/0137537 discloses a state of the art centralized packet scheduler for a wireless communications network. The scheduler is aimed at improving network throughput and maximizing operator revenue by considering user group fairness as well as operator capabilities when scheduling transmission packets.

SUMMARY

[0008] It is an object of the present invention to provide an improved method of scheduling and allocating radio resources to a user equipment node in a wireless network.

[0009] It is another object of the invention to provide improved arrangements for scheduling radio resources to user equipment in a wireless radio network.

[0010] These objects are achieved by the invention as defined in the independent claims. Preferred embodiments are defined in the dependent claims.

BRIEF DESCRIPTION OF THE DRAWINGS

[0011] 

Figure 1

Exemplifying LTE architecture

Figure 2

Diagram illustrating priority based scheduling

Figure 3

Diagram illustrating value based scheduling

Figure 4

Block diagram illustrating an embodiment of a wireless communication network

Figure 5

Flow chart of an embodiment of the inventive method for scheduling radio resources

Figure 6

Block diagram illustrating an embodiment of an inventive network node

Figure 7

Block diagram illustrating an embodiment of an inventive system

DETAILED DESCRIPTION OF THE DRAWING

[0012] Figure 1 discloses an exemplifying wireless network 1 based on 3GPP LTE wherein mobile terminals UE receive varying types of service deliveries for which the future performance would benefit from reporting of terminal service evaluations. The wireless network 1 includes a radio access system or network (RAN) such as E-UTRAN, comprising at least one radio base station 2 (eNB). The RAN is connected over an interface such as the S1-interface to at least one core network, which is connected to external networks, not shown in fig. 1. The core network comprises mobility management entities (MME) which handles control signaling for instance for mobility.

[0013] The RAN provides communication and control for a plurality of user equipments (UE) 3, and each of the radio base stations 2 is serving a respective cell in which the UEs 3 are located and possibly moving. Each of the user equipments 3 uses a respective downlink channel (DL) and a respective uplink channel (UL) to communicate with the radio base station 2.

[0014] The wireless network and communication system is herein described as an LTE radio access network. However, the skilled person realizes that the inventive method, system and network node work on other wireless networks as well.

[0015] Figure 2 discloses priority based scheduling according to prior art. Three different services 1,2 and 3 are assigned a different priority value by the operator. The priority value may be the value to the operator of delivering the service. This is illustrated in Figure 2, where five boxes correspond to five different users using one of the services 1, 2 or 3. The height of the boxes corresponds to the value obtained by scheduling the service, while the width of the boxes corresponds to the resources needed to obtain the value. It can be seen that the same value is obtained by all the users using service 3, but the resource usage varies, which is a result of the different radio conditions of the users. In the example the network is fully loaded, meaning that all users cannot be scheduled. A scheduler using a value based, static prioritization would schedule the users using service 1 and service 2 first, and leave out the three users using service 3, even though the total value would be higher if all three users using service 3 would have been scheduled instead of the user using service 2, as illustrated in Figure 3.

[0016] Figure 4 discloses a block diagram illustrating an embodiment of a wireless communication network wherein the inventive method is practice. The wireless communication network includes a radio access network (RAN) node 44, a core network (CN) node 43, an operation and maintenance (OaM) system 42 providing an operator interface to the RAN 44 and the CN 43, and an IP interface to a set A-C of service providers 41. The CN includes a PCRF - policy and charging rules function, also denoted service aware policy controller (SAPC). The CN further includes a policy and charging enforcement function (PCEF) that may perform Deep Packet Inspection (DPI). This function may be implemented in a service aware support node (SASN) or some other core network node. A service accelerator (SA) may cache service data on behalf of a service provider, and have negotiated service information sent from the service provider. The negotiated service information may include detailed service information as well as service indications describing the content. The detailed service information may consist of one or more of, but not limited to, service coding information such as codec details and suitable bitrates, error correction precautions, latency requirements, mean opinion score information, etc. This means that the service accelerator may be capable of providing details concerning the predicted end user perceived quality and value, as well as indicating which service description the received data should be associated to. The service accelerator may convey service information to the OaM system or to the operator core network.

[0017] The PCEF implements the deep packet inspection mapping a first service identifier to a second service identifier representing the performance to value for an operator as well as a user. The first service identifier could be provided via IP packet marking.

[0018] In an embodiment for implementing the invention in the wireless network structure disclosed in Figure 4, the PCEF identifies the service type of a service request and associates packets to a service identifier, and/or to different bearers. Information relating to performance to value for the user/operator is submitted to the RAN through the OaM. The OaM may also combine user and operator values into a combined user/operator value. One example is that the operator value is a function of the user value.

[0019] The OaM may also receive service information directly from the service provider, either via business agreements, or via enriched service descriptions. The service information can also be aggregated in a node based on service quality reports from the user terminals.

[0020] Service definitions may also be standardized, whereby the service provider (service identifier) provides more details about the service including a performance to user value. The performance to operator value is configured through the OaM to RAN (also configuration provider).

[0021] Figure 5 discloses a flow chart of an embodiment of the inventive method for scheduling radio resources to a user equipment node in a wireless network. In a first step 51 a service request is received in a network node, e.g., a radio access node, from user equipment in the scheduling domain of the network node. The service request relates to a specified service type. Such service types may e.g. be conversational voice, conversational video, real time gaming, non-conversational video IP multimedia subsystem (IMS) signaling, live streaming video, interactive gaming, buffered streaming video etc.

[0022] In a subsequent step 52, the performance of the service is mapped to the user value; thus forming a performance to user value relationship. The performance to value relationship could include information relating to a mapping of the performance of a service to the user value in terms of for example quality, or mean opinion score (MOS). The performance may be expressed as a performance function, depending on for example throughput and/or delay margin. The performance function may look different for different services and users, but should be normalized in a way to make them comparable. For example, for a delay sensitive service, such as video telephony, the performance would depend mainly on the delay margin, while for a service where throughput is more important, the performance function would depend mainly on throughput. Different relations may be defined for different service and user subscription combinations.

[0023] The performance to user value mapping could be predefined by the service provider. Default mappings for the most common services may be preconfigured by the vendor in the radio access network or an operation and support system (OSS) in the core network. However, performance to user value mapping may also be redefined at any time in the wireless network through a service accelerator in the core network.

[0024] The performance to operator value relationship is retrieved in another step 53. This performance to operator relationship could include information relating to the performance of a service mapped to an operator value in terms of for example overall quality, total user satisfaction, goodwill or even money. This could for example be done by translating the user value into operator value and using the performance to user value mapping. For example, if a mapping of throughput to mean opinion score (MOS) is available, this could be translated to a mapping of throughput to operator value by defining the operator value for each MOS. The value would typically depend on service, subscription type and the business model of the operator and is hence best suited to be defined by the operator. Thus the operator value could be dependent upon the user value. However, the operator value could also be set independently of the perceived user value.

[0025] The performance to value relationship is approximated with a scheduling weight function in step 54. The step includes combining the performance to user value relationship with the performance to operator value relationship and approximating the combined the performance to value relationship with a continuous function, a value curve. The value curve could represent a concave function, whereupon the resulting value curve will have a continuously decreasing derivative. The value curve may be scaled with the spectral efficiency, or the number of bits that can be transmitted per resource block, for each user. The scaling could be based on signal to interference and noise ratio (SINR) of the user or any other suitable measurement. Following the scaling, a user equipment that can transmit a certain number of bits using only a few resources relatively will be valued higher for a given service than a user equipment with worse radio conditions that need more resources to transfer the same amount of bits. The value curved is translated into a scheduling weight function, e.g., by differentiating the value curve, obtaining the value increase per performance increase. Performance can be a function of for example throughput and/or delay margin. Using the derivative of the value curve as the scheduling weight function, a scheduling based on this scheduling weight function will prioritize a user that will increase the (relative) user or operator value the most given the current performance.

[0026] In an alternative embodiment, the value curve is used together with an approximation of the performance increase that can be obtained by scheduling the user at the given time instant to form a scheduling weight function. The resulting value increase from this scheduling is mapped to scheduling weight using a linear transformation.

[0027] Previous performance for service delivery of the service type is evaluated. A performance estimate is generated that in step 55 is applied to the scheduling weight function in order to determine scheduling weight for the service request.

[0028] Information on scheduling weight for the service request is forwarded to a conventional scheduler in the radio access node. In step 56, scheduling weights for valid scheduling requests are compared. The scheduling is concluded in step 57, where radio resources are allocated to a scheduling request having the most significant scheduling weight, in the sense that a higher scheduling weight is more significant than a lower scheduling weight. A pre-requisite for the scheduling is that sufficient radio resources are available to fulfill the resource requirements for the service request.

[0029] The steps disclosed for the embodiment illustrated in Figure 4, may be executed in the radio access network or the core network. However, it is preferable that the steps 54-55 relating to actually obtaining the scheduling weight are performed in the radio access network close to the scheduler performs the actual grant of radio resources for the received service request.

[0030] The method disclosed in Figure 5 and any other embodiment of the inventive method, may be built upon existing interfaces and protocols with only limited refinement of underlying semantics. However, the additional configuration information is required in the interface between the network management system/OSS system and the radio access network as well as the core network. In the case of network management system centered management, the information would flow on itf-N (3GPP).

[0031] In figure 6, an embodiment of an inventive network node 60 is illustrated in a block diagram format. A service identifier 61 is arranged to identify a service type and expected delivery associated with a service request.

[0032] A scheduling weight (function) deriver determines a scheduling weight function or scheduling weight. The scheduling weight (function) deriver receives a service indication from the service identifier 61 and input from a configuration provider. The configuration provider could be arranged in a network management system, the OSS system or any other entity by means of which the operator or service provider may configure a service. The service identifier 61 transfers service information in the form of a service indication to the scheduling weight (function) deriver.

[0033] The configuration provider is arranged to deliver a performance to user and/or operator value mapping per service and user subscription also known as a performance to value relationship. The performance to value relationship is received in the scheduling weight (function) deriver 63. That performs the steps 53 -55 disclosed in Figure 5 and previously discussed. The determined scheduling weight is communicated to a scheduler 63 that effects the actual scheduling of radio resources for a service request

[0034] Figure 6 discloses an embodiment wherein the service identifier, the scheduling weight (function) deriver and the scheduler are part of a common network node. However, it is obvious to the person skilled in the art that the service identifier could be part of a network node in the radio access network as well as in the core network. The scheduling weight (function) deriver is preferably arranged in the radio access network, with one scheduling weight (function) deriver associated with a corresponding scheduler in each radio base station. The scheduling weight (function) deriver may be arranged as part of the scheduler, as disclosed in figure 5, but could also be a separate logical entity within the network node.

[0035] In figure 7, an embodiment of an inventive system 70 for service aware scheduling is illustrated in a block diagram format. The system includes a service identifier 71 arranged to identify the service configuration associated with a service request and to transfer this information in the form as a service identification. The service identifier could be located in one or more of a radio access node, a control node, a service provider and/or a service accelerator.

[0036] A configuration provider 72 provides the configuration per service, including the performance to value relationship based on operator and/or user value mapping. The configuration provider could also derive a performance to weight mapping based on the mapping of performance related to operator and/or user value. The configuration provider 72 is preferably part of a control node, i.e., a network management system, en operation and maintenance system, a service provider and/or a service accelerator.

[0037] The scheduling weight deriver 73 receives service information and service configuration including operator/user value per service. A scheduling weight function or a scheduling weight is derived, e.g. according to the method embodiment described in relation to Figure 7. The information from the configuration provider includes a service configuration including a weight function per service. The output from the scheduling weight deriver may be scaled with the transmission performance, e.g., the spectral efficiency, the number of bits that can be transmitted per resource block for each user, and the power headroom. The scaling will provide a result indicating that a user equipment that may transmit a certain number of bits using only a few resources will be valued higher than a user equipment with conditions that require more resources for the transfer of the same amount of bits.

[0038] A scheduler 74 in the radio access node receives the output from the scheduling weight deriver. A scheduling decision is based on the output from the scheduling weight deriver. In an embodiment of the invention, the scheduling weight deriver may be included in the scheduler as disclosed in figure 6.

[0039] The description above discloses the best mode presently contemplated for practising the invention, but should not be perceived as limiting to the invention. The scope of the invention should only be ascertained with reference to the issued claims.

Claims

1. A method for service aware scheduling of wireless resources in a wireless network comprising:

- receiving (51) a service request for service delivery of a service type;

- retrieving (52) a performance to user value relationship associated with the service request for service delivery of the service type, wherein the performance to user value relationship comprises information relating to a mapping of performance of a service to a user value;

- retrieving (53) a performance to operator value relationship associated with the service request for service delivery of the service type, wherein the performance to operator value relationship comprises information relating to a mapping of performance of the service to an operator value;

- approximating (54) the performance to user value relationship and the performance to operator value relationship with a scheduling weight function; and

- scheduling (58) wireless resources based on the scheduling weight function.

2. A method according to Claim 1, wherein the scheduling weight function is associated with service delivery of the service type.

3. A method according to any of the preceding claims, wherein a scheduling weight (55) is determined by applying a performance estimate of previous performance for service delivery of the service type to the scheduling weight function.

4. A method according to Claim 3, further including a step of comparing (56) the scheduling weight with scheduling weights for competing service requests and performing the scheduling of wireless resources based on this comparison.

5. A method according to any of the preceding claims, further including a step of evaluating (57) a transmission performance prior to scheduling.

6. A method according to any of the preceding claims, wherein the performance to user value relationship is defined by a service provider in a network management system, an operation support system, a service accelerator or a core network node .

7. A method according to any of the preceding claims, wherein the performance to operator value relationship is defined by an operator in a network management system, an operation support system, a service accelerator or a core network node.

8. A scheduling weight deriver (62) for use in an operation and support system (42) for use in the method of service aware scheduling of wireless resources in a wireless network according to any claims 1-7, comprising a first interface arranged to receive information from a service provider on a performance to user value relationship associated with a service request for a service type, a second interface arranged to receive information from an operator on a performance to operator value relationship associated with the service request for the service type and means to approximate a combination of the performance to user value relationship and the performance to operator value relationship with a scheduling weight function reflecting an aggregated performance to value relationship, wherein the performance to user value relationship comprises information relating to a mapping of performance of a service to a user value and the performance to operator value relationship comprises information relating to a mapping of performance of the service to an operator value.

9. A network node (60) for service aware scheduling in a wireless network comprising:

- a scheduling weight deriver (62) arranged to receive information identifying a service type for a received service request, to retrieve information on a performance to user value relationship associated with the received service request for the service type, to retrieve information on a performance to operator value relationship associated with the received service request and to determine a scheduling weight for the received service request, wherein the performance to user value relationship comprises information relating to a mapping of performance of a service to a user value and the performance to operator value relationship comprises information relating to a mapping of performance of the service to an operator value; and

- a scheduler (63) arranged to receive the scheduling weight and schedule wireless resources based on a combination of the scheduling weight and a transmission performance.

10. A network node (60) according to Claim 9, further comprising a service identifier (61) providing service information in the form of a service indication to the scheduling weight deriver.

11. A network node (60) according to any of Claims 9-10, wherein the scheduling weight deriver (61) is part of the scheduler (62).

12. A network node (60) according to any of Claims 9-11, wherein a transmission performance includes spectral efficiency, bitrate, and/or power headroom.

13. A system (70) for service aware scheduling in a wireless network comprising:

- a service identifier (71) arranged to identify a service type for a received service request;

- a configuration provider (72) arranged to determine a performance to user value relationship and a performance to operator value relationship associated with the received service request for the service type, wherein the performance to user value relationship comprises information relating to a mapping of performance of a service to a user value and the performance to operator value relationship comprises information relating to a mapping of performance of the service to an operator value;

- a scheduling weight deriver (73) arranged to receive information from the service identifier and from the configuration provider and to determine a scheduling weight for the received service request; and

- a scheduler (74) arranged to receive the scheduling weight and schedule wireless resources based on a combination of the scheduling weight and a transmission performance.

14. A system according to Claim 13, wherein the configuration provider (72) includes a memory storing preconfigured performance to value relationships for a set of service types available to user equipment nodes in the network.

15. A system according to Claims 13 or 14, wherein the scheduling weight deriver is a scheduling weight function deriver and the transmission performance includes spectral efficiency, bit rate, and/or power headroom.

Ansprüche

1. Verfahren für die servicebewusste Verplanung von drahtlosen Ressourcen in einem drahtlosen Netzwerk, umfassend:

- Empfangen (51) einer Serviceanfrage für eine Servicebereitstellung eines Servicetyps;

- Abrufen (52) eines Verhältnisses der Leistung zum Nutzerwert, das mit der Serviceanfrage für die Servicebereitstellung des Servicetyps verknüpft ist, wobei das Verhältnis der Leistung zum Nutzerwert Informationen in Bezug auf eine Zuordnung der Leistung eines Services zu einem Nutzerwert umfasst;

- Abrufen (53) eines Verhältnisses der Leistung zum Betreiberwert, das mit der Service-anfrage für die Servicebereitstellung des Servicetyps verknüpft ist, wobei das Verhältnis der Leistung zum Betreiberwert Informationen in Bezug auf eine Zuordnung der Leistung des Services zu einem Betreiberwert umfasst;

- Angleichen (54) des Verhältnisses der Leistung zum Nutzerwert und des Verhältnisses der Leistung zum Betreiberwert mit einer Gewichtsfunktion für die Verplanung; und

- Verplanen (58) drahtloser Ressourcen auf Grundlage der Gewichtsfunktion für die Verplanung.

2. Verfahren nach Anspruch 1, wobei die Gewichtsfunktion für die Verplanung mit der Servicebereitstellung des Servicetyps verknüpft ist.

3. Verfahren nach einem der vorhergehenden Ansprüche, wobei ein Verplanungsgewicht (55) ermittelt wird, indem eine Leistungsschätzung der vorherigen Leistung für die Servicebereitstellung des Servicetyps für die Gewichtsfunktion der Verplanung angewendet wird.

4. Verfahren nach Anspruch 3, ferner einschließend einen Schritt zum Vergleichen (56) des Verplanungsgewichts mit Verplanungsgewichten für konkurrierende Serviceanfragen und Durchführen der Verplanung von drahtlosen Ressourcen auf Grundlage dieses Vergleichs.

5. Verfahren nach einem der vorhergehenden Ansprüche, ferner einschließend einen Schritt zum Bewerten (57) einer Übertragungsleistung vor der Verplanung.

6. Verfahren nach einem der vorhergehenden Ansprüche, wobei das Verhältnis der Leistung zum Nutzerwert durch einen Serviceprovider in einem Netzwerkmanagementsystem, einem Betriebsunterstützungssystem, einem Serviceakzelerator oder einem Kernnetzwerkknoten definiert wird.

7. Verfahren nach einem der vorhergehenden Ansprüche, wobei das Verhältnis der Leistung zum Betreiberwert durch einen Betreiber in einem Netzwerkmanagementsystem, einem Betriebsunterstützungssystem, einem Serviceakzelerator oder einem Kernnetzwerkknoten definiert wird.

8. Ein Verplanungsgewichtableiter (62) zur Verwendung in einem Betriebs- und Unterstützungssystem (42) zur Verwendung in dem Verfahren für die servicebewusste Verplanung von drahtlosen Ressourcen in einem drahtlosen Netzwerk, nach einem der Ansprüche 1-7, umfassend eine erste Schnittstelle, die angeordnet ist, um von einem Serviceprovider Informationen über ein Verhältnis der Leistung zum Nutzerwert zu empfangen, das mit einer Service-anfrage für einen Servicetyp verknüpft ist, eine zweite Schnittstelle, die angeordnet ist, um von einem Betreiber Informationen über ein Verhältnis der Leistung zum Betreiberwert zu empfangen, das mit der Serviceanfrage für den Servicetyp verknüpft ist und ein Mittel zum Angleichen einer Kombination des Verhältnisses der Leistung zum Nutzerwert und des Verhältnisses der Leistung zum Betreiberwert mit einer Gewichtsfunktion für die Verplanung, die ein zusammengesetztes Verhältnis der Leistung zum Wert widerspiegelt, wobei das Verhältnis der Leistung zum Nutzerwert Informationen in Bezug auf eine Zuordnung der Leistung eines Services zu einem Nutzerwert umfasst und das Verhältnis der Leistung zum Betreiberwert Informationen in Bezug auf eine Zuordnung der Leistung des Services zu einem Betreiberwert umfasst.

9. Netzwerkknoten (60) für die servicebewusste Verplanung in einem drahtlosen Netzwerk, umfassend:

- einen Verplanungsgewichtableiter (62), der angeordnet ist, um Informationen zu empfangen, die einen Servicetyp für eine empfangene Serviceanfrage identifizieren, um Informationen über ein Verhältnis der Leistung zum Nutzerwert abzurufen, das mit der empfangenen Serviceanfrage für den Servicetyp verknüpft ist, um Informationen über ein Verhältnis der Leistung zum Betreiberwert abzurufen, das mit der empfangenen Serviceanfrage verknüpft ist und um ein Verplanungsgewicht für die empfangene Serviceanfrage zu bestimmen, wobei das Verhältnis der Leistung zum Nutzerwert Informationen in Bezug auf eine Zuordnung der Leistung eines Services zu einem Nutzerwert umfasst und das Verhältnis der Leistung zum Betreiberwert Informationen in Bezug auf eine Zuordnung der Leistung des Services zu einem Betreiberwert umfasst; und

- einen Planer (63), der angeordnet ist, um das Verplanungsgewicht zu empfangen und drahtlose Ressourcen auf Grundlage einer Kombination des Verplanungsgewichts und einer Übertragungsleistung zu verplanen.

10. Netzwerkknoten (60) nach Anspruch 9, ferner umfassend eine Servicekennung (61), die Serviceinformationen in Form einer Serviceanzeige für den Verplanungsgewichtableiter bereitstellt.

11. Netzwerkknoten (60) nach einem der Ansprüche 9-10, wobei der Verplanungsgewichtableiter (61) Teil des Planers (62) ist.

12. Netzwerkknoten (60) nach einem der Ansprüche 9-11, wobei eine Übertragungsleistung eine spektrale Effizienz, eine Bitrate und/oder Energiereserven einschließt.

13. System (70) für die servicebewusste Verplanung in einem drahtlosen Netzwerk, umfassend:

- eine Servicekennung (71), die angeordnet ist, um einen Servicetyp für eine empfangene Serviceanfrage zu identifizieren;

- einen Konfigurationsprovider (72), der angeordnet ist, um ein Verhältnis der Leistung zum Nutzerwert und ein Verhältnis der Leistung zum Betreiberwert zu bestimmen, verknüpft mit der empfangenen Serviceanfrage für den Servicetyp, wobei das Verhältnis der Leistung zum Nutzerwert Informationen in Bezug auf eine Zuordnung der Leistung eines Services zu einem Nutzerwert umfasst und das Verhältnis der Leistung zum Betreiberwert Informationen in Bezug auf eine Zuordnung der Leistung des Services zu einem Betreiberwert umfasst;

- einen Verplanungsgewichtableiter (73), der angeordnet ist, um Informationen von der Servicekennung und von dem Konfigurationsprovider zu empfangen und um ein Verplanungsgewicht für die empfangene Serviceanfrage zu bestimmen; und

- einen Planer (74), der angeordnet ist, um das Verplanungsgewicht zu empfangen und drahtlose Ressourcen auf Grundlage einer Kombination des Verplanungsgewichts und einer Übertragungsleistung zu verplanen.

14. System nach Anspruch 13, wobei der Konfigurationsprovider (72) einen Speicher einschließt, der vorkonfigurierte Verhältnisse der Leistung zum Wert für eine Reihe von Servicetypen speichert, die für Benutzergeräteknoten in dem Netzwerk verfügbar sind.

15. System nach den Ansprüchen 13 oder 14, wobei der Verplanungsgewichtableiter ein Ableiter für die Gewichtsfunktion der Verplanung ist und die Übertragungsleistung eine spektrale Effizienz, eine Bitrate und/oder Energiereserven einschließt.

Revendications

1. Procédé pour une planification en fonction d'un service de ressources sans fil dans un réseau sans fil, comprenant :

- la réception (51) d'une demande de service pour une prestation de service d'un type de service ;

- la récupération (52) d'un rapport de performance/valeur d'utilisateur associé à la demande de service pour une prestation de service du type de service, dans lequel le rapport de performance/valeur d'utilisateur comprend de l'information concernant une mise en correspondance entre la performance d'un service et une valeur d'utilisateur ;

- la récupération (53) d'un rapport de performance/valeur d'opérateur associé à la demande de service pour la prestation de service du type de service, dans lequel le rapport de performance/valeur d'opérateur comprend de l'information concernant une mise en correspondance entre la performance du service et la valeur d'opérateur ;

- l'approximation (54) du rapport de performance/valeur d'utilisateur et du rapport de performance/valeur d'opérateur avec une fonction de pondération de planification ; et

- la planification (58) de ressources sans fil sur la base de la fonction de pondération de planification.

2. Procédé selon la revendication 1, dans lequel la fonction de pondération de planification est associée à la prestation de service du type de service.

3. Procédé selon l'une quelconque des revendications précédentes, dans lequel un coefficient de pondération de planification (55) est déterminé en appliquant une valeur estimée d'une performance antérieure pour la prestation de service du type de service à la fonction de pondération de planification.

4. Procédé selon la revendication 3, comprenant en outre une étape de comparaison (56) du coefficient de pondération de planification avec des coefficients de pondération de planification pour des demandes de service concurrentes, et la réalisation de la planification de ressources sans fil sur la base de cette comparaison.

5. Procédé selon l'une quelconque des revendications précédentes, comprenant en outre une étape d'évaluation (57) d'une performance de transmission avant la planification.

6. Procédé selon l'une quelconque des revendications précédentes, dans lequel le rapport de performance/valeur d'utilisateur est défini par un prestataire de services dans un système de gestion de réseau, un système de soutien des opérations, un accélérateur de service ou un noeud de réseau central.

7. Procédé selon l'une quelconque des revendications précédentes, dans lequel le rapport de performance/valeur d'opérateur est défini par un opérateur dans un système de gestion de réseau, un système de soutien des opérations, un accélérateur de service ou un noeud de réseau central.

8. Dispositif d'obtention de coefficient de pondération de planification (62) pour l'utilisation dans un système de soutien et d'exploitation (42) pour l'utilisation avec le procédé de planification en fonction d'un service de ressources sans fil dans un réseau sans fil selon l'une quelconque des revendications 1 à 7, comprenant une première interface étudiée pour recevoir de l'information d'un prestataire de services concernant un rapport de performance/valeur d'utilisateur associé à une demande de service pour un type de service, une deuxième interface étudiée pour recevoir de l'information d'un opérateur concernant un rapport de performance/valeur d'opérateur associé à la demande de service pour le type de service, et un moyen pour l'approximation d'une combinaison entre le rapport de performance/valeur d'utilisateur et le rapport de performance/valeur d'opérateur avec une fonction de pondération de planification reflétant un rapport agrégé de performance/valeur, dans lequel le rapport de performance/valeur d'utilisateur comprend de l'information concernant une mise en correspondance entre une performance d'un service et une valeur d'utilisateur, et le rapport de performance/valeur d'opérateur comprenant de l'information concernant une mise en correspondance entre une performance du service et une valeur d'opérateur.

9. Noeud de réseau (60) pour une planification en fonction d'un service dans un réseau sans fil, comprenant :

- un dispositif d'obtention de coefficient de pondération de planification (62) étudié pour recevoir de l'information identifiant un type de service pour une demande de service reçue, pour récupérer de l'information sur un rapport de performance/valeur d'utilisateur associé à la demande de service reçue pour le type de service, pour récupérer de l'information sur un rapport de performance/valeur d'opérateur associé à la demande de service reçue, et pour déterminer un coefficient de pondération de planification pour la demande de service reçue, dans lequel le rapport de performance/valeur d'utilisateur comprend de l'information concernant une mise en correspondance entre la performance d'un service et une valeur d'utilisateur, et le rapport de performance/valeur d'opérateur comprenant de l'information concernant une mise en correspondance entre la performance du service et une valeur d'opérateur ; et

- un planificateur (63) étudié pour recevoir le coefficient de pondération de planification et planifier des ressources sans fil sur la base d'une combinaison du coefficient de pondération de planification et d'une performance de transmission.

10. Noeud de réseau (60) selon la revendication 9, comprenant en outre un identificateur de service (61) fournissant de l'information de service sous la forme d'une indication de service au dispositif d'obtention de coefficient de pondération de planification.

11. Noeud de réseau (60) selon l'une quelconque des revendications 9 à 10, dans lequel le dispositif d'obtention de coefficient de pondération de planification (61) fait partie du planificateur (62).

12. Noeud de réseau (60) selon l'une quelconque des revendications 9 à 11, dans lequel une performance de transmission comprend une efficacité spectrale, un taux de bits et/ou une marge de puissance.

13. Système (70) pour une planification en fonction d'un service dans un réseau sans fil, comprenant :

- un identificateur de service (71) étudié pour identifier un type de service pour une demande de service reçue ;

- un fournisseur de configuration (72) étudié pour déterminer un rapport de performance/valeur d'utilisateur et un rapport de performance/valeur d'opérateur associés à la demande de service reçue pour le type de service, dans lequel le rapport de performance/valeur d'utilisateur comprend de l'information concernant une mise en correspondance entre la performance d'un service et une valeur d'utilisateur, et le rapport de performance/valeur d'opérateur comprenant de l'information concernant une mise en correspondance entre une performance du service et une valeur d'opérateur ;

- un dispositif d'obtention de coefficient de pondération de planification (73) étudié pour recevoir de l'information de l'identificateur de service et du fournisseur de configuration et pour déterminer un coefficient de pondération de planification pour la demande de service reçue ; et

- un planificateur (74) étudié pour recevoir le coefficient de pondération de planification et pour planifier des ressources sans fil sur la base d'une combinaison entre le coefficient de pondération de planification et une performance de transmission.

14. Système selon la revendication 13, dans lequel le fournisseur de configuration (72) comprend une mémoire stockant des rapports préconfigurés de performance/valeur pour un ensemble de type de services disponibles pour des noeuds d'équipements utilisateurs dans le réseau.

15. Système selon les revendications 13 ou 14, dans lequel le dispositif d'obtention de coefficient de pondération de planification est un dispositif d'obtention de fonction de pondération de planification, et la performance de transmission comprenant une efficacité spectrale, un taux de bits et/ou une marge de puissance.

Drawing