WO2024016856A1 - Procédé d'attribution de ressources de réseau, dispositif de réseau et support de stockage - Google Patents

Procédé d'attribution de ressources de réseau, dispositif de réseau et support de stockage Download PDF

Info

Publication number
WO2024016856A1
WO2024016856A1 PCT/CN2023/097878 CN2023097878W WO2024016856A1 WO 2024016856 A1 WO2024016856 A1 WO 2024016856A1 CN 2023097878 W CN2023097878 W CN 2023097878W WO 2024016856 A1 WO2024016856 A1 WO 2024016856A1
Authority
WO
WIPO (PCT)
Prior art keywords
site
target
node
candidate
target site
Prior art date
Application number
PCT/CN2023/097878
Other languages
English (en)
Chinese (zh)
Inventor
张学谦
Original Assignee
中兴通讯股份有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Publication of WO2024016856A1 publication Critical patent/WO2024016856A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/02—Resource partitioning among network components, e.g. reuse partitioning
    • H04W16/10—Dynamic resource partitioning
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/12—Wireless traffic scheduling
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/12—Wireless traffic scheduling
    • H04W72/1263—Mapping of traffic onto schedule, e.g. scheduled allocation or multiplexing of flows

Definitions

  • the present application relates to the field of wireless network technology, and in particular, to a network resource allocation method, network equipment and storage media.
  • Wi-Fi Mesh network (wireless mesh network) is a broadband network that can be used to access the Internet. It has the characteristics of high capacity and high speed.
  • the Mesh network contains multiple nodes (Access Point, AP), and the station (Station, STA) establishes a connection with the Internet through the nodes, and then interacts with the Internet for information.
  • AP Access Point
  • STA station
  • Embodiments of the present application provide a network resource allocation method, network equipment, and storage media.
  • embodiments of the present application provide a network resource allocation method, which is applied to the processing unit PU.
  • the method includes: obtaining the transmission request of the target site; obtaining the channel status information of the wireless network; and obtaining the transmission request from the wireless network according to the channel status information.
  • at least one corresponding target node is determined for each target station; and the target station is controlled to establish a transmission connection with the corresponding at least one target node.
  • embodiments of the present application also provide a network device, including a memory and a processor.
  • the memory stores a computer program.
  • the processor executes the computer program, it implements the method described in the first aspect.
  • embodiments of the present application also provide a computer-readable storage medium, the storage medium stores a program, and when the program is executed by a processor, the method described in the first aspect is implemented.
  • Figure 1 is a schematic diagram of the logical connection scenario of the Mesh network provided by the embodiment of the present application.
  • Figure 2 is a flow chart of a network resource allocation method provided by an embodiment of the present application.
  • FIG. 3 is a sequence diagram of the STA1 upload scenario provided by the embodiment of the present application.
  • Figure 4 is a schematic structural diagram of a network device provided by an embodiment of the present application.
  • orientation descriptions such as “up”, “down”, etc. indicate the orientation or positional relationship based on the orientation or positional relationship shown in the drawings, and are only for the convenience of describing this application.
  • the application and simplified description are not intended to indicate or imply that the device or element referred to must have a specific orientation, be constructed and operate in a specific orientation, and therefore should not be construed as a limitation on the present application.
  • Wi-Fi 7 IEEE802.11be is the next generation Wi-Fi technology. It is currently in the draft stage and has not yet formed a real standard. In the draft, Wi-Fi plans to support larger bandwidth (320Mhz), support more frequency bands (Wi-Fi 6G), use more antennas (16MIMO), and newer modulation technology (4K QAM). Wi-Fi 7 also focuses on adding a technology called Multi-node Coordination, focusing on improving and solving the problem of how to maximize the optimization of spectrum resources when multiple nodes work together.
  • the Multi-node Coordination technology in Wi-Fi 7 can be applied to Mesh networks to significantly improve the throughput of Mesh networks.
  • Mesh network resources such as channels.
  • sites are waiting for the right node to upload data.
  • nodes are waiting for the right node. sites to download data, both cases cause the overall throughput of the entire Mesh network to decrease.
  • the current EasyMesh network or other private Mesh protocols focus on stipulating the networking process and networking methods.
  • the protocols on how to discover nodes in the network and implement network management are all application layer protocols.
  • channel preemption will be in a state of free competition.
  • the final results are the following two: 1) A certain station seizes most of the sending opportunities. This causes other stations to be in a state of "starvation" for sending and receiving; 2) If the competitiveness of stations between networks is the same, channel competition will be intensified and the entire network will be in a state of internal consumption, which will lead to a decline in the sending and transmission performance of all devices.
  • Multi- Node coordination technology can transform the previous channel competition into channel cooperation.
  • Distributed MIMO Use a unified decision-making unit to make decisions on the sending and receiving timing of all nodes and STAs in the Mesh network. Each reception or transmission is calculated based on the actual environment of the current network. For example, the same site may receive packets from different nodes.
  • the protocol only defines the mechanism. For example, the decision-making unit commands a node to receive and send at what time and at what rate through a certain management frame. If the node If it is received, what kind of frame will be returned; if the node rejects, what kind of frame will be returned.
  • the protocol only defines the mechanism. For example, the decision-making unit commands a node to receive and send at what time and at what rate through a certain management frame. If the node If it is received, what kind of frame will be returned; if the node rejects, what kind of frame will be returned.
  • how to make a certain decision is not explained in the protocol. Therefore, how to make a decision to allocate appropriate node resources to the site, reduce the occurrence of competition between sites, and effectively improve the throughput of the Mesh network remains to be seen. solve.
  • embodiments of the present application provide a network resource allocation method, network equipment, and storage media, which help improve the throughput of the Mesh network.
  • FIG. 1 is a schematic diagram of the logical connection of the Mesh network provided by the embodiment of the present application, including the Internet, a home router, a processing unit (Process Unit, PU), a Mesh network, and site 1 (Station1, STA1) and site 2 ( Station2, STA2), where the Mesh network includes the main node (main Access Point, main AP), sub-node 1 (sub-Access Point1, sub-AP1), sub-node 2 (sub-Access Point2, sub-AP2), sub-node 3 (sub- Access Point3, sub-AP3).
  • main Access Point main AP
  • sub-node 1 sub-Access Point1, sub-AP1
  • sub-node 2 sub-Access Point2, sub-AP2
  • sub-node 3 sub- Access Point3, sub-AP3
  • the master node is connected to all sub-nodes in a star shape, that is, all sub-nodes must be directly connected to the backhaul network (such as optical fiber and millimeter wave) through high-speed and low-latency media.
  • the backhaul network such as optical fiber and millimeter wave
  • each child node can provide almost real-time physical layer status to the master node.
  • all APs can support the D-MIMO protocol or other protocols.
  • the site can be a terminal, such as a computer equipped with a wireless network card, a smartphone with a WiFi module, etc.; the site can also be a fixed signal transmission base station, etc.
  • sub-AP1, sub-AP2, and sub-AP3 are connected to sub-AP1, sub-AP2, and sub-AP3 respectively.
  • the resource allocation method of this application is applied to the processing unit PU, and the network resource allocation method of this application is applied to the above logical connection scenario, but is not limited to the above logical connection scenario.
  • an Internet Service Provider needs to be included to provide Internet services.
  • the ISP is generally acted by an operator.
  • the ISP connects to the router through the home line to log in to the home. After ISP access, you can enter the gateway through an optical modem, or directly enter the gateway through wireless access (4G LTE or 5G). After that, you enter the home network.
  • the home network also includes several Wi-Fi hotspots to achieve whole-house coverage.
  • the node connected to the gateway is called the main node of the Mesh network, and the other nodes are called the child nodes of the Mesh network.
  • the processing unit PU of this application is a distributed MIMO processing unit located between the Mesh network and the home router.
  • the Internet enters the distributed MIMO processing unit through the home gateway router.
  • Information arriving from the Internet must first pass through the processing unit After processing by the PU, it is then handed over to certain nodes and STA for reception; and the information that needs to be uploaded to the Internet from within the Mesh network also needs to be aggregated by the processing unit PU and then uploaded to the Internet.
  • the processing unit PU can be deployed on the home gateway router or directly on the main node in the Mesh network.
  • the capacity of the paths connected to multiple nodes on the processing unit PU must reach the total capacity provided by the Mesh network, and must have extremely low latency.
  • Figure 2 is a flow chart of a network resource allocation method provided by an embodiment of the present application. The method includes but is not limited to the following steps 201 to 205.
  • Step 201 Obtain the transmission request of the target site
  • Step 202 Obtain the channel status information of the wireless network
  • Step 203 Determine at least one corresponding target node for each target site from several candidate nodes in the wireless network according to the channel state information;
  • Step 204 Control the target site to establish a transmission connection with at least one corresponding target node.
  • the above step 201: Obtaining the transmission request of the target site includes:
  • Step 2011 When receiving transmission requests from several candidate sites at the same time, obtain the priority information corresponding to each candidate site;
  • Step 2012 According to the priority information corresponding to each candidate site, select at least one candidate site that meets the preset priority conditions as the target site.
  • the resource allocation method of the present application also includes:
  • Step 205 Obtain the transmission completion signal of the target site and at least one corresponding target node
  • Step 206 Update the priority information of the target site after the transmission is completed according to the preset optimization criteria.
  • the optimization standard is: when a specified site is required to be allocated more network resources (such as time/frequency/empty flow), the priority information of the site is optimized and the priority of the site is increased.
  • the site includes an upload site
  • the target site includes a first target site and a second target site.
  • a candidate site as a target site can be: prioritize several upload sites according to the priority information corresponding to each upload site; determine the first target site from the sorted several upload sites; Among the upload sites other than the first target site among the sorted upload sites, an upload site that can upload data at the same time as the first target site without affecting each other is determined as the second target site.
  • controlling the target site to establish a transmission connection with at least one corresponding target node may be: sending a control instruction to the target node, and the control instruction is used to control the target node to issue a transmission permission to the corresponding target site.
  • the above step 205: Obtaining the transmission completion signal of the target site and the corresponding at least one target node may be: generating the transmission completion signal when receiving an upload data packet from the priority sending site.
  • the resource allocation method of the present application also includes: Receive takeover requests from candidate nodes that meet the filtering conditions; reserve bandwidth resources for the candidate nodes based on the takeover requests, and the bandwidth resources are used for information interaction with the candidate nodes.
  • the filtering conditions include at least one of the following: the candidate node supports a preset Wi-Fi protocol version, Or the physical link between the candidate node and the PU meets low latency requirements.
  • the default Wi-Fi protocol version may be Wi-Fi 7 or Wi-Fi 6.
  • the IP ping tool can be used to test whether the latency is low.
  • the above-mentioned bandwidth resources include a first bandwidth resource and a second bandwidth resource.
  • 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 control instructions sent by the PU.
  • the above step 2011: when receiving transmission requests from several candidate sites at the same time, obtaining the priority information corresponding to each candidate site may be: when receiving transmission requests from several upload sites at the same time When a transmission request is issued, determine whether each upload site issues a transmission request for the first time; if the upload site issues a transmission request for the first time, obtain the initial priority, and use the initial priority as the priority information corresponding to the upload site.
  • the site includes a download site.
  • the above step 2012 select at least one candidate site that meets the preset priority conditions as the target site according to the priority information corresponding to each candidate site, which may be:
  • the download queue is traversed periodically, and at least one download site that meets the preset priority conditions is selected as the target site of the current cycle.
  • the resource allocation method of the present application also includes:
  • controlling the target site to establish a transmission connection with at least one corresponding target node includes:
  • download data packets sent to several download sites are cached in the download queue.
  • the above step 205: Obtaining the transmission completion signal of the target site and at least one corresponding target node may be: when the download data packet is passed through After at least one target node is sent to the corresponding download site, a transmission completion signal is generated.
  • This embodiment uses an embodiment to describe the execution process of the network resource allocation method of the present application.
  • This embodiment includes an upload scenario and a download scenario.
  • Wi-Fi Mesh node joining process
  • AP-Main When the Wi-Fi Mesh network is initialized, there is only one master node AP, called AP-Main.
  • AP-Main is connected to a processing unit PU.
  • PU is a logical entity (its essence is a piece of code) that can run alone in a device (such as a home gateway) or directly on the AP-Main device.
  • the connection between PU and AP-Main must ensure high bandwidth With low latency (such as connecting through optical fiber or millimeter wave), so that the PU can obtain the real-time channel status information of AP-Main.
  • the PU is located between AP-Main and the Internet, so the uplink and downlink data between the Internet and the site It needs to be processed by PU.
  • the child node 1 For a child node 1 that is ready to join the Wi-Fi Mesh network, the child node 1 can be a device that supports Wi-Fi 7 D-MIMO, or it can be a device that only supports old protocols such as Wi-Fi 6. During the handshake protocol interaction after child node 1 establishes a connection (wired or wireless) with AP-Main, AP-Main will know the protocol version supported by child node 1. If child node 1 does not support Wi-Fi 7, the node joining process ends.
  • the evaluation method may be to use an IP ping tool to test whether the latency is low. If the test cannot meet the low latency requirements, the node This completes the joining process.
  • Child node 1 needs to transfer its decision-making power of sending and receiving and hand it over to the PU. Child node 1 should send a takeover request to the PU. After receiving the request, the PU reserves a part of the link resources for subsequent information exchange between the two. In some embodiments, two independent bandwidth resources are reserved on the link for transmission: the channel status information reported by the sub-node 1 to the PU and the control command issued by the PU to the sub-node 1.
  • the processing unit PU will cache the download data of all sites from the Wi-Fi Mesh network. At the same time, the upload data sent by the site to the Wi-Fi Mesh network must also enter the PU for aggregation and post-processing.
  • the link connecting the PU to each AP has the characteristics of large capacity (completely covering the capacity of all APs' supported frequency bands) and low latency (acquiring channel status information in real time).
  • Wi-Fi 7 it can support three frequency bands: 2.4G, 5G and 6G at the same time.
  • the 2.4G frequency band is an ISM frequency band with very small channel capacity.
  • 5G and 6G the channel capacity is very considerable.
  • Wi-Fi works on a single frequency band in half-duplex mode, that is, sending and receiving do not occur at the same time.
  • APs and STAs that support Wi-Fi 7 can be connected to 5G and 6G at the same time.
  • 5G can be manually configured as the upload channel and 6G as the download channel. Achieve full-duplex operation of upload and download.
  • the upload and download channels of PUs with different configurations are in different frequency bands (for example, the upload channel is 5G and the download channel is 6G). Since uploading and downloading are transmitted separately in different frequency bands, the following description is divided into two embodiments.
  • each STA will send an RTS (Requst to Send, transmission) to the AP it is connected to at any time. request) request to indicate that the AP wants to upload information.
  • RTS Requst to Send, transmission
  • the STA chooses whether to send an RTS to the AP by detecting whether the channel status between itself and the AP is idle. The moment the AP receives the RTS request, the RTS request arrives almost in real time. PU, so PU starts to process the upload channel resource allocation of the entire Mesh network whenever it receives an RTS. The steps are as follows:
  • the PU When the PU receives an RTS request from an STA, it first determines whether the STA is issuing an RTS request for the first time: If the STA is issuing an RTS request for the first time, set a count value 0 (indicating the initial priority) for the STA and count The value 0 is used as the priority information corresponding to the STA; if the STA does not issue an RTS request for the first time, it means that the STA already has a count value indicating the priority, and the count value of the STA is obtained directly. Similarly, when the PU receives RTS requests from multiple STAs at the same time, the PU can obtain the count values corresponding to multiple STAs that issue RTS requests at the same time.
  • the PU When the PU receives RTS requests from multiple STAs at the same time, the PU prioritizes the multiple STAs based on their count values. In this embodiment, after the sorting is completed, the PU gives priority to the one with the smallest count value. The STA allocates subsequent AP resources and receives upload data packets. In addition, the PU can also select several other STAs from multiple STAs that can upload at the same time as 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 value of the STA that has received its upload data packet according to different optimization criteria.
  • the PU receives RTS requests from 5 STAs at the same time, the PU obtains the count values of the 5 STAs, and sorts the five STAs from small to large as ⁇ STA1, STA2, STA3, STA4, STA5 ⁇ . Since STA1 has the smallest count value, PU first chooses to allocate AP resources to STA1 to receive the upload data packet from STA1 first; then PU checks whether STA2 can upload data packets at the same time as STA1 without affecting each other, and so on, and PU checks in turn There are 4 STAs remaining.
  • the PU can allocate APs to ⁇ STA1, STA4, STA5 ⁇ at the same time to upload data packets at the same time.
  • each STA will increase the count by 5 each time; but if the specified STA is required to obtain more upload time, Then for the specified STA each time Increase the count by 2 so that a specified STA can get more upload opportunities.
  • STA1 Take the upload scenario of STA1 as an example. Refer to Figure 3 to describe the entire upload process as follows: STA1 is connected to AP1, STA1 wants to upload data, and STA1 detects that the current channel status between STA1 and AP1 is idle, then STA1 will first send an RTS request. to AP1 to request AP1 to receive the upload data packet. At the moment AP1 receives the RTS request, the RTS request arrives at the PU almost in real time. At this time, the PU will decide whether to proceed based on the channel status information reported by other APs and STAs in the entire network. Allow AP1 to start accessing STA1's upload packets (or the PU thinks it is more appropriate for another AP2 to communicate with STA1).
  • the PU control command is also issued within the specified time, and AP1 decides whether to issue CTS to STA1 based on the PU control command. If the control instruction indicates that AP1 is allowed to receive upload data packets from STA1, AP1 sends a CTS to STA1. STA1 starts sending upload data packets after receiving the CTS. AP1 receives the upload data packet at the physical layer. Almost at the same time, the upload data packet also After arriving at the PU unit, after receiving the data packet, the PU accumulates n counts for the count value of STA1, and then the PU determines the destination of the uploaded data packet.
  • the time when the PU receives the RTS request from STA4 and STA5 is consistent with that of STA1. For example, if the PU believes that STA4 and AP4 and STA5 and AP5 communicate more appropriately, the time when the PU's control instructions arrive at AP4 and AP5 is consistent with the time when it reaches AP1.
  • STA4 starts sending upload data packets after receiving the 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. After receiving the data packet, PU is STA4's The count value accumulates n counts.
  • AP5 sends CTS to STA5.
  • STA5 starts sending upload data packets after receiving CTS.
  • AP5 receives the upload data packet at the physical layer. Almost at the same time, the upload data packet also arrives at the PU unit. After receiving the data packet, the PU accumulates n counts for the count value of STA5.
  • the order of the five STAs may become ⁇ STA2, STA3, STA1, STA4, STA5 ⁇ , and the resource allocation sequence will be determined repeatedly.
  • This application can control the order in which multiple STAs upload data packets through the PU. Therefore, it can reduce the occurrence of vicious competition for transmission resources when multiple STAs upload data at the same time.
  • the PU After the PU receives download requests from STA1, STA2, STA3, STA4, and STA5, it establishes a download queue based on the arrival time of the request. Its priority is related to the arrival time of the request. There are STA1, STA2, STA3, STA4, and STA5 cached in the download queue. download data package. Take the following steps as an example:
  • the created download queue is ⁇ STA1, STA2, STA3, STA4, STA5 ⁇ .
  • AP1 may reach 300Mbps, while connected to AP2 If it can reach 400Mbps, then AP2 is determined to be a suitable AP for STA1.
  • a comparison table is output, which contains each STA and at least one corresponding AP.
  • one STA can be connected to two different APs and receive download data packets from the two APs at the same time.
  • the PU Whenever a traversal process ends, the PU will send the data in the specified STA queue to the STA. The PU periodically searches for the best current connection method. Try your best to clear the download packets in the download queue.
  • FIG 4 is a schematic structural diagram of a network device provided by an embodiment of the present application.
  • the network device 400 includes: a memory 401, a processor 402, and a computer program stored on the memory 401 and executable on the processor 402. When the computer program is run, it is used to perform the above method.
  • the processor 402 and the memory 401 may be connected through a bus or other means.
  • the memory 401 can be used to store non-transitory software programs and non-transitory software programs.
  • a stateful computer executable program such as the method described in the embodiment of this application.
  • the processor 402 implements the above method by running non-transitory software programs and instructions stored in the memory 401 .
  • the memory 401 may include a program storage area and a data storage area, where the program storage area may store an operating system and an application program required for at least one function; the storage data area may store the execution of the above method.
  • the memory 401 may include high-speed random access memory and may also include non-transitory memory, such as at least one storage device storage device, a flash memory device, or other non-transitory solid-state storage device.
  • the memory 401 may include memory located remotely relative to the processor 402, and these remote memories may be connected to the network device 400 through a network. Examples of the above-mentioned 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 above method are stored in the memory 401, and when executed by one or more processors 402, the above method is executed.
  • Embodiments of the present application also provide a computer-readable storage medium that stores computer-executable instructions, and the computer-executable instructions are used to execute the above method.
  • the computer-readable storage medium stores computer-executable instructions, and the computer-executable instructions are executed by one or more control processors to implement the above method.
  • the device embodiments described above are only illustrative, and the units described as separate components may or may not be physically separate, that is, they may be located in one place, or they may be distributed to multiple network units. Some or all of the modules can be selected according to actual needs to achieve the purpose of the solution of this embodiment.
  • the embodiments of the present application at least have the following beneficial effects: when the present application receives a transmission request from the target site; according to the channel state information of the wireless network, the corresponding at least one node is determined for the target site from several candidate nodes in the wireless network. A target node; then, control the target site to establish a transmission connection with at least one corresponding target node for information transmission. After receiving the transmission request from the site, this application can determine the target node from multiple candidate nodes competing to connect to the site based on the channel state information of the wireless network. Therefore, this application helps to reduce the vicious competition between multiple nodes and the target. Stations have the opportunity to establish transmission connections, which causes internal consumption of resources in the entire wireless network. Therefore, this application helps to improve the throughput of the entire wireless network.
  • Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, Digital Versatile Disk (DVD) or other optical disk storage, magnetic cassettes, tapes, storage device storage or other magnetic storage devices, or Any other medium that can be used to store the desired information and that can be accessed by a computer.
  • communication media typically includes 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 .

Landscapes

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

Abstract

Des modes de réalisation de la présente invention concernent un procédé d'attribution de ressources de réseau, un dispositif de réseau et un support de stockage. Le procédé comprend : l'acquisition de demandes de transmission provenant de stations cibles (201) ; l'acquisition d'informations d'état de canal d'un réseau sans fil (202) ; selon les informations d'état de canal, la détermination d'au moins un nœud cible correspondant pour chaque station cible parmi une pluralité de nœuds candidats dans le réseau sans fil (203) ; et la commande de chaque station cible pour établir une connexion de transmission avec l'au moins un nœud cible correspondant (204).
PCT/CN2023/097878 2022-07-22 2023-06-01 Procédé d'attribution de ressources de réseau, dispositif de réseau et support de stockage WO2024016856A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202210870834.2 2022-07-22
CN202210870834.2A CN117499930A (zh) 2022-07-22 2022-07-22 一种网络资源分配方法、网络设备和存储介质

Publications (1)

Publication Number Publication Date
WO2024016856A1 true WO2024016856A1 (fr) 2024-01-25

Family

ID=89616933

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2023/097878 WO2024016856A1 (fr) 2022-07-22 2023-06-01 Procédé d'attribution de ressources de réseau, dispositif de réseau et support de stockage

Country Status (2)

Country Link
CN (1) CN117499930A (fr)
WO (1) WO2024016856A1 (fr)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030179731A1 (en) * 2002-03-20 2003-09-25 Nec Corporation Communication method and system
CN114124964A (zh) * 2022-01-24 2022-03-01 阿里云计算有限公司 通信系统、通道调度方法、设备及存储介质
CN114258087A (zh) * 2020-09-11 2022-03-29 华为云计算技术有限公司 连接云站点的方法及装置
CN115665262A (zh) * 2022-09-30 2023-01-31 新华三技术有限公司 一种请求处理方法、装置、电子设备及存储介质

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030179731A1 (en) * 2002-03-20 2003-09-25 Nec Corporation Communication method and system
CN114258087A (zh) * 2020-09-11 2022-03-29 华为云计算技术有限公司 连接云站点的方法及装置
CN114124964A (zh) * 2022-01-24 2022-03-01 阿里云计算有限公司 通信系统、通道调度方法、设备及存储介质
CN115665262A (zh) * 2022-09-30 2023-01-31 新华三技术有限公司 一种请求处理方法、装置、电子设备及存储介质

Also Published As

Publication number Publication date
CN117499930A (zh) 2024-02-02

Similar Documents

Publication Publication Date Title
Yang et al. Survey and perspective on extremely high throughput (EHT) WLAN—IEEE 802.11 be
JP6387132B2 (ja) 同時送受信ネットワークモードのための装置および方法
TW201943303A (zh) 合作車間有效資源使用方法
JP7427170B2 (ja) 時間内及び周波数内ｒｔａパケット重複
WO2019141082A1 (fr) Procédé de communication sans fil et dispositif d'accès sans fil, dispositif de planification de réseau, et dispositif terminal
KR20220008886A (ko) Mu-mimo 패킷 도달 전 채널 경합
US9948541B2 (en) Full duplex services using RTS/CTS
CN114514773A (zh) 多接入点(ap)网络中基于简档的客户端引导
WO2020177218A1 (fr) Procédé de transmission de données de liaison latérale et dispositif terminal
US8184541B2 (en) Method and system for link layer scheduling in a multiple access communication system
KR20220006092A (ko) 패킷 도달 전 채널 경합
US20240137324A1 (en) Uplink transmission method in wireless local area network (wlan) and station device
Bankov et al. On the use of multilink access methods to support real-time applications in Wi-Fi networks
US11197223B2 (en) Method and apparatus for determining transmission path of packet in wireless communication
US20230354377A1 (en) Sidelink communications in wireless network
WO2024016856A1 (fr) Procédé d'attribution de ressources de réseau, dispositif de réseau et support de stockage
JP2023521087A (ja) Ｒｔａパケットのためのｅｄｃａキュー
WO2024021860A1 (fr) Procédé et appareil de transmission de données, support de stockage et produit de programme
CN107959957A (zh) 一种实现lte网络资源定向分配的中继选择方法
WO2022042649A1 (fr) Procédé et dispositif de communication coordonnée de multiples points d'accès, et support de stockage
CN107172713B (zh) 无线资源分配/管理方法/系统、可读存储介质、设备
JP2024511187A (ja) Ｒｔａトラフィックとのｅｄｃａ ｔｘｏｐの共有
WO2021159474A1 (fr) Procédé, appareil et terminal de réservation de ressources
CN115997414A (zh) 无线网状网中的多用户（mu）通信
WO2013174672A1 (fr) Procédé et système pour optimiser une liaison sans fil et l'utiliser pour transmettre de la puissance et réduire des interférences

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 23841923

Country of ref document: EP

Kind code of ref document: A1