+

WO2018184176A1 - Procédé, dispositif et système de planification - Google Patents

Procédé, dispositif et système de planification Download PDF

Info

Publication number
WO2018184176A1
WO2018184176A1 PCT/CN2017/079626 CN2017079626W WO2018184176A1 WO 2018184176 A1 WO2018184176 A1 WO 2018184176A1 CN 2017079626 W CN2017079626 W CN 2017079626W WO 2018184176 A1 WO2018184176 A1 WO 2018184176A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
information
workstations
access
workstation
Prior art date
Application number
PCT/CN2017/079626
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 华为技术有限公司
Priority to PCT/CN2017/079626 priority Critical patent/WO2018184176A1/fr
Priority to CN201780063020.5A priority patent/CN109804693B/zh
Publication of WO2018184176A1 publication Critical patent/WO2018184176A1/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/12—Wireless traffic scheduling

Definitions

  • the embodiments of the present invention relate to the field of communications technologies, and in particular, to a scheduling method, apparatus, and system.
  • the basic network service set (BSS) WiFi network structure is shown in Figure 1, including an access point (AP) and one or more workstations (station, STA), one or more STAs. Access the WiFi network through the AP and use the services provided by the AP.
  • the application scenario of the WiFi network is mostly a distributed coverage scenario of multiple APs.
  • the distributed coverage refers to a WiFi network including multiple APs.
  • the multiple APs have a cascading relationship, and each AP can access one or Multiple STAs.
  • an AP can support multiple virtual APs, and each virtual AP corresponds to a service set identifier (SSID), that is, provides a service.
  • SSID service set identifier
  • each SSID may be supported, and each SSID has multiple STA accesses.
  • the AP can transmit data packets with multiple STAs.
  • the AP has a hardware sending queue. Before the data packet enters the hardware queue, there is a software sending queue.
  • the software sending queue can send a queue based on each access STA management software.
  • the process in which the AP schedules data packets from the STA-based software queue to the hardware transmission queue is called airtime fairness scheduling.
  • the embodiment of the invention provides a scheduling method, device and system, which solves the problem that the scheduling effect of the WiFi network is poor and the user experience is low in the prior art.
  • a scheduling method is provided, which is applied to a WiFi network, where the WiFi network includes a first node, a second node directly cascading with the first node, and the second node is a lower node of the first node, and the method includes
  • the first node acquires information of all the workstations that directly access and indirectly access the first node; the first node uniformly allocates the proportion of the air interface resources of each workstation according to the information of all the workstations that access the first node;
  • the sum of the air interface resource ratios of all the workstations that directly access and indirectly access the second workstation allocates air interface resources to the second node.
  • the first node obtains the information of all the workstations that directly access and indirectly access the first node, so that when the proportion of the air interface resources is allocated, the air interface of each workstation can be uniformly allocated.
  • Source ratio and allocates air interface resources to the second node according to the sum of the proportion of the air interface resources of all the workstations that directly access and indirectly access the second node, thereby ensuring direct access to the workstation of the first node and indirect access first
  • the fairness and rationality of the proportion of air interface resources allocated by the workstations of the nodes thereby improving the scheduling effect and user experience.
  • the first node obtains information about all directly accessing and indirectly accessing the workstation of the first node, including: receiving, by the first node, the second node Information about all workstations that directly access and indirectly access the second node.
  • a method is provided for the first node to obtain information of a workstation indirectly accessing the first node by using the second node, so that the ratio of the air interface resources allocated by the first node to the second node may be ensured. Rationality, which in turn improves scheduling and user experience.
  • a second possible implementation manner of the first aspect information about all workstations that directly access and indirectly access the second node is carried in the first learning packet.
  • the learning message is a packet sent by the second node for performing MAC address learning on the first node.
  • a method for the first node to obtain information of direct access and indirect access to all workstations of the second node is provided, so that the ratio of the air interface resources allocated by the first node to the second node is reasonable. Sex, which improves scheduling and user experience.
  • the first node is a root node or a slave node in the WiFi network.
  • the first node obtains all direct access and indirect access to the first node.
  • the information of the workstation includes: the first node receives information of a workstation directly connected to each node sent by each node in the WiFi network; the first node summarizes information directly connected to each node of the workstation to obtain all direct Information on workstations that access and indirectly access the first node.
  • the first node obtains all direct access and indirect access to the first node.
  • the information of the workstation includes: the first node receives the scheduling indication information sent by the root node, and the scheduling indication information is used to indicate information of all the workstations that directly access and indirectly access the first node; the first node acquires the information according to the scheduling indication information. All information directly accessing and indirectly accessing the workstation of the first node.
  • the first node may obtain, by using the root node, information about all workstations that directly access and indirectly access the first node, thereby ensuring that the first node is allocated to the workstation directly accessing the first node, and the second
  • the rationality of the air interface resource ratio of the node improves the scheduling effect and user experience.
  • the method further includes: the first node directly accesses the first node The information of the workstation is sent to the root node; or the first node sends a second learning message to the upper node of the first node, and the second learning message is the MAC address of the upper node sent by the first node for the first node. Learning message.
  • the first node may send information about the workstation directly accessing the first node to the root node. The point or the second learning message is sent to the upper node of the first node, so that the root node or the upper node of the first node can obtain information of the workstation accessing the first node.
  • the information of the workstation includes a workstation identification. Further, the information of the workstation may further include at least one of the following information: a workstation priority, a service set identifier corresponding to the workstation, and a priority of the service set identifier corresponding to the workstation.
  • a workstation priority a workstation priority
  • a service set identifier corresponding to the workstation a service set identifier corresponding to the workstation.
  • a node which is applied to a WiFi network, where the node is a first node, the WiFi network further includes a second node directly cascading with the first node, and the second node is a lower node of the first node,
  • the first node includes: an obtaining unit, configured to acquire information of all workstations that directly access and indirectly access the first node; and an allocating unit configured to uniformly allocate each workstation according to information of all workstations accessing the first node The proportion of the air interface resource; the allocation unit is further configured to allocate the air interface resource to the second node according to the sum of the proportions of the air interface resources of all the workstations that directly access and indirectly access the second node.
  • the acquiring unit is specifically configured to: receive information about all the direct access and the indirect access to the workstation of the second node that are sent by the second node.
  • the information of all the workstations that directly access and indirectly access the second node are carried in the first learning packet.
  • the first learning packet is a packet sent by the second node for performing MAC address learning on the first node.
  • the first node is a root node or a slave node in the WiFi network.
  • the acquiring unit is specifically configured to: receive, sent by each node in the WiFi network Information directly accessing the workstations of each node; summarizing the information of the workstations directly accessing each node to obtain information of all workstations that directly access and indirectly access the first node.
  • the acquiring unit is specifically configured to: receive the scheduling indication information sent by the root node,
  • the scheduling indication information is used to indicate information of all workstations that directly access and indirectly access the first node; and according to the scheduling indication information, acquire information of all workstations that directly access and indirectly access the first node.
  • the first node further includes: a sending unit, configured to directly access The information of the workstation of the first node is sent to the root node; or the sending unit is configured to send the second learning packet to the upper node of the first node, where the second learning packet is sent by the first node for the first node.
  • the information of the workstation includes a workstation identifier. Further, the information of the workstation may further include at least one of the following information: a workstation priority, a service set identifier corresponding to the workstation, and a priority of the service set identifier corresponding to the workstation.
  • a node comprising a memory, a processor, a bus, and a communication interface, storing Storing code and data, the processor and the memory are connected by a bus, and the code in the processor running the memory causes the node to perform any one of the possible implementations of the first aspect to the seventh possible implementation of the first aspect
  • the scheduling method provided.
  • a system comprising a first node, and a second node directly cascading with the first node, the second node being a lower node of the first node; wherein the first node is the second aspect A node provided by any one of the seventh possible implementations of the second aspect, or a node provided by the third aspect above.
  • Yet another aspect of the present application provides a computer readable storage medium having instructions stored therein that, when executed on a computer, cause the computer to perform the methods described in the above aspects.
  • Yet another aspect of the present application provides a computer program product comprising instructions which, when run on a computer, cause the computer to perform the methods described in the various aspects above.
  • FIG. 1 is a schematic structural diagram of a WiFi network of a basic BSS according to an embodiment of the present invention
  • FIG. 2 is a schematic diagram of AP scheduling in a WiFi network according to an embodiment of the present invention
  • FIG. 3 is a schematic structural diagram of a WiFi network according to an embodiment of the present disclosure.
  • FIG. 4 is a schematic structural diagram of an access point device according to an embodiment of the present disclosure.
  • FIG. 5 is a flowchart of a scheduling method according to an embodiment of the present invention.
  • FIG. 6 is a schematic diagram of a workstation of an access node according to an embodiment of the present disclosure.
  • FIG. 7 is a schematic structural diagram of another WiFi network according to an embodiment of the present disclosure.
  • FIG. 8 is a schematic structural diagram of a first node according to an embodiment of the present disclosure.
  • FIG. 9 is a schematic structural diagram of another first node according to an embodiment of the present invention.
  • An access point refers to a wireless access point, also called a wireless AP, which is an access point of a wireless network and is also the core of a wireless network.
  • the main functions of the AP are as follows: management of mobile stations in the cell, including processing of connection and authentication of the mobile station; completion of bridging of data frames from the wired network to the BSS, and address filtering And the learning function of the address; complete the handover management of the mobile station between different BSS; simple network management functions.
  • the AP can be used as a wireless network extension to connect with other APs to expand the coverage of the wireless network.
  • Wireless APs are mainly used in broadband homes, inside buildings, and inside campuses.
  • the distance can range from tens of meters to hundreds of meters.
  • the access point device may be a wireless router, and the wireless router mainly has a routing switching access integrated device and a pure access point device, and the integrated device performs access and routing work, and the pure access device is only responsible for wireless client access.
  • an AP may be referred to as a node, and may be divided into a root node and a slave node.
  • the root node refers to the primary AP in the distributed coverage WiFi network.
  • the primary AP can be cascaded with one or more APs, but the primary AP does not have a cascaded AP.
  • a slave node refers to a slave AP in a distributed overlay WiFi network,
  • the slave AP refers to any AP other than the primary AP in the distributed coverage WiFi network.
  • the cascading level of the AP included in the distributed coverage WiFi network may be defined.
  • the cascading level of the primary AP may be defined as the first level, and the secondary AP directly cascading with the primary AP
  • the cascading level is defined as the second level, which is defined as the third level from the AP that is directly cascaded from the AP at the second level, and so on.
  • a station also referred to as a mobile station, refers to a device that carries a wireless network interface card (such as a wireless network card).
  • the terminal device connected to the AP that is, the wireless client accessing the AP.
  • the service set identifier (SSID) technology can divide a wireless local area network into several sub-networks that require different authentication. Each sub-network needs independent authentication, and only authenticated users can enter the corresponding A subnet prevents unauthorized users from entering the network. If the SSID is not broadcast for security reasons, the user must manually set the SSID to enter the corresponding subnet. Simply put, the SSID is the name of a local area network. Only devices that are set to the same SSID value can communicate with each other.
  • FIG. 3 is a schematic structural diagram of a WiFi network according to an embodiment of the present disclosure.
  • an application scenario of the WiFi network is a distributed coverage scenario of multiple APs, that is, the WiFi network includes multiple cascaded APs, and A workstation STA accessing the plurality of APs.
  • the multiple APs included in the WiFi network may be connected by using a WiFi connection, and some APs may be connected by a wired connection.
  • the multiple APs are connected by using a WiFi connection as an example.
  • FIG. 3 a plurality of APs including R, A, B, C, and D are taken as an example, R is a root node, and A, B, C, and D are slave nodes, and may also be called a lower node of R, and the cascade relationship is as follows.
  • Figure 3 shows.
  • the workstation STAs that access the multiple APs include 10 (ie, S1 to S10) as an example, and the access relationship is as shown in FIG. 3, and S1 and S2 are connected to R, S3, and S4 to access A and S5.
  • the service set identifiers corresponding to S1, S3, S5, S7, and S9 are SSID1
  • the service set identifiers corresponding to S2, S4, S6, S8, and S10 are SSID2.
  • the access point device may include a processor, a memory, a communication interface, and a bus.
  • the memory and the communication interface are connected to the processor through a bus. .
  • the processor is configured to perform various functions of the access point device, and may include one or more modules, for example, including a central processing unit (CPU), an application-specific integrated circuit (ASIC), And field-programmable gate array (FPGA) and the like.
  • the memory can be used to store data, software programs, and modules, and can be implemented by any type of volatile or non-volatile memory or a combination thereof.
  • the memory includes flash memory and synchronous dynamic random memory (synchronous dynamic random memory).
  • Access memory, SDRAM is an example. Flash can be used to store programs and configuration data, and SDRAM can provide temporary storage for program execution and data processing.
  • the communication interface is used to support the access point device to communicate with other devices, and the access point device serves as a bridge connecting the distributed system (for example, Ethernet) and the wireless network, and needs to pass through the wireless interface of the WLAN and the other on the wireless network.
  • Node communication requires communication with other nodes in the distributed system.
  • the communication interface of the access point device is implemented by a wired network card and a WLAN network card to support communication between the access point device and other nodes.
  • FIG. 5 is a flowchart of a scheduling method according to an embodiment of the present disclosure, where the WiFi is applied to a WiFi network.
  • the network includes a first node and a second node directly cascaded with the first node, and the second node is a lower node of the first node.
  • the method includes the following steps.
  • Step 201 The first node acquires information of all workstations that directly access and indirectly access the first node.
  • the first node may refer to any node that exists in the lower node, the second node is directly cascaded with the first node, and the cascade level is one level higher than the cascade level of the first node.
  • the node in the lower node may be any one of R, B, or C, and the lower nodes of R may include A, B, C, and D, and the lower nodes of B may include C and D.
  • the lower node of C may include D.
  • the first node as R as an example, the lower node is directly cascaded with R, and the lower nodes of the cascade level are A and B, that is, the second node is A or B.
  • a workstation directly accessing the first node refers to a workstation directly accessed through the first node.
  • the workstation indirectly accessing the first node refers to a workstation accessed through a lower node directly cascaded with the first node, and the workstation accessed by the lower node includes a workstation directly accessing and indirectly accessing each lower node. All workstations that directly access and indirectly access the first node may be referred to as all workstations accessing the first node.
  • the lower nodes that are directly cascaded with R are A and B.
  • the workstations that directly access R are S1 and S2
  • the workstations that access A only include the directly connected workstations S3 and S4
  • the workstations that access B include direct access and indirect access workstations, which directly access B.
  • the workstations include S5 and S6, and the workstations that indirectly access B include S7, S8, S9, and S10, so that all workstations connected to R are S1 to S10.
  • the workstations directly accessing B are S5 and S6, and the workstations directly accessing and indirectly accessing C are S7 to S10, thereby accessing all of B.
  • the workstations are S5 ⁇ S10. If the first node is C, the lower node that is directly cascaded with C is D, the workstations that directly access C are S7 and S8, and the workstations that directly access D are S9 and S10, so that all workstations connected to C are S7 ⁇ S10.
  • the workstation information may include a workstation identification, and the workstation identification is used to uniquely identify the workstation.
  • the information of the workstation may further include at least one of the following information: a workstation priority, a service set identifier corresponding to the workstation, and a priority of the service set identifier corresponding to the workstation.
  • the workstation priority refers to the priority corresponding to the workstation, and may be a priority according to the user level or the scope of the user authority.
  • the service set identifier corresponding to the workstation refers to the identifier of the subnet corresponding to the workstation.
  • the priority of the service set identifier corresponding to the workstation refers to the priority of the identifier of the sub-network corresponding to the workstation, and may be the priority according to the importance or scope of the sub-network.
  • Step 202 The first node uniformly allocates the proportion of air interface resources of each workstation according to information of all workstations accessing the first node.
  • Air interface resources can refer to air transmission time.
  • the first node may determine the total number of all workstations accessing the first node according to the workstation identifier, thereby uniformly allocating the ratio of the air interface resources to each workstation according to the total number. For example, in the WiFi network shown in FIG.
  • the ratio of allocated air interface resources can be 1/10.
  • the first node can be based on each workstation it accesses The priority and the total number of all workstations connected to each station, the corresponding air interface resource ratio is assigned to each workstation.
  • the workstation priority may include two or more levels of partitioning, and for a workstation with a higher priority, the ratio of air interface resources allocated by the first node may be higher than the proportion of air interface resources allocated to workstations with lower priority. For example, in the WiFi network shown in FIG.
  • C can be
  • the ratio of air interface resources allocated to S7 and S9 is 3/10, and the ratio of air interface resources allocated to S8 and S10 is 1/5.
  • the first node may determine the number of workstations corresponding to each SSID according to the SSID corresponding to all workstations accessing the first node, thereby determining the workstation according to each SSID. Quantity, configure the ratio of air interface resources for each SSID. For multiple workstations under the same SSID, the ratio of air interface resources of each workstation can be determined by the method of even distribution. For example, in the WiFi network shown in FIG.
  • the identifiers of all workstations accessed by R include S1 to S10, and the SSIDs corresponding to S1, S3, S5, S7, and S9 are SSID1, S2, and S4.
  • the SSID corresponding to S6, S8, and S10 is SSID2, and the ratio of the air interface resources allocated by the first node to SSID1 and SSID2 is 1/2, so that S1, S3, S5, S7, and S9, and S2, S4, S6, and S8.
  • the proportion of air interface resources determined by the method of average allocation with S10 is 1/10.
  • the information of the workstation further includes the service set identifier SSID of the workstation and the priority of the service set identifier corresponding to the workstation
  • the number of the SSID and the priority of each SSID may be used. And the number of workstations under each SSID is assigned.
  • the SSID priority may include two or more levels of partitioning, and for a higher priority SSID, the ratio of air interface resources allocated by the first node may be higher than the proportion of air interface resources allocated for the lower priority SSID. For example, in the WiFi network shown in FIG.
  • the identifiers of all workstations accessed by R include S1 to S10, and the SSIDs corresponding to S1, S3, S5, S7, and S9 are SSID1, S2, and S4.
  • the SSID corresponding to S6, S8, and S10 is SSID2, and the priority of SSID1 is higher than the priority of SSID2.
  • the ratio of air interface resources allocated by the first node to SSID1 is 3/5, and the proportion of air interface resources that can be allocated for SSID2 is 2/.
  • the first node may allocate the ratio of the air interface resources to all workstations accessing the first node, according to each workstation of the first node.
  • the priority, the total number of SSIDs corresponding to the workstation, the priority of each SSID, and the number of workstations under each SSID allocate the proportion of air interface resources to all workstations accessing the first node.
  • the ratio of air interface resources allocated by workstations with higher priority is higher than the proportion of air interface resources allocated by workstations with lower priority.
  • the ratio of the air interface resources allocated by the higher priority SSID is higher than the proportion of the air interface resources allocated by the lower priority SSID.
  • Step 203 The first node allocates air interface resources to the second node according to the sum of the air interface resource proportions of all the workstations that directly access and indirectly access the second node.
  • the first node may be the second node according to the direct access and the indirect access for the second node in the lower node directly cascading with the first node.
  • the sum of the ratio of the air interface resources of all the workstations of the node is the ratio of the air interface resources corresponding to the second node.
  • the first node may schedule the data of the second node according to the ratio of the air interface resources corresponding to the second node.
  • the first node may also schedule data of the workstation directly accessing the first node according to the ratio of the air interface resources of the workstation directly accessing the first node.
  • the workstations that access A include S3 and S4, and the workstations that access B include S5 to S10, and the proportion of air interface resources of each workstation in S3 to S10 is 1/10, the ratio of the air interface resources corresponding to A determined by R is 1/5, the proportion of air interface resources corresponding to B is 3/5, and the proportion of air interface resources of S1 and S2 directly connected to R is 1/10.
  • a node can schedule it according to the corresponding air interface resource ratios of S1, S2, A, and B.
  • B allocates an air interface to each workstation according to the information of all the workstations accessed.
  • B does not need to consider workstations S9 and S10 that directly access D, that is, B does not need to allocate the ratio of air interface resources to workstations S9 and S10.
  • R allocates the ratio of the air interface resources to each workstation that is accessed according to the information of all the workstations that are accessed
  • R needs to allocate the ratio of the air interface resources to the workstations S9 and S10 that directly access D, and allocate the corresponding air interface for B.
  • the sum of the ratios of the air interface resources of the workstations S5 to S10 is allocated as the ratio of the air interface resources corresponding to B.
  • the first node when scheduling is performed according to the method provided by the embodiment of the present invention, if the first node has a lower-level node that is directly cascaded by wire, the first node acquires information of all workstations accessing the first node. The first node does not need to consider the information of the workstations that are connected by wire. If there is a node connected by wire in the lower-level node directly cascading with the first node, when determining information of all workstations accessing the lower-level node, all workstations that directly access and indirectly access the lower-level node are The information is taken into account, and it is not necessary to distinguish whether the nodes connected to the workstation indirectly accessing the lower node are connected by wire or wireless.
  • the first node may be a root node or a slave node in the WiFi network, and the slave node refers to a node other than the root node except the WiFi network.
  • the first node may be implemented by using different methods as follows.
  • the first node obtains the information of all the workstations that access the first node, and the method includes the following steps: Step a1 - Step a2.
  • the first node may be a root node or a slave node.
  • Step a1 The first node receives information of all direct access and indirect access to the workstation of the second node sent by the second node.
  • the first node and the second node are directly cascaded, so that the second node can report the information of all the workstations that it accesses to the first after obtaining the information of all the workstations that are directly accessed and indirectly accessed.
  • the first node receives information of all workstations accessed by the second node sent by the second node, so that the first node acquires information about all workstations accessing the second node.
  • the second node obtains the information of all the workstations that are directly accessed and indirectly accessed
  • the information of the workstation directly accessed by the second node may be directly determined, and the information of the workstation that is indirectly accessed may also be reported in a stepwise manner. Get it.
  • the first node receives information about all workstations that are sent by the second node and accesses the second node, and only includes direct access to the second node. Workstation information.
  • the lower node directly cascaded with the first node may include one or more nodes, and the second node is one of the lower nodes directly cascaded by the first node.
  • each node of the lower-level nodes directly cascaded by the first node may obtain information of all workstations accessed by the method described in the foregoing step a1.
  • the first node is sent to the first node to obtain information about all workstations that indirectly access the first node.
  • the first node is R
  • the lower nodes directly cascading with R are A and B
  • the workstations directly accessing A are S3 and S4
  • A can directly determine the information of workstations S3 and S4. Report it to R.
  • the workstations that directly access B are S5 and S6, and C can directly determine the information of workstations S5 and S6.
  • the workstations that are indirectly connected to C are S7 to S10, and D reports the information of workstations S9 and S10 that are directly connected to C, C.
  • the information of the S7 to S10 can be reported to the B, so that the B obtains the information of all the workstations that directly access and indirectly access the B, and all the workstations that the B accesses are S5 to S10.
  • the information is reported to R.
  • Step a2 The first node determines information of all workstations accessing the first node according to information of the workstation directly accessing the first node and information of the workstation indirectly accessing the first node.
  • the first node may determine the information of the workstation indirectly accessing the first node and the information of the workstation directly accessing the first node as access. Information about all workstations of the first node.
  • the workstations directly accessing R are S1 and S2, so that R is based on the information of all workstations S3 and S4 connected to A, and all workstations S5 to S10 of access B.
  • the second method if the first node is the root node, the first node obtains the information of all the workstations that directly access and indirectly access the first node, and specifically includes: step b1 to step b2.
  • Step b1 The first node receives information of a workstation directly connected to the node sent by each node except the first node in the WiFi network.
  • the first node when the first node is the root node, the first node can maintain the topology structure of the WiFi network, and each node included in the slave node in the WiFi network can send information of the workstation directly accessed by the node to the first node, so that the first node A node obtains information about all workstations directly accessed from the node.
  • Step b2 The first node summarizes the information of the workstation directly accessing each node to obtain information of all workstations accessing the first node.
  • the first node When the first node receives the information of the workstation directly connected to the node sent by each node other than the first node in the WiFi network, the first node may, according to the topology, information about the workstation directly accessing each node, And the information of the workstation directly accessing the first node is aggregated to obtain information of direct access and indirect access to the first node, and all workstations of each node in the slave node.
  • R is the root node
  • A, B, C, and D are slave nodes
  • A, B, C, and D respectively send information of the workstations directly connected to them to R
  • R is based on the WiFi network.
  • the topology aggregates the information of the received workstations to obtain information about all workstations accessing each of nodes A, B, C, and D.
  • the root node R summarizes the information obtained for all workstations accessing each node.
  • the third type if the first node is a slave node, the first node obtains the information of all the workstations that directly access and indirectly access the first node, and specifically includes: steps c1-c2.
  • Step c1 The first node receives scheduling indication information sent by the root node, where the scheduling indication information is used to indicate information of all directly accessing and indirectly accessing workstations of the first node.
  • Step c2 The first node acquires information of all workstations that directly access and indirectly access the first node according to the scheduling indication information.
  • the root node may obtain information about all workstations in the WiFi network that directly access and indirectly access each node according to the foregoing second method, so that the root node may send a scheduling indication to the first node.
  • the information when the first node receives the scheduling indication information, the first node may determine, according to the scheduling indication information, information of all workstations that directly access and indirectly access the first node.
  • the method may further include: sending, by the first node, information about the workstation directly accessing the first node to Root node.
  • the information of all the workstations that directly access and indirectly access the second node may be carried in the first learning packet, where the first learning packet is sent by the second node.
  • the learning message is a packet sent by the lower-level node for the MAC address learning of the upper-level node, and the MAC address of the workstation carried in the learning packet can be used as the identifier of the workstation.
  • the information of the workstation carried in the learning message may further include at least one of the following information: a workstation identifier, a workstation priority, a service set identifier corresponding to the workstation, and a priority of the service set identifier corresponding to the workstation.
  • the information of the workstation carried in the learning message includes the MAC address and the corresponding SSID
  • the first node is R, and the lower nodes directly cascading with R are A and B
  • R learning The obtained MAC addresses and SSIDs of A and B are as shown in Table 2 below. If the first node is B, it is directly cascaded with B. The level node is C, and the MAC address and SSID of the C learned by B are as shown in Table 3 below. If the first node is C and the lower node directly cascaded with C is D, the MAC address and SSID of the D learned by C are as shown in Table 4 below.
  • the above Tables 2 to 4 correspond to Tables 5 to 7 below.
  • the MAC addresses of the lower nodes of the first node learned by the first node shown in Tables 5 to 7 are merely exemplary, and the above Tables 5 to 7 do not limit the embodiment of the present invention. .
  • the method may further include: the first node sending the second learning report to the third node
  • the second learning message carries information about all workstations accessing the first node.
  • the first node when the third node performs scheduling according to the method provided by the embodiment of the present invention, the first node, as a lower-level node that is directly cascaded by the third node, may send the second learning packet to the third node, where the second learning packet is sent. Carrying information of all workstations accessing the first node, so that the third node acquires information of all workstations accessing the third node according to the above method.
  • the first node may obtain information about a workstation accessing the first node by using the foregoing different methods, so that when allocating the ratio of the air interface resources, all the direct access and the indirect access to the first node may be combined.
  • the information of the workstations uniformly allocates the ratio of the air interface resources to each workstation accessing the first node, and allocates the air interface resources to the second node according to the sum of the ratios of the air interface resources of all the workstations that directly access and indirectly access the second node. Therefore, the fairness and rationality of the ratio of the air interface resources of the workstation directly accessing the first node and the workstation directly accessing the first node are ensured, thereby improving the scheduling effect and the user experience of the first node.
  • each network element such as the first node, the second node, the third node, and the root node, etc., in order to implement the above functions, includes hardware structures and/or software modules corresponding to each function.
  • the present invention can be implemented in a combination of hardware or hardware and computer software in conjunction with the network elements and algorithm steps of the various examples described in the embodiments disclosed herein. Whether a function is implemented in hardware or computer software to drive hardware depends on the specific application and design constraints of the solution. A person skilled in the art can use different methods for implementing the described functions for each particular application, but such implementation should not be considered to be beyond the scope of the present invention.
  • the embodiment of the present invention may perform the division of the function module on the first node according to the foregoing method example.
  • each function module may be divided according to each function, or two or more functions may be integrated into one processing module.
  • the above integrated modules can be implemented in the form of hardware or in the form of software functional modules. It should be noted that the division of the module in the embodiment of the present invention is schematic, and is only a logic. Functional division, there may be another way of dividing when actually implemented.
  • FIG. 8 is a schematic diagram showing a possible structure of the first node involved in the foregoing embodiment.
  • the first node 300 includes an obtaining unit 301 and an allocating unit 302.
  • the obtaining unit 301 is configured to perform step 201 in FIG. 5;
  • the allocating unit 302 is configured to perform step 202 and step 203 in FIG. 5.
  • the first node 300 may further include a sending unit 303.
  • the sending unit 303 is configured to send information about a workstation directly accessing the first node to the root node, or send information to all the workstations of the first node to the upper node of the first node, or
  • the upper node of a node sends a second learning message. All the related content of the steps involved in the foregoing method embodiments may be referred to the functional description of the corresponding functional modules, and details are not described herein again.
  • the foregoing allocating unit 302 may be a processor
  • the obtaining unit 301 may be a receiver
  • the sending unit 303 may be a transmitter
  • the transmitter and the receiver may constitute a communication interface.
  • FIG. 9 is a schematic diagram showing a possible logical structure of the first node 310 involved in the foregoing embodiment provided by the embodiment of the present invention.
  • the first node 310 includes a processor 312, a communication interface 313, a memory 311, and a bus 314.
  • the processor 312, the communication interface 313, and the memory 311 are connected to one another via a bus 314.
  • the processor 312 is configured to control manage the actions of the first node 310, for example, the processor 312 is configured to perform steps 202 and 203 in FIG. 5, and/or for use in the description herein. Other processes of technology.
  • the communication interface 313 is for supporting the first node 310 to perform communication.
  • the memory 311 is configured to store program codes and data of the first node 310.
  • the processor 312 can be a central processing unit, a general purpose processor, a digital signal processor, an application specific integrated circuit, a field programmable gate array or other programmable logic device, a transistor logic device, a hardware component, or any combination thereof. It is possible to implement or carry out the various illustrative logical blocks, modules and circuits described in connection with the present disclosure.
  • the processor may also be a combination of computing functions, for example, including one or more microprocessor combinations, combinations of digital signal processors and microprocessors, and the like.
  • the bus 314 can be a Peripheral Component Interconnect (PCI) bus or an Extended Industry Standard Architecture (EISA) bus.
  • PCI Peripheral Component Interconnect
  • EISA Extended Industry Standard Architecture
  • a computer readable storage medium is stored, where computer execution instructions are stored, and when at least one processor of the device executes the computer to execute an instruction, the device executes FIG. The scheduling method shown.
  • a computer program product comprising computer executable instructions stored in a computer readable storage medium; at least one processor of the device may be Reading the storage medium reads the computer execution instructions, and the at least one processor executing the computer execution instructions causes the apparatus to implement the scheduling method illustrated in FIG.
  • the first node obtains the information of all the workstations that directly access and indirectly access the first node, and uniformly allocates the proportion of the air interface resources of each workstation, according to the direct access and the indirect access to the second node.
  • the sum of the proportions of the air interface resources of all the workstations allocates the air interface resources to the second node, thereby ensuring the fairness and rationality of the ratio of the air interface resources of the workstation directly accessing the first node and the workstation directly accessing the first node, thereby improving The scheduling effect of the first node and the user experience.

Landscapes

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

Abstract

La présente invention se rapporte au domaine de la technologie de communication, et concerne un procédé, un dispositif et un système de planification, de façon à améliorer un effet de planification et une expérience d'utilisateur pour un réseau WiFi. Le procédé est appliqué à un réseau WiFi. Le réseau WiFi comprend : un premier nœud et un second nœud en cascade directement avec le premier nœud, le second nœud étant un nœud de niveau inférieur du premier nœud. Le procédé comprend les étapes suivantes : un premier nœud acquiert des informations de tous les postes de travail directement et indirectement accédant au premier nœud ; le premier nœud attribue, de manière unifiée, et en fonction des informations de tous les postes de travail accédant au premier nœud, une proportion de ressources d'interface radio pour chaque poste de travail ; et le premier nœud attribue, en fonction de la somme des proportions de ressources d'interface radio de tous les postes de travail accédant directement et indirectement au second nœud, des ressources d'interface radio pour le second nœud.
PCT/CN2017/079626 2017-04-06 2017-04-06 Procédé, dispositif et système de planification WO2018184176A1 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
PCT/CN2017/079626 WO2018184176A1 (fr) 2017-04-06 2017-04-06 Procédé, dispositif et système de planification
CN201780063020.5A CN109804693B (zh) 2017-04-06 2017-04-06 一种调度方法、装置及系统

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2017/079626 WO2018184176A1 (fr) 2017-04-06 2017-04-06 Procédé, dispositif et système de planification

Publications (1)

Publication Number Publication Date
WO2018184176A1 true WO2018184176A1 (fr) 2018-10-11

Family

ID=63712976

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2017/079626 WO2018184176A1 (fr) 2017-04-06 2017-04-06 Procédé, dispositif et système de planification

Country Status (2)

Country Link
CN (1) CN109804693B (fr)
WO (1) WO2018184176A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111010713A (zh) * 2019-12-17 2020-04-14 烽火通信科技股份有限公司 一种数据传输方法及系统

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2014179722A1 (fr) * 2013-05-02 2014-11-06 Interdigital Patent Holdings, Inc. Opération de recherche, d'opportunité de transmission (txop) et commande de flux pour extension de plage dans le wifi
CN104185188A (zh) * 2013-05-27 2014-12-03 华为技术有限公司 干扰处理方法及设备
CN105359609A (zh) * 2013-05-31 2016-02-24 诺基亚通信公司 用于基于关于操作模式的信息配置调度时段的方法和装置
CN105554093A (zh) * 2015-12-10 2016-05-04 广州蓝杰网络科技有限公司 基于云端的无线控制器和无线热点之间的链接方法和系统

Family Cites Families (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20060251013A1 (en) * 2005-05-04 2006-11-09 Interdigital Technology Corporation Resource allocation in multi-access point wireless networks
CN101282569B (zh) * 2007-04-03 2012-11-14 中兴通讯股份有限公司 包含基站和无线中继站的无线传输网络的自适应管理方法
US7907562B2 (en) * 2007-06-20 2011-03-15 Microsoft Corporation Managing dense wireless access point infrastructures in wireless local area networks
KR100891757B1 (ko) * 2007-07-26 2009-04-07 엘지노텔 주식회사 무선 랜 시스템의 이웃 ＡＰ(ＮｅｉｇｈｂｏｒｈｏｏｄＡｃｃｅｓｓ Ｐｏｉｎｔ) 정보 제공 방법 및 장치
WO2014032733A1 (fr) * 2012-08-31 2014-03-06 Huawei Technologies Co., Ltd. Procédé d'économie d'énergie dans un système de communication
WO2015039311A1 (fr) * 2013-09-18 2015-03-26 华为技术有限公司 Procédé et appareil pour établir une interface entre des points d'accès
US10264510B2 (en) * 2013-11-06 2019-04-16 Kt Corporation Method and device for transmitting and receiving data in wireless LAN system
US9591564B2 (en) * 2014-03-31 2017-03-07 Huawei Technologies Co., Ltd. Methods for dynamic traffic offloading and transmit point (TP) muting for energy efficiency in virtual radio access network (V-RAN)
CN114158121B (zh) * 2015-04-28 2025-03-07 交互数字专利控股公司 用于子信道化的wlan中的csma和空间重用的方法、装置及过程
US20170079044A1 (en) * 2015-09-10 2017-03-16 Qualcomm Incorporated Communication resource allocation
CN106060963B (zh) * 2016-06-28 2020-03-06 新华三技术有限公司 一种报文处理方法及装置

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2014179722A1 (fr) * 2013-05-02 2014-11-06 Interdigital Patent Holdings, Inc. Opération de recherche, d'opportunité de transmission (txop) et commande de flux pour extension de plage dans le wifi
CN104185188A (zh) * 2013-05-27 2014-12-03 华为技术有限公司 干扰处理方法及设备
CN105359609A (zh) * 2013-05-31 2016-02-24 诺基亚通信公司 用于基于关于操作模式的信息配置调度时段的方法和装置
CN105554093A (zh) * 2015-12-10 2016-05-04 广州蓝杰网络科技有限公司 基于云端的无线控制器和无线热点之间的链接方法和系统

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111010713A (zh) * 2019-12-17 2020-04-14 烽火通信科技股份有限公司 一种数据传输方法及系统
CN111010713B (zh) * 2019-12-17 2022-09-27 烽火通信科技股份有限公司 一种数据传输方法及系统

Also Published As

Publication number Publication date
CN109804693B (zh) 2021-08-13
CN109804693A (zh) 2019-05-24

Similar Documents

Publication Publication Date Title
US11909652B2 (en) Method, device and storage medium for quality of service (QoS) flow management of time sensitive data for transmission of ethernet packet filter sets
US11894992B2 (en) Network component management method and network device
RU2520380C2 (ru) Способ и система для динамического согласования обслуживания с однородной защитной плоскостью контроля в беспроводной сети
WO2020073903A1 (fr) Procédé de communication de réseau sensible à la latence et appareil associé
US12063594B2 (en) Method, device, and system for deploying network slice
WO2021063407A1 (fr) Procédé, appareil et système de configuration pour une politique d'allocation de ressource radio
WO2018176471A1 (fr) Procédé et appareil de sélection de canal
WO2014090006A1 (fr) Procédé de traitement d'informations, point d'accès, et station
US9467340B2 (en) Logical channel establishing method and system, edge virtual bridging station and bridge
WO2020191684A1 (fr) Procédé et dispositif destinés à gérer des priorités de règles de qos, et support d'informations
CN117676916A (zh) 通信资源管理方法、装置、系统及存储介质
WO2018184176A1 (fr) Procédé, dispositif et système de planification
WO2024016801A1 (fr) Procédé et appareil d'aménagement de puissance de calcul de station de base, dispositif électronique et support de stockage
WO2016078325A1 (fr) Procédé et dispositif de transmission de données
CN108934058B (zh) 一种通信方法及装置
WO2019222999A1 (fr) Procédé et dispositif de commande d'accès et support d'enregistrement lisible
CN112203354B (zh) 一种业务处理方法及装置
CN113115369B (zh) 一种网络切片的资源分配方法及装置
CN112492629B (zh) 网络切片部署方法、切片管理平台及网络侧设备
WO2018049626A1 (fr) Procédé de traitement de service, et dispositif et système associés
WO2021135485A1 (fr) Procédé, appareil et système de contrôle d'accès
EP3370368B1 (fr) Système de communication, procédé de réseautage et dispositif de commande pour un réseau piloté par une application
CN115119316B (zh) 资源分配方法、装置及可读存储介质
CN115604723B (zh) 资源负荷确定方法、装置及存储介质
CN113938956B (zh) 资源分配方法、装置及计算机可读存储介质

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: 17904847

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 17904847

Country of ref document: EP

Kind code of ref document: A1

点击 这是indexloc提供的php浏览器服务，不要输入任何密码和下载