CN109804693B - Scheduling method, device and system - Google Patents
Scheduling method, device and system Download PDFInfo
- Publication number
- CN109804693B CN109804693B CN201780063020.5A CN201780063020A CN109804693B CN 109804693 B CN109804693 B CN 109804693B CN 201780063020 A CN201780063020 A CN 201780063020A CN 109804693 B CN109804693 B CN 109804693B
- Authority
- CN
- China
- Prior art keywords
- node
- workstations
- information
- accessing
- directly
- Prior art date
- Legal status (The legal status 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 status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/12—Wireless traffic scheduling
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The application provides a scheduling method, a scheduling device and a scheduling system, relates to the technical field of communication, and is used for improving scheduling effect and user experience of a WiFi network. The method is applied to a WiFi network, wherein the WiFi network comprises a first node and a second node which is directly cascaded with the first node, and the second node is a lower node of the first node, and the method comprises the following steps: the first node acquires information of all workstations directly accessed to and indirectly accessed to the first node; the first node uniformly allocates the proportion of air interface resources of each workstation according to the information of all workstations accessed to the first node; and the first node allocates air interface resources to the second node according to the sum of the proportion of the air interface resources of all workstations directly accessed to the second node and the proportion of the air interface resources of all workstations indirectly accessed to the second node.
Description
Technical Field
The embodiment of the invention relates to the technical field of communication, in particular to a scheduling method, a scheduling device and a scheduling system.
Background
A WiFi network structure of a Basic Service Set (BSS) is shown in fig. 1, and includes an Access Point (AP) and one or more Stations (STAs), where the one or more STAs access the WiFi network through the AP and can use services provided by the AP. At present, most of application scenarios of a WiFi network are distributed coverage scenarios of multiple APs, where distributed coverage means that one WiFi network includes multiple APs, a cascade relationship exists among the multiple APs, and each AP can access one or multiple STAs. In application, one AP may support multiple virtual APs, where each virtual AP corresponds to a Service Set Identifier (SSID), that is, provides a service. For the STA, there are a plurality of APs each providing a different service.
As shown in fig. 2, for one physical AP, multiple SSIDs may be supported, each with multiple STAs accessing. The AP may transmit data packets with a plurality of STAs, the AP has a hardware transmission queue, and a software transmission queue is provided before the data packets enter the hardware queue, where the software transmission queue may be a process of managing the software transmission queue based on each access STA, and the process of scheduling the data packets from the STA-based software queue to the hardware transmission queue by the AP is called airtime fairness (airtime fairness) scheduling. Currently, for a coverage scenario of a single AP, scheduling methods are roughly three: the method comprises the steps of average scheduling among a plurality of STAs, scheduling based on the air interface resource proportion statically configured by the SSID and average scheduling among a plurality of STAs in the SSID, and scheduling based on the air interface resource proportion statically configured by the STAs and proportional scheduling among the STAs in the SSID.
However, most of existing WiFi networks have a large application range, a single AP cannot cover the coverage area, and distributed coverage needs to be used, for a distributed coverage scenario of multiple APs, no clear scheduling method is provided at present, and when the scheduling method in the coverage scenario of the single AP is used, a problem of poor scheduling effect exists, so that user experience is reduced.
Disclosure of Invention
Embodiments of the present invention provide a scheduling method, apparatus, and system, which solve the problems of poor scheduling effect and low user experience of a WiFi network in the prior art.
In order to achieve the above purpose, the embodiment of the invention adopts the following technical scheme:
in a first aspect, a scheduling method is provided, which is applied in a WiFi network, where the WiFi network includes a first node and a second node directly cascaded with the first node, and the second node is a subordinate node of the first node, and the method includes: the first node acquires information of all workstations directly accessed to and indirectly accessed to the first node; the first node uniformly allocates the proportion of air interface resources of each workstation according to the information of all workstations accessed to the first node; and the first node allocates air interface resources for the second node according to the sum of the air interface resource proportions of all the workstations which are directly accessed and indirectly accessed to the second workstation. In the above technical scheme, the first node obtains information of all workstations directly and indirectly connected to the first node, so that when air interface resource proportion allocation is performed, the air interface resource proportion of each workstation can be uniformly allocated, and air interface resources are allocated to the second node according to the sum of the air interface resource proportions of all workstations directly and indirectly connected to the second node, so that fairness and rationality of the air interface resource proportions allocated to workstations directly connected to the first node and workstations indirectly connected to the first node can be ensured, and scheduling effect and user experience are improved.
With reference to the first aspect, in a first possible implementation manner of the first aspect, the obtaining, by the first node, information of all workstations directly accessing and indirectly accessing the first node includes: the first node receives the information of all the workstations which are directly accessed to the second node and indirectly accessed to the second node and are sent by the second node. In the possible implementation manner, a method is provided for a first node to obtain information of a workstation indirectly accessed to the first node through a second node, so that the reasonability of the proportion of air interface resources allocated to the second node by the first node can be ensured, and the scheduling effect and the user experience are improved.
With reference to the first possible implementation manner of the first aspect, in a second possible implementation manner of the first aspect, information of all workstations directly accessing and indirectly accessing the second node is carried in a first learning message, and the first learning message is a message sent by the second node and used for the first node to perform MAC address learning. In the possible implementation manner, a method is provided for the first node to obtain information of all workstations directly and indirectly accessed to the second node, so that the reasonability of the proportion of air interface resources allocated to the second node by the first node can be ensured, and the scheduling effect and the user experience are improved.
With reference to 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 obtaining, by the first node, information of all workstations directly accessing and indirectly accessing the first node includes: the first node receives information of a workstation which is directly accessed to each node and is sent by each node in the WiFi network; the first node collects the information of the workstations directly accessing each node to acquire the information of all the workstations directly accessing and indirectly accessing the first node. In the possible implementation manner, a method is provided for acquiring information of all workstations directly accessing and indirectly accessing the first node when the first node is used as a root node, so that the reasonability of the proportion of air interface resources allocated to the second node by the first node can be ensured, and the scheduling effect and the user experience are improved.
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 obtaining, by the first node, information of all workstations directly accessing and indirectly accessing the first node includes: the first node receives scheduling indication information sent by the root node, wherein the scheduling indication information is used for indicating information of all workstations directly accessed to and indirectly accessed to the first node; and the first node acquires the information of all the workstations directly accessed to and indirectly accessed to the first node according to the scheduling indication information. In the possible implementation manner, the first node may obtain information of all workstations directly accessing and indirectly accessing the first node through the root node, so that the reasonability of the proportion of air interface resources allocated by the first node to the workstations directly accessing the first node and the second node can be ensured, and the scheduling effect and the user experience are improved.
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 sends information of a workstation directly accessed to the first node to a root node; or the first node sends a second learning message to a superior node of the first node, where the second learning message is a message sent by the first node and used for MAC address learning of the superior node of the first node. In the possible implementation manner, the first node may send information of the workstation directly accessing the first node to the root node or send the information to the upper node of the first node through the second learning packet, so that the root node or the upper node of the first node may obtain the information of the workstation accessing the first node.
With reference to any one of the first aspect to the sixth possible implementation manner of the first aspect, in a seventh possible implementation manner of the first 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: the priority of the workstation, the service set identifier corresponding to the workstation, and the priority of the service set identifier corresponding to the workstation. In the possible implementation manners, information of several possible workstations is provided, so that when the proportion of the air interface resources of each workstation is uniformly distributed according to the information, the reasonability of the proportion distribution of the air interface resources can be improved, and the scheduling effect and the user experience are further improved.
In a second aspect, a node is provided, where the node is a first node in a WiFi network, the WiFi network further includes a second node directly cascaded with the first node, the second node is a subordinate node of the first node, and the first node includes: the system comprises an acquisition unit, a processing unit and a processing unit, wherein the acquisition unit is used for acquiring information of all workstations directly accessing and indirectly accessing a first node; the allocation unit is used for uniformly allocating the proportion of the air interface resources of each workstation according to the information of all workstations accessed to the first node; and the allocation unit is further used for allocating air interface resources to the second node according to the sum of the air interface resource proportions of all the workstations directly accessed to the second node and all the workstations indirectly accessed to the second node.
With reference to the second aspect, in a first possible implementation manner of the second aspect, the obtaining unit is specifically configured to: and receiving the information of all the workstations which are directly accessed to the second node and indirectly accessed to the second node and 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, information of all workstations directly accessing and indirectly accessing the second node is carried in a first learning message, and the first learning message is a message sent by the second node and used for the first node to perform MAC address learning.
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 a 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 obtaining unit is specifically configured to: receiving information of a workstation directly accessing each node, which is sent by each node in a WiFi network; and summarizing the information of the workstations directly accessing each node to acquire the information of all the workstations directly accessing and indirectly accessing 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 obtaining unit is specifically configured to: receiving scheduling indication information sent by a root node, wherein the scheduling indication information is used for indicating information of all workstations directly accessing and indirectly accessing a first node; and acquiring information of all workstations directly accessing and indirectly accessing the first node according to the scheduling indication information.
With reference to the third possible implementation manner 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 send information of a workstation directly accessed to a first node to a root node; or, the sending unit is configured to send a second learning packet to a higher-level node of the first node, where the second learning packet is a packet sent by the first node and used for MAC address learning of the higher-level node of the first node.
With reference to any one of the second aspect to the sixth possible implementation manner of the second aspect, in a seventh possible implementation manner of the second 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: the priority of the workstation, the service set identifier corresponding to the workstation, and the priority of the service set identifier corresponding to the workstation.
In a third aspect, a node is provided, where the node includes a memory, a processor, a bus, and a communication interface, where the memory stores codes and data, the processor is connected to the memory through the bus, and the processor runs the codes in the memory to enable the node to execute the scheduling method provided in any one of the first to seventh possible implementation manners of the first aspect.
In a fourth aspect, a system is provided, where the system includes a first node and a second node directly cascaded with the first node, and the second node is a subordinate node of the first node; the first node is a node provided in any one of the second aspect to the seventh possible implementation manners of the second aspect, or a node provided in the third aspect.
Yet another aspect of the present application provides a computer-readable storage medium having stored therein instructions, which when executed on a computer, cause the computer to perform the method of the above-described aspects.
Yet another aspect of the present application provides a computer program product containing instructions which, when run on a computer, cause the computer to perform the method of the above-described aspects.
It is understood that the apparatus, the computer storage medium, or the computer program product of any of the scheduling methods provided above are all configured to execute the corresponding methods provided above, and therefore, the beneficial effects achieved by the apparatus, the computer storage medium, or the computer program product may refer to the beneficial effects in the corresponding methods provided above, and are not described herein again.
Drawings
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 invention;
fig. 4 is a schematic structural diagram of an access point device according to an embodiment of the present invention;
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 station of an access node according to an embodiment of the present invention;
fig. 7 is a schematic structural diagram of another WiFi network provided in the embodiment of the present invention;
fig. 8 is a schematic structural diagram of a first node according to an embodiment of the present invention;
fig. 9 is a schematic structural diagram of another first node according to an embodiment of the present invention.
Detailed Description
Before describing the embodiments of the present invention, first, terms related to the embodiments of the present invention will be described.
An Access Point (AP) refers to a wireless access point, which may also be referred to as a wireless AP, and is an access point of a wireless network and is also a core of the wireless network. In a wireless network, the main functions of an AP are represented by the following aspects: management of mobile stations in a cell, including processing of connection, authentication, and the like of the mobile stations; completing the bridging process of the data frame from the wired network to the BSS, and realizing the address filtering and address learning functions; completing the switching management of the mobile station among different BSSs; simple network management functions, etc. In addition, the AP may be used as a wireless network extension, and may be connected to other APs to extend the coverage of the wireless network. Wireless APs are used primarily in broadband homes, inside buildings, and inside parks, where range coverage can range from tens of meters to hundreds of meters. The access point equipment can be a wireless router, the wireless router mainly comprises route switching access integrated equipment and pure access point equipment, the integrated equipment executes access and routing work, and the pure access equipment is only responsible for access of the wireless client.
In the embodiment of the present invention, the 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 a main AP in a WiFi network with distributed coverage, a lower level of the main AP may be cascaded with one or more APs, but no cascaded AP exists at an upper level of the main AP. The slave node refers to a slave AP in the WiFi network with distributed coverage, and the slave AP refers to any other AP except the master AP in the WiFi network with distributed coverage. In the embodiment of the present invention, a cascading hierarchy of APs included in a WiFi network with distributed coverage may be defined, specifically, the cascading hierarchy of a master AP may be defined as a first level, the cascading hierarchy of a slave AP directly cascaded with the master AP is defined as a second level, the cascading hierarchy of a slave AP directly cascaded with the slave AP of the second level is defined as a third level, and so on.
A Station (STA), which may also be referred to as a mobile station, refers to a device carrying a wireless network interface card (e.g., a wireless network card). In the embodiment of the present invention, the present invention refers to a terminal device connected to an AP, that is, a wireless client accessing to the AP.
The Service Set Identifier (SSID) technology can divide a wireless local area network into several sub-networks requiring different authentication, each sub-network requires independent authentication, and only users who pass authentication can enter the corresponding sub-network, thereby preventing unauthorized users from entering the local network. If the SSID may not be broadcast for security, the user may manually set the SSID to enter the corresponding subnet. In brief, the SSID is the name of a local area network, and only devices set to the same SSID name can communicate with each other.
Fig. 3 is a schematic structural diagram of a WiFi network according to an embodiment of the present invention, and 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 STA accessing the multiple APs. The plurality of APs included in the WiFi network may be completely connected in a WiFi manner, or there may be some APs connected in a wired manner, and fig. 3 illustrates an example where the plurality of APs are completely connected in a WiFi manner.
In fig. 3, taking an example that a plurality of APs includes R, A, B, C and D, where R is a root node, A, B, C and D are slave nodes, which may also be referred to as lower nodes of R, and their cascade relationship is shown in fig. 3. In fig. 3, for example, the workstations STA accessing the plurality of APs include 10 (i.e., S1 to S10), and the access relationships are as shown in fig. 3, where S1 and S2 access R, S3, S4 access A, S5, S6 access B, S7 and S8 access C, and S9 and S10 access D. The service set corresponding to S1, S3, S5, S7 and S9 is identified as SSID1, and the service set corresponding to S2, S4, S6, S8 and S10 is identified as SSID 2.
Fig. 4 is a schematic structural diagram of an access point device according to an embodiment of the present invention, and referring to fig. 4, the access point device may include a processor, a memory, a communication interface, and a bus, where the memory and the communication interface are connected to the processor through the bus.
The processor is configured to perform various functions of the ap device, and may include one or more modules, such as a Central Processing Unit (CPU), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), and the like. The memory may be used to store data, software programs, and modules, and may be implemented by any type of volatile or non-volatile memory or combination thereof, and is illustrated in fig. 4 as examples of memory including Flash memory (Flash) and Synchronous Dynamic Random Access Memory (SDRAM). Flash can be used for storing programs and configuration data, and SDRAM can provide temporary storage space for program operation and data processing. The communication interface is used to support the access point device to communicate with other devices, and the access point device is used as a bridge for connecting the distributed system (e.g., ethernet) and the wireless network, and needs to communicate with other nodes on the wireless network through the wireless interface of the WLAN on the one hand, and needs to communicate with other nodes in the distributed system on the other hand. In fig. 4, the communication interface of the access point device is implemented by a wired network card and a WLAN network card to support the 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 invention, which is applied in a WiFi network, where the WiFi 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, and referring to fig. 5, the method includes the following steps.
Step 201: the first node obtains information of all workstations directly accessing and indirectly accessing the first node.
In the WiFi network, the first node may refer to any node in which a subordinate node exists, and the second node refers to a node in the subordinate node that is directly cascaded with the first node and has a higher cascade level than the first node. For example, as in the WiFi network shown in fig. 3, the first node may be either R, B or C, and the lower node of R may include A, B, C and D, the lower node of B may include C and D, and the lower node of C may include D. Taking the first node as R as an example, the first node is directly cascaded with R, and the lower nodes at one more stage of the cascade hierarchy are a and B, that is, the second node is a or B.
In addition, a station directly accessing the first node means a station directly accessing the first node. The workstation indirectly accessing the first node refers to a workstation accessing through a subordinate node directly cascaded with the first node, and the workstation accessing through the subordinate node includes a workstation directly accessing and a workstation indirectly accessing each subordinate node. All stations directly accessing and indirectly accessing the first node may be referred to as all stations accessing the first node.
With reference to the WiFi network structure shown in fig. 3, as shown in fig. 6, if the first node is R, the lower nodes directly cascaded with R are a and B. The workstations directly accessing the R are S1 and S2, the workstations accessing the A only comprise workstations S3 and S4 directly accessing, the workstations accessing the B comprise workstations directly accessing and indirectly accessing, the workstations directly accessing the B comprise workstations S5 and S6, and the workstations indirectly accessing the B comprise workstations S7, S8, S9 and S10, so that all the workstations accessing the R are S1-S10. If the first node is B, the lower node directly cascaded with B is C, the workstations directly accessed to B are S5 and S6, and the workstations directly accessed to C and indirectly accessed to C are S7-S10, so that all the workstations accessed to B are S5-S10. If the first node is C and the lower node directly cascaded with C is D, the workstations directly accessed to C are S7 and S8, and the workstations directly accessed to D are S9 and S10, so that all the workstations accessed to C are S7 to S10.
Further, the information of the workstation may include a workstation identification for uniquely identifying the workstation. Further, the information of the workstation may further include at least one of the following information: the priority of the workstation, the service set identifier corresponding to the workstation, and the priority of the service set identifier corresponding to the workstation. The workstation priority refers to a priority corresponding to the workstation, and may be a priority divided according to a user level or a user authority range. The service set identifier corresponding to the workstation refers to the identifier of the sub-network corresponding to the workstation. The priority of the service set identifier corresponding to the workstation is the priority of the identifier of the sub-network corresponding to the workstation, and may be a priority divided according to the importance of the sub-network, the authority range, or the like.
Step 202: the first node uniformly allocates the proportion of the air interface resources of each workstation according to the information of all workstations accessed to the first node.
When the first node acquires the information of all the workstations accessed to the first node, the first node may uniformly allocate, according to the information of all the workstations accessed to the first node, a proportion of air interface resources to each of all the workstations accessed to the first node, where the air interface resources may refer to air transmission time. Specifically, if the information of the workstation includes the workstation identifier, the first node may determine, according to the workstation identifier, the total number of all workstations accessing the first node, so as to averagely allocate, according to the total number, the air interface resource proportion to each workstation. For example, as shown in fig. 3, in the WiFi network, 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 the proportion of air interface resources averagely allocated to the workstations accessing R from S1 to S10 may be 1/10.
If the information of the workstations further includes the priority of the workstations, the first node may allocate a corresponding proportion of air interface resources to each workstation according to the priority of each workstation accessed by the first node and the total number of all workstations accessed by the first node. The priority of the workstation may include two or more levels of division, and for the workstation with a higher priority, the proportion of the air interface resources allocated by the first node may be higher than the proportion of the air interface resources allocated to the workstation with a lower priority. For example, as shown in fig. 3, in the WiFi network, if the first node is C, the identities of all workstations accessed by C include S7-S10, and the priorities corresponding to S7 and S9 are higher than the priorities of S8 and S10, the air interface resource proportions allocated by C to S7 and S9 are 3/10, and the air interface resource proportions allocated to S8 and S10 are 1/5, respectively.
If the information of the workstation further includes service set identifiers SSID corresponding to the workstations, the first node may determine, according to SSIDs corresponding to all workstations accessed to the first node, the number of workstations corresponding to each SSID, so as to configure an air interface resource ratio for each SSID according to the number of workstations under each SSID, and for multiple workstations under the same SSID, may determine the air interface resource ratio of each workstation by an average allocation method. For example, as shown in the WiFi network shown in fig. 3, if the first node is R, the identifiers of all the workstations accessed by R include SSIDs S1 to S10, SSIDs corresponding to S1, S3, S5, S7, and S9 are SSID1, and SSIDs corresponding to S2, S4, S6, S8, and S10 are SSID2, the proportion of air interface resources that the first node can allocate to the SSIDs 1 and 2 is 1/2, and thus the proportion of air interface resources determined by the average allocation method for S1, S3, S5, S7, and S9, and S2, S4, S6, S8, and S10 are all 1/10.
If the information of the workstation further includes the SSID corresponding to the workstation and the priority of the SSID corresponding to the workstation, the first node may allocate the SSID according to the number of SSIDs, the priority of each SSID, and the number of workstations under each SSID when allocating an air interface resource ratio to each SSID. The SSID priority may include two or more levels of division, and for an SSID with a higher priority, the proportion of air interface resources allocated by the first node may be higher than the proportion of air interface resources allocated to an SSID with a lower priority. For example, as shown in fig. 3, in a WiFi network, if a first node is R, identifiers of all workstations accessed by R include SSIDs S1 to S10, SSIDs corresponding to S1, S3, S5, S7, and S9 are SSID1, SSIDs corresponding to S2, S4, S6, S8, and S10 are SSID2, and the priority of SSID1 is higher than that of SSID2, the first node may allocate air interface resources to SSID1 in a ratio of 3/5 and allocate air interface resources to SSID2 in a ratio of 2/5, so that air interface resources determined by average allocation methods of S1, S3, S5, S7, and S9 in a ratio of 3/25, and air interface resources determined by average allocation methods of S2, S4, S6, S8, and S10 in a ratio of 2/25.
If the information of the workstation includes 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, when allocating the air interface resource proportion to all the workstations accessing the first node, the air interface resource proportion to all the workstations accessing the first node according to the priority of each workstation of the first node, the total number of the SSIDs corresponding to the workstations, the priority of each SSID, and the number of the workstations under each SSID. For the workstations under the same SSID priority, the proportion of the air interface resources allocated by the workstations with higher priority is higher than that allocated by the workstations with lower priority. For the SSIDs with the same total number and priority of the workstations, the proportion of the air interface resources allocated by the SSID with the higher priority is higher than that allocated by the SSID with the lower priority.
Step 203: and the first node allocates air interface resources for the second node according to the sum of the air interface resource proportions of all the workstations directly accessed to the second node and all the workstations indirectly accessed to the second node.
After the first node allocates the air interface resource proportions to all the workstations accessing the first node, for a second node in a subordinate node directly cascaded with the first node, the first node may be an air interface resource proportion corresponding to the second node according to a sum of the air interface resource proportions of all the workstations directly accessing and indirectly accessing the second node. Furthermore, the first node may schedule the data of the second node according to the air interface resource proportion corresponding to the second node. Meanwhile, the first node may also schedule data of the workstation directly accessed to the first node according to an air interface resource proportion of the workstation directly accessed to the first node.
For example, as shown in fig. 3, in the WiFi network, if the first node is R, the workstation accessing the a includes S3 and S4, the workstation accessing the B includes S5 to S10, and the air interface resource proportion of each workstation in S3 to S10 is 1/10, the air interface resource proportion corresponding to a determined by R is 1/5, the air interface resource proportion corresponding to B is 3/5, and the air interface resource proportions of S1 and S2 directly accessing R are all 1/10, then the first node may schedule the first node according to the respective corresponding air interface resource proportions in S1, S2, a, and B.
Further, when there is a wired connection in the WiFi network, for example, the WiFi network shown in fig. 7, B and D are connected in a wired manner, and when B allocates an air interface resource proportion to each workstation in a unified manner according to information of all accessed workstations, B does not need to consider the workstations S9 and S10 directly accessed to D, that is, B does not need to allocate an air interface resource proportion to the workstations S9 and S10. However, when R allocates the air interface resource proportion for each accessed workstation according to the information of all accessed workstations, R needs to allocate the air interface resource proportion for the workstations S9 and S10 directly accessed to D, and when allocating the corresponding air interface resource proportion for B, it allocates the sum of the air interface resource proportions of the workstations S5 to S10 as the air interface resource proportion corresponding to B.
That is, when scheduling according to the method provided by the embodiment of the present invention, if the first node has lower nodes directly cascaded in a wired manner, the first node does not need to consider information of all workstations accessed to the first node when acquiring the information of all workstations accessed to the first node. If a node connected by a wired method exists in a subordinate node directly cascaded with a first node, when determining information of all workstations directly accessed to the subordinate node, information of all workstations indirectly accessed to the subordinate node is taken into account, and it is not necessary to distinguish whether a node connected to a workstation indirectly accessed to the subordinate node is connected by a wired method or a wireless method.
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 in the WiFi network. When the first node obtains the information of all workstations accessing the first node through the step 201, the first node may be implemented by following several different methods, which are described in detail below.
The first method, according to a topology structure of a WiFi network, for a first node to obtain information of all workstations accessing the first node by a step-by-step reporting method, specifically includes: step a 1-step a 2. In the first method, the first node may be a root node or a slave node.
Step a 1: the first node receives the information of all the workstations which are directly accessed to the second node and indirectly accessed to the second node and are 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 which are accessed by the second node to the first node after acquiring the information of all the workstations which are directly accessed and indirectly accessed by the second node, and the first node receives the information of all the workstations which are accessed by the second node and sent by the second node, so that the first node acquires the information of all the workstations which are accessed by the second node. When the second node acquires the information of all the workstations directly and indirectly accessed by the second node, the information of the workstation directly accessed by the second node can be directly determined, and the information of the workstation indirectly accessed by the second node can also be acquired in a step-by-step reporting mode.
It should be noted that, if the second node does not have the workstation indirectly accessing the second node, the first node receives the information of all the workstations accessing the second node sent by the second node, and only includes the information of the workstations directly accessing the second node.
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 with the first node. When the first node acquires the information of all the workstations indirectly accessed thereto, each node in the lower node directly cascaded by the first node may send the information of all the workstations accessed thereto to the first node by the method described in the above step a1, so that the first node acquires the information of all the workstations indirectly accessed to the first node.
For example, as shown in fig. 3, with the first node as R, the lower nodes directly cascaded with R as a and B, and the workstations directly accessing a as S3 and S4, a may directly determine the information of the workstations S3 and S4 and report it to R. The workstations directly accessed to the B are S5 and S6, the C can directly determine the information of the workstations S5 and S6, the workstations indirectly accessed to the C are S7 to S10, the D reports the information of the workstations S9 and S10 directly accessed to the C, the C can report the information of the workstations S7 to S10 to the B after acquiring the information of the workstations S9 and S10, the B acquires the information of all the workstations directly accessed to the B and reports the information of all the workstations S5 to S10 accessed to the R.
Step a 2: the first node determines the information of all the workstations accessed to the first node according to the information of the workstations directly accessed to the first node and the information of the workstations indirectly accessed to the first node.
When the first node acquires the information of the workstation indirectly accessed to the first node, the first node may determine the information of the workstation indirectly accessed to the first node and the information of the workstation directly accessed to the first node as the information of all the workstations accessed to 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 determines the information of all the workstations accessing R to be S1 to S10 according to the information of all the workstations accessing a, S3 and S4, the information of all the workstations accessing B, S5 to S10, and the information of the workstations directly accessing R, S1 and S2.
Secondly, if the first node is a root node, the first node obtains information of all workstations directly accessed to and indirectly accessed to the first node, and the method specifically includes: step b1 to step b 2.
Step b 1: the first node receives information of workstations directly accessing the node, which is sent by each node except the first node in the WiFi network.
When the first node is a root node, the first node can maintain the topological structure of the WiFi network, and each node included in the slave nodes in the WiFi network can send the information of the workstation directly accessed by the slave node to the first node, so that the first node can acquire the information of all workstations directly accessed by the slave node.
Step b 2: the first node collects the information of the workstations directly accessing each node to obtain the information of all the workstations accessing the first node.
When the first node receives information of a workstation directly accessing to the first node, which is sent by each node except the first node in the WiFi network, the first node may summarize the information of the workstation directly accessing to each node and the information of the workstation directly accessing to the first node according to the topology structure, so as to obtain information of all workstations directly accessing to the first node, indirectly accessing to the first node, and each node in the slave nodes.
For example, taking fig. 3 as an example, R is a root node, A, B, C and D are slave nodes, A, B, C and D respectively send information of workstations directly accessed by R to R, and R summarizes the received information of workstations according to the topology structure of the WiFi network to obtain information of all workstations accessing to each node in A, B, C and D. As shown in table 1 below, the root node R summarizes the information of all workstations accessing each node.
TABLE 1
It should be noted that the information of all workstations accessing each node shown in table 1 is only exemplary, and table 1 is not limited to the embodiment of the present invention.
Thirdly, if the first node is a slave node, the first node obtains information of all workstations directly accessing and indirectly accessing the first node, which may specifically include: steps c1-c 2.
Step c 1: the first node receives scheduling indication information sent by the root node, wherein the scheduling indication information is used for indicating information of all workstations directly accessing and indirectly accessing the first node.
Step c 2: and the first node acquires the information of all the workstations directly accessed to and indirectly accessed to the first node according to the scheduling indication information.
When the first node is a slave node, the root node may obtain information of all workstations directly and indirectly accessing each node in the WiFi network according to the second method, so that the root node may send scheduling indication information to the first node, and when the first node receives the scheduling indication information, the first node may determine information of all workstations directly and indirectly accessing the first node according to the scheduling indication information.
In addition, before the slave node in the WiFi network acquires information of all workstations accessing the first node through the third method, the method may further include: the first node sends information of the workstation directly accessed to the first node to the root node.
Further, in step a1 of the first method, information of all workstations directly accessing and indirectly accessing the second node may be carried in a first learning message, where the first learning message is a message sent by the second node and used for the first node to perform MAC address learning, and the first learning message includes information of all workstations accessing the second node. That is, when the first node obtains the information of the workstation indirectly accessing the first node, the subordinate node directly cascaded with the first node may carry the information of all the workstations directly accessed and indirectly accessed by the subordinate node in the learning message, so that the first node obtains the information of the workstations indirectly accessing the first node through the learning message.
The learning message refers to a message sent by a lower node and used for the upper node to learn an MAC address, and the MAC address of the workstation carried by the learning message can be used as an identifier of the workstation. Further, the information of the workstation carried by the learning message may further include at least one of the following information: the system comprises 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.
With reference to the WiFi network shown in fig. 3, when the information of the workstation carried by the learning packet includes the MAC address and the corresponding SSID, if the first node is R and the lower nodes directly cascaded with R are a and B, the MAC addresses and SSIDs of a and B learned by R are as shown in table 2 below. If the first node is B and the lower node directly cascaded with B is C, the MAC address and SSID of 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 D learned by C are as shown in table 4 below.
TABLE 2
TABLE 3
TABLE 4
The MAC addresses and SSIDs of the respective lower nodes learned by the first node shown in tables 2 to 4 are merely exemplary, and tables 2 to 4 do not limit the embodiment of the present invention.
If the information of the workstation carried in the learning packet sent by the subordinate node of the first node is the MAC address of the workstation of each subordinate node accessing the first node, the tables 2 to 4 correspond to the tables 5 to 7, respectively.
TABLE 5
TABLE 6
TABLE 7
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 tables 5 to 7 do not limit the embodiment of the present invention.
Further, when the WiFi network further includes a third node, and the first node is directly cascaded with the third node and is a lower node of the third node, the method may further include: and the first node sends a second learning message to the third node, wherein the second learning message carries information of all workstations accessed to 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 is used as a subordinate node to which the third node is directly cascaded, and may send a second learning packet to the third node, where the second learning packet carries information of all workstations accessing the first node, so that the third node obtains information of all workstations accessing the third node according to the method.
In the embodiment of the present invention, the first node may obtain information of the workstations accessing the first node through the several different methods, so that when allocating the air interface resource proportion, the information of all workstations directly accessing and indirectly accessing the first node may be combined to uniformly allocate the air interface resource proportion to each workstation accessing the first node, and the air interface resource is allocated to the second node according to the sum of the air interface resource proportions of all workstations directly accessing and indirectly accessing the second node, thereby ensuring fairness and rationality of the air interface resource proportions of the workstations directly accessing the first node and the workstations indirectly accessing the first node, and further improving scheduling effect and user experience of the first node.
The above-mentioned scheme provided by the embodiment of the present invention is introduced mainly from the perspective of interaction between network elements. It is to be understood that each network element, such as the first node, the second node, the third node, the root node, etc., contains corresponding hardware structures and/or software modules for performing each function in order to realize the functions. Those of skill in the art will readily appreciate that the present invention can be implemented in hardware or a combination of hardware and computer software for performing the exemplary network elements and algorithm steps described in connection with the embodiments disclosed herein. Whether a function is performed as hardware or computer software drives hardware depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.
In the embodiment of the present invention, the first node may be divided into functional modules according to the above method example, for example, each functional module may be divided corresponding to each function, or two or more functions may be integrated into one processing module. The integrated module can be realized in a hardware mode, and can also be realized in a software functional module mode. It should be noted that, the division of the modules in the embodiment of the present invention is schematic, and is only a logic function division, and there may be another division manner in actual implementation.
In the case of dividing the functional modules by corresponding functions, fig. 8 shows a possible structural diagram of the first node involved in the foregoing embodiment, and the first node 300 includes: an acquisition unit 301 and an allocation unit 302. Wherein, the obtaining unit 301 is configured to execute step 201 in fig. 5; the allocation unit 302 is configured to perform step 202 and step 203 in fig. 5. Further, the first node 300 may further comprise a sending unit 303. The sending unit 303 is configured to send information of a workstation directly accessing to the first node to the root node, or is configured to send information of all workstations accessing to the first node to a higher node of the first node, or is configured to send the second learning packet to the higher node of the first node. All relevant contents of each step related to the above method embodiment may be referred to the functional description of the corresponding functional module, and are not described herein again.
In a hardware implementation, the allocating unit 302 may be a processor, the obtaining unit 301 may be a receiver, the sending unit 303 may be a sender, and the sender and the receiver may form a communication interface.
Fig. 9 is a schematic diagram of a possible logical structure of the first node 310 according to the foregoing embodiments, according to an 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 each other by a bus 314. In an embodiment of the invention, processor 312 is configured to control and manage the actions of first node 310, e.g., processor 312 is configured to perform steps 202 and 203 of fig. 5, and/or other processes for the techniques described herein. The communication interface 313 is used to support the first node 310 for communication. A memory 311 for storing program codes and data of the first node 310.
In another embodiment of the present invention, a computer-readable storage medium is also provided, in which computer-executable instructions are stored, and when the computer-executable instructions are executed by at least one processor of a device, the device executes the scheduling method shown in fig. 5.
In another embodiment of the present invention, there is also provided a computer program product comprising computer executable instructions stored in a computer readable storage medium; the computer executable instructions may be read by the at least one processor of the device from a computer readable storage medium and executed by the at least one processor to cause the device to implement the scheduling method illustrated in fig. 5.
In the embodiment of the invention, the first node allocates the air interface resource for the second node according to the sum of the air interface resource proportions of all the workstations directly accessed to the first node and indirectly accessed to the second node by acquiring the information of all the workstations directly accessed to the first node and indirectly accessed to the first node and uniformly allocating the air interface resource proportion of each workstation, thereby ensuring the fairness and rationality of the air interface resource proportions of the workstations directly accessed to the first node and the workstations indirectly accessed to the first node, and further improving the scheduling effect and the user experience of the first node.
Finally, it should be noted that: the above description is only an embodiment of the present application, but the scope of the present application is not limited thereto, and any changes or substitutions within the technical scope of the present disclosure should be covered by the scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.
Claims (15)
1. A scheduling method applied to a Wi-Fi network, wherein the Wi-Fi network comprises a first node and a second node directly cascaded with the first node, and the second node is a subordinate node of the first node, the method comprising:
the first node acquires information of all workstations directly accessing and indirectly accessing the first node, wherein the first node is a root node or a slave node in the Wi-Fi network, the information of the workstations at least comprises a workstation identification, the workstations directly accessing the first node comprise the workstations directly accessing through the first node, and the workstations indirectly accessing the first node comprise the workstations accessing through a lower node which is in one-layer cascade connection or multi-layer cascade connection with the first node;
the first node uniformly allocates the proportion of air interface resources of each workstation according to the information of all workstations accessed to the first node;
and the first node allocates air interface resources to the second node according to the sum of the air interface resource proportions allocated to all workstations which are directly accessed and indirectly accessed to the second node.
2. The method of claim 1, wherein the first node obtains information of all workstations directly accessing and indirectly accessing the first node, comprising:
and the first node receives the information of all the workstations which are directly accessed and indirectly accessed to the second node and sent by the second node.
3. The method according to claim 2, wherein information of all workstations directly accessing and indirectly accessing the second node is carried in a first learning message, and the first learning message is a message sent by the second node and used for MAC address learning of the first node.
4. The method of claim 1, wherein if the first node is the root node, the first node obtains information of all workstations directly accessing and indirectly accessing the first node, comprising:
the first node receives information of a workstation directly accessing to the node, which is sent by each node in the Wi-Fi network;
the first node collects the information of the workstations directly accessed to each node to acquire the information of all the workstations directly accessed to and indirectly accessed to the first node.
5. The method of claim 1, wherein if the first node is the slave node, the first node obtains information of all workstations directly accessing and indirectly accessing the first node, comprising:
the first node receives scheduling indication information sent by the root node, wherein the scheduling indication information is used for indicating information of all workstations directly accessed to the first node and workstations indirectly accessed to the first node;
and the first node acquires the information of all the workstations directly accessed to and indirectly accessed to the first node according to the scheduling indication information.
6. The method of claim 1, wherein if the first node is the slave node, the method further comprises:
the first node sends information of a workstation directly accessed to the first node to the root node; alternatively, the first and second electrodes may be,
the first node sends a second learning message to a superior node of the first node, wherein the second learning message is a message sent by the first node and used for MAC address learning of the superior node of the first node.
7. The method of claim 1, wherein the information of the workstation further comprises at least one of: the priority of the workstation, the service set identifier corresponding to the workstation, and the priority of the service set identifier corresponding to the workstation.
8. A node, for use in a Wi-Fi network, the node being a first node, the Wi-Fi network further comprising a second node directly cascaded with the first node, the second node being a subordinate node of the first node, the first node comprising:
an obtaining unit, configured to obtain information of all workstations directly accessing and indirectly accessing the first node, where the first node is a root node or a slave node in the Wi-Fi network, the information of the workstations at least includes a workstation identifier, the workstations directly accessing the first node include workstations directly accessed through the first node, and the workstations indirectly accessing the first node include workstations accessed through lower nodes layer-cascaded or layer-cascaded with the first node;
the allocation unit is used for uniformly allocating the proportion of the air interface resources of each workstation according to the information of all workstations accessed to the first node;
the allocating unit is further configured to allocate air interface resources to the second node according to a sum of the air interface resource proportions allocated to all workstations directly accessing and indirectly accessing the second node.
9. The node according to claim 8, wherein the obtaining unit is specifically configured to:
and receiving information of all workstations directly accessing and indirectly accessing the second node, which is sent by the second node.
10. The node according to claim 9, wherein information of all workstations directly accessing and indirectly accessing the second node is carried in a first learning message, and the first learning message is a message sent by the second node and used for MAC address learning of the first node.
11. The node according to claim 8, wherein if the first node is the root node, the obtaining unit is specifically configured to:
receiving information of a workstation directly accessing each node, which is sent by each node in the Wi-Fi network;
and summarizing the information of the workstations directly accessing each node to acquire the information of all the workstations directly accessing and indirectly accessing the first node.
12. The node according to claim 8, wherein if the first node is the slave node, the obtaining unit is specifically configured to:
receiving scheduling indication information sent by the root node, wherein the scheduling indication information is used for indicating information of all workstations directly accessing and indirectly accessing the first node;
and acquiring information of all workstations directly accessing and indirectly accessing the first node according to the scheduling indication information.
13. The node of claim 8, 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 to the first node to the root node; alternatively, the first and second electrodes may be,
the sending unit is configured to send a second learning packet to a higher-level node of the first node, where the second learning packet is a packet sent by the first node and used for MAC address learning of the higher-level node of the first node.
14. A node, characterized in that the node comprises a memory, a processor, a bus and a communication interface; wherein the memory stores code and data, the processor is connected with the memory through the bus, and the processor executes the code in the memory to make the node execute the scheduling method of any one of the above claims 1 to 7.
15. A system comprising a first node, and a second node directly cascaded with the first node, the second node being a subordinate node of the first node; wherein the first node is a node according to any of the preceding claims 8-14.
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| PCT/CN2017/079626 WO2018184176A1 (en) | 2017-04-06 | 2017-04-06 | Method, device and system for scheduling |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109804693A CN109804693A (en) | 2019-05-24 |
| CN109804693B true CN109804693B (en) | 2021-08-13 |
Family
ID=63712976
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201780063020.5A Active CN109804693B (en) | 2017-04-06 | 2017-04-06 | Scheduling method, device and system |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN109804693B (en) |
| WO (1) | WO2018184176A1 (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111010713B (en) * | 2019-12-17 | 2022-09-27 | 烽火通信科技股份有限公司 | Data transmission method and system |
Family Cites Families (15)
| 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 (en) * | 2007-04-03 | 2012-11-14 | 中兴通讯股份有限公司 | Self-adaption management method for wireless transmission network containing base station and wireless relay station |
| US7907562B2 (en) * | 2007-06-20 | 2011-03-15 | Microsoft Corporation | Managing dense wireless access point infrastructures in wireless local area networks |
| KR100891757B1 (en) * | 2007-07-26 | 2009-04-07 | 엘지노텔 주식회사 | Method and apparatus for providing neighborhood ap information in a wlan system |
| WO2014032733A1 (en) * | 2012-08-31 | 2014-03-06 | Huawei Technologies Co., Ltd. | Method for energy saving in a communication system |
| TWI651985B (en) * | 2013-05-02 | 2019-02-21 | 內數位專利控股公司 | Discovery, transmit opportunity (txop) operation and flow ?control for range extension in wifi |
| CN104185188B (en) * | 2013-05-27 | 2017-11-24 | 华为技术有限公司 | Disturb processing method and equipment |
| KR101733630B1 (en) * | 2013-05-31 | 2017-05-10 | 노키아 솔루션스 앤드 네트웍스 오와이 | Method and apparatus for configuring scheduling periods based on information about the mode of operation |
| WO2015039311A1 (en) * | 2013-09-18 | 2015-03-26 | 华为技术有限公司 | Method and apparatus for establishing interface between access points |
| CN105612806A (en) * | 2013-11-06 | 2016-05-25 | Kt株式会社 | Method for transmitting and receiving data in wireless local area network system and apparatus therefor |
| 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) |
| US20180132278A1 (en) * | 2015-04-28 | 2018-05-10 | Interdigital Patent Holdings, Inc. | Methods, apparatus and systems for procedures for carrier sense multiple access and spatial reuse in sub-channelized wireless local area networks (wlans) |
| US20170079044A1 (en) * | 2015-09-10 | 2017-03-16 | Qualcomm Incorporated | Communication resource allocation |
| CN105554093B (en) * | 2015-12-10 | 2018-12-28 | 广州蓝杰网络科技有限公司 | Link method and system between wireless controller and hotspot based on cloud |
| CN106060963B (en) * | 2016-06-28 | 2020-03-06 | 新华三技术有限公司 | Message processing method and device |
-
2017
- 2017-04-06 CN CN201780063020.5A patent/CN109804693B/en active Active
- 2017-04-06 WO PCT/CN2017/079626 patent/WO2018184176A1/en active Application Filing
Also Published As
| Publication number | Publication date |
|---|---|
| CN109804693A (en) | 2019-05-24 |
| WO2018184176A1 (en) | 2018-10-11 |
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 | |
| US20210022042A1 (en) | Information transmission method and apparatus | |
| CN111865830B (en) | Processing method, device and system for time delay sensitive network service TSN | |
| US11490327B2 (en) | Method, device, and system for deploying network slice | |
| US20200288324A1 (en) | Centralized coordination for shared spectrum systems | |
| CN107710826B (en) | Method and device for establishing wireless backhaul connection | |
| CN112203330B (en) | QoS flow control method and communication device | |
| EP3110191A1 (en) | Network sharing method and network element | |
| CN111865633B (en) | Communication method, device and system | |
| WO2014032521A1 (en) | Method and apparatus for spectrum allocation | |
| CN109803351B (en) | Resource allocation method and equipment | |
| WO2021063407A1 (en) | Configuration method, apparatus, and system for radio resource allocation policy | |
| US20200029228A1 (en) | Channel Selection Method and Apparatus | |
| RU2598293C1 (en) | Method and apparatus for transmitting standard configuration data of improved system of selecting a transmitting protocol | |
| CN106455073B (en) | Channel allocation method for security service in electric power wireless private network and central base station | |
| CN109804693B (en) | Scheduling method, device and system | |
| CN117354931A (en) | Resource allocation method, device, equipment and storage medium | |
| US10547510B2 (en) | Assigning network devices | |
| CN111480364B (en) | Access control method, device and readable storage medium | |
| CN113115369B (en) | Resource allocation method and device for network slices | |
| US11652707B2 (en) | Network management system and method | |
| CN112203354B (en) | Service processing method and device | |
| WO2024016801A1 (en) | Base station computing power arrangement method and apparatus, electronic device and storage medium | |
| CN116233910A (en) | Network resource management method, device, equipment and storage medium | |
| CN117676916A (en) | Communication resource management method, device, system and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |