WO2018184176A1

WO2018184176A1 - Method, device and system for scheduling

Info

Publication number: WO2018184176A1
Application number: PCT/CN2017/079626
Authority: WO
Inventors: 赵望生
Original assignee: 华为技术有限公司
Priority date: 2017-04-06
Filing date: 2017-04-06
Publication date: 2018-10-11
Also published as: CN109804693B; CN109804693A

Abstract

The present application relates to the field of communication technology, and provides a method, device and system for scheduling, so as to improve a scheduling effect and user experience for a WiFi network. The method is applied in a WiFi network. The WiFi network comprises: a first node and a second node cascaded directly with the first node, wherein the second node is a lower level node of the first node. The method comprises: a first node acquires information of all workstations directly and indirectly accessing the first node; the first node allocates, in a unified manner, and according to the information of all workstations accessing the first node, an air interface resource proportion for each workstation; and the first node allocates, according to the sum of air interface resource proportions of all workstations directly and indirectly accessing the second node, air interface resources for the second node.

Description

Scheduling method, device and system

Technical field

The embodiments of the present invention relate to the field of communications technologies, and in particular, to a scheduling method, apparatus, and system.

Background technique

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. At present, 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. In an application, an AP can support multiple virtual APs, and each virtual AP corresponds to a service set identifier (SSID), that is, provides a service. For STAs, there are multiple APs that provide different services.

As shown in FIG. 2, for one physical AP, multiple SSIDs 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. Currently, for a coverage scenario of a single AP, there are roughly three methods for scheduling: average scheduling between multiple STAs, scheduling of air interface resources based on static configuration of SSIDs, and scheduling between multiple STAs within the SSID, and based on The proportion of air interface resources that are statically configured by the STA is scheduled and scheduled between multiple STAs within the SSID.

However, most of the existing WiFi networks have a large application range, and a single AP cannot be covered, and distributed coverage is required. For a distributed coverage scenario of multiple APs, a clear scheduling method has not been given yet, and the above single AP is used. When the scheduling method is used to cover the scene, there is a problem that the scheduling effect is poor, thereby reducing the user experience.

Summary of the invention

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.

In order to achieve the above object, embodiments of the present invention adopt the following technical solutions:

In a first aspect, 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. In the foregoing technical solution, 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.

With reference to the first aspect, in a first possible implementation manner of the first aspect, 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. In the foregoing possible implementation manner, 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.

In conjunction with the first possible implementation of the first aspect, in 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. In the foregoing possible implementation manner, 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.

In conjunction with the first aspect, in a third possible implementation manner of the first aspect, the first node is a root node or a slave node in the WiFi network.

With reference to the third possible implementation manner of the first aspect, in a fourth possible implementation manner of the first aspect, if the first node is a root 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 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. In the foregoing possible implementation manner, a method for obtaining information of all directly accessing and indirectly accessing workstations of the first node when the first node is the root node is provided, so that the air interface allocated by the first node to the second node can be ensured. The rationality of the proportion of resources, thereby improving the scheduling effect and user experience.

With reference to the third possible implementation manner of the first aspect, in a fifth possible implementation manner of the first aspect, if the first node is a slave 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. In the foregoing possible implementation manner, 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.

With reference to the third possible implementation manner of the first aspect, in a sixth possible implementation manner of the first aspect, if the first node is a slave node, 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. In the above possible implementation manner, 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.

In conjunction with the first aspect to any one of the sixth possible implementations of the first aspect, in a seventh possible implementation of the first aspect, 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. In the foregoing possible implementation manners, information about several possible workstations is provided, so that the proportion of air interface resources allocated to each workstation is uniformly allocated according to the information, thereby improving the rationality of proportion allocation of air interface resources, thereby improving the scheduling effect and user experience.

In a second aspect, a node is provided, 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.

With reference to the second aspect, in a first possible implementation manner of the second aspect, 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.

With reference to the first possible implementation manner of the second aspect, in a second possible implementation manner of the second aspect, 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.

With reference to the second aspect, in a third possible implementation manner of the second aspect, the first node is a root node or a slave node in the WiFi network.

With reference to the third possible implementation manner of the second aspect, in a fourth possible implementation manner of the second aspect, if the first node is a root node, 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.

With reference to the third possible implementation manner of the second aspect, in a fifth possible implementation manner of the second aspect, if the first node is a slave 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.

In conjunction with the third possible implementation of the second aspect, in a sixth possible implementation manner of the second aspect, if the first node is a slave 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 packet learned by the upper node for MAC address learning.

With reference to any one of the second aspect to the sixth possible implementation of the second aspect, in a seventh possible implementation of the second aspect, 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.

In a third aspect, a node is provided, the 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.

In a fourth aspect, a system is provided, the 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.

It can be understood that the apparatus, computer storage medium or computer program product of any of the scheduling methods provided above is used to perform the corresponding method provided above, and therefore, the beneficial effects that can be achieved can be referred to the above. The beneficial effects in the corresponding methods are not described here.

DRAWINGS

1 is a schematic structural diagram of a WiFi network of a basic BSS according to an embodiment of the present invention;

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.

detailed description

Before introducing the embodiments of the present invention, the technical terms involved in the embodiments of the present invention are first described.

An access point (AP) 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. In the 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. In addition, 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.

In the embodiment of the present invention, 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. In the embodiment of the present invention, the cascading level of the AP included in the distributed coverage WiFi network may be defined. Specifically, 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 (station, STA), also referred to as a mobile station, refers to a device that carries a wireless network interface card (such as a wireless network card). In the embodiment of the present invention, 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. Referring to FIG. 3, 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. In FIG. 3, the multiple APs are connected by using a WiFi connection as an example.

In 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. In FIG. 3, 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. And S6 access B, S7 and S8 access C, and S9 and S10 access D. The service set identifiers corresponding to S1, S3, S5, S7, and S9 are SSID1, and the service set identifiers corresponding to S2, S4, S6, S8, and S10 are SSID2.

4 is a schematic structural diagram of an access point device according to an embodiment of the present invention. Referring to FIG. 4, 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. In FIG. 4, 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, on the other hand, requires communication with other nodes in the distributed system. In Figure 4, 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. Referring to FIG. 5, 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.

In the WiFi network, 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. For example, as shown in the WiFi network shown in FIG. 3, the first 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. Taking 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.

In addition, 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.

In conjunction with the WiFi network structure shown in FIG. 3, as shown in FIG. 6, if the first node is R, the lower nodes that are directly cascaded with R are A and B. Among them, the workstations that directly access R are S1 and S2, the workstations that access A only include the directly connected workstations S3 and S4, and 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. If the first node is B, the lower node directly cascading with B is C, 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.

Further, the workstation information may include a workstation identification, and the workstation identification is used to uniquely identify the workstation. 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. 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.

When the first node acquires information about all the workstations accessing the first node, the first node may uniformly allocate the proportion of the air interface resources to each workstation of all the workstations accessed according to the information of all the workstations accessed by the first node, Air interface resources can refer to air transmission time. Specifically, if the information of the workstation includes the workstation identifier, 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. 3, if the first node is R, and the identifier of the workstation accessing R includes S1 to S10, the total number of all workstations accessing R is 10, and R is an average of S1 to S10. The ratio of allocated air interface resources can be 1/10.

If the workstation information also includes workstation priority, 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. 3, if the first node is C, and the identifiers of all workstations accessed by C include S7 to S10, and the priorities corresponding to S7 and S9 are higher than the priorities of S8 and S10, then 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.

If the information of the workstation further includes the service set identifier SSID corresponding to the workstation, 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. 3, if the first node is R, 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.

If 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, when the first node allocates the proportion of the air interface resource for each SSID, 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. 3, if the first node is R, 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/. 5, so that the proportion of air interface resources determined by the method of average allocation of S1, S3, S5, S7 and S9 is 3/25, and the ratio of air interface resources determined by the method of average allocation of S2, S4, S6, S8 and S10 is 2 /25.

If the information of the workstation is also the priority of the workstation, the SSID corresponding to the workstation, and the priority of the SSID corresponding to the workstation, 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. Among them, for workstations with the same SSID priority, 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. For the total number of workstations and the SSID with the same 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.

After the first node allocates the ratio of the air interface resources to all the workstations accessing the first 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. and then, 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. At the same time, 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.

For example, in the WiFi network shown in FIG. 3, if the first node is R, 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.

Further, when there is a wired connection in the WiFi network, such as the WiFi network shown in FIG. 7, and B and D are connected by wire, B allocates an air interface to each workstation according to the information of all the workstations accessed. When the ratio of resources is used, 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. However, when 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. In the case of the resource ratio, 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.

That is, 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.

Further, 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. When the first node obtains the information of all the workstations accessing the first node through the foregoing step 201, the first node may be implemented by using different methods as follows.

The first type, according to the topology of the WiFi network, 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. Wherein, in the first method, 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. a node, 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. Wherein, when 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.

It should be noted that, if the second node does not have an indirect access to the second node workstation, 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.

In addition, 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. When the first node obtains information of all the workstations that it indirectly accesses, 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.

For example, as shown in FIG. 3, the first node is R, the lower nodes directly cascading with R are A and B, and the workstations directly accessing A are S3 and S4, and 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. After obtaining the information of the workstations S9 and S10, 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.

When the first node acquires the 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.

For example, as shown in FIG. 3, if the first node is R, 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 information, as well as the information of the workstations S1 and S2 directly accessing R, determines that the information of all workstations accessing R is the information of S1 to S10.

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.

Wherein, 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.

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.

For example, taking Figure 3 as an example, R is the root node, A, B, C, and D are slave nodes, and A, B, C, and D respectively send information of the workstations directly connected to them to R, and 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. As shown in Table 1 below, the root node R summarizes the information obtained for all workstations accessing each node.

Table 1

It should be noted that the information of all the workstations connected to each node shown in Table 1 above is merely exemplary, and the above Table 1 does not limit the embodiment of the present invention.

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.

When the first node is a slave node, 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.

In addition, before the slave node in the WiFi network acquires the information of all the workstations accessing the first node by using the foregoing third method, the method may further include: sending, by the first node, information about the workstation directly accessing the first node to Root node.

Further, in step a1 of the foregoing first method, 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. A message for the first node to perform MAC address learning, where the first learning message includes information of all workstations accessing the second node. That is, when the first node acquires information of the workstation indirectly accessing the first node, the lower-level node directly cascading with the first node may carry information of all workstations that directly access and indirectly access it in the learning report. In the text, the first node obtains information of the workstation indirectly accessing the first node through the learning message.

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. Further, 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.

In conjunction with the WiFi network shown in FIG. 3, when the information of the workstation carried in the learning message includes the MAC address and the corresponding SSID, if the first node is R, and the lower nodes directly cascading with R are A and B, then 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.

Table 2

table 3

Table 4

It should be noted that the MAC addresses and SSIDs of the lower-level nodes learned by the first node shown in Tables 2 to 4 above are merely exemplary, and Tables 2 to 4 above are not limited to the embodiments of the present invention.

If the information of the workstation carried by the learning packet sent by the lower node of the first node is the MAC address of the workstation accessing the lower node of the first node, the above Tables 2 to 4 correspond to Tables 5 to 7 below.

table 5

Table 6

Table 7

It should be noted that 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. .

Further, when the WiFi network further includes a third node, where the first node is directly cascaded with the third node and is a lower node of the third node, 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.

Specifically, 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.

In the embodiment of the present invention, 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.

The solution provided by the embodiment of the present invention is mainly introduced from the perspective of interaction between the network elements. It can be understood that 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. Those skilled in the art will readily appreciate that 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. For 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. Further, 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.

In the hardware implementation, 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, and 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. In an embodiment of the invention, 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. The bus can be divided into an address bus, a data bus, a control bus, and the like. For ease of representation, only one thick line is shown in Figure 9, but it does not mean that there is only one bus or one type of bus.

In another embodiment of the present invention, 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.

In another embodiment of the present invention, a computer program product is provided, the 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.

In the embodiment of the present invention, 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.

Finally, it should be noted that the above description is only a specific embodiment of the present application, but the scope of protection of the present application is not limited thereto, and any changes or substitutions within the technical scope disclosed in the present application should be covered in the present application. Within the scope of protection of the application. Therefore, the scope of protection of the present application should be determined by the scope of the claims.

Claims

A scheduling method, which is applied to a WiFi network, the WiFi network includes a first node, and a second node directly cascading with the first node, where the second node is the first node Lower node, the method includes:

The first node acquires information of all workstations that directly access and indirectly access the first node;

The first node uniformly allocates the proportion of air interface resources of each workstation according to information of all workstations that access the first node;

The first node allocates air interface resources to the second node according to a sum of air interface resource proportions of all workstations that directly access and indirectly access the second node.
The method according to claim 1, wherein the first node acquires information of all workstations that directly access and indirectly access the first node, including:

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 method according to claim 2, wherein the information of all workstations that directly access and indirectly access the second node is carried in a first learning message, where the first learning message is And the packet sent by the second node for performing MAC address learning by the first node.
The method according to claim 1, wherein the first node is a root node or a slave node in the WiFi network.
The method according to claim 4, wherein if the first node is the root node, the first node acquires information of all workstations that directly access and indirectly access the first node, including :

Receiving, by the first node, information about a workstation directly connected to the node sent by each node in the WiFi network;

The first node aggregates information of workstations directly accessing each node to obtain information of all workstations that directly access and indirectly access the first node.
The method according to claim 4, wherein if the first node is the slave node, the first node acquires information of all workstations that directly access and indirectly access the first node, including :

Receiving, by the first node, 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;

And the first node acquires, according to the scheduling indication information, information about all workstations that directly access and indirectly access the first node.
The method according to claim 4, wherein if the first node is the slave node, the method further comprises:

Sending, by the first node, information of a workstation directly accessing the first node to the root node; or

The first node sends a second learning message to the upper node of the first node, where the second learning message is a MAC address learning for the upper node sent by the first node for the first node. Message.
The method of any of claims 1-7, wherein the information of the workstation comprises at least a workstation identification.
The method according to claim 8, wherein the information of the workstation further comprises at least one of the following: a workstation priority, a service set identifier corresponding to the workstation, and a service set identifier corresponding to the workstation. Priority.
A node, which is applied to a WiFi network, 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 the a lower node of the first node, the first node comprising:

An obtaining unit, configured to acquire information about all workstations that directly access and indirectly access the first node;

An allocating unit, configured to uniformly allocate an air interface resource ratio of each workstation according to information of all workstations accessing the first node;

The allocating unit is further configured to allocate an air interface resource to the second node according to a sum of air interface resource proportions of all workstations that directly access and indirectly access the second node.
The node according to claim 10, wherein the obtaining unit is specifically configured to:

Receiving information of all direct access and indirect access to the workstation of the second node sent by the second node.
The node according to claim 11, wherein the information of all the workstations that directly access and indirectly access the second node is carried in a first learning message, where the first learning message is And the packet sent by the second node for performing MAC address learning by the first node.
The node according to claim 10, wherein the first node is a root node or a slave node in the WiFi network.
The node according to claim 13, wherein if the first node is the root node, the obtaining unit is specifically configured to:

Receiving information of a workstation directly connected to each node sent by each node in the WiFi network;

The information of the workstations directly accessing each node is summarized to obtain information of all workstations that directly access and indirectly access the first node.
The node according to claim 13, wherein if the first node is the slave node, the acquiring unit is specifically configured to:

Receiving, by the root node, scheduling indication information, where the scheduling indication information is used to indicate information of all directly accessing and indirectly accessing workstations of the first node;

Obtaining, according to the scheduling indication information, information of all workstations that directly access and indirectly access the first node.
The node according to claim 13, wherein if the first node is the slave node, the first node further comprises:

a sending unit, configured to send information of a workstation directly accessing the first node to the root node; or

The sending unit is configured to send a second learning message to the upper node of the first node, where the second learning message is a MAC address sent by the first node for the first node Address learning message.
A node, wherein the node comprises a memory, a processor, a bus, and a communication interface; wherein the memory stores code and data, and the processor is connected to the memory through the bus, the processing The code in the memory running causes the node to perform the scheduling method of any of the preceding claims 1-9.
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 node of any of the preceding claims 10-17.