CN117915483A

CN117915483A - Resource allocation method, device and system

Info

Publication number: CN117915483A
Application number: CN202211282053.8A
Authority: CN
Inventors: 闫中江; 侯伟波; 李�杰; 侯选哲; 李波; 杨懋; 谭延营; 孙霞
Original assignee: Huawei Technologies Co Ltd
Current assignee: Huawei Technologies Co Ltd
Priority date: 2022-10-19
Filing date: 2022-10-19
Publication date: 2024-04-19

Abstract

The application provides a resource allocation method, a resource allocation device and a resource allocation system, which are applied to the technical field of communication. The resource allocation method provided by the application comprises the following steps: the central control node determines the sequence of allocating resources for each service flow in the service flows of multiple service types according to the priority of the resource allocation rule corresponding to the service flows of multiple service types in the network; the central control node determines a resource allocation result according to the sequence of allocating resources for each of the service flows of the plurality of service types and the resource allocation rule corresponding to each of the service flows, wherein the resource allocation result is used for indicating the resources allocated for each of the service flows of the plurality of service types; the central control node sends the resource allocation result to non-central control nodes in the network. The method can be applied to multi-hop heterogeneous networks, and the central control node can allocate resources for the service flows according to QoS requirements of the service flows of various service types in the network.

Description

Resource allocation method, device and system

Technical Field

The present application relates to the field of communications technologies, and in particular, to a method, an apparatus, and a system for resource allocation

Background

The wireless home network is a heterogeneous network formed by short-distance communication technologies such as wireless-fidelity (WiFi) and Bluetooth, and has the characteristics of large capability difference of communication equipment (nodes for short) and various wireless link types. In order to solve the problems of equipment air interface interference and resource competition in a wireless home network, a topology diagram of equipment networking relation can be constructed at a central control node of the home network by adopting technologies such as network topology discovery and the like, so that corresponding network resources are distributed for service transmission among different nodes in the home network through the central control node.

However, the wireless home network topology constructed at the central control node is typically a multi-hop network topology due to limited transmit power of the nodes, limited number of communication devices each node can connect to, and so on.

In recent years, methods such as convex optimization theory, bipartite graph matching theory or game theory are widely adopted in academia, a resource allocation algorithm in a wireless network is modeled as an optimization problem, and the goals of throughput maximization or time delay minimization are achieved by allocating corresponding network resources for wireless service.

However, the above-described research methods are generally applicable only to single-hop or homogeneous network types, i.e. networks having only a single link type. Furthermore, the problem solved by the above-described research methods is typically a resource allocation optimization problem that is only targeted to a single objective. There is currently no solution for how to allocate network resources based on different quality of service (quality ofservice, qoS) requirements for different services in a multi-hop heterogeneous network.

Disclosure of Invention

The embodiment of the application provides a resource allocation method, device and system, which are used for solving the problem of how to allocate network resources based on different QoS requirements of different services in a multi-hop heterogeneous network.

In order to achieve the above purpose, the embodiment of the present application adopts the following technical scheme:

In a first aspect, a resource allocation method is provided, where the method may be performed by a central control node, may be performed by a component of the central control node (e.g., a processor, a chip, or a system-on-chip, etc.), and may be implemented by a logic module or software that is capable of implementing all or part of the functions of the central control node. The method will be described below by taking the execution body as a central control node as an example. The method is applied to the multi-hop heterogeneous network, and comprises the following steps: the central control node determines the sequence of allocating resources for each service flow in the service flows of multiple service types according to the priority of the resource allocation rule corresponding to the service flows of the multiple service types in the network, wherein the priority of the resource allocation rule corresponding to each service flow is determined according to the QoS requirement of the service flow of the corresponding service type; then, the central control node determines a resource allocation result according to the sequence of allocating resources for each of the plurality of service types of service flows and the resource allocation rule corresponding to each of the plurality of service flows, wherein the resource allocation result is used for indicating the resources allocated for each of the plurality of service types of service flows; the central control node sends the resource allocation result to non-central control nodes in the network.

Based on the resource allocation method provided by the embodiment of the application, the central control node can determine the sequence of allocating resources for the service flows in the network based on the priority of the resource allocation rule, and allocate the resources for the service flows according to the sequence of allocating the resources for the service flows and by combining the corresponding resource allocation rule. Wherein the priority of the resource allocation rule is determined based on the QoS requirements of the traffic. Therefore, the central control node performs resource allocation based on the resource allocation rule, so that resources can be allocated to a plurality of service flows simultaneously under the condition that the service with higher QoS requirement is guaranteed to obtain the required QoS preferentially, and network resources can be allocated based on different QoS requirements of different services in the multi-hop network. And the resource allocation rule can be adjusted and modified according to the specific condition of the network, and has the advantages of easy maintenance and easy adjustment.

In combination with the above first aspect, in one possible design, the service type includes a bandwidth guarantee type, a large file transfer type, or a low-latency, high-reliability message transfer type.

With reference to the first aspect, in one possible design, the service flows of the multiple service types include a service flow of a first service type, where the service flow of the first service type includes multiple service flows; wherein the resource allocation order of each of the plurality of traffic flows of the first traffic type is determined based on the priority of each of the plurality of traffic flows of the first traffic type. Based on the scheme, the central control node can determine a scheme for distributing resources for the service flows based on the priorities of the service flows, can distribute resources for the service flows with higher priorities preferentially, and ensures that the service flows with higher priorities can be transmitted smoothly.

With reference to the first aspect, in one possible design, the method further includes: the central control node determines the equivalent bandwidth of a target routing path carrying the first service flow; wherein the first traffic stream is one of a plurality of traffic types of traffic streams; the central control node determines a resource allocation result according to the sequence of allocating resources for each service flow in the service flows of a plurality of service types and the resource allocation rule corresponding to each service flow, and the method comprises the following steps: the central control node determines that resources are required to be allocated to the service flows of the service type to which the first service flow belongs currently according to the sequence of allocating resources to each of the service flows of the plurality of service types; and the central control node determines resources allocated for the first service flow in a resource allocation result according to the equivalent bandwidth of the target routing path carrying the first service flow and a resource allocation rule corresponding to the service flow of the service type to which the first service flow belongs. Based on the scheme, a scheme for determining the size of the resources allocated to the service flow according to the equivalent bandwidth of the routing path carrying the service flow is provided.

With reference to the first aspect, in one possible design, each of the plurality of service types of service flows has a priority; the central control node determines resources allocated for the first service flow in a resource allocation result according to the equivalent bandwidth of a target routing path carrying the first service flow and a resource allocation rule corresponding to the service flow of the service type to which the first service flow belongs, and the method comprises the following steps: the central control node determines the size of the resources to be allocated to the first service flow according to the resource allocation rule corresponding to the service flow of the service type to which the first service flow belongs by combining the guaranteed bandwidth of the first service flow and the equivalent bandwidth of the target routing path carrying the first service flow; the central control node determines the size of the resources allocated for the second service flow, wherein the second service flow is a service flow with priority not lower than that of the first service flow in the established service flows; when the sum of the size of the resources allocated for the second service flow and the size of the resources to be allocated for the first service flow is smaller than or equal to the size of the resources to be allocated, the central control node allocates the size of the resources for the first service flow according to the size of the resources to be allocated for the first service flow; or in the case that the sum of the size of the resources allocated for the second traffic flow and the size of the resources that the first traffic flow needs to be allocated is larger than the size of the resources that can be allocated, the central control node determines not to allocate resources for the first traffic flow.

Based on the scheme, the access control evaluation can be carried out on the service flow based on the guaranteed bandwidth of the service flow, the equivalent bandwidth of the routing path of the service flow and the resources of the service flow which are allocated to the service flow with priority not lower than that of the service flow, so that the service flow can be guaranteed to be transmitted under the condition of enough bandwidth, and otherwise, the service flow is not transmitted.

With reference to the first aspect, in one possible design, the method further includes: the central control node determines the equivalent bandwidth of a wireless fidelity WiFi link in a target routing path carrying a first service flow; the equivalent bandwidth of the WiFi link in the target routing path is used for determining the equivalent bandwidth of the target routing path; the equivalent bandwidth of the WiFi link satisfies the following relationship:

Where s represents the equivalent bandwidth of the WiFi link; n ^PPDU represents the number of physical layer protocol data units PPDUs in one transmission opportunity TXOP; p ^PPDU represents the number of medium access control protocol data units MPDUs in one PPDU; p represents an average length of each MPDU; t ^TXOP denotes the duration of one TXOP; /(I) Indicating the average number of retransmissions. Based on the scheme, a method for calculating equivalent bandwidth of a WiFi link is provided.

In combination with the first aspect, in one possible design, the number of PPDUs in one TXOP in a WiFi link satisfies the following relationship:

Wherein n ^PPDU represents the number of PPDUs in one TXOP; τ ^TXOP denotes whether to turn on the TXOP mechanism, τ ^TXOP =1 denotes to turn on, and τ ^TXOP =0 denotes to turn off; t ^TXOP denotes the maximum time length of the TXOP when the TXOP is turned on; τ ^RTS denotes whether to turn on the request to send/grant to send RTS/CTS handshake mechanism, τ ^RTS =1 denotes on, τ ^RTS =0 denotes not on; t ^RTS represents a transmission duration of requesting to transmit an RTS frame; t ^CTS denotes a transmission duration for permitting transmission of a CTS frame; t ^SIFS denotes the duration of the frame interval SIFS; t ^pre denotes a transmission duration of the physical layer preamble; t ^pre-BA denotes a transmission duration of the block acknowledgement frame preamble, and t ^BA-256 denotes a transmission duration of a block acknowledgement frame containing a bitmap of 256.

In combination with the first aspect, in one possible design, in the WiFi link, the number of MPDUs in one PPDU satisfies the following relationship:

Wherein, P ^PPDU represents the number of MPDUs in a PPDU; n ^MPDU represents the maximum number of the aggregated MPDUs in a PPDU; n ^byte is the maximum number of bytes that can be carried in a PPDU; p represents the average length of each MPDU, t ^PPDU is the maximum transmission time of the PPDU,/> The historical average link transmission rate of the MAC layer is controlled for medium access.

In combination with the first aspect, in one possible design, a duration of one TXOP in the WiFi link satisfies the following relationship:

Wherein T ^TXOP denotes the duration of one TXOP; t ^AIFS represents an arbitration interframe space AIFS value corresponding to the access class; w _min represents the minimum CWmin value of the contention window corresponding to the access category; t ^slot denotes a slot length; τ ^RTS denotes whether to turn on the RTS/CTS handshake mechanism, τ ^RTS =1 denotes to turn on, τ ^RTS =0 denotes to turn off; t ^RTS represents a transmission duration of requesting to transmit an RTS frame; t ^CTS denotes a transmission duration for permitting transmission of a CTS frame; t ^SIFS denotes the duration of the frame interval SIFS; n ^PPDU represents the number of PPDUs in one TXOP; t ^pre denotes a transmission duration of the physical layer preamble; p ^PPDU denotes the number of MPDUs in one PPDU; p represents an average length of each MPDU; r ^θ denotes a physical layer transmission rate of modulation coding scheme MCS level θ.

With reference to the first aspect, in one possible design, the method further includes: the central control node determines the equivalent bandwidth of the Bluetooth link according to the resource allocation type adopted by the Bluetooth link in the target routing path carrying the first service flow and the polled and scheduled state of the Bluetooth link; the equivalent bandwidth of the Bluetooth link in the target routing path is used for determining the equivalent bandwidth of the target routing path. Based on the scheme, a method for calculating the equivalent bandwidth of the Bluetooth link is provided.

With reference to the first aspect, in one possible design, the determining, by the central control node, an equivalent bandwidth of the target routing path carrying the first traffic flow includes: the central control node determines equivalent bandwidth of each transmission link in a plurality of transmission links included in a target routing path carrying the first service flow; the central control node determines the equivalent bandwidth of a target routing path carrying the first service flow according to the equivalent bandwidth of each transmission link; wherein, the equivalent bandwidth of the target routing path corresponding to the first service flow satisfies the following relationship: Wherein X represents an equivalent bandwidth of a target routing path carrying the first traffic flow; m represents the number of transmission links in a target routing path carrying a first traffic flow; s _m is the equivalent bandwidth of the transmission link L _m; the transmission link L _m is the mth transmission link in the routing path, and M is greater than or equal to 1 and less than or equal to M.

Based on the scheme, the method for calculating the equivalent bandwidth of the routing path based on each link included in the routing path is provided.

With reference to the first aspect, in one possible design, the sending, by the central control node, a resource allocation result to a non-central control node in the network includes: the central control node broadcasts a resource allocation result to non-central control nodes in the network in a networking control information release subframe; the networking control information release subframe is a time for sending a resource allocation result. Based on the scheme, the central control node can broadcast the resource allocation result to the non-central control node in the time period which is specially used for sending the resource allocation result and is the networking control information release subframe, so that the non-central control node can successfully receive the resource allocation result in the networking control information release subframe.

In a second aspect, a communication device is provided for implementing the various methods described above. The communication means may be the central control node of the first aspect described above, or a device comprising the central control node described above, or a device, such as a chip, comprised in the central control node described above.

The communication device comprises corresponding modules, units or means (means) for realizing the method, and the modules, units or means can be realized by hardware, software or realized by executing corresponding software by hardware. The hardware or software includes one or more modules or units corresponding to the functions described above.

With reference to the second aspect, in one possible design, the communication device includes: the processing module and the receiving and transmitting module: the processing module is used for determining the sequence of allocating resources for each service flow in the service flows of the multiple service types according to the priority of the resource allocation rule corresponding to the service flows of the multiple service types in the network; the priority of the resource allocation rule corresponding to each service flow is determined according to the QoS requirement of the service flow of the corresponding service type; the processing module is further used for determining a resource allocation result according to the sequence of allocating resources for each of the service flows of the plurality of service types and the resource allocation rule corresponding to each of the service flows, wherein the resource allocation result is used for indicating the resources allocated for each of the service flows of the plurality of service types; and the receiving and transmitting module is used for transmitting the resource allocation result to the non-central control node in the network.

In combination with the above second aspect, in one possible design, the service type includes a bandwidth guarantee type, a large file transfer type, or a low-latency, high-reliability message transfer type.

With reference to the second aspect, in one possible design, the service flows of the multiple service types include a service flow of a first service type, where the service flow of the first service type includes multiple service flows; wherein the resource allocation order of each of the plurality of traffic flows of the first traffic type is determined based on the priority of each of the plurality of traffic flows of the first traffic type.

With reference to the second aspect, in one possible design, the processing module is further configured to determine an equivalent bandwidth of a target routing path carrying the first traffic flow; wherein the first traffic stream is one of a plurality of traffic types of traffic streams; the processing module is specifically configured to determine that resources are currently required to be allocated to a service flow of a service type to which a first service flow belongs according to an order of allocating resources to each service flow in the service flows of multiple service types; and determining resources allocated for the first service flow in a resource allocation result according to the equivalent bandwidth of the target routing path carrying the first service flow and a resource allocation rule corresponding to the service flow of the service type to which the first service flow belongs.

With reference to the second aspect, in one possible design, each of the plurality of service types of service flows has a priority; the processing module is specifically configured to determine, according to an equivalent bandwidth of a target routing path carrying the first traffic flow and a resource allocation rule corresponding to a traffic flow of a traffic type to which the first traffic flow belongs, a size of a resource allocated for the first traffic flow, where the determining includes: according to a resource allocation rule corresponding to a service flow of a service type to which the first service flow belongs, combining a guaranteed bandwidth of the first service flow and an equivalent bandwidth of a target routing path carrying the first service flow, and determining the size of resources to be allocated to the first service flow; determining the size of resources allocated for a second service flow, wherein the second service flow is a service flow with priority not lower than that of the first service flow in the established service flows; in the case that the sum of the size of the resources allocated for the second service flow and the size of the resources to be allocated for the first service flow is smaller than or equal to the size of the resources to be allocated, allocating the size of the resources for the first service flow according to the size of the resources to be allocated for the first service flow; or determining not to allocate resources for the first traffic stream if the sum of the size of resources allocated for the second traffic stream and the size of resources that the first traffic stream needs to be allocated is greater than the size of resources that can be allocated.

With reference to the second aspect, in one possible design, the processing module is further configured to determine an equivalent bandwidth of the WiFi link in a target routing path carrying the first traffic flow; the equivalent bandwidth of the WiFi link in the target routing path is used for determining the equivalent bandwidth of the target routing path; the equivalent bandwidth of the WiFi link satisfies the following relationship:

Where s represents the equivalent bandwidth of the WiFi link; n ^PPDU represents the number of physical layer protocol data units PPDUs in one transmission opportunity TXOP; p ^PPDU represents the number of medium access control protocol data units MPDUs in one PPDU; p represents an average length of each MPDU; t ^TXOP denotes the duration of one TXOP; Indicating the average number of retransmissions.

With reference to the second aspect, in one possible design, the number of PPDUs in one TXOP in the WiFi link satisfies the following relationship:

With reference to the second aspect, in one possible design, the number of MPDUs in one PPDU in a WiFi link satisfies the following relationship:

With reference to the second aspect, in one possible design, a duration of one TXOP in the WiFi link satisfies the following relationship:

With reference to the second aspect, in one possible design, the processing module is further configured to determine an equivalent bandwidth of the bluetooth link according to a resource allocation type adopted by the bluetooth link in a target routing path carrying the first traffic flow and a state of the bluetooth link being scheduled by polling; the equivalent bandwidth of the Bluetooth link in the target routing path is used for determining the equivalent bandwidth of the target routing path.

With reference to the second aspect, in one possible design, the processing module is further configured to determine an equivalent bandwidth of a target routing path carrying the first traffic flow, where the determining includes: a processing module, configured to determine an equivalent bandwidth of each transmission link among a plurality of transmission links included in a target routing path carrying the first traffic flow; determining the equivalent bandwidth of a target routing path carrying the first service flow according to the equivalent bandwidth of each transmission link; wherein, the equivalent bandwidth of the target routing path corresponding to the first service flow satisfies the following relationship:

Wherein X represents an equivalent bandwidth of a target routing path carrying the first traffic flow; m represents the number of transmission links in a target routing path carrying the first traffic flow; s _m is the equivalent bandwidth of the transmission link L _m; the transmission link L _m is the mth transmission link in the routing path, and M is greater than or equal to 1 and less than or equal to M.

With reference to the second aspect, in one possible design, the transceiver module is specifically configured to broadcast, in a networking control information release subframe, a resource allocation result to a non-central control node in the network; the networking control information release subframe is a time for sending a resource allocation result.

In a third aspect, there is provided a communication apparatus comprising: a processor for executing instructions stored in a memory, which when executed, cause the communication device to perform the method of any of the above aspects. The communication means may be the central control node of the first aspect described above, or a device comprising the central control node described above, or a device, such as a chip, comprised in the central control node described above.

In one possible design, the communication device further includes a memory for storing computer instructions. In the alternative, the processor and memory are integrated or the processor and memory are separate.

In one possible design, the memory is coupled to the processor and external to the communication device.

In a fourth aspect, there is provided a communication apparatus comprising: a processor and interface circuitry for communicating with a module external to the communication device; the processor is configured to perform the method of any of the above aspects by logic circuitry, or by running a computer program or instructions. The communication means may be the central control node of the first aspect described above, or a device comprising the central control node described above, or a device, such as a chip, comprised in the central control node described above.

Or the interface circuit may be a code/data read/write interface circuit for receiving computer-executable instructions (stored in memory, possibly read directly from memory, or possibly via other means) and transmitting them to the processor for causing the processor to execute the computer-executable instructions to perform the method of any of the above aspects.

In some possible designs, the communication device may be a chip or a system-on-chip.

In a fifth aspect, there is provided a computer readable storage medium having instructions stored therein which, when run on a communications device, cause the communications device to perform the method of any of the above aspects. The communication means may be the central control node of the first aspect described above, or a device comprising the central control node described above, or a device, such as a chip, comprised in the central control node described above.

In a sixth aspect, there is provided a computer program product comprising instructions which, when run on a communications device, cause the communications device to perform the method of any of the above aspects. The communication means may be the central control node of the first aspect described above, or a device comprising the central control node described above.

In a seventh aspect, there is provided a communications device (e.g. which may be a chip or a system of chips) comprising a processor for carrying out the functions referred to in any of the above aspects. In one possible design, the communication device further includes a memory for holding necessary program instructions and data. When the communication device is a chip system, the communication device may be formed of a chip, or may include a chip and other discrete devices.

In an eighth aspect, a communication system is provided that includes a central control node and a non-central control node. Wherein the central control node is configured to perform the method according to the first aspect.

The technical effects of any one of the second to eighth aspects may be referred to the technical effects of the different designs in the first aspect, which are not described herein.

Drawings

Fig. 1 is a schematic diagram of a architecture of a single-hop network according to an embodiment of the present application;

Fig. 2 is a schematic diagram of a multi-hop network according to an embodiment of the present application;

fig. 3 is a schematic diagram of a communication system according to an embodiment of the present application;

Fig. 4 is a schematic structural diagram of a communication device according to an embodiment of the present application;

fig. 5 is an interaction schematic diagram of a resource allocation method according to an embodiment of the present application;

fig. 6 is a schematic structural diagram of a superframe according to an embodiment of the present application;

Fig. 7 is a schematic diagram of a multiple access technology in a WiFi network according to an embodiment of the present application;

Fig. 8 is a schematic diagram of a bluetooth link according to an embodiment of the present application;

FIG. 9 is a schematic diagram of a communication method according to an embodiment of the present application;

fig. 10 is a schematic diagram of a wireless home network according to an embodiment of the present application;

Fig. 11 is a schematic structural diagram of a communication device according to an embodiment of the present application.

Detailed Description

In order to facilitate understanding of the technical solutions of the embodiments of the present application, a brief description of related technologies and terms of the present application is given below.

1. Single-hop network (single-hop):

In a conventional wireless local area network, each client accesses the network via a wireless link that connects to an Access Point (AP). Where users need to first access a fixed access point if they want to communicate with each other, such a network is called a single-hop network (single-hop). One possible architecture of a single hop network is illustrated in fig. 1, for example.

2. Multi-hop network (multi-hop):

In some wireless networks, any wireless device point may act as both an access point and a router, each node in the network may send and receive signals, each node may communicate directly with one or more peer nodes, and such networks are referred to as multi-hop networks (multi-hop). It is also understood that the transmission of information is accomplished by forwarding through multiple nodes on the link, each of which may communicate directly with one or more peer nodes, with multiple hops being multiple forwarding. One possible architecture of a multi-hop network is illustrated in fig. 2, for example.

In recent years, methods such as convex optimization theory, bipartite graph matching theory or game theory are widely adopted in academia, a resource allocation algorithm in a wireless network is modeled as an optimization problem, and the goals of throughput maximization or time delay minimization are achieved by allocating corresponding network resources for wireless service. It should be noted that the above-described research method is generally only applicable to single-hop and/or homogeneous networks, i.e. networks having only a single link type. Furthermore, the problem solved by the above-described research methods is typically a resource allocation optimization problem that is only targeted to a single objective, and is not suitable for solving a resource allocation problem with multiple QoS requirements.

However, wireless home networks are typically multi-hop heterogeneous networks, and wireless home networks often need to transmit multiple different QoS-requiring services simultaneously. As can be seen, the current resource allocation method cannot support the QoS requirements of different services in a multi-hop heterogeneous network, such as a wireless home network. Thus, there is currently no solution as to how to allocate network resources based on different QoS requirements of different traffic in a multi-hop heterogeneous network.

Based on the above problems, the embodiments of the present application provide a resource allocation method, which is used to solve the problem of how to allocate network resources based on different QoS requirements of different services in a multi-hop heterogeneous network.

The technical solutions in the embodiments of the present application will be described below with reference to the accompanying drawings in the embodiments of the present application. Wherein, in the description of the present application, "/" means that the related objects are in a "or" relationship, unless otherwise specified, for example, a/B may mean a or B; the "and/or" in the present application is merely an association relationship describing the association object, and indicates that three relationships may exist, for example, a and/or B may indicate: there are three cases, a alone, a and B together, and B alone, wherein a, B may be singular or plural. Also, in the description of the present application, unless otherwise indicated, "a plurality" means two or more than two. "at least one of" or the like means any combination of these items, including any combination of single item(s) or plural items(s). For example, at least one (one) of a, b, or c may represent: a, b, c, a-b, a-c, b-c, or a-b-c, wherein a, b, c may be single or plural. In addition, in order to facilitate the clear description of the technical solution of the embodiments of the present application, in the embodiments of the present application, the words "first", "second", etc. are used to distinguish the same item or similar items having substantially the same function and effect. It will be appreciated by those of skill in the art that the words "first," "second," and the like do not limit the amount and order of execution, and that the words "first," "second," and the like do not necessarily differ. Meanwhile, in the embodiments of the present application, words such as "exemplary" or "such as" are used to mean serving as examples, illustrations or explanations. Any embodiment or design described herein as "exemplary" or "e.g." in an embodiment should not be taken as preferred or advantageous over other embodiments or designs. Rather, the use of words such as "exemplary" or "such as" is intended to present related concepts in a concrete fashion that may be readily understood.

It should be noted that, the network architecture and the service scenario described in the embodiments of the present application are for more clearly describing the technical solution of the embodiments of the present application, and do not constitute a limitation on the technical solution provided by the embodiments of the present application, and those skilled in the art can know that, with the evolution of the network architecture and the appearance of the new service scenario, the technical solution provided by the embodiments of the present application is equally applicable to similar technical problems.

The resource allocation method provided by the embodiment of the application can be applied to various communication systems. For example, the resource allocation method provided in the embodiment of the present application may be applied to a long term evolution (long term evolution, LTE) system, a fifth generation mobile communication technology (5th generation mobile communication technology,5G) system, or a system that can directly communicate between terminal devices, such as a device-to-device (D2D) or vehicle-to-everything, V2X) system, or other similar new communication systems facing the future, such as a 6 th generation (6G) system, which is not limited in particular in the embodiment of the present application.

As shown in fig. 3, a communication system 30 is provided according to an embodiment of the present application. The communication system 30 includes a central control node 40 and a non-central control node 50. The central control node 40 may communicate with the non-central control nodes 50 in a wireless or wired manner, and the different non-central control nodes 50 may also communicate with each other in a wireless or wired manner.

It should be noted that fig. 3 is only a schematic diagram, and although not shown, other devices may be included in the communication system 30, which is not limited in detail herein.

Taking interaction between the central control node 40 and the non-central control node 50 shown in fig. 3 as an example, in the resource allocation method provided by the embodiment of the present application, the central control node 40 determines the sequence of allocating resources for each of the service flows of multiple service types according to the priorities of the resource allocation rules corresponding to the service flows of the multiple service types in the network; the priority of each corresponding resource allocation rule is determined according to the QoS requirement of the service flow of the corresponding service type; then, the central control node 40 determines a resource allocation result according to the sequence of allocating resources for each of the plurality of service types of service flows and the resource allocation rule corresponding to each of the plurality of service flows, the resource allocation result being used for indicating the resources allocated for each of the plurality of service types of service flows; thereafter, the central control node 40 transmits the resource allocation result to the non-central control nodes in the network. The specific implementation and technical effects of this solution will be described in detail in the following method embodiments, which are not described here again.

Alternatively, the central control node or the non-central control node in the embodiments of the present application may also be referred to as a communication device, which may be a general-purpose device or a special-purpose device, which is not specifically limited in the embodiments of the present application.

Optionally, the related functions of the central control node or the non-central control node in the embodiment of the present application may be implemented by one device, or may be implemented by multiple devices together, or may be implemented by one or more functional modules in one device, which is not specifically limited in the embodiment of the present application. It will be appreciated that the above described functionality may be either a network element in a hardware device, or a software functionality running on dedicated hardware, or a combination of hardware and software, or a virtualized functionality instantiated on a platform (e.g., a cloud platform).

For example, the functions associated with a central control node or non-central control node in embodiments of the present application may be implemented by the communication device 400 of fig. 4. Fig. 4 is a schematic structural diagram of a communication device 400 according to an embodiment of the present application. The communication device 400 comprises one or more processors 401, communication lines 402, and at least one communication interface (shown in fig. 4 by way of example only as comprising a communication interface 404, and one processor 401, for example), optionally a memory 403.

The processor 401 may be a general purpose central processing unit (central processing unit, CPU), microprocessor, application-specific integrated circuit (ASIC), or one or more integrated circuits for controlling the execution of the program of the present application.

Communication line 402 may include a passageway for connecting between the various components.

The communication interface 404, which may be a transceiver module, is used to communicate with other devices or communication networks, such as ethernet, RAN, wireless local area network (wireless local areanetworks, WLAN), etc. For example, the transceiver module may be a device such as a transceiver, or the like. Optionally, the communication interface 404 may also be a transceiver circuit located in the processor 401, so as to implement signal input and signal output of the processor.

The memory 403 may be a device having a memory function. For example, but not limited to, a read-only memory (ROM) or other type of static storage device that can store static information and instructions, a random access memory (random access memory, RAM) or other type of dynamic storage device that can store information and instructions, an electrically erasable programmable read-only memory (ELECTRICALLY ERASABLE PROGRAMMABLE READ-only memory, EEPROM), a compact disc read-only memory (compact disc read-only memory) or other optical disk storage, optical disk storage (including compact discs, laser discs, optical discs, digital versatile discs, blu-ray discs, etc.), magnetic disk storage media or other magnetic storage devices, or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer. The memory may be self-contained and coupled to the processor via communication line 402. The memory may also be integrated with the processor.

The memory 403 is used for storing computer-executable instructions for executing the present application, and is controlled by the processor 401. The processor 401 is configured to execute computer-executable instructions stored in the memory 403, thereby implementing the resource allocation method provided in the embodiment of the present application.

Alternatively, in the embodiment of the present application, the processor 401 may also perform the functions related to the processing in the resource allocation method provided in the embodiment of the present application, where the communication interface 404 is responsible for communicating with other devices or communication networks, and the embodiment of the present application is not limited in detail.

Alternatively, the computer-executable instructions in the embodiments of the present application may be referred to as application program codes, which are not particularly limited in the embodiments of the present application.

In a particular implementation, processor 401 may include one or more CPUs, such as CPU0 and CPU1 of FIG. 4, as an embodiment.

In a particular implementation, as one embodiment, the communication device 400 may include multiple processors. Each of these processors may be a single-core processor or a multi-core processor. The processor herein may include, but is not limited to, at least one of: a central processing unit (centralprocessing unit, CPU), microprocessor, digital Signal Processor (DSP), microcontroller (MCU), or artificial intelligence processor, each of which may include one or more cores for executing software instructions to perform operations or processes.

In a specific implementation, as an embodiment, the communication device 400 may further include an output device 405 and an input device 406. The output device 405 communicates with the processor 401 and may display information in a variety of ways. For example, the output device 405 may be a liquid crystal display (liquidcrystal display, LCD), a light emitting diode (LIGHT EMITTING diode, LED) display device, a Cathode Ray Tube (CRT) display device, or a projector (projector), or the like. The input device 406 is in communication with the processor 401 and may receive user input in a variety of ways. For example, the input device 406 may be a mouse, keyboard, touch screen device, or sensing device, among others.

The communication device 400 may also be referred to as a communication apparatus, and may be a general-purpose device or a special-purpose device. For example, the communication device 400 may be a desktop, a portable computer, a network server, a personal computer (PDA), a mobile handset, a tablet, a wireless terminal device, an embedded device, a terminal device as described above, a network device as described above, or a device having a similar structure as in fig. 4. The embodiments of the present application are not limited to the type of communication device 400.

The resource allocation method provided by the embodiment of the present application will be described below with reference to fig. 1 to 4 by taking interaction between the central control node 40 and the non-central control node 50 shown in fig. 3 as an example.

It should be noted that, in the following embodiments of the present application, names of messages between devices or names of parameters in a message are merely examples, and may be other names in specific implementations, which are not limited in particular by the embodiments of the present application.

As shown in fig. 5, a method for allocating resources is provided in an embodiment of the present application. The method is illustrated in fig. 5 by taking the central control node and the non-central control node as the execution bodies of the interactive schematic, but the application is not limited to the execution bodies of the interactive schematic. For example, the central control node in fig. 5 may also be a chip, a system-on-chip, or a processor that supports the central control node to implement the method, or may be a logic module or software that can implement all or part of the functions of the central control node; the non-central control node in fig. 5 may also be a chip, a system-on-chip, or a processor that supports the non-central control node to implement the method, or may be a logic module or software that can implement all or part of the functions of the non-central control node. Exemplary, the resource allocation method includes S501-S503:

S501, the central control node determines the sequence of allocating resources for each service flow in the service flows of multiple service types according to the priority of the resource allocation rule corresponding to the service flows of multiple service types in the network; the priority of each corresponding resource allocation rule is determined according to the QoS requirement of the service flow of the corresponding service type.

S502, the central control node determines a resource allocation result according to the sequence of allocating resources for each service flow in the service flows of multiple service types and the resource allocation rule corresponding to each service flow, wherein the resource allocation result is used for indicating the resources allocated for each service flow in the service flows of multiple service types;

S503, the central control node sends a resource allocation result to non-central control nodes in the network. Correspondingly, the non-central control node receives the resource allocation result.

Optionally, the resource allocation method provided by the embodiment of the application can be applied to a multi-hop heterogeneous network, such as a wireless home network.

Optionally, in the embodiment of the present application, the central control node is a node for allocating resources in the network. The non-central control node of the allocated resources may transmit traffic streams over the allocated resources.

In one possible implementation, the central control node may be a dedicated node for resource allocation, and no traffic stream is transmitted. For example, in a Wi-Fi network, the central control node may be an access point controller (access point controller, AC). In another possible implementation, the central control node may be a node having both resource allocation capability and data transmission capability, in other words, the central control node may be used for not only resources but also traffic flows.

Steps S501 to S503 are described in detail below.

In S501, the central control node may determine, according to the priority of the resource allocation rule corresponding to the service flows of the preconfigured multiple service types, the sequence of allocating resources for the service flows of each service type in the network. The service type is first described here.

Optionally, the service types in the embodiment of the present application may include a bandwidth guarantee type, a large file transmission type, or a low-latency and high-reliability message transmission type. Of course, the service types may also include other types, which are not particularly limited by the embodiments of the present application.

The bandwidth guarantee type refers to that the occupied bandwidth of the service of the type needs to be guaranteed not to be lower than a corresponding threshold value. For example, assuming that the service flow a and the service flow B are bandwidth guaranteed services, the preset threshold corresponding to the service flow a is 20Mbps, and the preset threshold corresponding to the service flow B is 10Mbps, in the network, the occupied bandwidth of the service flow a needs to be guaranteed not to be lower than 20Mbps, and the occupied bandwidth of the service flow B needs to be guaranteed not to be lower than 10Mbps.

The bandwidth guaranteed service may be a wireless screen-drop service, a video-on-demand service, or a video call service, for example.

The large file transmission type refers to that the data amount required to be transmitted by the type of service is more. Optionally, a threshold may be preset, and if the amount of data that needs to be transmitted by a service meets (is greater than or equal to) the preset threshold, the service is of a large file transmission type, otherwise, the service is not. For example, if the preset threshold is 400Mbits and the traffic flow C needs to transmit 410Mbits of data, the traffic flow C is a large file transmission type service, and the traffic flow D needs to transmit 300Mbits of data, the traffic flow D is not a large file transmission type service.

By way of example, the large file transfer type service may be a version upgrade or file sharing service.

The low-delay and high-reliability message transmission service refers to a service requiring message with strict transmission delay sensitivity and reliability requirements. Alternatively, low latency, high reliability messaging services require a latency not higher than a corresponding threshold (which may be referred to as a maximum tolerable latency). For example, assuming that the service flow E is a low-latency, high-reliability message transmission service, and the maximum tolerable latency is 1ms, in the network, it is required to ensure that the latency of the service flow E is not higher than 1ms, that is, the latency of the message to be transmitted corresponding to the service flow E is not higher than 1ms.

For example, the low-latency and high-reliability messaging service may be a service such as a control command of an appliance or a short message (a message with a smaller packet length).

Further, in the embodiment of the present application, the bandwidth guaranteed service may also be referred to as a class a service. Large file transfer type services may also be referred to as class B services. Low latency, high reliability messaging services may also be referred to as class C services. The following description will be made of the embodiments of the present application in which the bandwidth guarantee type service is a type a service, the large file transmission type service is a type B service, and the low-latency and high-reliability transmission message type service is a type C service.

It should be noted that, class a, class B, and class C are names of exemplary service types provided by the embodiments of the present application, and may also be replaced by other names, which are not particularly limited by the embodiments of the present application.

The traffic types are introduced above. The first resource allocation rule is specifically described below by taking a resource allocation rule corresponding to a service flow of any service type as an example, where the resource allocation rule is referred to as a first resource allocation rule.

The first resource allocation rule, the meaning (or content) of which is related to a traffic flow of a corresponding traffic type, may indicate how to allocate resources for the traffic flow of that traffic type, or may indicate rules to be followed when allocating resources for the traffic flow of that type.

Alternatively, the first resource allocation rule may indicate a size of resources allocated for the traffic flow of the corresponding traffic type. For example, a first resource allocation rule 1 indicates the size of allocated resources for class a traffic and a second resource allocation rule 2 indicates the size of allocated resources for class B traffic.

Alternatively, the first resource allocation rule may indicate the manner in which the size of the resources is calculated to be allocated for the traffic flow of the corresponding traffic type. For example, a first resource allocation rule 1 indicates how to calculate the size of resources allocated for class a traffic.

Further, the first resource allocation rule has a priority, and the priority of the first resource allocation rule may be used for the central control node to determine an order in which the first resource allocation rule is executed. Specifically, the central control node executes the first resource allocation rule with high priority first according to the priority order of the first resource allocation rule, and then executes the first resource allocation rule with low priority first, so that the order of allocating resources for the service flows of each service type in the network is obtained according to the order of executing the first resource allocation rule corresponding to the service flows of different service types.

Alternatively, the priority of the first resource allocation rule may be determined according to QoS requirements of traffic flows of the corresponding traffic type. For example, if a service flow of a certain service type is important and the requirement for QoS is high, a first resource allocation rule corresponding to the service type may be configured with a higher priority, so that the resource allocation of the service flow of the service type is preferentially guaranteed.

In one possible implementation, the QoS requirements of the services may have priorities, and the priorities of the corresponding QoS requirements are different for different types of services. For class a, class B and class C traffic, it may be assumed, for example, that the priority of the QoS requirements of class C traffic is higher than the priority of the QoS requirements of class B traffic, and the priority of the QoS requirements of class B traffic is higher than the priority of the QoS requirements of class a traffic. Further, the priority of the first resource allocation rule may be determined according to the priority of the QoS requirement of the corresponding service type, where the higher the priority of the QoS requirement, the higher the priority of the corresponding first resource allocation rule, and vice versa.

Alternatively, in the embodiment of the present application, the priority may be represented by a numerical value, in other words, the priority may be determined according to the value of the priority. Illustratively, the value of the priority may take any of {1,2, … …, N }, where N is a positive integer.

Alternatively, in the embodiment of the present application, the priority may be inversely related to the value of the priority. For example, assuming that any one of {1,2, … …, N } may be taken as the priority value, the priority is highest when the priority value is1, and lowest when the priority value is N. Or the priority level can be directly proportional to the priority value. For example, assuming that any one of {1,2, … …, N } may be taken as the priority value, the priority is highest when the priority value is N, and lowest when the priority value is 1.

Optionally, in the embodiment of the present application, the resource allocation rule may further include a resource allocation rule that does not correspond to a service flow of a certain service type. Such a resource allocation rule may be referred to as a second resource allocation rule hereinafter.

Alternatively, the second resource allocation rule may be applicable to all traffic flows, and it may be understood that the second resource allocation rule is a rule executed by default when allocating resources for traffic flows. If the resource allocation rule does not conflict with other resource allocation rules with higher priority, the central control node can allocate the resources according to the second resource allocation rule when allocating the resources for any service flow.

Alternatively, the second resource allocation rule may be used to allocate resources for the control information. The control information may be information that is interacted between the central control node and the non-central control node and is used for implementing a corresponding function. For example, the information related to traffic flow establishment may be reported by the non-central control node to the central control node. Or may be a resource allocation result sent by the central control node to the non-central control node.

Further, the second resource allocation rule may have a priority. If the second resource allocation rule conflicts with other resource allocation rules, the central control node can execute the resource allocation rule with high priority according to the priority of the resource allocation rule, and discard (not execute) the resource allocation rule with low priority.

The resource allocation rule is introduced above, and the service flow in the embodiment of the application is introduced below.

In the embodiment of the application, each service flow in the current network comprises the service flow which is currently requested to be established and the service flow which is already established.

The service flow has corresponding service types, and specific description of the service types can be referred to above for the class a service, the class B service and the class C service.

Optionally, in the embodiment of the present application, the service flow may also have a priority, and the priority of the service flow itself may be referred to as a service priority. The central control node may determine a service priority of each service flow in the current network, and allocate resources for the service flows according to the service priorities of the service flows and a resource allocation rule.

Wherein, the service priority levels can be the same or different for different service flows belonging to the same service type.

In one possible implementation, the priority of the service flows may be determined based on the service flows of the same service type, that is, the priority of each service flow is ordered under one or more service flows corresponding to the same service type. In another possible implementation, the priority of the traffic flows may be determined based on all traffic flows in the current network, that is, the priority of each traffic flow is ordered among all traffic flows in the current network.

In one possible implementation, the central control node may obtain information about each service flow in the current network, so as to allocate resources for the service flows according to the information about the service flows and the resource allocation rule. For example, the central control node may establish and store a data link table of each service flow in the current network according to the related information of the service flow, so as to allocate resources for the service flow according to the data link table and the resource allocation rule.

Wherein, in the data link list, the related information (the attribute contained in the data structure of each element) of the service flow may include at least one of the following:

(1) Traffic flow status. The item is used for representing the current establishment state of the service flow. The term may be established or requested to be established, for example, on behalf of the service flow being an already established service flow, the request to establish the service flow being a currently requested service flow to be established.

(2) Service type. The term is used to characterize the service type corresponding to the service flow. Illustratively, the term may be of class A, class B or class C.

(3) Traffic priority. The term is used to characterize the traffic priority of the traffic flow. Illustratively, the term may be any of {1,2, … …, N }, where 1 represents the highest priority.

(4) Service source node address. This term is used to characterize the address of the source node of the traffic flow. Illustratively, the traffic flow starts from node a, and the term is node a.

(5) Service destination node address. The term is used to characterize the address of the destination node of the traffic flow. Illustratively, the destination node of the traffic flow is node B, then the term is node B.

(6) Business attributes. The term is used to characterize the transmission requirements of the traffic flow, and can also be used to characterize the QoS requirements of the traffic flow. For example, for a traffic flow for a class a traffic, the term may be the bandwidth requirement of the traffic flow. For a traffic flow of a class B service, the term may be the size of the data to be transmitted by the traffic flow. For a traffic flow for class C traffic, this term may be the maximum tolerable delay for the traffic flow.

(7) The number of resources allocated. This term is used to characterize the size or number of resources that have been allocated to the traffic flow. For example, the term may be the number of allocated basic subframes (the basic subframes are described in detail below, and are not spread out here), for an established traffic flow, the term is the number of basic subframes that the traffic flow was allocated last, and for a traffic flow that is requested to be established, the term may be a preset value that characterizes that the traffic flow has not been established, and that the resources have not been allocated, for example, it may be-1 or 0.

Optionally, the central control node may acquire, from a source node of the service flow (or a non-central control node having a transmission requirement of the service flow), at least one of a service type, a service priority, a service source node address, a service destination node address, and a service attribute of the corresponding service flow.

Alternatively, the central control node may itself determine the traffic flow status of the traffic flow and/or the amount of allocated resources.

It should be noted that, the data link table is an exemplary manner of storing information related to a service flow, and the central control node may also store information related to a service flow through other structures, which is not limited in this embodiment of the present application.

In S502, the central control node may allocate resources for each service flow in the current network according to the sequence of allocating resources for each service flow in the service flows of multiple service types and the resource allocation rule corresponding to each service flow, so as to determine a resource allocation result (may also be referred to as a resource allocation policy, and the embodiment of the present application does not limit specific names), where the resource allocation result indicates the resources allocated for each service flow.

Specifically, the central control node may allocate resources for the service flows of the corresponding service types according to the meaning of the first resource allocation rule, starting from the first resource allocation rule with the highest priority according to the priority order of the first resource allocation rule. And then, the central control node allocates resources for the service flows of the corresponding service types according to the meaning of the resource allocation rule with the highest priority, and the like until the resources are allocated for the service flows of the corresponding service types according to the meaning of the first resource allocation rule with the lowest priority, so as to complete the resource allocation, and the resource allocation result is determined according to the resources allocated for each service flow.

For example, assume that there are 3 resource allocation rules, where the priority of resource allocation rule 1 is highest, the priority of resource allocation rule 2 is next highest, and the priority of resource allocation rule 3 is lowest. The central control node allocates resources for the service flow A according to the indication of the resource allocation rule 1, allocates resources for the service flow B according to the indication of the resource allocation rule 2, and allocates resources for the service flow C according to the indication of the resource allocation rule 3. Finally, the resource allocation result determined by the neutral control node indicates the resources allocated for the service flow a, the resources allocated for the service flow B and the resources allocated for the service flow C.

Alternatively, the resource allocation result may indicate resources allocated to other data or signaling in addition to resources allocated for the traffic flow. Illustratively, the resource allocation result may also indicate the resources allocated to the control information.

Optionally, in the case that the service flows have service priorities, when the central control node allocates resources for the service flows of the corresponding service types according to the first resource allocation rule, if the service flows of the corresponding service types have a plurality of service flows, the central control node may determine an order of allocating resources for the plurality of service flows according to the service priorities of the plurality of service flows, and specifically, the central control node may allocate resources for the service flows according to an order of from high to low service priorities. Or in the case that the service flows have no service priority, the central control node can determine the sequence of allocating resources for the service flows with the same priority according to the time when the source node of the service flows applies for resource allocation. Specifically, the central control node may allocate resources for the service flow according to the early-late sequence in which the source node of the service flow applies for resource allocation.

Further, for the service flows with the same priority, the central control node may determine the sequence of allocating resources for the service flows with the same priority according to the time when the source node of the service flows applies for resource allocation.

A certain traffic flow in the current network is hereinafter referred to as a first traffic flow, and the possible manner in which the central control node determines the resources allocated to the first traffic flow in the network according to the resource allocation rule is introduced.

Firstly, the central control node determines that resources are required to be allocated to the service flows of the service type to which the first service flow belongs currently according to the sequence of allocating resources to each service flow in the current network. The central control node may then determine resources allocated for the first traffic flow according to the indication of the resource allocation rule corresponding to the traffic type to which the first traffic flow belongs.

The following describes possible ways in which the central control node determines the resources allocated to the first traffic flow according to the resource allocation rule corresponding to the traffic type to which the first traffic flow belongs.

In one possible implementation, the resource allocation rule corresponding to the service type to which the first service flow belongs may indicate that the first service flow is allocated with the required resources, that is, how many resources are allocated for the first service flow by the central control node according to the indication of the resource allocation rule. Alternatively, the first traffic flow may be a traffic flow of a class C traffic.

In one possible implementation, a resource allocation rule corresponding to a traffic type to which the first traffic flow belongs may indicate that baseline resources are allocated for the first traffic flow. Wherein, the baseline resource refers to the minimum resource capable of guaranteeing service transmission. Alternatively, the first traffic flow may be a traffic flow of a class B traffic.

In one possible implementation, the resource allocation rule corresponding to the service type to which the first service flow belongs may indicate that the resource allocated for the first service flow is determined according to an equivalent bandwidth of the target routing path of the first service flow. Wherein the target routing path is a routing path determined by the central control node for carrying (or otherwise transmitting) the first traffic flow.

The equivalent bandwidth of the routing path is calculated by the central control node according to each link and the corresponding link type included in the routing path, and a specific calculation method is described below and is not expanded herein.

Alternatively, the first traffic flow may be a traffic flow of a class a traffic.

Further, in the case that each service flow has a service priority, the central control node determines, according to the equivalent bandwidth of the target routing path of the first service flow, resources allocated to the first service flow, which may specifically be:

Under the instruction of a resource allocation rule corresponding to the service type of the first service flow, the central control node determines the size of the resource to be allocated for the first service flow according to the guaranteed bandwidth of the first service flow and the equivalent bandwidth of the target routing path carrying the first service flow.

The central control node determines the size of the resource allocated for the second service flow, wherein the second service flow is a service flow with service priority not lower than that of the first service flow in the currently established service flows.

In case the sum of the size of the resources allocated for the second traffic flow and the size of the resources to be allocated for the first traffic flow is smaller than or equal to the size of the resources that can be allocated, the central control node allocates resources for the first traffic flow according to the size of the resources to be allocated for the first traffic flow, i.e. the size of the resources allocated by the central control node for the first traffic flow is equal to the previously determined size of the resources to be allocated for the first traffic flow.

Or in the case that the sum of the size of the resources allocated for the second traffic flow and the size of the resources to be allocated for the first traffic flow is larger than the size of the resources that can be currently allocated, the central control node determines not to allocate resources for the first traffic flow.

The size of the resources allocated to the second service flow refers to the size of the resources allocated to the second service flow in the current resource allocation.

The size of the resource that can be allocated refers to the size of the resource that can be allocated in the current resource allocation, including the resource that has been allocated to other traffic flows (traffic flows other than the first traffic flow) in the current resource allocation, and the resource that has not been allocated to other traffic flows.

The resources allocated by the central control node may be time-frequency resources in the network.

Wherein, optionally, the time granularity of the resources allocated by the central control node may be a basic subframe. Correspondingly, in the above implementation manner, the size of the resource allocated to the first service flow determined by the central control node may be represented in the time domain by the number of basic subframes. Illustratively, the central control node determines resources allocated to 100 underlying subframes of the first traffic stream.

The basic subframe is the smallest time granularity on the time axis in the embodiment of the present application, and the specific time length of the basic subframe may be set according to the requirement, which is not particularly limited in the embodiment of the present application. Illustratively, the length of the base subframe may be set to σ, and the unit of time may be milliseconds or microseconds.

Alternatively, the central control node may determine the time domain location of the resources allocated for the traffic flow. Alternatively, the central control node may determine the time domain position of the resources allocated for each service flow according to the sequence of allocating the resources for the service flows. In other words, the earlier the central control node allocates resources for a certain traffic flow, the earlier the time domain position of the resources allocated for that traffic flow, and vice versa. Or the central control node may determine the time domain location of the resources allocated for the traffic flow in other manners, which embodiments of the present application are not limited in particular.

Optionally, the resources allocated by the central control node to the plurality of service flows of different service types may be distributed in the time domain, and the resources allocated to the plurality of service flows of the same service type may be continuous in the time domain.

Wherein, optionally, the interval resource between the resources allocated by the plurality of service flows with different service types can be used for transmitting the control information between the central control node and the non-central control node.

Illustratively, there are traffic flows 1 and 2 for type a traffic and traffic flow 3 for type B traffic in the current network. The central control node allocates resources for the service flow 3 of the B type service according to the priority of the resource allocation rule corresponding to the A type service and the priority of the resource allocation rule corresponding to the B type service, and determines to allocate the resources of 100 basic subframes. The central control node allocates resources of the 100 basic resources to traffic stream 3 starting from the starting time domain position of the resources that can currently be allocated to the traffic stream. Then, the central control node allocates resources for the service flow 1 and the service flow 2 of the type A service, and determines that 40 basic subframes are allocated for the service flow 1 first, and then 60 basic subframes are allocated for the service flow 2. Wherein the resources allocated for traffic 1 and the resources allocated for traffic 2 are adjacent in the time domain. The resources allocated for the service flow 3 are separated from the resources allocated for the service flow 1 and the service flow 2 by a time length in the time domain, and the central control node can allocate the resources corresponding to the time length to the control information.

Optionally, the embodiment of the present application does not limit the manner of determining the frequency domain location of the resources allocated to the traffic flow.

After the central control node determines the allocated resources, the time-frequency domain position of the allocated resources can be indicated through the resource allocation result.

Optionally, the central control node may further indicate a routing path carrying each traffic flow in the current network through the resource allocation result. In particular, the central control node may indicate the nodes and links comprised by the routing path carrying the traffic flow.

The routing path of the bearing service flow is a routing path calculated by the central control node according to the collected global network topology, and the embodiment of the application does not limit the specific algorithm for calculating the routing path of the bearing service flow by the central control node. For example, the central control node may determine the routing path with the largest equivalent bandwidth among all routing paths available to carry a certain traffic flow as the routing path carrying that traffic flow. For another example, the central control node may determine the routing path with the least transmission resources or the fastest transmission among all routing paths available to carry a certain traffic flow as the routing path carrying the traffic flow.

In S503, after the central control node allocates resources for each service flow in the network, the central control node sends the resource allocation result to all non-central control nodes in the network. After receiving the resource allocation result, the non-central control node in the network can determine the allocated resource of each service flow according to the indication of the resource allocation result, and perform corresponding data transmission.

Further, after determining the allocated resources for each traffic flow, the non-central control node may decide itself how to transmit data for the corresponding traffic flow on the allocated resources.

Based on the resource allocation method provided by the embodiment of the application, the central control node can determine the sequence and the resources for allocating resources for the service flows in the network based on the resource allocation rule, wherein the resource allocation rule is determined based on the service type and the QoS requirement of the service, so that the central control node can allocate the resources for a plurality of service flows simultaneously under the condition of guaranteeing the priority of the service with higher QoS requirement to obtain the required QoS, and the aim of allocating network resources based on different QoS requirements of different services in the multi-hop network is fulfilled. And the resource allocation rule can be adjusted and modified according to the specific condition of the network, and has the advantages of easy maintenance and easy adjustment.

Optionally, the central control node may send the resource allocation result to all non-central control nodes in the network by broadcasting.

In one possible implementation, the central control node may issue a subframe through the networking control information in the superframe, and send the resource allocation result to the non-central control node in the network. The superframe and the networking control information subframe are related to a time frame structure defined by the embodiment of the present application, and the time frame structure in the embodiment of the present application is described below.

In the embodiment of the present application, the time axis is divided into superframes, and one superframe corresponds to one resource allocation performed by the central control node. Each super frame includes a plurality of basic subframes, and the length of one super frame may be set to the number T _SF of the included basic subframes.

The superframe structure is described below in conjunction with an exemplary superframe structure diagram shown in fig. 6. As shown in fig. 6, the superframe N is composed of the following parts:

Networking control information release subframe: for issuing a resource allocation result indicating the resources allocated to the traffic flow. The networking control information release subframe is located at the beginning of the superframe.

Service subframe: data for carrying traffic flows, which can also be understood as time domain resources allocated to traffic flows as determined by the central control node. The non-central control node may transmit corresponding service flow data on the corresponding service subframe according to the resource allocation result received in the networking control information release subframe.

Optionally, the service sub-frames may be divided based on the service type and service priority corresponding to the service flow carried. Exemplary, service subframe 1 is used for carrying a service flow of a class a service, and service subframe 2 is used for carrying a service flow of a class B service. For another example, service subframe 3 is used for carrying a service flow with a priority value of 1 in a class C service, and service subframe 4 is used for carrying a service flow with a priority value of 2 in a class C service. Or the same service subframe may also carry a plurality of service flows with different service types and/or different service priorities, which is not limited in the embodiment of the present application.

Uplink control feedback subframe: for all non-central control nodes in the network to send control packets to the central control node, this subframe is shared by all non-central control nodes, a subframe for sending control packets, which subframe may also be referred to as shared subframe. Optionally, the control packet sent by the non-central control node may include information such as a service flow establishment request, a maintenance request, or a tear-down request (which may also be collectively referred to as a service flow transmission requirement). After receiving the control packet, the central control node can acquire the request of the non-central control node, so as to perform corresponding processing on the service flow.

Alternatively, the non-central control node may send a control packet to the central control node in the uplink control subframe by means of a single-hop or multi-hop method.

It should be noted that, in the embodiment of the present application, the source node is transmitted to the destination node in a single-hop manner, and it may also be understood that the source node is transmitted to the destination node in a peer-to-peer (P2P) manner. For example, the non-central control node sends the control packet to the central control node by a single-hop method, which may also be referred to as that the non-central control node adopts a P2P method, and sends the control packet to the central control node.

Resource allocation guard time: when the central control node collects new service flow transmission requirements in an uplink control feedback subframe in a current superframe (i.e. a superframe corresponding to the current resource allocation), the central control node is guaranteed to have enough time to execute a new resource allocation algorithm to obtain a new resource allocation result, and the new resource allocation result can be sent out in the beginning stage of the next superframe (i.e. a networking control information release subframe of the next superframe), and a new resource allocation algorithm reservation time should be executed for the central control node. The resource allocation guard time is the time reserved for the central control node to execute the new resource allocation algorithm. Illustratively, as shown in fig. 6, the end time domain position of the resource allocation guard time of the superframe N is the end time domain position of the superframe N and coincides with the start time domain position of the next superframe (superframe n+1).

It can be appreciated that the interval duration from the end time domain position of the last uplink control feedback subframe in the superframe to the end time domain position of the superframe needs to be no less than the resource allocation guard time.

Alternatively, the length of the resource allocation guard time may be determined by the central control node. For example, the central control node may determine the length of the resource allocation protection time according to the execution time of the resource allocation algorithm, the platform implemented by software and hardware, and other factors.

Optionally, the subframe corresponding to the resource allocation guard time may be a service subframe. Alternatively, the central control node may allocate traffic subframes during the resource allocation guard time. Illustratively, as shown in fig. 6, the resource allocation guard time of superframe N corresponds to a traffic subframe.

The networking control information release subframe, the service subframe, the uplink control feedback subframe or the resource allocation protection time may be composed of a plurality of continuous basic subframes.

Alternatively, the number of traffic subframes or uplink control feedback subframes in the superframe may be one or more.

It should be noted that the superframe structure shown in fig. 6 is an exemplary structure, and embodiments of the present application do not limit the specific structure of the superframe (e.g., the location of the service subframe or the uplink control feedback subframe in the superframe) and the duration of each portion of the superframe.

It should be noted that, the above-mentioned networking control information release subframe, service subframe, uplink control feedback subframe or resource allocation protection time are exemplary names given by the embodiments of the present application, and may be replaced by other names in practical application, so that the technical solution of the embodiments of the present application is not affected.

For ease of understanding, in connection with the examples below, it is described how a central control node allocates resources for traffic flows in a network according to resource allocation rules. Table 1 below is an exemplary resource allocation rule.

TABLE 1

In table 1, R1 to R9 are identification information of resource allocation rules, and the resource allocation rules in table 1 are hereinafter referred to as rules R1 to R9. In table 1 above, the priority refers to the priority of the resource allocation rule, and the high or low of the priority is inversely related to the numerical value of the priority, in other words, the priorities of the rules R1 to R9 are from high to low.

The following will develop the rules R1 to R9.

Rule R1: in order to ensure that the central control node can smoothly issue the resource allocation result to the non-central control node, resources need to be allocated for the networking control sub-frame. In order to ensure that the service flow transmission requirement information can be smoothly interacted between all non-central control nodes and central control nodes, resources are required to be allocated for uplink control feedback subframes. Therefore, before allocating resources for all traffic flows, the central control node needs to first reserve a certain amount of resources for the networking control subframe and reserve a certain amount of resources for the uplink control feedback subframe.

In one possible implementation, the size of the resource reserved for the networking control subframe can be calculated by the central control node according to the performance of the adopted broadcast algorithm, the number of nodes in the network, the maximum radius of the multi-hop network topology, the number of WiFi links and bluetooth links in the network and other parameters, and the embodiment of the application is not limited to a specific calculation mode.

In one possible implementation, the size of the resource reserved for the uplink control feedback subframe may be calculated by the central control node according to parameters such as the number of nodes in the network, the maximum radius of the multi-hop network topology, and the number of WiFi links and bluetooth links in the network, and the embodiment of the application is not limited to a specific calculation mode.

The size of the resource reserved for the networking control subframe may refer to the number of basic subframes reserved for the networking control subframe, and the size of the resource reserved for the uplink control feedback subframe may refer to the number of basic subframes reserved for the uplink control feedback subframe.

Rule R2: because the C-class service is a low-delay and high-reliability service, in order to ensure the low-delay transmission requirement of the C-class service, if the transmission requirement of the C-class service is acquired from a non-central control node, the central control node needs to allocate resources for the C-class service preferentially. In addition, an acknowledgement/retransmission mechanism is required to ensure reliable transmission of class C traffic.

Herein, the "acknowledgement/retransmission mechanism" refers to an error control technique such as retransmission, and may be, for example, a Stop-Wait (Stop-Wait) mechanism, or an automatic repeat request (Go-BackNARQ) mechanism, etc.

R3 rule: when all the established traffic flows and the traffic flows requiring the establishment of the class B traffic flow exist, the central control node needs to allocate baseline resources for the traffic flows of the class B traffic to prevent the class B traffic from starving. Wherein, starvation refers to the transmission rate of traffic dropping to 0 when traffic cannot be allocated resources. And under the same condition, the resources are preferentially allocated to the service flows with higher service priorities.

In one possible implementation, the number of basic subframes contained in the baseline resource, or the proportion of the baseline resource in the superframe, may be calculated by the central control node according to parameters such as the number of nodes in the network, the maximum radius of the multi-hop network topology, the number of WiFi links and bluetooth links in the network, and the embodiment of the application is not limited to a specific calculation mode.

R4 rule: in order to ensure the transmission bandwidth of the class a service, for each established and requested class a service flow, the central control node needs to perform access control evaluation according to the service priority of the service flow, and allocate the requested resources for the class a service flow evaluated by the access control.

The specific steps of the access control evaluation are as follows:

1) And setting the service flow of the A-type service to be evaluated and requiring establishment as F, calculating the equivalent bandwidth of a routing path for transmitting the service flow F, and calculating the corresponding total number K of the basic subframes according to the bandwidth requirement of the service flow.

2) And sequencing all established service flows according to service priorities, wherein the service priorities corresponding to the networking control release subframes and the uplink control information access subframes which are allocated with resources are higher than the service priorities of any type of service flows. Setting a set of all established service flows with no lower service priority than the service flow F as Fb, and setting the sum of the number of basic subframes allocated to the service flows in the service flow set Fb as Kb; if K+Kb is less than or equal to T _SF, then the traffic flow F will pass the access control evaluation, otherwise it will not pass.

The routing path of the transport service flow F is a routing path calculated by the central control node according to the collected global network topology, the equivalent bandwidth of the routing path is calculated by the central control node according to each link and the corresponding link type included in the routing path, and a specific calculation method is described below and is not expanded again.

R5 rule: in order to maximize the transmission rate of the traffic stream of the class B service, it is sequentially determined whether each basic subframe except the resources allocated based on the R1 rule can be allocated to the traffic stream of each class B service.

The concrete meaning of "except for the resources allocated based on the R1 rule" refers to a basic subframe allocated based on the R1 rule, and cannot be allocated to any traffic flow of the B-class traffic any more.

The manner of allocating the non-idle subframes to the traffic flows of the B-class traffic may be frequency division or space division.

One implementation of "determining whether each basic subframe except the resources allocated based on the R1 rule can be allocated to the traffic flow of each class B traffic" is as follows: sequentially circularly traversing each basic subframe, if the subframe is an idle subframe, randomly distributing the subframe to a service flow of a certain B-type service, and then processing the subframe according to a non-idle subframe; otherwise, the service flow of each B-class service is sequentially circulated, if the routing path for transmitting a certain B-class service flow is not interfered with the routing paths of all the service flows for transmitting data by using the basic subframe, the subframe can be allocated to the service flow, otherwise, the subframe is not allocated to the service subframe, and then the service flow of the next B-class service can be continuously checked.

R6 rule: to avoid multi-hop transmission, for each traffic stream, the central control node may preferably calculate whether a P2P link is present when determining a routing path for transmitting data, and if so, preferably transmit the traffic stream using the P2P link.

R7 rule: in order to avoid inter-stream interference, when allocating resources, the central control node preferentially allocates different basic subframes for each service stream, i.e. preferentially adopts time division resources to schedule a plurality of service streams for transmission.

R8 rule: in order to avoid inter-flow interference, when allocating resources, if all basic subframes are already allocated to different service flows, when the central control node determines whether a certain basic subframe can be allocated to a certain given service flow, the central control node needs to determine whether the routing paths of all service flows using the service subframes to transmit data interfere with the routing paths of the service flows, if not, the central control node can allocate the basic subframe to the service flow in a space division manner, and if so, the basic subframe is not allocated to the service flow.

R9 rule: in order to avoid channel fading, the central control node should ensure that the allocated basic subframes are uniformly distributed in the superframe when allocating basic subframes for each traffic stream.

The R1 rule and the R6-R9 rules may be understood as a second resource allocation rule, i.e. a resource allocation rule executed by default, and the R2-R5 rules may be understood as first resource allocation rules respectively corresponding to the service flows of the multiple service types.

The following describes a specific implementation of resource allocation for each traffic flow in the network by the central control node according to the R1-R9 rules in table 1, in combination with a specific example.

It is assumed that at the end of the nth superframe, the traffic table established by the central control node includes 7 rows of information from the traffic ID to the traffic attribute in table 2. And assume that there is an interference relationship between the routing paths carrying any two traffic flows in table 2.

TABLE 2

The specific time frame structure parameters of the superframe are assumed as follows:

basic subframe: a length of 1.25 milliseconds (ms);

superframe structure: each super-frame contains 200 basic subframes with a duration of 25ms;

Networking control information release subframe: one networking control information release subframe comprises 4 basic subframes, and the duration is 5ms;

uplink control feedback subframe (shared subframe): an uplink control feedback subframe comprises 4 basic subframes, and the duration is 5ms;

service subframe: one service subframe comprises 10 basic subframes, and the duration is 12.5ms;

resource allocation guard time: 5ms;

the following parameters are assumed to be preset:

baseline resources for class B traffic: 20 basic subframes, the duration is 25ms;

The number of basic subframes allocated by C-type service: 2 basic subframes, the duration is 2.5ms.

The central control node performs the following steps for allocating resources to the A1, A2, B1 and C1 service flows in table 2 according to the R1-R9 rules shown in table 1:

Step 1: according to the R1 rule, firstly, 4 basic subframes are allocated for the networking control information release subframes, and then 4 basic subframes are allocated for the shared uplink control information access subframes; turning to step 2;

Step 2: according to the R2 rule, network resources are allocated to the class C traffic flow C1 in table 2: 2 basic subframes; turning to step 3;

Step 3: according to R3, allocating 20 basic subframes of the baseline resource for the B-class service flow B1 in the table 2; turning to step 4;

Step 4: according to R4, access control evaluations are performed for each of the class a traffic flows, i.e., A1 and A2, that have been established and are requested to be established in table 2.

A) Access control assessment is first made for A1. As shown in table 2, the equivalent bandwidth of the routing path of the transmission A1 is calculated to be 25Mbps, the bandwidth demand requested by A1 is 20Mbps, and 200 basic subframes are total per superframe, so that the number of basic subframes to be allocated for A1 is 200× (20/25) =160.

B) Ordering all types of traffic which are established currently (refer to traffic which has been allocated resources in the current resource allocation before step b) according to the priority, and counting the number of the allocated basic subframes of all types of traffic which are not lower in priority than the traffic A1, wherein the number of the allocated basic subframes is as follows: b1 has been allocated 20 basic subframes (baseline resources), C1 has been allocated 2 basic subframes, networking control release subframes have been allocated 4 basic subframes, uplink control information access subframes have been allocated 4 basic subframes, and a total of 30 basic subframes. A1 will evaluate through access control because 160+30<200, thus allocating its requested network resources to A1: 160 basic subframes.

C) Then, an access control assessment is made for A2. As shown in table 2, the equivalent bandwidth of the routing path through which A2 is transmitted is calculated to be 25Mbps, the bandwidth demand of the A2 request is 20Mbps, and 200 basic subframes are total per superframe, so that the number of basic subframes to be allocated for A2 is 200× (20/25) =160.

D) Ordering all the established service flows according to the priority, and counting the number of the allocated basic subframes of the established service flows with no lower priority than the service flow A2, wherein the number of the allocated basic subframes is as follows: the method comprises the steps that 160 basic subframes are allocated to A1, 20 basic subframes (base line resources) are allocated to B1, 2 basic subframes are allocated to C1, 4 basic subframes are allocated to a networking control release subframe, 4 basic subframes are allocated to an uplink control information access subframe, and 190 basic subframes are total.

Because 160+190>200 (resources are not sufficient to allocate for A2 if resources are allocated only from the time dimension), and because there is an interference relationship between the routing paths carrying any two traffic flows in table 2, 190 basic subframes that have been allocated cannot be subdivided into A2 (if resources are allocated from the frequency dimension, or the space dimension, neither of which has the conditions of frequency and space division), A2 will not be assessed by access control. Therefore, no resources are allocated for A2.

Step 5: to maximize the transmission rate of the class B traffic stream, it is sequentially determined whether each basic subframe except the resources allocated according to the R1 rule can be allocated to each class B traffic stream. The method comprises the steps that 160 basic subframes are allocated to A1, 20 basic subframes (baseline resources) are allocated to B1, 2 basic subframes are allocated to C1, 4 basic subframes are allocated to a networking control release subframe, 4 basic subframes are allocated to an uplink control information access subframe, 190 basic subframes are total, and the 190 basic subframes cannot be allocated to B1 because of interference relation between routing paths carrying any two service flows in table 2, and the rest 10 basic subframes can be allocated to B1, namely 30 basic subframes are allocated to B1 in total.

And 5, after finishing the step, the central control node finishes resource allocation to obtain two rows of information, namely the number of the allocated basic subframes and the equivalent bandwidth of the routing path in the table 2. The number of allocated basic subframes corresponding to the A1, A2, B1 and C1 service flows is the number of basic subframes allocated to the A1, A2, B1 and C1 service flows determined in the steps 2-5. The equivalent bandwidths of the routing paths corresponding to the A1, A2, B1 and C1 service flows are calculated by the central control node and are used for bearing the equivalent bandwidths of the routing paths of the A1, A2, B1 and C1 service flows respectively.

Optionally, the embodiment of the present application further provides a method for calculating an equivalent bandwidth of the routing path, which is described below.

Specifically, the central control node calculates the equivalent bandwidth of each link according to the link type of each link included in the routing path, and further calculates the equivalent bandwidth of the routing path according to the equivalent bandwidth of each link. The following describes a method for calculating the equivalent bandwidth of a link in the case where the link type is a WiFi link and the link type is a bluetooth link, respectively.

1. Calculation of equivalent bandwidth of WiFi link:

Fig. 7 is a schematic diagram of a multiple access technique in an exemplary WiFi network. The following describes a method for calculating equivalent bandwidth of a WiFi link in an embodiment of the present application with reference to fig. 7.

In one possible approach, the equivalent bandwidth of the WiFi link satisfies the following relationship:

Where s represents the equivalent bandwidth of the WiFi link; n ^PPDU denotes the number of physical layer protocol data units (presentationprotocol data unit, ppdus) in one transmission opportunity (transmission opportunity, TXOP); p ^PPDU denotes the number of medium access control protocol data units (MEDIA ACCESS control protocol dataunit, MPDUs) in one PPDU; p represents the average length of each MPDU.

Further, the number of PPDUs in one TXOP satisfies the following relationship:

Wherein n ^PPDU represents the number of PPDUs in one TXOP; τ ^TXOP indicates whether to turn on the TXOP mechanism, τ ^TXOP =1 indicates turn on or τ ^TXOP =0 indicates no turn on; t ^TXOP denotes the maximum time length of the TXOP when the TXOP is turned on; τ ^RTS denotes whether or not to turn on a Request To Send (RTS)/grant send (CTS) handshake mechanism, τ ^RTS =1 denotes turned on, and τ ^RTS =0 denotes not turned on; t ^RTS denotes a transmission duration of the RTS frame; t ^CTS denotes a transmission duration of the CTS frame; t ^SIFS denotes a duration of a frame interval (short INTER FRAME SPACE, SIFS) (specifically, an interval duration between an RTS frame and a CTS frame); t ^pre denotes a transmission duration of a physical layer preamble (preamble); t ^pre-BA denotes a transmission duration of the block acknowledgement frame preamble, and t ^BA ^-256 denotes a transmission duration of a block acknowledgement frame having a bitmap (bitmap) of 256.

Further, the number of MPDUs in one PPDU satisfies the following relationship:

Wherein, P ^PPDU represents the number of MPDUs in a PPDU; n ^MPDU represents the maximum number of the aggregated MPDUs in a PPDU; n ^byte is the maximum number of bytes (bytes) that can be carried in a PPDU; p denotes an average length of each MPDU, t ^PPDU is a maximum transmission time of the PPDU, Is the historical average link transmission rate of the Medium Access Control (MAC) layer.

Further, the duration of one TXOP satisfies the following relationship:

Wherein T ^TXOP denotes the duration of one TXOP; t ^AIFS denotes an arbitration interframe space (arbitration INTER FRAME SPACE, AIFS) value for the Access Category (AC); w _min represents the value of the minimum CWmin of the contention window corresponding to the access category; t ^slot denotes a slot length; τ ^RTS indicates whether to turn on the RTS/CTS handshake mechanism, τ ^RTS =1 indicates turn on, and τ ^RTS =0 indicates no turn on; t ^RTS represents a transmission duration of requesting to transmit an RTS frame; t ^CTS denotes a transmission duration for permitting transmission of a CTS frame; t ^SIFS denotes the duration of the frame interval SIFS; n ^PPDU represents the number of PPDUs in one TXOP; t ^pre denotes a transmission duration of the physical layer preamble; p ^PPDU denotes the number of MPDUs in one PPDU; p represents an average length of each MPDU; r ^θ represents a physical layer transmission rate of modulation and coding scheme (modulationand scheme, MCS) level θ, and r ^θ may be used to represent a physical layer transmission rate of MCS level θ specified by the IEEE 802.11 standard, by way of example.

2. Calculation of equivalent bandwidth of bluetooth link:

In one possible implementation, the central control node determines an equivalent bandwidth of the bluetooth link according to a resource allocation type adopted by the bluetooth link in the routing path and a state that the bluetooth link is polled and scheduled.

Fig. 8 is a schematic diagram of a distributed network (scatternet) consisting of a bluetooth network. As shown in fig. 8, the network includes two piconets (piconets), one of which is composed of node a and node B, and one of which is composed of node B and node C, and node B is simultaneously a master (master) node of node a and a slave (slave) node of node C. The node A and the node B form a Bluetooth link, and the node B and the node C form a Bluetooth link. Resources are equally allocated between the two picoets, i.e. the two picoets are polled (which can also be understood as the link consisting of node a and node B, and the link consisting of node B and node C are polled).

Assuming that each BR link uses a mode of sending a 1-slot reply by 3 slots to perform communication, and uses the Type (Type) of uplink and downlink resource allocation in the bluetooth standard v5.2 as 3-DH3 to perform data transmission.

A schematic diagram of a communication manner in which the 3-slot transmission 1-slot reply is shown in fig. 9. The master node transmits data to the slave node in the first 3 slots, and the slave node transmits feedback data to the master node in the last slot.

In the bluetooth standard v5.2, when the Type is 3-DH3, the corresponding parameters are shown in table 3 below:

TABLE 3 Table 3

The mode of sending 1 time slot response reply by 3 time slots corresponds to asymmetric transmission rate. As can be seen from Table 3, when the Type is 3-DH3, the asymmetric transmission rate from the master node to the slave node (master-slave) can reach 1766.4Kbps, and the asymmetric transmission rate from the slave node to the master node (slave-master) can reach 265.6Kbps. Because the bluetooth standard v5.2 gives the equivalent bandwidth of the link that can be achieved in the case of 1 master node and 1 slave node, and in fig. 7, two picoets are scheduled in a polling manner, that is, two bluetooth links are scheduled in a polling manner, the transmission rate of any one bluetooth link will be equally divided into half, that is, the master-slave transmission rate can reach 1766.4/2= 883.2Kbps, and the slave-master transmission rate can reach 265.6/2=132.8 Kbps.

It should be noted that the above manner of calculating the equivalent bandwidth of the bluetooth link is an exemplary calculation manner applied to the bluetooth network shown in fig. 8. If the network form of the bluetooth network or the scheduling form of the bluetooth link changes, the calculation mode also changes adaptively.

In addition to the above calculation manner of the equivalent bandwidth of the WiFi link and the calculation manner of the equivalent bandwidth of the bluetooth link, the central control node may also calculate the equivalent bandwidth of each link in the routing path by using other calculation manners, which is not particularly limited in the embodiment of the present application.

Further, after the central control node determines the equivalent bandwidth of each link in the routing path, the equivalent bandwidth of the routing path satisfies the following relationship:

wherein X represents the equivalent bandwidth of the target routing path carrying the traffic flow; m represents the number of transmission links in a target routing path carrying traffic flows; s _m is the equivalent bandwidth of the transmission link L _m; the transmission link L _m is the mth transmission link in the routing path, and M is greater than or equal to 1 and less than or equal to M.

The calculation method of the equivalent bandwidth of the routing path may be used to determine the equivalent bandwidth of the routing path in the method embodiment, for example, may be used to determine the equivalent bandwidth of the target routing path carrying the first traffic flow, and the "routing path" in the formula (4) may be replaced by the "target routing path carrying the first traffic flow" accordingly.

An exemplary application scenario of the resource allocation method according to the embodiment of the present application is described below with reference to fig. 10.

Taking the wireless home network shown in fig. 10 as an example, assume that in fig. 10, the camera, the AP and the mobile phone are connected by WiFi, and the mobile phone and the watch are connected by bluetooth. At time t, the mobile phone performs version upgrade on the watch, namely, a B-class service flow is established, and at the moment, the B-class service flow occupies all bandwidths of a wireless Bluetooth link between the mobile phone and the watch. At time t+1s, the watch receives multi-hop transmission of the camera video, namely, transmission of the camera to the A-class service flow of the watch is established.

If the resource allocation method provided by the embodiment of the application is applied to the wireless home network shown in fig. 10, the high-priority class a service flow which arrives later is allowed to be established after the central control node executes the resource allocation rule based on the QoS requirement of the class a service flow and the QoS requirement of the class B service flow, and the service flow of the established class B service is slowed down. At time t+1s it is observed that:

Class a traffic is transmitted and bandwidth is effectively guaranteed, while class B traffic is slowed down;

because the class a traffic is a multi-hop traffic, its routing path is camera-AP-handset-watch, if the AP is powered down, the class a traffic (camera video) will not be transmitted to the watch.

It will be appreciated that in the various embodiments above, the methods and/or steps implemented by the central control node may also be implemented by a component (e.g., a chip or circuit) that may be used in the central control node. The methods and/or steps implemented by the non-central control node may also be implemented by a component (e.g., a chip or circuit) that may be used in the non-central control node.

The scheme provided by the embodiment of the application is mainly introduced from the interaction point of the devices. Correspondingly, the embodiment of the application also provides a communication device which is used for realizing the various methods. The communication means may be the central control node in the above-described method embodiments, or a device comprising the central control node, or a component usable with the central control node. Or the communication device may be a non-central control node in the above-described method embodiment, or a device comprising the above-described non-central control node, or a component usable with the non-central control node. It will be appreciated that the communication device, in order to achieve the above-described functions, comprises corresponding hardware structures and/or software modules performing the respective functions. Those of skill in the art will readily appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as hardware or combinations of hardware and computer software. Whether a function is implemented as hardware or computer software driven hardware depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.

The embodiment of the application can divide the functional modules of the communication device according to the above method embodiment, for example, each functional module can be divided corresponding to each function, or two or more functions can be integrated into one processing module. The integrated modules may be implemented in hardware or in software functional modules. It should be noted that, in the embodiment of the present application, the division of the modules is schematic, which is merely a logic function division, and other division manners may be implemented in actual implementation.

Taking the communication device as an example of the central control node in the above method embodiment, fig. 11 shows a schematic structural diagram of a communication device 1100. The communication device 1100 comprises a transceiver module 1101 and a processing module 1102. The transceiver module 1101 may also be referred to as a transceiver module or a transceiver unit, where the transceiver module 1101 is configured to implement a transceiver function, and may be, for example, a transceiver circuit, a transceiver, or a communication interface.

In one possible design, the processing module 1102 is configured to determine, according to priorities of resource allocation rules corresponding to service flows of multiple service types in the network, an order of allocating resources for each of the service flows of the multiple service types; the priority of each corresponding resource allocation rule is determined according to the QoS requirement of the service flow of the corresponding service type. The processing module 1102 is further configured to determine a resource allocation result according to an order of allocating resources for each of the service flows of the multiple service types and a resource allocation rule corresponding to each of the service flows, where the resource allocation result is used to indicate resources allocated for each of the service flows of the multiple service types. A transceiver module 1101, configured to send a resource allocation result to a non-central control node in the network.

In the present embodiment, the communication apparatus 1100 is presented in a form in which respective functional modules are divided in an integrated manner. A "module" herein may refer to a particular ASIC, an electronic circuit, a processor and memory that execute one or more software or firmware programs, an integrated logic circuit, and/or other device that can provide the described functionality.

In a simple embodiment, one skilled in the art will appreciate that the communication device 1100 may take the form of the communication device 400 shown in fig. 4.

For example, the processor 401 in the communication apparatus 400 shown in fig. 4 may cause the communication apparatus 400 to execute the resource allocation method in the above-described method embodiment by calling the computer-executable instructions stored in the memory 403. In particular, the functions/implementation of the transceiver module 1101 and the processing module 1102 in fig. 11 may be implemented by the processor 401 in the communication device 400 shown in fig. 4 invoking computer executable instructions stored in the memory 403. Or the function/implementation of the processing module 1102 in fig. 11 may be implemented by the processor 401 in the communication device 400 shown in fig. 4 invoking computer executable instructions stored in the memory 403, and the function/implementation of the transceiver module 1101 in fig. 11 may be implemented by the communication interface 404 in the communication device 400 shown in fig. 4.

Since the communication device 1100 provided in this embodiment can perform the above-mentioned resource allocation method, the technical effects that can be obtained by the communication device can be referred to the above-mentioned method embodiment, and will not be described herein.

It should be noted that one or more of the above modules or units may be implemented in software, hardware, or a combination of both. When any of the above modules or units are implemented in software, the software exists in the form of computer program instructions and is stored in a memory, a processor can be used to execute the program instructions and implement the above method flows. The processor may be built in a SoC (system on a chip) or ASIC, or may be a separate semiconductor chip. The processor may further include necessary hardware accelerators, such as field programmable gate arrays (field programmable GATE ARRAY, fpgas), programmable logic devices (programmable logic device, plds), or logic circuits implementing special-purpose logic operations, in addition to the cores for executing software instructions for performing the operations or processing.

When the above modules or units are implemented in hardware, the hardware may be any one or any combination of a CPU, microprocessor, DSP chip, micro control unit (microcontroller unit, MCU), artificial intelligence processor, ASIC, soC, FPGA, PLD, special purpose digital circuitry, hardware accelerator, or non-integrated discrete device, which may run the necessary software or be independent of the software to perform the above method flows.

Optionally, an embodiment of the present application further provides a chip system, including: at least one processor and an interface, the at least one processor being coupled with the memory through the interface, the at least one processor, when executing the computer programs or instructions in the memory, causing the method of any of the method embodiments described above to be performed. In one possible implementation, the communication device further includes a memory. Alternatively, the chip system may be formed by a chip, or may include a chip and other discrete devices, which are not specifically limited in this embodiment of the present application.

In the above embodiments, it may be implemented in whole or in part by software, hardware, firmware, or any combination thereof. When implemented using a software program, it may be implemented in whole or in part in the form of a computer program product.

The present application provides a computer program product comprising one or more computer instructions which, when run on a communications device, cause any of the methods of the embodiments of the present application to be performed.

When the computer program instructions are loaded and executed on a computer, the processes or functions described in accordance with embodiments of the present application are produced in whole or in part. The computer may be a general purpose computer, a special purpose computer, a computer network, or other programmable apparatus.

The computer instructions may be stored in a computer-readable storage medium. Embodiments of the present application provide a computer readable storage medium having instructions stored therein that, when executed on a communication device, cause any of the methods of embodiments of the present application to be performed.

Computer instructions may be transmitted from one computer-readable storage medium to another computer-readable storage medium, for example, by wire (e.g., coaxial cable, optical fiber, digital subscriber line (digital subscriber line, DSL)), or wirelessly (e.g., infrared, wireless, microwave, etc.) from one website, computer, server, or data center. Computer readable storage media can be any available media that can be accessed by a computer or data storage devices including one or more servers, data centers, etc. that can be integrated with the media. The usable medium may be a magnetic medium (e.g., a floppy disk, a hard disk, a magnetic tape), an optical medium [ e.g., a digital versatile disk (DIGITAL VERSATILE DISC, DVD) ], or a semiconductor medium (e.g., a Solid State Disk (SSD)), or the like.

Although the application is described herein in connection with various embodiments, other variations to the disclosed embodiments can be understood and effected by those skilled in the art in practicing the claimed application, from a study of the drawings, the disclosure, and the appended claims. In the claims, the word "comprising" does not exclude other elements or steps, and the "a" or "an" does not exclude a plurality. A single processor or other unit may fulfill the functions of several items recited in the claims. The mere fact that certain measures are recited in mutually different dependent claims does not indicate that a combination of these measures cannot be used to advantage.

Although the application has been described in connection with specific features and embodiments thereof, it will be apparent that various modifications and combinations thereof can be made without departing from the scope of the application. Accordingly, the specification and drawings are merely exemplary illustrations of the present application as defined in the appended claims and are considered to cover any and all modifications, variations, combinations, or equivalents that fall within the scope of the application. The present application is intended to include such modifications and alterations insofar as they come within the scope of the appended claims or the equivalents thereof.

Claims

1. A method of resource allocation, the method being applied to a multi-hop heterogeneous network, the method comprising:

The central control node determines the sequence of allocating resources for each service flow in the service flows of multiple service types according to the priority of the resource allocation rule corresponding to the service flows of the multiple service types in the network; the priority of each corresponding resource allocation rule is determined according to the QoS requirement of the service flow of the corresponding service type;

The central control node determines a resource allocation result according to the sequence of allocating resources for each of the plurality of service types of service flows and the resource allocation rule corresponding to each of the plurality of service types of service flows, wherein the resource allocation result is used for indicating resources allocated for each of the plurality of service types of service flows;

And the central control node sends the resource allocation result to non-central control nodes in the network.

2. The method of claim 1, wherein the traffic type comprises a bandwidth guaranteed type, a large file transfer type, or a low latency, high reliability transfer message type.

3. The method of claim 1, wherein the plurality of traffic types of traffic flows comprises a first traffic type of traffic flow comprising a plurality of traffic flows; wherein the resource allocation order of each of the plurality of traffic flows of the first traffic type is determined according to the priority of each of the plurality of traffic flows of the first traffic type.

4. A method according to any one of claims 1-3, wherein the method further comprises:

The central control node determines the equivalent bandwidth of a target routing path carrying a first service flow; wherein the first service flow is one of the plurality of service types of service flows;

the central control node determines a resource allocation result according to the sequence of allocating resources for each service flow in the service flows of the multiple service types and the resource allocation rule corresponding to each service flow, and the method comprises the following steps:

The central control node determines that resources are required to be allocated to the service flows of the service type to which the first service flow belongs currently according to the sequence of allocating resources to each service flow in the service flows of the plurality of service types;

And the central control node determines resources allocated for the first service flow in the resource allocation result according to the equivalent bandwidth of the target routing path carrying the first service flow and a resource allocation rule corresponding to the service flow of the service type to which the first service flow belongs.

5. The method of claim 4, wherein each of the plurality of traffic types of traffic flows has a priority;

The central control node determines resources allocated to the first service flow in the resource allocation result according to the equivalent bandwidth of the target routing path carrying the first service flow and a resource allocation rule corresponding to the service flow of the service type to which the first service flow belongs, and the method comprises the following steps:

The central control node determines the size of the resources to be allocated to the first service flow according to the resource allocation rule corresponding to the service flow of the service type to which the first service flow belongs and combining the guaranteed bandwidth of the first service flow and the equivalent bandwidth of the target routing path carrying the first service flow;

The central control node determines the size of resources allocated for a second service flow, wherein the second service flow is a service flow with priority not lower than that of the first service flow in the established service flows;

in the case that the sum of the size of the resources allocated for the second service flow and the size of the resources to be allocated for the first service flow is smaller than or equal to the size of the resources that can be allocated, the central control node allocates resources for the first service flow according to the size of the resources to be allocated for the first service flow;

Or in the case that the sum of the size of the resources allocated for the second traffic flow and the size of the resources to be allocated for the first traffic flow is larger than the size of the resources that can be allocated, the central control node determines not to allocate resources for the first traffic flow.

6. The method according to claim 4 or 5, characterized in that the method further comprises:

The central control node determines the equivalent bandwidth of a wireless fidelity WiFi link in a target routing path carrying the first service flow; the equivalent bandwidth of the WiFi link in the target routing path is used for determining the equivalent bandwidth of the target routing path; the equivalent bandwidth of the WiFi link satisfies the following relationship:

Wherein s represents an equivalent bandwidth of the WiFi link; n ^PPDU represents the number of physical layer protocol data units PPDUs in one transmission opportunity TXOP; p ^PPDU represents the number of medium access control protocol data units MPDUs in one PPDU; p represents an average length of each MPDU; t ^TXOP denotes the duration of one TXOP; Indicating the average number of retransmissions.

7. The method of claim 6, wherein the step of providing the first layer comprises,

In the WiFi link, the number of PPDUs in one TXOP satisfies the following relation:

8. The method according to claim 6 or 7, wherein,

In the WiFi link, the number of MPDUs in one PPDU satisfies the following relationship:

Wherein, P ^PPDU represents the number of MPDUs in a PPDU; n ^MPDU represents the maximum number of the aggregated MPDUs in a PPDU; n ^byte is the maximum number of bytes that can be carried in a PPDU; p denotes an average length of each MPDU, t ^PPDU is a maximum transmission time of the PPDU, The historical average link transmission rate of the MAC layer is controlled for medium access.

9. The method according to any one of claims 6 to 8, wherein,

In the WiFi link, the duration of one TXOP satisfies the following relationship:

Wherein T ^TXOP denotes the duration of one TXOP; t ^AIFS represents an arbitration interframe space AIFS value corresponding to the access class; w _min represents the minimum CWmin value of the contention window corresponding to the access category; t ^slot denotes a slot length; τ ^RTS denotes whether to turn on the RTS/CTS handshake mechanism, τ ^RTS =1 denotes to turn on, τ ^RTS =0 denotes to turn off; t ^RTS represents a transmission duration of requesting to transmit an RTS frame; t ^CTS denotes a transmission duration for permitting transmission of a CTS frame; t ^SIFS denotes the duration of the frame interval SIFS; n ^PPDU represents the number of PPDUs in one TXOP; t ^pre denotes a transmission duration of the physical layer preamble; n ^PPDU denotes the number of MPDUs in one PPDU; p represents an average length of each MPDU; r ^θ denotes a physical layer transmission rate of modulation coding scheme MCS level θ.

10. The method according to any one of claims 4-9, further comprising:

The central control node determines the equivalent bandwidth of the Bluetooth link according to the resource allocation type adopted by the Bluetooth link in the target routing path carrying the first service flow and the state of the Bluetooth link in polling scheduling; the equivalent bandwidth of the Bluetooth link in the target routing path is used for determining the equivalent bandwidth of the target routing path.

11. The method according to any of claims 4-10, wherein the central control node determining an equivalent bandwidth of a target routing path carrying the first traffic flow comprises:

the central control node determines equivalent bandwidth of each transmission link among a plurality of transmission links included in a target routing path carrying the first service flow;

The central control node determines the equivalent bandwidth of a target routing path carrying the first service flow according to the equivalent bandwidth of each transmission link; wherein, the equivalent bandwidth of the target routing path corresponding to the first service flow satisfies the following relationship:

12. The method according to any of claims 1-11, wherein the central control node sending a resource allocation result to non-central control nodes in the network, comprising:

The central control node broadcasts the resource allocation result to non-central control nodes in the network in a networking control information release subframe; wherein, the networking control information release subframe is a time for sending the resource allocation result.

13. A communication device, the communication device comprising: a transceiver module and a processing module;

The processing module is used for determining the sequence of allocating resources for each service flow in the service flows of the multiple service types according to the priority of the resource allocation rule corresponding to the service flows of the multiple service types in the network; the priority of the resource allocation rule corresponding to each service flow is determined according to the QoS requirement of the service flow of the corresponding service type;

The processing module is further used for determining a resource allocation result according to the sequence of allocating resources for each service flow in the service flows of the multiple service types and the resource allocation rule corresponding to each service flow, wherein the resource allocation result is used for indicating the resources allocated for each service flow in the service flows of the multiple service types;

and the receiving and transmitting module is used for transmitting the resource allocation result to the non-central control node in the network.

14. The apparatus of claim 13, wherein the traffic type comprises a bandwidth guaranteed type, a large file transfer type, or a low latency, high reliability transfer message type.

15. The apparatus according to claim 13 or 14, wherein the plurality of traffic types of traffic flows comprises a first traffic type of traffic flow comprising a plurality of traffic flows; wherein the resource allocation order of each of the plurality of traffic flows of the first traffic type is determined according to the priority of each of the plurality of traffic flows of the first traffic type.

16. The apparatus according to any of claims 13-15, wherein the processing module is further configured to determine an equivalent bandwidth of a target routing path carrying the first traffic flow; wherein the first service flow is one of the plurality of service types of service flows;

The processing module is specifically configured to determine that resources are currently required to be allocated to a service flow of a service type to which the first service flow belongs according to an order of allocating resources to each service flow in the service flows of the multiple service types; and determining resources allocated for the first service flow in the resource allocation result according to the equivalent bandwidth of the target routing path carrying the first service flow and a resource allocation rule corresponding to the service flow of the service type to which the first service flow belongs.

17. The apparatus of claim 16, wherein each of the plurality of traffic types of traffic flows has a priority;

The processing module is specifically configured to determine, according to an equivalent bandwidth of a target routing path carrying the first service flow and a resource allocation rule corresponding to a service flow of a service type to which the first service flow belongs, a size of a resource allocated for the first service flow, where the determining includes:

Determining the size of resources to be allocated to the first service flow according to the resource allocation rule corresponding to the service flow of the service type to which the first service flow belongs and combining the guaranteed bandwidth of the first service flow and the equivalent bandwidth of a target routing path carrying the first service flow;

determining the size of resources allocated for a second service flow, wherein the second service flow is a service flow with priority not lower than that of the first service flow in the established service flows;

When the sum of the size of the resources allocated for the second service flow and the size of the resources required to be allocated for the first service flow is smaller than or equal to the size of the resources which can be allocated, allocating the size of the resources for the first service flow according to the size of the resources required to be allocated for the first service flow;

Or determining not to allocate resources for the first traffic flow if the sum of the size of resources allocated for the second traffic flow and the size of resources that the first traffic flow needs to be allocated is greater than the size of resources that can be allocated.

18. The apparatus according to claim 16 or 17, wherein,

The processing module is further configured to determine an equivalent bandwidth of a WiFi link in a target routing path carrying the first service flow; the equivalent bandwidth of the WiFi link in the target routing path is used for determining the equivalent bandwidth of the target routing path; the equivalent bandwidth of the WiFi link satisfies the following relationship:

19. The apparatus of claim 18, wherein the device comprises a plurality of sensors,

20. The device according to claim 18 or 19, wherein,

21. The device according to any one of claims 18 to 20, wherein,

Wherein T ^TXOP denotes the duration of one TXOP; t ^AIFS denotes an arbitration inter-frame space AIFS value corresponding to the access class AC; w _min represents the minimum CWmin value of the contention window corresponding to the access category; t ^slot denotes a slot length; τ ^RTS indicates whether to turn on the RTS/CTS handshake mechanism, τ ^RTS =1 indicates turn on, and τ ^RTS =0 indicates no turn on; t ^RTS represents a transmission duration of requesting to transmit an RTS frame; t ^CTS denotes a transmission duration for permitting transmission of a CTS frame; t ^SIFS denotes the duration of the frame interval SIFS; n ^PPDU represents the number of PPDUs in one TXOP; t ^pre denotes a transmission duration of the physical layer preamble; p ^PPDU denotes the number of MPDUs in one PPDU; p represents an average length of each MPDU; r ^θ denotes a physical layer transmission rate of modulation coding scheme MCS level θ.

22. The device according to any one of claims 16 to 21, wherein,

The processing module is further configured to determine an equivalent bandwidth of the bluetooth link according to a resource allocation type adopted by the bluetooth link in a target routing path carrying the first service flow and a state of the bluetooth link being polled and scheduled; the equivalent bandwidth of the Bluetooth link in the target routing path is used for determining the equivalent bandwidth of the target routing path.

23. The apparatus according to any of claims 16-22, wherein the processing module further configured to determine an equivalent bandwidth of a target routing path carrying the first traffic flow comprises:

The processing module is configured to determine an equivalent bandwidth of each transmission link among a plurality of transmission links included in a target routing path carrying the first traffic flow; determining the equivalent bandwidth of a target routing path carrying the first service flow according to the equivalent bandwidth of each transmission link; wherein, the equivalent bandwidth of the target routing path corresponding to the first service flow satisfies the following relationship:

24. The apparatus according to any one of claims 13-23, wherein the transceiver module is configured to broadcast the resource allocation result to a non-central control node in the network in a networking control information release subframe; wherein, the networking control information release subframe is a time for sending the resource allocation result.

25. A communication device, the communication device comprising: a processor coupled to a memory for storing computer-executable instructions, the processor for executing the instructions stored by the memory; the instructions, when executed by the processor, cause the communication device to perform the method of any of claims 1-12.

26. A computer-readable storage medium, having stored thereon a computer program which, when executed by a computer, causes the method of any of claims 1-12 to be performed.

27. A computer program product, characterized in that the computer program product, when executed by a computer, causes the method of any one of claims 1-12 to be performed.

28. A communication system comprising a central node and a non-central node; the central node for performing the method of any of claims 1-12.