CN117499930A

CN117499930A - Network resource allocation method, network equipment and storage medium

Info

Publication number: CN117499930A
Application number: CN202210870834.2A
Authority: CN
Inventors: 张学谦
Original assignee: ZTE Corp
Current assignee: ZTE Corp
Priority date: 2022-07-22
Filing date: 2022-07-22
Publication date: 2024-02-02
Also published as: WO2024016856A1

Abstract

The embodiment of the invention provides a network resource allocation method, network equipment and a storage medium, and a transmission request of a target site is acquired; acquiring channel state information of a wireless network; determining at least one corresponding target node for each target site from a plurality of candidate nodes in the wireless network according to the channel state information; and controlling the target site to establish transmission connection with the corresponding at least one target node. The invention helps to improve the throughput of the wireless mesh network.

Description

Network resource allocation method, network equipment and storage medium

Technical Field

The present invention relates to the field of wireless network technologies, and in particular, to a network resource allocation method, a network device, and a storage medium.

Background

Wi-Fi Mesh (Wireless Mesh) is a broadband network that can be used to access the Internet, and has high capacity and high speed. The Mesh network comprises a plurality of nodes (Access points, APs), and Stations (STAs) establish connection with the internet through the nodes so as to perform information interaction with the internet. When a site wants to exchange information with the Internet through a Mesh network, a plurality of nodes in the Mesh network compete freely at the same time to establish transmission connection with the site, and if the competition capacity of the plurality of nodes is the same, the resource competition condition is aggravated, so that the whole Mesh network is in an internal consumption state, and the throughput of the whole Mesh network is reduced.

Disclosure of Invention

The following is a summary of the subject matter described in detail herein, which is not intended to limit the scope of the claims.

The embodiment of the invention provides a network resource allocation method, network equipment and a storage medium, which are beneficial to improving the throughput of a wireless mesh network.

In a first aspect, an embodiment of the present invention provides a network resource allocation method, applied to a processing unit PU, where the method includes:

acquiring a transmission request of a target site;

acquiring channel state information of a wireless network;

determining at least one corresponding target node for each target site from a plurality of candidate nodes in the wireless network according to the channel state information;

and controlling the target site to establish transmission connection with the corresponding at least one target node.

In a second aspect, an embodiment of the present invention further provides a network device, including a memory and a processor, where the memory stores a computer program, and the processor implements the method according to the first aspect when executing the computer program.

In a third aspect, an embodiment of the present invention further provides a computer readable storage medium, where a program is stored, where the program is executed by a processor to implement the method according to the first aspect.

The embodiment of the invention has at least the following beneficial effects: the invention receives the transmission request from the target site; determining at least one corresponding target node for the target site from a plurality of candidate nodes in the wireless network according to the channel state information of the wireless network; and then, the control target station establishes transmission connection with at least one corresponding target node so as to carry out information transmission. After receiving the transmission request of the station, the invention can determine the target node from the candidate nodes which compete with the station to connect according to the channel state information of the wireless network, thus being beneficial to reducing the probability of establishing transmission connection between the malignant competition of the nodes and the target station, so that the phenomenon of internal consumption of the whole wireless network resource occurs, and being beneficial to improving the throughput of the whole wireless network.

Additional features and advantages of the invention will be set forth in the description which follows, and in part will be obvious from the description, or may be learned by practice of the invention. The objectives and other advantages of the invention will be realized and attained by the structure particularly pointed out in the written description and claims hereof as well as the appended drawings.

Drawings

The accompanying drawings are included to provide a further understanding of the invention and are incorporated in and constitute a part of this specification, illustrate and do not limit the invention.

Fig. 1 is a schematic diagram of a logical connection scenario of a Mesh network according to an embodiment of the present invention;

fig. 2 is a flowchart of a network resource allocation method according to an embodiment of the present invention;

fig. 3 is a timing diagram of an STA1 uploading scenario provided in an embodiment of the present invention.

Fig. 4 is a schematic structural diagram of a network device according to an embodiment of the present invention.

Detailed Description

The present invention will be described in further detail with reference to the drawings and examples, in order to make the objects, technical solutions and advantages of the present invention more apparent. It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the scope of the invention.

In the description of the present invention, it should be understood that the direction or positional relationship indicated with reference to the description of the orientation, such as "upper", "lower", etc., is based on the direction or positional relationship shown in the drawings, only for convenience of describing the present invention and simplifying the description, and does not indicate or imply that the apparatus or element referred to must have a specific orientation, be constructed and operated in a specific orientation, and thus should not be construed as limiting the present invention.

It should be noted that although functional block division is performed in a device diagram and a logic sequence is shown in a flowchart, in some cases, the steps shown or described may be performed in a different order than the block division in the device, or in the flowchart. The terms first, second and the like in the description, in the claims and in the above-described figures, are used for distinguishing between similar objects and not necessarily for describing a particular sequential or chronological order. In the description of the present invention, unless otherwise indicated, the meaning of "a plurality" is two or more.

In the description of the present invention, unless otherwise defined explicitly, the terms "mounted", "connected", etc. should be construed broadly and the specific meaning of the terms in the present invention can be determined reasonably by those skilled in the art in combination with the specific contents of the technical solution.

Wi-Fi 7 IEEE802.11 be is the next generation Wi-Fi technology, and is currently under draft, and is not really standard. In the draft, wi-Fi plan supports a larger bandwidth (320 Mhz), supports more frequency bands (Wi-Fi 6G), uses more antennas (16 MIMO), and newer modulation techniques (4K QAM). Wi-Fi 7 also emphasizes a technique called Multi-node Coordination, which emphasizes improving and solving the problem of how to maximize optimized spectrum resources when multiple nodes work cooperatively.

The Multi-node Coordination technology in Wi-Fi 7 can be applied to the Mesh network to remarkably improve the throughput of the Mesh network. In the current Mesh network, when a plurality of nodes transmit and receive data at the same time, the plurality of nodes compete with Mesh network resources (such as channels) very strongly, on one hand, a scene that a station waits for a proper node to upload data exists, and on the other hand, the node waits for the proper station to download data exists, and the total throughput of the whole Mesh network is reduced under both conditions.

The current easy Mesh network or other private Mesh protocols focus on specifying the networking flow and networking method. Protocols for how to discover nodes in a network, and for implementing network management (including channel optimization, site roaming procedures, etc.), are all protocols at the application layer. When performance problems of a network are involved, particularly, resource allocation problems when a plurality of nodes simultaneously perform uploading service and downloading service are rarely involved. This can lead to a problem: when uploading and downloading of a plurality of stations are carried out in the Mesh network, the difference of preemptive transmission opportunities of the stations is large due to the different competitive capacities of the stations, so that the transmission of each station is uneven, and the total throughput of the Mesh network is reduced.

Basically if the nodes do not cooperate in advance in transmitting and receiving data, the channel preemption will be in a free contention state, and the end result is the following two: 1) A certain station preempts most of transmission opportunities, so that other stations are in a receiving-transmitting starvation state; 2) If the station competition capability between the networks is the same, the channel competition situation is aggravated, so that the whole network is in an internal consumption state, and the sending transmission performance of all devices is reduced.

There is no standard solution to channel contention prior to Wi-Fi 7, and Multi-node Coordination technology, which is an important feature in Wi-Fi 7, can be to convert the previous channel contention into channel cooperation. Several technical schemes are mentioned in Multi-node Coordination, which are sequentially as follows according to the implementation complexity:

1) Coordinated OFDMA: the cooperating nodes select orthogonal time-frequency units to transmit data packets, so as to reduce the probability of collision of transmission data between the nodes.

2) Coordinated Null Steering (cooperative antenna nulling): multiple antennas may produce gain on the signal. Conversely, multiple antennas may also tend to null signals in a direction (e.g., the direction of stations that are not connected to them). This minimizes signal interference to other stations.

3) Distributed MIMO (Distributed MIMO): and making a decision for the sending and receiving opportunities of all nodes and the STA in the Mesh network by using a unified decision unit. Each reception or transmission is calculated based on the actual environment of the current network. For example, the same station may receive packets from different nodes.

However, from the Wi-Fi 7 ieee802.11 protocol, only a mechanism is defined in the protocol, for example, a decision unit commands a certain node to receive and transmit at a certain timing and a certain rate through a certain management frame, and if the node receives the message, the decision unit returns a certain frame; what frames will be returned if the node refuses. However, how to make a certain decision is not described in the protocol, so how to make a decision to allocate appropriate node resources to the stations and reduce the occurrence of contention phenomenon between the stations so as to effectively improve the throughput of the Mesh network is still to be solved.

Based on the above, the embodiment of the invention provides a network resource allocation method, network equipment and a storage medium, which are beneficial to improving the throughput of a Mesh network.

Referring to fig. 1, fig. 1 is a schematic diagram of logical connection of a Mesh network according to an embodiment of the present invention, including the internet, a home router, a Processing Unit (PU), the Mesh network, and a Station1 (STA 1) and a Station2 (STA 2), where the Mesh network includes a master node (master AP), a child node 1 (child Access Point1, child AP 1), a child node 2 (child Access Point2, child AP 2), and a child node 3 (child Access Point3, child AP 3).

It should be noted that, in one embodiment of the present invention, the master node is connected to all the sub-nodes in a star-like manner, that is, all the sub-nodes must be directly connected to the master node through a medium with high speed and low delay as a backhaul network (such as an optical fiber and millimeter waves), so that each sub-node can provide a physical layer status to the master node in almost real time.

In the present invention, all APs may support D-MIMO protocol, and may support other protocols.

In the present invention, the station may be a terminal, for example: a computer provided with a wireless network card, a smart phone with a WiFi module and the like; the station may also be a fixed signaling base station or the like.

In one embodiment of the present invention, a plurality of user terminals (PC, mobile phone, etc.) are connected to the sub-AP 1, the sub-AP 2, and the sub-AP 3, respectively.

It should be noted that, the resource allocation method of the present invention is applied to the processing unit PU, and the network resource allocation method of the present invention is applied to the above-mentioned logic connection scenario, but is not limited to the above-mentioned logic connection scenario.

In the logical connection scenario described above, it is necessary to include a network service provider (Internet Service Provider, ISP) responsible for providing internet services, which ISP is typically served by the operator. The ISP is connected to the router for entering the home through a home line. The ISP can enter the gateway through the optical modem after being accessed, or can enter the gateway directly through wireless access (4G LTE or 5G). This is followed by access to the home network. A number of Wi-Fi hotspots are also included within the home network to achieve full-house coverage. Wherein the nodes connected with the gateway are called as main nodes of the Mesh network, and the other nodes are called as sub-nodes of the Mesh network.

The processing unit PU of the invention is a distributed MIMO processing unit and is positioned between the Mesh network and the home router. The internet enters the distributed MIMO processing unit through the home gateway router. Information coming from the Internet is processed by the processing unit PU and then is transmitted to a specific node and STA to be received; and the information which is required to be uploaded to the Internet by the Mesh network is also required to be uploaded to the Internet after being converged by the processing unit PU. In actual device connection, the processing unit PU may be deployed on a home gateway router, or may be directly deployed on a master node in the Mesh network. It should be noted that the capacity of the paths connecting to the plurality of nodes on the processing unit PU must be such that it reaches the total capacity that the Mesh network can provide and it is necessary to have very low latency characteristics.

Referring to fig. 2, fig. 2 is a flowchart of a network resource allocation method according to an embodiment of the present invention, which includes but is not limited to the following steps 201 to 205.

Step 201: acquiring a transmission request of a target site;

step 202: acquiring channel state information of a wireless network;

step 203: determining at least one corresponding target node for each target site from a plurality of candidate nodes in the wireless network according to the channel state information;

step 204: and controlling the target site to establish transmission connection with at least one corresponding target node.

In one embodiment, step 201 above: acquiring a transmission request of a target station, including:

step 2011: when simultaneously receiving transmission requests from a plurality of candidate stations, acquiring priority information corresponding to each candidate station;

step 2012: and selecting at least one candidate site meeting the preset priority condition as a target site according to the priority information corresponding to each candidate site.

In one embodiment, at step 204 above: after the control target site establishes transmission connection with at least one corresponding target node, the resource allocation method of the invention further comprises the following steps:

step 205: acquiring transmission completion signals of a target site and at least one corresponding target node;

step 206: and updating the priority information of the target station after the transmission is completed according to a preset optimization criterion.

Illustratively, the optimization criteria are: when a specified station is required to be allocated to more network resources (such as time/frequency/air flow), priority information of the station is optimized, and priority of the station is increased.

In one embodiment, the sites include an upload site, the target site includes a first target site and a second target site, at 2012: according to the priority information corresponding to each candidate site, selecting at least one candidate site meeting the preset priority condition as a target site, wherein the selection can be specifically as follows: according to the priority information corresponding to each uploading site, sequencing the priorities of a plurality of uploading sites; determining a first target site from the sorted uploading sites; and determining uploading sites which can upload data simultaneously with the first target site and are not mutually influenced from other uploading sites except the first target site from the plurality of ordered uploading sites as second target sites.

In one embodiment, step 204 above: the control target site establishes transmission connection with at least one corresponding target node, which specifically may be: and sending a control instruction to the target node, wherein the control instruction is used for controlling the target node to send transmission permission to the corresponding target site.

In one embodiment, step 205, described above: the obtaining a transmission completion signal of the target site and the corresponding at least one target node may specifically be: when an upload packet from a priority transmission station is received, a transmission completion signal is generated.

In one embodiment, in step 203, above: before determining at least one corresponding target node for each target site from a plurality of candidate nodes in the wireless network according to the channel state information, the resource allocation method of the invention further comprises the following steps: receiving a takeover request from a candidate node meeting the filtering condition; and reserving bandwidth resources for the candidate nodes according to the takeover request, wherein the bandwidth resources are used for carrying out information interaction with the candidate nodes.

In one embodiment, the filtering conditions include at least one of: the candidate node supports a preset Wi-Fi protocol version, and a physical link between the candidate node and the PU meets the low-delay requirement.

Specifically, the preset Wi-Fi protocol version may be Wi-Fi 7 or Wi-Fi6.

Illustratively, whether it is of low latency may be tested by an IP ping tool.

In an embodiment, the bandwidth resources include a first bandwidth resource and a second bandwidth resource, where the first bandwidth resource is used to transmit channel state information reported by the candidate node, and the second bandwidth resource is used to transmit a control instruction sent by the PU.

In one embodiment, step 2011 described above: when simultaneously receiving transmission requests from a plurality of candidate stations, the priority information corresponding to each candidate station is acquired, which may specifically be: when receiving transmission requests from a plurality of uploading stations at the same time, judging whether each uploading station sends the transmission request for the first time; if the uploading site sends a transmission request for the first time, acquiring an initial priority, and taking the initial priority as priority information corresponding to the uploading site.

In one embodiment, the site includes a download site, step 2012 above: according to the priority information corresponding to each candidate site, selecting at least one candidate site meeting the preset priority condition as a target site, wherein the selection can be specifically as follows:

establishing a downloading queue according to the priority information corresponding to each downloading site;

and periodically traversing the downloading queue, and selecting at least one downloading site meeting the preset priority condition as a target site of the current period.

In one embodiment, in step 203, above: after determining at least one corresponding target node for each target site from a plurality of candidate nodes in the wireless network according to the channel state information, the resource allocation method of the invention further comprises the following steps:

establishing a comparison table according to each target site and at least one target node corresponding to each target site;

correspondingly, the control target site establishes transmission connection with at least one corresponding target node, and the control target site comprises:

and controlling the target site to establish transmission connection with at least one corresponding target node according to the comparison table.

In one embodiment, the download queue caches the download packets addressed to the plurality of download sites, step 205 above: the obtaining a transmission completion signal of the target site and the corresponding at least one target node may specifically be: and generating a transmission completion signal after the download data packet is sent to the corresponding download site through at least one target node.

The following describes the implementation of the network resource allocation method according to the present invention in a specific embodiment, where the implementation includes an upload scenario and a download scenario.

1. Wi-Fi Mesh node joining process:

when the Wi-Fi Mesh network is initialized, only one Main node AP is called AP-Main. The AP-Main is connected to a processing unit PU. The PU is a logic entity (the PU is a code, can independently run in a device (such as a home gateway) or can directly run on an AP-Main device, the connection between the PU and the AP-Main needs to ensure high bandwidth and low delay (such as connection through optical fibers or millimeter waves) so that the PU can acquire the real-time channel state information of the AP-Main.

For a child node 1 ready to join a Wi-Fi Mesh network, the child node 1 may be a device supporting Wi-Fi 7D-MIMO, or may be a device supporting only the old protocol such as Wi-Fi6. In the handshake protocol interaction after the sub-node 1 establishes a connection (wired or wireless) with the AP-Main, the AP-Main knows the protocol version supported by the sub-node 1. If child node 1 does not support Wi-Fi 7, then the node joining process ends.

If the AP-1 can support Wi-Fi 7D-MIMO, it is also necessary to evaluate whether the physical link between the child node 1 and the PU meets the requirement of D-MIMO on real-time (the channel state information belongs to information with small data size but strong real-time). The physical link between the two is preferably a less disturbed connection of wire/fibre/millimetre wave. Illustratively, the evaluation method may be to test whether it belongs to low latency by an IP ping tool. If the test fails to meet the low latency requirement, the node joining process ends as such.

If the low-delay requirement is met between the child node 1 and the PU, the child node 1 needs to give up own receiving and transmitting decision rights and gives the receiving and transmitting decision rights to the PU to take over. The child node 1 should send out a take-over request to the PU, and the PU reserves a part of link resources for implementing information interaction after receiving the take-over request. Specifically, two sections of independent bandwidth resources are reserved on the link for transmission: the child node 1 reports the channel state information to the PU and the PU sends out a control command to the child node 1.

2. PU resource allocation process:

the processing unit PU caches the downloaded data of all stations from the Wi-Fi Mesh network, and all the uploaded data sent by the stations to the Wi-Fi Mesh network must enter the PU for aggregation post-processing. Links of the PU to each AP have a large capacity (capacity of supporting frequency bands of all APs completely covered), and low latency (acquisition of channel state information in real time).

In Wi-Fi 7, three frequency bands of 2.4G,5G and 6G can be supported simultaneously. The 2.4G band is ISM band with very little channel capacity. However, the channel capacity is quite considerable in both 5g and 6 g. Wi-Fi works in a single frequency band half duplex, i.e. transmission and reception are not performed simultaneously. But due to the introduction of the 6G frequency band, the AP and the STA supporting Wi-Fi 7 can be connected on 5G and 6G simultaneously, and then the 5G can be manually configured as an uploading channel and the 6G as a downloading channel. Full duplex operation of uploading and downloading is realized. The uploading and downloading channels of the PUs with different configurations are in different frequency bands (the uploading channel 5G and the downloading channel are 6G). Since the uploading and downloading are transmitted separately in different frequency bands, the following description is divided into two embodiments.

(1) Uploading a scene

Because the uploading timing of the STAs of the stations is random (if the timing of uploading data to the internet by using the mobile phone is determined by people's intention), each STA will Send out an RTS (request to Send) request to the AP to which it is connected at any time to indicate that the AP wants to upload information, wherein the STA selects whether to Send out an RTS to the AP by detecting whether the channel state between itself and the AP is idle, and the RTS request reaches the PU almost in real time at the moment the AP receives the RTS request, so the PU starts to process the uploading channel resource allocation of the whole Mesh network every time one RTS is received, which comprises the following specific steps:

1. when the PU receives the RTS request from the STA, it first determines whether the STA first sends the RTS request: if the STA sends out an RTS request for the first time, setting a count value 0 (representing an initial priority) for the STA, and taking the count value 0 as priority information corresponding to the STA; if the STA does not send out the RTS request for the first time, indicating that the STA already has a count value indicating priority, the count value of the STA is directly obtained. Similarly, when the PU receives RTS requests from multiple STAs at the same time, the PU may obtain count values corresponding to the multiple STAs that send out RTS requests at the same time.

2. When the PU receives RTS requests of multiple STAs at the same time, the PU ranks the multiple STAs according to the count values of the multiple STAs, and in this embodiment, after the ranking is finished, the PU preferentially selects the STA with the smallest count value to allocate subsequent AP resources and receive the upload data packet, and in addition, the PU may select a plurality of other STAs from the multiple STAs that can be uploaded simultaneously with the STA with the smallest count value. After the PU receives the upload data packet from the STA, the PU will accumulate n counts for the count values of the STA that received its upload data packet according to different optimization criteria.

Illustratively, the PU receives RTS requests from 5 STAs simultaneously, the PU obtains count values of the 5 STAs, and orders the five STAs { STA1, STA2, STA3, STA4, STA5} from small to large in count value. Since the count value of STA1 is the smallest, the PU first chooses to allocate AP resources for STA1 to first receive the upload packet from STA 1; then the PU checks whether STA2 can upload data packets simultaneously with STA1 and do not affect each other, and so on, the PU checks the remaining 4 STAs in turn. For example: the PU checks once to find that { STA1, STA4, STA5} can upload data packets simultaneously and do not affect each other, and the PU can allocate APs for { STA1, STA4, STA5} simultaneously for uploading data packets simultaneously.

Illustratively: after receiving the uploading data packet from the STA, each STA increases 5 counts under the completely fair rule; however, if the designated STA is required to acquire more uploading time, the designated STA is increased by 2 counts each time, so that more uploading opportunities can be acquired for each designated STA.

Taking the uploading scenario of STA1 as an example, referring to fig. 3, the entire uploading process is described as follows: STA1 is connected with AP1, STA1 wants to upload data, STA1 detects that the current channel state between STA1 and AP1 is idle, STA1 will first send an RTS request to AP1 to request AP1 to receive the upload data packet, at the moment that AP1 receives the RTS request, the RTS request reaches PU almost in real time, at this moment, the PU will determine whether to allow AP1 to start accessing the upload data packet of STA1 according to the channel state information reported by other APs and STAs in the whole network (or PU considers that it is more suitable to communicate with STA1 by another AP 2). The control instruction of the PU is then also issued within a specified time, and the AP1 decides whether to issue a CTS to the STA1 according to the control instruction of the PU. If the control instruction indicates that the AP1 allows to receive the upload data packet from the STA1, the AP1 sends a CTS to the STA1, the STA1 starts to send the upload data packet after receiving the CTS, the AP1 receives the upload data packet at the physical layer, and almost simultaneously, the upload data packet also reaches the PU unit, after receiving the data packet, the PU accumulates n counts for the count value of the STA1, and then the PU decides the forwarding of the upload data packet.

The time of sending the RTS request by the PU receives STA4, the time of sending the RTS request by STA5 is consistent with STA1, taking the case that the PU considers that STA4 and AP4 are more suitable for communication between STA5 and AP5, the time of the control command of the PU reaching AP4 and AP5 is consistent with the time of reaching AP1, AP4 sends CTS to STA4, STA4 starts to send the upload data packet after receiving CTS, AP4 receives the upload data packet at the physical layer, almost at the same time, the upload data packet also reaches the PU unit, PU accumulates n counts for the count value of STA4 after receiving the data packet, similarly, AP5 sends CTS to STA5, STA5 starts to send the upload data packet after receiving CTS, AP5 receives the upload data packet at the physical layer, almost at the same time, the upload data packet also reaches the PU unit, and PU accumulates n counts for the count value of STA5 after receiving the data packet. When the RTS requests from 5 STAs are received at the same time next time, the sequence of the five STAs may be { STA2, STA3, STA1, STA4, STA5}, so as to repeatedly determine the resource allocation sequence.

(2) Download scene

After receiving the downloading requests of the STA1, the STA2, the STA3, the STA4 and the STA5, the PU establishes a downloading queue according to the arrival time of the requests, wherein the priority of the downloading queue is related to the arrival time of the requests, and the downloading data packets of the STA1, the STA2, the STA3, the STA4 and the STA5 are cached in the downloading queue. Taking the following steps as an example:

1. the download queues established are { STA1, STA2, STA3, STA4, STA5}.

2. And periodically traversing the downloading queue, on the premise of the maximum transmission rate which can be achieved by each STA, matching a proper AP for each STA according to the current channel state information, for example, the connection of the STA1 to the AP1 can reach 300Mbps, and the connection to the AP2 can reach 400Mbps, and determining the AP2 to be the proper AP of the STA 1. After the traversal of the period is finished, a comparison table is output, wherein the table contains each STA and at least one corresponding AP.

3. The STA is controlled to establish a transmission connection with at least one corresponding AP according to the lookup table, and illustratively, one STA may connect to two different APs while receiving download data packets from the two APs.

4. The PU will send data specifying the STA queue to the STA each time an traversal process ends. The PU periodically finds the current best connection mode. And emptying the downloading data packets in the downloading queue to the maximum capacity.

Referring to fig. 4, fig. 4 is a schematic structural diagram of a network device according to an embodiment of the present invention. The network device 400 includes: memory 401, processor 402, and a computer program stored on memory 401 and executable on processor 402, the computer program being operative to perform the method as described above.

The processor 402 and the memory 401 may be connected by a bus or other means.

Memory 401 acts as a non-transitory computer readable storage medium that may be used to store non-transitory software programs, as well as non-transitory computer executable programs, such as the methods described in embodiments of the present invention. The processor 402 implements the method described above by running non-transitory software programs and instructions stored in the memory 401.

Memory 401 may include a storage program area that may store an operating system, at least one application program required for functions, and a storage data area; the storage data area may store data for performing the methods described above. In addition, memory 401 may include high-speed random access memory, and may also include non-transitory memory, such as at least one storage device memory device, flash memory device, or other non-transitory solid state memory device. In some implementations, the memory 401 may optionally include memory remotely located with respect to the processor 402, which may be connected to the network device 400 via a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.

The non-transitory software programs and instructions required to implement the methods described above are stored in the memory 401 and when executed by the one or more processors 402, perform the methods described above.

The embodiment of the invention also provides a computer readable storage medium which stores computer executable instructions for executing the method.

In one embodiment, the computer-readable storage medium stores computer-executable instructions that are executed by one or more control processors to implement the methods described above.

The above described apparatus embodiments are merely illustrative, wherein the units illustrated as separate components may or may not be physically separate, i.e. may be located in one place, or may be distributed over a plurality of network elements. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of this embodiment.

Those of ordinary skill in the art will appreciate that all or some of the steps, systems, and methods disclosed above may be implemented as software, firmware, hardware, and suitable combinations thereof. Some or all of the physical components may be implemented as software executed by a processor, such as a central processing unit, digital signal processor, or microprocessor, or as hardware, or as an integrated circuit, such as an application specific integrated circuit. Such software may be distributed on computer readable media, which may include computer storage media (or non-transitory media) and communication media (or transitory media). The term computer storage media includes both volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data, as known to those skilled in the art. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital Versatile Disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, storage device storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can be accessed by a computer. Furthermore, as is well known to those of ordinary skill in the art, communication media typically include computer readable instructions, data structures, program modules, or other data in a modulated data signal, such as a carrier wave or other transport mechanism, and may include any information delivery media.

It should also be appreciated that the various embodiments provided by the embodiments of the present invention may be arbitrarily combined to achieve different technical effects.

While the preferred embodiment of the present invention has been described in detail, the present invention is not limited to the above embodiment, and various equivalent modifications and substitutions can be made by those skilled in the art without departing from the spirit of the present invention, and these equivalent modifications and substitutions are intended to be included in the scope of the present invention as defined in the appended claims.

Claims

1. A method of network resource allocation, applied to a processing unit PU, the method comprising:

acquiring a transmission request of a target site;

acquiring channel state information of a wireless network;

determining at least one corresponding target node for the target station from a plurality of candidate nodes in the wireless network according to the channel state information;

2. The method of claim 1, wherein the obtaining the transmission request of the target station comprises:

when simultaneously receiving transmission requests from a plurality of candidate stations, acquiring priority information corresponding to each candidate station;

and selecting at least one candidate site meeting preset priority conditions as a target site according to the priority information corresponding to each candidate site.

3. The method of claim 2, wherein after controlling the destination station to establish a transmission connection with the corresponding at least one destination node, the method further comprises:

acquiring transmission completion signals of the target site and the at least one corresponding target node;

and updating the priority information of the target station after the transmission is completed according to a preset optimization criterion.

4. A method according to claim 3, wherein the target station includes an uploading station, the target station includes a first target station and a second target station, and the selecting, as the target station, at least one candidate station that meets a preset priority condition according to priority information corresponding to each candidate station includes:

according to the priority information corresponding to each uploading site, sequencing the priorities of a plurality of uploading sites;

determining the first target site from the sorted uploading sites;

and determining uploading sites which can upload data simultaneously with the first target site and do not affect each other from other uploading sites except the first target site from the plurality of ordered uploading sites as the second target site.

5. The method of claim 4, wherein said controlling the destination station to establish a transmission connection with the corresponding at least one destination node comprises:

and sending a control instruction to the target node, wherein the control instruction is used for controlling the target node to send transmission permission to the corresponding target site.

6. The method of claim 4, wherein said obtaining a transmission complete signal for the target station and the corresponding at least one target node comprises:

and generating a transmission completion signal when receiving the uploading data packet from the target station.

7. The method of claim 4, wherein prior to said determining a corresponding at least one target node for each of said target sites from among a plurality of candidate nodes in said wireless network based on said channel state information, said method further comprises:

receiving a takeover request from a candidate node meeting the filtering condition;

and reserving bandwidth resources for the candidate nodes according to the takeover request, wherein the bandwidth resources are used for carrying out information interaction with the candidate nodes.

8. The method of claim 7, wherein the filtering conditions include at least one of: the candidate node supports a preset Wi-Fi protocol version, and a physical link between the candidate node and the PU meets the low-delay requirement.

9. The method of claim 7, wherein the bandwidth resources comprise a first bandwidth resource and a second bandwidth resource, the first bandwidth resource being used for transmitting channel state information reported by the candidate node, and the second bandwidth resource being used for transmitting control instructions sent by the PU.

10. The method of claim 4, wherein the obtaining priority information corresponding to each candidate station when the transmission requests from the plurality of candidate stations are received simultaneously comprises:

when simultaneously receiving transmission requests from a plurality of uploading stations, judging whether each uploading station sends the transmission requests for the first time;

and if the uploading station sends the transmission request for the first time, acquiring an initial priority, and taking the initial priority as priority information corresponding to the uploading station.

11. A method according to claim 3, wherein the stations include downloading stations, and the selecting at least one candidate station satisfying a preset priority condition as a target station according to the priority information corresponding to each candidate station includes:

12. The method of claim 11, wherein after said determining a corresponding at least one target node for each of said target sites from among a number of candidate nodes in said wireless network based on said channel state information, said method further comprises:

correspondingly, the controlling the destination station to establish a transmission connection with the at least one destination node includes:

and controlling the target site to establish transmission connection with the at least one corresponding target node according to the comparison table.

13. The method of claim 11, wherein the downloading queue has cached therein downloading packets addressed to a plurality of the downloading sites, and the obtaining a transmission completion signal for the destination site and the corresponding at least one destination node comprises:

and generating a transmission completion signal after the download data packet is sent to the corresponding download site through at least one target node.

14. A network device comprising a memory and a processor, the memory storing a computer program, characterized in that the processor implements the method of any one of claims 1 to 13 when executing the computer program.

15. A computer readable storage medium storing a program, characterized in that the program when executed by a processor implements the method of any one of claims 1 to 13.