WO2023160365A1 - 一种调度方法、系统及装置 - Google Patents

一种调度方法、系统及装置 Download PDF

Info

Publication number
WO2023160365A1
WO2023160365A1 PCT/CN2023/074646 CN2023074646W WO2023160365A1 WO 2023160365 A1 WO2023160365 A1 WO 2023160365A1 CN 2023074646 W CN2023074646 W CN 2023074646W WO 2023160365 A1 WO2023160365 A1 WO 2023160365A1
Authority
WO
WIPO (PCT)
Prior art keywords
network node
service
network
scheduling
network nodes
Prior art date
Application number
PCT/CN2023/074646
Other languages
English (en)
French (fr)
Inventor
谌金豆
甘爽
司小书
Original Assignee
华为技术有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 华为技术有限公司 filed Critical 华为技术有限公司
Publication of WO2023160365A1 publication Critical patent/WO2023160365A1/zh

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access
    • H04W74/002—Transmission of channel access control information
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access
    • H04W74/02—Hybrid access

Definitions

  • the embodiments of the present application relate to the technical field of optical communication, and in particular, to a scheduling method, system, and device.
  • a wireless fidelity (wireless fidelity, Wi-Fi) channel is usually shared by an access point (access point, AP) and a station (station, STA).
  • the AP and the STA each use a set of enhanced distribution channel access (EDCA) parameters to compete for the Wi-Fi channel and obtain transmission opportunities.
  • EDCA enhanced distribution channel access
  • the AP can adjust EDCA parameters by judging the network status.
  • the probability of multiple devices competing for the Wi-Fi channel at the same time is also increasing.
  • random backoff conflicts may occur, causing packet sending failures, reducing network throughput, and increasing service delays.
  • the embodiments of the present application provide a scheduling method, system and device, which are used to provide a feasible way to avoid random backoff conflicts of the air interface, thereby improving the transmission efficiency of the entire network in the network.
  • the present application provides a scheduling method, the method comprising: the control node receives service information reported by N network nodes respectively, the service information is used to indicate the service data information that the network nodes need to transmit through the channel, the N is a positive integer; the control node determines M network nodes to be scheduled in the current scheduling cycle according to the service information reported by the N network nodes, the M is a positive integer, and the M is less than or equal to the N ; The control node sends a first scheduling message to the M network nodes, where the first scheduling message is used to indicate that the M network nodes are allowed to compete for a channel.
  • centralized control of multiple network nodes can be realized through the control node in the network, and the order in which each network node is allowed to send data can be decided through statistics of service information of each network node.
  • the network nodes scheduled by the control node in each scheduling period are allowed to compete for the channel in the current scheduling period, so that data can be sent through the channel, while the network nodes that are not scheduled need to wait for the scheduling result of the next scheduling period .
  • this method can avoid random backoff conflicts of the air interface, and each network node can realize the orderly transmission of data according to the centralized control of the control node, thereby improving the quality of the network.
  • the transmission efficiency of the entire network can be realized through the control node in the network, and the order in which each network node is allowed to send data can be decided through statistics of service information of each network node.
  • the method further includes: the control node receiving first response messages respectively reported by the M network nodes, where the first response messages are used to instruct the network nodes to compete for a channel; the The control node according to the The first response message and the service information respectively reported by the N network nodes determine the P network nodes to be scheduled in the next scheduling period, the P is a positive integer, and the P is less than or equal to the N; the control The node sends a second scheduling message to the P network nodes, where the second scheduling message is used to indicate that the P network nodes are allowed to compete for a channel.
  • control node can make a timely decision on the scheduling result of the next scheduling cycle according to the status of the competing channels of the M network nodes scheduled in the current scheduling cycle, so that the transmission efficiency of the entire network can be improved through the centralized scheduling control of the control node. performance.
  • the method further includes: the control node updating service information of the network node in at least one of the following ways:
  • the control node receives second response messages reported by the M network nodes respectively, and the second response messages are used to indicate the service information updated by the network node before or after the service data transmission of the current scheduling period is completed;
  • Mode 2 The control node receives the updated service information periodically reported by the N network nodes respectively.
  • control node can obtain the latest business status of the network node in a timely manner according to the latest business information reported by the network node, so as to obtain more accurate decision results and improve the transmission efficiency of the entire network.
  • the service information includes but not limited to at least one of the following information: service type, service flow, service delay, service priority; the control node according to the N network nodes respectively
  • the reported service information determines the M network nodes scheduled in the current scheduling cycle, which can be implemented as follows: if the service information reported by the N network nodes respectively includes the service type, according to the service type and the pre-configured service The type priority determines the priority of the network node; if the service information reported by the N network nodes respectively contains the service flow, the priority of the network node is determined according to the service flow; if the N network nodes respectively report The service information of the N network nodes contains the service delay, and the priority of the network node is determined according to the service delay; if the service information reported by the N network nodes respectively contains the service priority, according to the service priority Determine the priority of the network node; the control node determines M network nodes to be scheduled in the current scheduling period according to the priority of the network node.
  • control node can more accurately decide the order in which the network nodes are scheduled based on the statistical service information of the network nodes, thereby improving the transmission efficiency of the entire network in the network and improving network performance.
  • the method before the control node sends the first scheduling message to the M network nodes, the method further includes: if the control node receives the first request message reported by the first network node, Or, if the control node determines that the service information of the first network node also includes priority request information, then determine that the first network node requests to occupy channels preferentially; wherein, the first request message or the priority request The information is used to request priority occupation of the channel to send or receive the first data; the control node starts the scheduling of the current scheduling period after receiving the first indication message reported by the first network node, and the first The indication message is used to indicate that the first network node has sent or received the first data; or, after receiving the first indication message reported by the first network node, the control node starts the second network node to For the scheduling of the current scheduling period, the second network node and the first network node meet a preset condition; the preset condition includes the following information: the second network node is on the same channel as the first network node , the first
  • the network can also be designed to have special requirements for network nodes to preferentially request to occupy channels, and the control node can implement priority to enable network nodes with priority to occupy channels to transmit services through channels in a timely manner according to the requirements of network nodes. It can avoid problems such as increased delay and decreased network throughput caused by network nodes failing to process services in time, thereby improving the performance of the entire network.
  • the first scheduling message includes the following information: a network node identifier and enabling scheduling information.
  • a network node identifier In this design, through the centralized scheduling of network nodes by control nodes, it is possible to avoid free competition and random The conflict problem caused by backoff, and the transmission efficiency of the entire network can be improved.
  • the service information or the first scheduling message is sent in one of the following ways: custom data frame, Ethernet frame, optical network terminal management control interface OMCI protocol frame.
  • the interactive message between the control node and the network node can be implemented by adding new frames, or by multiplexing existing frames, so that the method provided by this application can be implemented to avoid random backoff conflicts of the air interface .
  • the embodiment of the present application provides a scheduling method, the method comprising: the network node reports service information to the control node, the service information is used to indicate the service data information that the network node needs to transmit through the channel; the network node receiving a first scheduling message sent by the control node, where the first scheduling message is used to indicate that the network node is allowed to compete for a channel; and the network node competes for a channel according to the first scheduling message.
  • the method further includes: the network node reporting a first response message to the control node, where the first response message is used to instruct the network node to compete for a channel.
  • the method further includes: the network node updating service information to the control node in at least one of the following ways:
  • the network node reports a second response message to the control node, where the second response message is used to indicate the service information updated by the network node before or after the service data transmission of the current scheduling period is completed;
  • Mode 2 The network node periodically reports updated service information.
  • the service information includes at least one of the following information: service type, service flow, service delay, and service priority.
  • the method further includes: if the network node detects that there is first data to be sent or received, reporting a first request message to the control node, where the first request message is used for Requesting priority to occupy a channel to send or receive the first data; or, if the network node detects that there is first data to be sent or received, carry priority request information through the service information, and the priority request information is used to request Prioritize the channel to send or receive the first data; after the network node has sent or received the first data, report a first indication message to the control node, the first indication message is used to indicate the network The node has sent or received the first data.
  • the first scheduling message includes the following information: a network node identifier and enabling scheduling information.
  • the service information or the first scheduling message is sent in one of the following ways: custom data frame, Ethernet frame, OMCI protocol frame.
  • the embodiment of the present application provides a scheduling system, the system includes a control node and N network nodes; wherein, the control node can execute the method provided in any possible design of the first aspect above, and each The above network node may execute the method provided in any possible design of the above second aspect.
  • the embodiment of the present application provides a scheduling device, where the device includes a transceiver unit and a processing unit.
  • the functions performed by the transceiver unit and the processing unit may correspond to the steps involved in the control node in any possible design or implementation manner in the first aspect above.
  • the embodiment of the present application provides a scheduling device, where the device includes a transceiver unit and a processing unit.
  • the functions performed by the transceiving unit and the processing unit may correspond to the steps performed by the network node involved in any possible design or implementation manner in the second aspect above.
  • the embodiment of the present application further provides a network device, the network device includes one or more processors, the processors are coupled to a memory, and the memory stores computer program codes, the computer program codes include computer instructions.
  • the processor executes the computer instructions in the memory to execute the method provided in any possible design of the first aspect above.
  • the network device further includes a communication interface, and the processor is coupled to the communication interface.
  • the communication interface may be a transceiver or an input/output interface; when the network device is a chip included in the network device, the communication interface may It is the input/output interface of the chip.
  • the transceiver may be a transceiver circuit, and the input/output interface may be an input/output circuit.
  • the embodiment of the present application further provides a network device, the network device includes one or more processors and a memory, the memory is coupled to the processor, the memory stores computer program codes, and the Computer program code includes computer instructions.
  • the processor executes the computer instructions in the memory to execute the method provided in any possible design of the second aspect above.
  • the network device further includes a communication interface, and the processor is coupled to the communication interface.
  • the communication interface may be a transceiver or an input/output interface; when the network device is a chip included in the network device, the communication interface may be an input/output interface of the chip.
  • the transceiver may be a transceiver circuit, and the input/output interface may be an input/output circuit.
  • the embodiment of the present application further provides a wireless networking system, including the network device provided in the sixth aspect above, and N network devices provided in the seventh aspect above.
  • the embodiment of the present application also provides a computer-readable storage medium, the computer-readable storage medium stores a computer program, and when the computer program is executed by a computer, any possible design of the first aspect The method provided in is implemented, or the method provided in any possible design of the second aspect is implemented.
  • the embodiment of the present application further provides a computer program product, the computer program product including: computer program code, when the computer program code is run by the processor of the network device, the network device is made to execute any one of the above first aspects.
  • the computer program product including: computer program code, when the computer program code is run by the processor of the network device, the network device is made to execute any one of the above first aspects.
  • the embodiment of the present application also provides a chip, which is used to read and execute the software program stored in the memory, so as to realize the method in any possible design of the above-mentioned first aspect, or to realize the above-mentioned second aspect Any one of the possible design methods.
  • the memory may be connected to the chip, or the memory may also be built in the chip.
  • FIG. 1 is a schematic diagram of a possible WLAN network architecture in an embodiment of the present application
  • Fig. 2 is the schematic diagram of EDCA parameter set in the embodiment of the present application.
  • FIG. 3 is a schematic diagram of a possible EDCA parameter configured for the STA side in the embodiment of the present application
  • FIG. 4 is a schematic diagram of a possible contention channel in the embodiment of the present application.
  • FIG. 5A is a schematic diagram of a topological structure of an optical communication system applied to FTTR in an embodiment of the present application
  • FIG. 5B is a schematic diagram of another optical communication system topology using a home network in the embodiment of the present application.
  • FIG. 6 is one of the schematic flowcharts of a possible scheduling method in the embodiment of the present application.
  • FIG. 7A is the second schematic flow diagram of a possible scheduling method in the embodiment of the present application.
  • Figure 7B is an example of the first request message provided by the present application.
  • FIG. 7C is an example of the first indication message provided by this application.
  • Figure 8 is an example of a scheduling message provided by the present application.
  • FIG. 9 is the third schematic flow diagram of a possible scheduling method in the embodiment of the present application.
  • Figure 10 is an example of the first response message provided by the present application.
  • Figure 11 is an example of the second response message provided by the present application.
  • 12A to 12E are examples of Ethernet frames provided by the embodiments of the present application.
  • Figure 13 is an example of the OMCI protocol frame provided by the embodiment of the present application.
  • FIG. 14 is a schematic structural diagram of a scheduling device in an embodiment of the present application.
  • FIG. 15 is a schematic structural diagram of another scheduling device in the embodiment of the present application.
  • FIG. 16 is a schematic structural diagram of a chip provided in an embodiment of the present application.
  • references to "one embodiment”, “an implementation”, “an implementation” or “an example” throughout the specification mean that specific features, structures or characteristics related to the embodiment are included in the scope of the present application. In at least one embodiment. Thus, appearances of "in one embodiment,” “one implementation,” “an implementation,” or “in an example” throughout this specification are not necessarily referring to the same embodiment. Furthermore, the particular features, structures or characteristics may be combined in any suitable manner in one or more embodiments. It should be understood that, in various embodiments of the present application, the sequence numbers of the above-mentioned processes do not mean the order of execution, and the execution order of the processes should be determined by their functions and internal logic, and should not be used in the embodiments of the present application. The implementation process constitutes any limitation.
  • the WLAN network architecture includes a wireless controller (also referred to as a "control node” in this embodiment of the application), a wireless access point (in this embodiment of the application Also referred to as “network nodes”) and end devices.
  • the wireless controller is used to perform service configuration and radio frequency configuration on the access point.
  • the wireless access point may be referred to as an access point (access point, AP) for short.
  • the AP is used to provide service access for associated STAs.
  • a terminal device can associate with an access point.
  • Terminal equipment may include mobile phones (or called “cellular" phones), computers with mobile terminal equipment, portable, pocket, hand-held, and mobile devices built into computers, etc.
  • personal communication service personal communication service, PCS
  • PCS personal communication service
  • cordless telephone session initiation protocol (session initiation protocol, SIP) telephone
  • wireless local loop wireless local loop, WLL
  • PDA personal digital assistant
  • the terminal device may also be a computer, a tablet computer, an e-reader, etc., or may be a smart home device, such as a smart TV, a smart speaker, and the like.
  • the terminal device may also be a wearable device.
  • Wearable devices can also be called wearable smart devices or smart wearable devices, etc., which is a general term for the application of wearable technology to intelligently design daily wear and develop wearable devices, such as glasses, gloves, watches, clothing and shoes wait.
  • a wearable device is a portable device that is worn directly on the body or integrated into the user's clothing or accessories.
  • Wearable devices are not only a hardware device, but also achieve powerful functions through software support, data interaction, and cloud interaction.
  • Generalized wearable smart devices include full-featured, large-sized devices that can achieve complete or partial functions without relying on smartphones. Functions, such as smart watches or smart glasses, etc., and only focus on a certain type of application function, need to be used in conjunction with other devices such as smart phones, such as smart bracelets, smart helmets, smart jewelry, etc. for physical sign monitoring.
  • the Wi-Fi channel is shared by the AP and the STA.
  • the AP and the STA each use a set of enhanced distribution channel access (EDCA) parameters to compete for Wi-Fi channels and obtain transmission opportunities.
  • the configuration of EDCA parameters is determined by the AP.
  • Each AP configures its own EDCA parameters and broadcasts them to each STA accessing the AP.
  • Multiple STAs accessing the same AP need to listen to the same set of EDCA parameters broadcast by the AP.
  • the AP can broadcast EDCA parameters through a beacon (Beacon) frame.
  • the Beacon frame is a periodically triggered management frame defined by the 802.11 WLAN protocol. Beacon frames carry various necessary information in the network.
  • the Beacon frame includes the EDCA parameter set (parameter set) broadcast by the AP to the STA.
  • the Beacon frame may also include the EDCA parameter set used by the AP itself.
  • the EDCA parameter set element (EDCA parameter set element) includes the quality of service (quality of service, QoS) parameter set.
  • QoS parameter set includes STA QoS parameters for different access categories (access category, AC). Access classes may also be referred to as access classes. Access categories include: AC_BE (meaning best effort), AC_BK (meaning background), AC_VI (meaning video) and AC_VO (meaning voice).
  • QoS parameters of each access category i.e., access channel configuration parameters
  • access channel configuration parameters such as the minimum and maximum sizes of the exponential form of contention window (ECM), transmission opportunity (transmission opportunity, TXOP) restrictions, etc.
  • ECM exponential form of contention window
  • TXOP transmission opportunity
  • some multimedia real-time services such as AC_VI, AC_VO type services
  • AC_VI, AC_VO type services can have more opportunities to access channels, thereby reducing the time delay of multimedia real-time services and making The data transmission of the multimedia real-time service is smoother, which improves the user experience.
  • Element ID is the unique ID of an EDCA parameter set element and is used to distinguish it from other elements.
  • Length is the parameter length of the EDCA parameter set element, excluding the element identification and length fields.
  • Quality of service information in this field, also includes a sub-option, the sub-option is the EDCA parameter set update counter (EDCA parameter set update count), used to notify the terminal EDCA parameter set elements whether to change.
  • EDCA parameter set update count used to notify the terminal EDCA parameter set elements whether to change.
  • the EDCA parameter set element also includes a parameter record field of each access category, and each parameter record field defines the QoS parameters when the STA executes the access category, as shown in Figure 2, the parameter record of each access category
  • the fields include AC index (AC index, ACI)/arbitration interframe space number (arbitration interframe space number, AIFSN), exponential contention window, and transmission opportunity (transmission opportunity, TXOP) limit.
  • ACI/AIFSN includes AIFSN.
  • AIFSN indicates the number of time slots to be delayed after the short interframe space (SIFS) when the AP (or STA) accesses the network. The smaller the parameter value, the AP (or STA) is accessing the Wi-Fi channel The waiting time is shorter.
  • ECW is the contention window size of EDCA, and this value determines the size of the average backoff time. The smaller the value, the shorter the average backoff time.
  • the ECW parameter includes the minimum size of ECW (ECWmin) and the maximum size of ECW (ECWmax );
  • the TXOP limit indicates the time limit for the STA to occupy the Wi-Fi channel to transmit data. The larger the value, the longer the STA can continue to occupy the channel.
  • the AP broadcasts the EDCA parameter set elements to the STAs.
  • the EDCA parameter set element includes the QoS parameter set set by the AP for the STA to process each access category.
  • APs configure different QoS parameters for different access categories. For example, configure smaller AIFSN, ECWmin and ECWmax, and larger TxOP for AC_VI and AC_VO that require real-time transmission, and configure larger AIFSN, ECWmin and ECWmax, and smaller TxOP for other access categories, so that AC_VI and AC_VO services have a higher priority when accessing Wi-Fi channels, while other services have lower priorities, Meet the needs of real-time business and obtain a better business experience.
  • a possible EDCA parameter configured for the STA side is shown in FIG. 3 .
  • the STA monitors whether the channel is busy.
  • the AC service with higher priority has a shorter AIFS.
  • the backoff countdown starts.
  • the channel can be preempted first. After preempting the channel, the duration of occupying the channel is determined according to the value of TxOP. Compared with BE and BK, VI and VO services can occupy the channel for a longer time.
  • the AP usually also needs to use the channel to send service data, such as some control information, etc.
  • the current implementation of the AP competing for the channel is similar to the implementation shown by the STA shown in FIG. 4 .
  • the embodiment of the present application provides a scheduling method to provide a feasible way to avoid random backoff conflicts of the air interface, thereby improving the efficiency of data transmission through channels in the wireless network and improving the network performance of the wireless network .
  • the embodiment of the present application may be applicable to a WLAN deployment mode using fiber to the room (FTTR).
  • FTTR fiber to the room
  • an optical fiber is laid to each room, and home gateway interconnection is realized by deploying an edge network device in each room.
  • FTTR can meet the high bandwidth and delay requirements of new business applications such as online education, home office, and home entertainment.
  • the edge network device can be an edge ONT or an AP, that is, it can be used as a network node in a wireless network.
  • a gateway device is deployed to manage edge network devices.
  • the gateway device may be an optical gateway, an ONT or a PON gateway, etc., that is, it may serve as a control node in a wireless network.
  • FIG. 5A is a schematic diagram of a topology structure of an optical communication system applied to FTTR.
  • the optical communication system applied to FTTR includes at least an optical gateway, an optical splitter and a plurality of edge optical network terminals (edge optical network terminal, edge ONT).
  • edge ONT can also be called EDGE ONT, and can also be called Edge ONT.
  • Optical gateways can communicate with multiple EDGE ONTs through optical splitters.
  • An OLT is also included in the optical communication system. The optical gateway is deployed between the OLT and the edge ONT. In the FTTR scenario, the optical gateway is connected to the home information box through FTTH, and connected to each room through an optical splitter.
  • Each room deploys an edge (Edge) ONT, and the optical gateway at the information box performs collaborative management on multiple Edge ONTs .
  • Multiple ONTs under the FTTR architecture are connected to the optical gateway through optical fibers, and the control and management resources do not occupy the Wi-Fi air interface.
  • Terminal equipment can be connected to Edge ONT to realize network communication.
  • FIG. 5B is a schematic topology diagram of another optical communication system applying a home network.
  • An optical communication system includes at least an ONT and multiple APs. The ONT is used for collaborative management of the APs deployed in each room.
  • the optical communication system of the FTTR may adopt a passive optical network (passive optical network, PON).
  • PON can be gigabit-capable PON (GPON), Ethernet passive optical network (ethernet PON, EPON), ten Gigabit Ethernet passive optical network (10Gb/s ethernet passive optical network, 10G-EPON ), time and wavelength division multiplexing passive optical network (TWDM-PON), ten gigabit-capable passive optical network (XG-PON) or ten gigabit Symmetrical passive optical network (10-gigabit-capable symmetric passive optical network, XGS-PON), etc.
  • GPON gigabit-capable PON
  • Ethernet PON Ethernet passive optical network
  • 10G-EPON ten Gigabit Ethernet passive optical network
  • TWDM-PON time and wavelength division multiplexing passive optical network
  • XG-PON ten gigabit-capable passive optical network
  • XGS-PON ten gigabit Symmetrical passive optical network
  • the advantages of collaborative management of gateway devices to edge network devices under the FTTR architecture are utilized, and network devices centrally decide the order in which edge network devices compete for channels, so as to avoid random backoff conflicts and optimize the performance of the entire network.
  • this application can also be applied to a non-FTTR architecture. Any architecture of a communication system composed of control nodes and network nodes can be applied to this embodiment of the application. The above is only an example of an FTTR architecture. Not limited.
  • FIG. 6 it is an interactive flow chart of a scheduling method provided by the embodiment of the present application.
  • Step 601 the control node receives service information reported by N network nodes (network node 1 to network node N as shown in Figure 6, it should be noted that network node 1 to network node N are only used as distinctions), the The service information is used to indicate information of service data that the network node needs to transmit through the channel, and N is a positive integer.
  • the service information may include but not limited to the following information: service type, service flow, service delay, and service priority.
  • the control node itself can also serve as a network node.
  • the N network nodes can also include the control node. At this time, the control node can receive the service information reported by itself through internal reporting.
  • control node may receive the service information of the network nodes multiple times, and when deciding the network node to be scheduled in the current scheduling period in each scheduling period, the control node may make a centralized decision based on the latest service information of each network node.
  • N network nodes can periodically report service information, for example, report service information once every second, so that the control node can make centralized scheduling decisions based on the latest service information of each network node, so that Improve scheduling accuracy and overall network performance in wireless networks.
  • Each network node can also set different periods correspondingly, for example, a network node with more connected terminal devices can set a shorter period, while a network node with fewer connected terminal devices can set a longer period.
  • each network node can also monitor the business flow conditions in different time periods, and different periods can be set in different time periods. For example, a longer period can be set in the early morning period, and a shorter period can be set in the evening period. cycle. In this way, on the one hand, scheduling accuracy can be guaranteed, and on the other hand, resource consumption of network nodes and control nodes can be reduced.
  • the network node can also report updated service information to the control node before or after it is scheduled each time and completes service data transmission through the channel, so that the control node can obtain the network node in time
  • the latest business information which in turn can generate more accurate scheduling decisions. It can be implemented as follows: after the network node scheduled in the previous scheduling period competes for the channel, and before or after the service data transmission is completed, the control node receives the second response message reported by the network node, and according to the second response The message obtains the latest business information of the network node, which is used to accurately determine the network node to be scheduled in the current scheduling cycle.
  • each network node reporting service information to the control node.
  • the control node updates the previously acquired service information of the network node.
  • the control node can discard the historical service information according to the updated service information, and use the updated service information as the service information of the network node; or, it can also be implemented as incrementally updating the previously obtained network node information according to the updated service information.
  • Business information can be determined according to actual scenarios during implementation.
  • each network node can report initial service information. On the one hand, it can notify There is a new network node in the control node, and on the other hand, the control node can obtain the service information of the network node.
  • control node provided based on the embodiment of the present application has the function of centrally scheduling network nodes to send data, and the network node cannot successfully receive the response message of the network node after not receiving the service information of the network node or after scheduling the network node , the control node can also take the initiative to issue scheduling information for testing to avoid scheduling exceptions caused by equipment failures, message transmission loss, and other issues. For example, when the control node cannot determine the network node to be scheduled according to the service information of the network node, it may sequentially schedule the connected network nodes through the scheduling message.
  • Step 602 the control node determines M network nodes to be scheduled in the current scheduling cycle according to the service information reported by the N network nodes respectively (such as network node 1 to network node M in Figure 6, where network node 1 To the network node M is only used as a distinction), the M is a positive integer; it can be understood that the M is less than or equal to the N.
  • the control node determines that there is no network node to be scheduled in the current scheduling period (that is, M is 0, for example, when each network node remains silent)
  • the control node can preset the duration before proceeding to the next scheduling period. Decision-making; wherein, the preset duration can be determined according to the set scheduling period, and in different time ranges, the corresponding duration of the scheduling period can be different.
  • the control node may also determine that there is no interference among the scheduled M network nodes.
  • the control node may simultaneously schedule the first network node and the second network node in the current scheduling period.
  • the control node may The scheduling cycle schedules the first network node and the second network node at the same time; wherein, if the first network node and the second network node cannot scan each other, or even if the other party is scanned, the detected signal strength is less than or equal to the specified threshold, then It can be judged that the distance between the two is far away and there is no interference.
  • control node can determine the priority of the network nodes according to but not limited to at least one of the following methods, and then can decide which network nodes to start scheduling according to the priority of the network nodes:
  • the service types may be expressed as AC_BE, AC_BK, AC_VI, and AC_VO in the foregoing embodiments. If the service type of the network node is a multimedia real-time service (such as AC_VI, AC_VO type of service), it can be determined that the network node has a higher priority. It should be noted that the pre-configured service types can also be configured by other types, and the priorities corresponding to each service type can also be pre-configured according to actual application scenarios, which is not limited in this application.
  • the control node may determine that the network node has a higher priority. In this way, through this implementation manner, priority scheduling of network nodes with large service flow demands can be realized. For example, suppose the network includes network node 1 and network node 2. The service flow reported by network node 1 is 1024MB, and the service flow reported by network node 2 is 10MB. Since the service flow of network node 1 is greater than that of network node 2, the control node can give priority to Schedule network node 1. In this way, problems such as excessive storage pressure in the network due to the inability of the network node 1 to send services can be avoided.
  • the control node determines that the network node has a higher priority; or, the greater the service delay of the network node, the control node may determine that the network node has a higher priority.
  • this implementation method can meet the delay requirements of some services; for example, the delay requirement of service 1 is less than 7ms, while service 2 does not If there is a delay requirement, the control node may preferentially schedule the network node 1 requesting to transmit the service 1 .
  • the control node can prioritize network node 1 for scheduling.
  • service priorities may be preset, for example, service 1 is preset as the highest priority, and service 2 is preset as the lowest priority. Alternatively, it may also be determined according to user account information. For example, user 1 has a VIP membership on a designated platform, and the network node identifies that the service data corresponding to user 1 has service priority when transmitting services corresponding to the designated platform.
  • the control node when it determines the priority of the network node according to multiple ways in the foregoing ways, it may also determine the priority of the network node in combination with the weights corresponding to each way.
  • the weight corresponding to the service priority may be 50%
  • the weight corresponding to the service type may be 20%
  • the weight corresponding to the service flow may be 15%
  • the weight corresponding to the service delay may be 15%.
  • the control node can comprehensively consider various scenarios of service data of each network node, so as to obtain more accurate decision results.
  • control node can also directly determine the network node to be scheduled according to the information contained in the service information of the network node, without indirectly determining the priority of the network node first and then determining the network node to be scheduled. node.
  • the control node may also determine not to start the scheduling of the current scheduling period according to the request of the first network node , reserving a certain time window for the first network node, so that the first network node occupies the channel first; or, preferentially scheduling the first network node, for example, prior to scheduling the M network nodes in the current period, preferentially scheduling the first network node.
  • TCP transmission control protocol
  • RTT round-trip time
  • ACK acknowledge acknowledge
  • each network node can detect whether there is a need to preferentially occupy the channel to send or receive the first data. For example, in the above scenario, it is necessary to preferentially occupy the channel to receive the TCP ACK message, so as to avoid increasing the RTT. Assuming that there is a need for the first network node to send or receive the first data, the first network node may report a first request message, where the first request message is used to request a priority channel to transmit the first data; or, the The first network node may also carry priority request information for requesting priority occupation of the channel when reporting the service information (or sending messages such as the first response message or the second response message).
  • the control node may determine that the first network node has a priority requirement to occupy a channel.
  • the control node can notify the first network node to allow the channel to be preferentially occupied by feeding back an authorization message; or, the control node can also directly adjust the centralized scheduling according to the priority request of the first network node In this configuration, the first network node can directly transmit data through the channel after sending the first request message or priority request information.
  • the control node may determine not to open the Enabling the scheduling of the current scheduling period, or preferentially scheduling the first network node, or not enabling the scheduling of the second network node that may interfere with the first network node in the current scheduling period.
  • FIG. 7A it is a schematic diagram of an interaction flow of a scheduling method provided by an embodiment of the present application. Before the control node performs the scheduling of the current scheduling cycle through step 603, the following interaction process between the control node and the network node may also exist:
  • Step 701 If there is a first network node, it is detected that there is first data to be sent or received. As an example, usually after the network node sends 2 to 3 TCP data to the receiver, the receiver will reply a TCP ACK message. Based on this, each network node can count the number of TCP data sent, if the number is greater than the preset number threshold (assuming is n, n can be 2 or 3, etc.), then it can be determined that there is first data to be sent or received by the network node.
  • the first network node may be any network node among the N network nodes, and the first network node is taken as an example in FIG. 7A; during specific implementation, the first network node may also be any network node among the M network nodes , the present application does not limit the comparison.
  • Step 702 The first network node reports a first request message, where the first request message is used to request a preferentially occupied channel to send or receive first data.
  • the first request message may include, but is not limited to, the following information: message type, network node identifier, priority request, and reserved bits.
  • the message type may indicate that the message is a first request message
  • the network node identifier may indicate the first network node.
  • the reserved bits are used as pre-reserved fields for functions to be developed or undeveloped functions, and are used to expand message functions. The same applies to reserved bits in subsequent embodiments, and the description will not be repeated later.
  • Step 703 According to the first request message, the control node determines not to start the scheduling of the current scheduling cycle; or, prioritizes scheduling the first network node; or determines not to start the scheduling that meets the requirements of the first network node in the current scheduling cycle Scheduling of the second network node with preset conditions.
  • the preset condition includes the following information: the second network node is on the same channel as the first network node, the first network node detects that the signal strength of the second network node is greater than a specified threshold or the second network node It is detected that the signal strength of the first network node is greater than a specified threshold, that is, if the second network node competes with the first network node for a channel at the same time, there may be a backoff conflict problem. Conversely, it can be understood that if the first network node and the second network node are on different channels, or there is no cross coverage area due to the long distance, even if the first network node and the second network node transmit data through the channel at the same time, there is no There is a backoff conflict problem. Based on this, the control node can improve the efficiency of data transmission by allowing multiple network nodes to compete for the channel.
  • control node may also continue the scheduling of the current scheduling period. In this way, it can not only meet the requirement of the first network node to occupy the channel preferentially, but also ensure the transmission efficiency of the entire network.
  • Step 704 the first network node determines that the first data has been sent or received.
  • Step 705 The first network node reports a first indication message, where the first indication message is used to indicate that the first network node has sent or received the first data.
  • the scheduling of the current scheduling period may be resumed according to the first indication message at this time.
  • the scheduling of the second network node may be resumed according to the first indication message at this time.
  • FIG. 7C it is an example of the first indication message provided in the embodiment of the present application.
  • the first indication message may include, but is not limited to, the following information: message type, network node identifier, transmitted (sent or received) first data, and reserved bits.
  • each scheduling period there may be a network node that initiates the interaction process shown in FIG. 7A to preferentially occupy the channel to send or receive the first data.
  • the above only takes one scheduling period as an example.
  • Step 603 The control node sends a first scheduling message to the M network nodes, where the first scheduling message is used to indicate that the M network nodes are allowed to compete for a channel.
  • the control node may send the first scheduling message to the M network nodes in a unicast manner.
  • the control node may also send the first Scheduling messages, so that the M network nodes receive the first scheduling message.
  • the scheduling message (which may be the first scheduling message, or the second scheduling message involved in the following embodiments) may include but not limited to the following messages: message type, network node identifier, opening scheduling information, air interface rate, aggregation number, transmit power, and reserved bits.
  • the enabling scheduling information may indicate whether scheduling is enabled or disabled, and each network node may determine whether to enable scheduling according to the network node identifier; or, the enabling scheduling information may also be only indicating enabling scheduling, and at this time, the network node identifier may be Contains only scheduled network nodes.
  • the scheduling message may also include information indicating the following: indicating power, channel, antenna polarization direction, antenna beam direction, and the like.
  • Step 604 the M network nodes respectively compete for a channel according to the first scheduling message.
  • the network node may not compete for the channel at this time.
  • the data is sent after the network nodes compete for the channel.
  • the embodiments of the present application can avoid collision problems that may be caused by random backoff.
  • the network node will not compete for the channel at this time, and continue to wait for the decision of the control node for the next scheduling period result.
  • each network node after each network node is scheduled, it can also report the scheduling situation to the control node in time, so that the control node can update the service information of each network node in time, and realize more accurate scheduling.
  • FIG. 9 it is a schematic flowchart of another possible scheduling method in the embodiment of the present application.
  • Step 605 first response messages reported by the M network nodes respectively, where the first response messages are used to instruct the network nodes to compete for the channel.
  • the first response message may include, but is not limited to, the following information: message type, network node identifier, contention to channel ((backoff done, BO_done), reserved bit.
  • Step 606 the control node determines the P network nodes to be scheduled in the next scheduling cycle according to the first response message and the service information reported by the N network nodes respectively, and the P is a positive integer; it can be understood that the P is less than or equal to said N.
  • the decision-making manner of the next scheduling period may refer to the content introduced in the foregoing embodiments, and details are not repeated here.
  • Step 607 the control node sends a second scheduling message to the P network nodes, where the second scheduling message is used to indicate that the P network nodes are allowed to compete for a channel.
  • the control node may also wait for a preset period of time before making a scheduling decision for a subsequent scheduling period again.
  • Step 608 The M network nodes report second response messages respectively, and the second response messages are used to indicate the service information updated by the network node before or after the service data transmission of the current scheduling period is completed.
  • the network node may immediately report the second response message after the service data is sent, so as to notify the control node in time.
  • the network node may also report the second response message after being scheduled multiple times (allowing to compete for the channel), thereby reducing the load on the network .
  • the specific reporting method can be adjusted according to actual needs. For example, if the actual demand pays more attention to the load in the network, a unified reporting method after multiple scheduling can be adopted.
  • the second response message may include, but is not limited to, the following information: message type, network node identifier, sending completion information, service flow, service delay, service type, service priority, and reserved bits.
  • the service flow, service delay, service type and service priority in the second response message are service information updated after sending by the M network nodes in the current scheduling period, and the updated
  • the service information may be used as the service information re-reported by the M network nodes, and the control node may continue to determine the network nodes to be scheduled in the subsequent scheduling period according to the updated service information.
  • the examples of the first request message, the first indication message, the scheduling message, the first response message and the second response message are implemented by adding new frames. , it can also be implemented in a wireless network by multiplexing existing frames.
  • An example, referring to FIGS. 12A to 12E is an example of an Ethernet frame provided by the embodiment of the present application.
  • the Ethernet packet header usually includes the destination address, the length and type of the source address. Another example, referring to FIG.
  • OMCI optical network terminal management and control interface
  • the OMCI protocol frame includes: GPON encapsulation mode (GPON encapsulation mode, GEM) header (header), transaction association Identification (transaction correlation identifier), message type (message type), device identifier (device identifier), message identifier (message identifier), message content (message contents) and OMCI tail (trailer).
  • GPON encapsulation mode GPON encapsulation mode, GEM
  • transaction association Identification transaction correlation identifier
  • message type messagessage type
  • device identifier device identifier
  • message identifier message identifier
  • message content messagessage contents
  • OMCI tail OMCI tail
  • the control node can realize the centralized control of multiple network nodes, and through the statistics of the service information of each network node, it can further decide the order in which each network node is allowed to send data.
  • the network nodes scheduled by the control node in each scheduling period are allowed to compete for the channel in the current scheduling period, so that data can be sent through the channel, while the network nodes that are not scheduled need to wait for the scheduling result of the next scheduling period .
  • this method can avoid random backoff conflicts of the air interface, and each network node can realize the orderly transmission of data according to the centralized control of the control node, thereby improving the quality of the network.
  • the transmission efficiency of the entire network can be avoided.
  • the embodiment of the present application further provides a scheduling device 1400, as shown in FIG. 14, the device may be set on the control node.
  • the scheduling device 1400 includes: a transceiver unit 1401 and a processing unit 1402, and the scheduling device 1400 may be used to implement the methods described in the foregoing method embodiments.
  • the optional transceiver unit 1401 and the processing unit 1402 can be connected to each other through the communication line 1403;
  • the communication line 1403 can be a peripheral component interconnect standard (peripheral component interconnect, referred to as PCI) bus or an extended industry standard architecture (extended industry standard architecture , referred to as EISA) bus and so on.
  • PCI peripheral component interconnect
  • EISA extended industry standard architecture
  • the communication line 1403 can be divided into address bus, data bus, control bus and so on. For ease of representation, only one thick line is used in FIG. 14 , but it does not mean that there is only one bus or one type of bus.
  • the transceiver unit 1401 is configured to receive service information reported by N network nodes respectively, the service information is used to indicate the service data information that the network node needs to transmit through the channel, and the N is a positive integer; the processing unit 1402 , used to determine M network nodes to be scheduled in the current scheduling period according to the service information reported by the N network nodes respectively, the M is a positive integer, and the M is less than or equal to the N; the transceiver unit 1401 , further configured to send a first scheduling message to the M network nodes, where the first scheduling message is used to indicate that the M network nodes are allowed to compete for a channel.
  • the transceiving unit 1401 is further configured to receive first response messages respectively reported by the M network nodes, where the first response messages are used to instruct the network nodes to compete for the channel; the processing Unit 1402 is further configured to determine P network nodes to be scheduled in the next scheduling period according to the first response message and the service information reported by the N network nodes respectively, where P is a positive integer and P is less than or equal to the N; the transceiving unit 1401 is further configured to send a second scheduling message to the P network nodes, where the second scheduling message is used to indicate that the P network nodes are allowed to compete for a channel.
  • the processing unit 1402 is further configured to update the network in at least one of the following ways Node business information:
  • Method 1 The transceiver unit 1401 receives the second response messages reported by the M network nodes respectively, and the second response messages are used to indicate the updated service of the network node before or after the service data transmission of the current scheduling period is completed. information;
  • Mode 2 The transceiver unit 1401 receives updated service information periodically reported by the N network nodes.
  • the service information includes at least one of the following information: service type, service flow, service delay, and service priority;
  • Service information when determining the M network nodes to be scheduled in the current scheduling cycle, it is specifically used for: if the service information reported by the N network nodes respectively includes the service type, according to the service type and the pre-configured service type The priority determines the priority of the network node; if the service information reported by the N network nodes respectively includes the service flow, determine the priority of the network node according to the service flow; if the N network nodes respectively report the The service information includes the service delay, and the priority of the network node is determined according to the service delay; if the service information reported by the N network nodes respectively contains the service priority, determine according to the service priority The priority of the network node; according to the priority of the network node, determine the M network nodes scheduled in the current scheduling period.
  • the transceiver unit 1401 is further configured to, before sending the first scheduling message to the M network nodes, if the first request message reported by the first network node is received, or if it is determined that the If the service information of the first network node further includes priority request information, it is determined that the first network node requests to occupy channels preferentially; wherein, the first request message or the priority request information is used to request preferential channel occupation, to Sending or receiving first data; the processing unit 1402 is further configured to, after receiving a first indication message reported by the first network node, perform scheduling of the current scheduling period, the first indication message being used for Instructing the first network node to have sent or received the first data; or, the processing unit 1402 is further configured to, after receiving the first indication message reported by the first network node, perform In the scheduling of the current scheduling period, the second network node and the first network node meet a preset condition; the preset condition includes the following information: the second network node and the first network node are in the same channel
  • the first scheduling message includes the following information: a network node identifier and enabling scheduling information.
  • the service information or the first scheduling message is sent in one of the following ways: custom data frame, Ethernet frame, OMCI protocol frame.
  • the scheduling device shown in FIG. 14 may also be set on a network node.
  • the transceiving unit 1401 is configured to report service information to the control node, and the service information is used to indicate the service data information that the network node needs to transmit through the channel;
  • the transceiving unit 1401 is also configured to receive the A first scheduling message sent by the control node, where the first scheduling message is used to indicate that the network node is allowed to compete for a channel;
  • the processing unit 1402 is configured to compete for a channel according to the first scheduling message.
  • the transceiving unit 1401 is further configured to report a first response message to the control node, where the first response message is used to instruct the network node to compete for a channel.
  • the transceiver unit 1401 is further configured to update service information to the control node in at least one of the following ways:
  • Mode 1 Report a second response message to the control node, where the second response message is used to indicate the service information updated by the network node before or after the service data transmission of the current scheduling period is completed;
  • Method 2 Periodically report updated business information.
  • the service information includes at least one of the following information: service type, service flow, service delay, and service priority.
  • the processing unit 1402 is further configured to detect that there is first data to be sent or received; the transceiver unit 1401 is further configured to report a first request message to the control node, so The first request message is used to request the priority to occupy the channel to send or receive the first data; the transceiver unit 1401 is further configured to report the first indication message to the control node after the first data has been sent or received, so The first indication message is used to indicate that the network node has sent or received the first data.
  • the first scheduling message includes the following information: a network node identifier and enabling scheduling information.
  • the service information or the first scheduling message is sent in one of the following ways: custom data frame, Ethernet frame, OMCI protocol frame.
  • each functional unit in each embodiment of the present application may be integrated into one processing unit, or physically exist separately, or two or more units may be integrated into one unit.
  • the above-mentioned integrated units can be implemented in the form of hardware or in the form of software functional units.
  • the integrated unit is realized in the form of a software function unit and sold or used as an independent product, it can be stored in a computer-readable storage medium.
  • the essence of the technical solution of this application or the part that contributes to the related technology or all or part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium.
  • a computer device which may be a personal computer, a server, or a network device, etc.
  • a processor processor
  • the aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (read-only memory, ROM), random access memory (random access memory, RAM), magnetic disk or optical disc and other media that can store program codes. .
  • the scheduling apparatus 1500 may be used to implement the methods described in the foregoing method embodiments, and reference may be made to the descriptions in the foregoing method embodiments.
  • the scheduling device 1500 may include one or more processors 1501 .
  • the processor 1501 may be a general purpose processor or a special purpose processor or the like. For example, it may be a baseband processor or a central processing unit.
  • the baseband processor can be used to process communication protocols and communication data
  • the central processor can be used to control scheduling devices (such as base stations, terminals, or chips, etc.), execute software programs, and process data of software programs.
  • the scheduling device may include a transceiver unit to implement signal input (reception) and output (transmission).
  • the transceiver unit may be a transceiver, a radio frequency chip, and the like.
  • the scheduling apparatus 1500 includes one or more processors 1501, and the one or more processors 1501 can implement the methods shown in the above-mentioned embodiments.
  • processor 1501 may also implement other functions in addition to implementing the methods in the foregoing embodiments.
  • the processor 1501 may execute instructions, so that the scheduling device 1500 executes the methods described in the foregoing method embodiments.
  • the instruction may be stored in whole or in part in the processor, such as instruction 1503, or may be stored in whole or in part in the memory 1502 coupled to the processor, such as instruction 1504, and the scheduling device 1500 may execute the above method through instructions 1503 and 1504 together Methods described in the Examples.
  • the scheduling device 1500 may include one or more memories 1502, on which are stored instructions 1504, which can be executed on the processor, so that the scheduling device 1500 executes the methods described in the above method embodiments .
  • data may also be stored in the memory.
  • Instructions and/or data may also be stored in the optional processor.
  • one or more memories 1502 may store the correspondence described in the above embodiments, or the Related parameters or tables, etc. Processor and memory can be set separately or integrated together.
  • the scheduling device 1500 may further include a transceiver 1505 and an antenna 1506 .
  • the processor 1501 may be called a processing unit, and controls the device (terminal or base station).
  • the transceiver 1505 may be called a transceiver, a transceiver circuit, or a transceiver unit, etc., and is used to realize the transceiver function of the device through the antenna 1506 .
  • the processor in the embodiment of the present application may be an integrated circuit chip, which has a signal processing capability.
  • each step of the above-mentioned method embodiments may be completed by an integrated logic circuit of hardware in a processor or instructions in the form of software.
  • the above-mentioned processor can be a general-purpose processor, a digital signal processor (digital signal processor, DSP), an application specific integrated circuit (application specific integrated circuit, ASIC), an off-the-shelf programmable gate array (field programmable gate array, FPGA) or other available Program logic devices, discrete gate or transistor logic devices, discrete hardware components.
  • DSP digital signal processor
  • ASIC application specific integrated circuit
  • FPGA off-the-shelf programmable gate array
  • Program logic devices discrete gate or transistor logic devices, discrete hardware components.
  • a general-purpose processor may be a microprocessor, or the processor may be any conventional processor, or the like.
  • the steps of the method disclosed in connection with the embodiments of the present application may be directly implemented by a hardware decoding processor, or implemented by a combination of hardware and software modules in the decoding processor.
  • the software module can be located in a mature storage medium in the field such as random access memory, flash memory, read-only memory, programmable read-only memory or electrically erasable programmable memory, register.
  • the storage medium is located in the memory, and the processor reads the information in the memory, and completes the steps of the above method in combination with its hardware.
  • the memory in the embodiments of the present application may be a volatile memory or a nonvolatile memory, or may include both volatile and nonvolatile memories.
  • the non-volatile memory can be read-only memory (ROM), programmable read-only memory (programmable ROM, PROM), erasable programmable read-only memory (erasable PROM, EPROM), electrically erasable programmable Read memory (electrically EPROM, EEPROM) or flash memory.
  • Volatile memory can be random access memory (RAM), which acts as external cache memory.
  • RAM random access memory
  • SRAM static random access memory
  • DRAM dynamic random access memory
  • DRAM synchronous dynamic random access memory
  • SDRAM double data rate synchronous dynamic random access memory
  • ESDRAM enhanced synchronous dynamic random access memory
  • SLDRAM direct memory bus random access memory
  • direct rambus RAM direct rambus RAM
  • the embodiment of the present application also provides a scheduling system, and the system may include the control node and N network nodes introduced in the above method embodiments.
  • the control node can execute the content that can be realized by the control node as introduced in the above method embodiment
  • each network node can execute the content that can be realized by the network node as introduced in the above method embodiment.
  • the embodiment of the present application also provides a computer-readable storage medium, on which a computer program is stored, and when the computer program is executed by a computer, the scheduling method in any one of the above-mentioned method embodiments is implemented.
  • the embodiment of the present application also provides a computer program product, which implements the scheduling method in any one of the above method embodiments when the computer program product is executed by a computer.
  • all or part of them may be implemented by software, hardware, firmware or any combination thereof.
  • software When implemented using software, it may be implemented in whole or in part in the form of a computer program product.
  • a computer program product includes one or more computer instructions. When the computer instructions are loaded and executed on the computer, the processes or functions according to the embodiments of the present application are generated in whole or in part.
  • a computer can be a general purpose computer, special purpose computer, computer network, or other programmable device.
  • Computer instructions may be stored in or transmitted from one computer-readable storage medium to another computer-readable storage medium, e.g.
  • the computer-readable storage medium may be any available medium that can be accessed by a computer, or a data storage device such as a server, a data center, etc. integrated with one or more available media.
  • Available media may be magnetic media (e.g., floppy disk, hard disk, magnetic tape), optical media (e.g., high-density digital video disc (digital video disc, DVD)), or semiconductor media (e.g., solid state disk (solid state disk, SSD) )wait.
  • the embodiment of the present application also provides a chip 1600, including an input and output interface 1601 and a logic circuit 1602, the input and output interface 1601 is used to receive/output code instructions or information, and the logic circuit 1602 is used to execute code instructions Or according to the information, execute the scheduling method in any one of the method embodiments shown above.
  • the chip 1600 may implement the functions shown by the processing unit and/or the transceiver unit in the foregoing embodiments.

Landscapes

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

Abstract

本申请公开了一种调度方法、系统及装置，用以提供一种可行的方式来避免空口的随机退避冲突。该方法包括：控制节点接收N个网络节点分别上报的业务信息，所述业务信息用于指示网络节点需要通过信道传输的业务数据的信息，所述N为正整数；所述控制节点根据所述N个网络节点分别上报的业务信息，确定当前调度周期被调度的M个网络节点，所述M为正整数；所述控制节点向所述M个网络节点发送第一调度消息，所述第一调度消息用于指示允许所述M个网络节点竞争信道。

Description

一种调度方法、系统及装置
本申请要求于2022年2月23日提交中国国家知识产权局、申请号为202210167775.2、申请名称为“一种调度方法、系统及装置”的中国专利申请的优先权，其全部内容通过引用结合在本申请中。
技术领域
本申请实施例涉及光通信技术领域，尤其涉及一种调度方法、系统及装置。
背景技术
目前在无线局域网(wireless local area network，WLAN)中，无线保真(wireless fidelity，Wi-Fi)信道通常是由接入点(access point，AP)和站点(station，STA)共享的。AP和STA各自使用一套增强分布式信道接入(enhanced distribution channel access，EDCA)参数来竞争Wi-Fi信道，获得发送机会。
AP可以通过判断网络状态，来调整EDCA参数。然而，随着网络的发展，家庭网络中的设备越来越多，多个设备在相同时刻竞争Wi-Fi信道的几率也越来越大。多个设备在相同时刻竞争Wi-Fi信道可能就会产生随机退避冲突，导致发包失败，降低网络吞吐，增加业务时延。
因此，如何避免空口的随机退避冲突，提升网络中的发送效率是值得研究的。
发明内容
本申请实施例提供一种调度方法、系统及装置，用以提供一种可行的方式来避免空口的随机退避冲突，从而可以提升网络中整网的发送效率。
第一方面，本申请提供一种调度方法，该方法包括：控制节点接收N个网络节点分别上报的业务信息，所述业务信息用于指示网络节点需要通过信道传输的业务数据的信息，所述N为正整数；所述控制节点根据所述N个网络节点分别上报的业务信息，确定当前调度周期被调度的M个网络节点，所述M为正整数，所述M小于或等于所述N；所述控制节点向所述M个网络节点发送第一调度消息，所述第一调度消息用于指示允许所述M个网络节点竞争信道。
该方法中，通过网络中的控制节点可以实现对多个网络节点的集中控制，通过对各网络节点的业务信息的统计，进而可以决策允许各网络节点发送数据的先后顺序。这样，在网络中，控制节点在每个调度周期内调度的网络节点被允许在当前调度周期竞争信道，以可以通过信道发送数据，而没有被调度的网络节点需要等待下一调度周期的调度结果。相比于相关技术中各网络节点通过自由竞争信道的方式来说，该方法可以避免空口的随机退避冲突，各网络节点可以根据控制节点的集中控制，实现数据的顺序发送，从而可以提升网络中整网的发送效率。
在一种可能的设计中，所述方法还包括：所述控制节点接收所述M个网络节点分别上报的第一响应消息，所述第一响应消息用于指示网络节点竞争到信道；所述控制节点根据所述 第一响应消息和所述N个网络节点分别上报的业务信息，确定下一调度周期被调度的P个网络节点，所述P为正整数，所述P小于或等于所述N；所述控制节点向所述P个网络节点发送第二调度消息，所述第二调度消息用于指示允许所述P个网络节点竞争信道。
该设计中，控制节点可以根据当前调度周期被调度的M个网络节点竞争信道的状态，及时的决策下一调度周期的调度结果，从而可以通过控制节点的集中调度控制提升整网的发送效率及性能。
在一种可能的设计中，所述方法还包括：所述控制节点通过以下方式中的至少一种更新网络节点的业务信息：
方式一、所述控制节点接收所述M个网络节点分别上报的第二响应消息，所述第二响应消息用于指示网络节点在当前调度周期的业务数据传输完成之前或之后更新的业务信息；
方式二、所述控制节点接收所述N个网络节点分别周期性上报的更新的业务信息。
该设计中，控制节点可以根据网络节点最新上报的业务信息，及时的获取网络节点最新的业务情况，从而可以得到更准确的决策结果，进而可以提升整网的发送效率。
在一种可能的设计中，所述业务信息包括但不限于以下信息中的至少一种：业务类型、业务流量、业务时延、业务优先级；所述控制节点根据所述N个网络节点分别上报的业务信息，确定当前调度周期被调度的M个网络节点，可实施为：若所述N个网络节点分别上报的业务信息中包含所述业务类型，根据所述业务类型以及预先配置的业务类型优先级确定网络节点的优先级；若所述N个网络节点分别上报的业务信息中包含所述业务流量，根据所述业务流量确定网络节点的优先级；若所述N个网络节点分别上报的业务信息中包含所述业务时延，根据所述业务时延确定网络节点的优先级；若所述N个网络节点分别上报的业务信息中包含所述业务优先级，根据所述业务优先级确定网络节点的优先级；所述控制节点根据所述网络节点的优先级，确定当前调度周期被调度的M个网络节点。
该设计中，控制节点可以根据统计的网络节点的业务信息，更加准确地决策网络节点被调度的先后顺序，从而可以提升网络中整网的发送效率，提高网络性能。
在一种可能的设计中，所述控制节点向所述M个网络节点发送第一调度消息之前，所述方法还包括：若所述控制节点接收到第一网络节点上报的第一请求消息，或者，若所述控制节点确定所述第一网络节点的业务信息中还包括优先请求信息，则确定所述第一网络节点请求优先占用信道；其中，所述第一请求消息或所述优先请求信息用于请求优先占用信道，以发送或者接收第一数据；所述控制节点在接收到所述第一网络节点上报的第一指示消息后，开启所述当前调度周期的调度，所述第一指示消息用于指示所述第一网络节点已发送或接收所述第一数据；或者，所述控制节点在接收到所述第一网络节点上报的第一指示消息后，开启第二网络节点在当前调度周期的调度，所述第二网络节点与所述第一网络节点满足预设条件；所述预设条件包括以下信息：所述第二网络节点与所述第一网络节点处于相同的信道，第一网络节点检测到第二网络节点的信号强度大于指定阈值或第二网络节点检测到第一网络节点的信号强度大于指定阈值。
该设计中，网络中还可以设计网络节点具有可以优先请求占用信道的特殊需求，控制节点根据网络节点的需求，可以实现优先使得具有优先占用信道需求的网络节点及时的通过信道进行业务传输，从而可以避免发生由于网络节点未能及时处理业务而导致的时延增加、网络吞吐下降等问题，进而可以提升整网的性能。
在一种可能的设计中，所述第一调度消息包括以下信息：网络节点标识、开启调度信息。该设计中，通过控制节点对网络节点的集中调度，可以避免由于网络节点的自由竞争和随机 退避而导致的冲突问题，以及可以提升整网的发送效率。
在一种可能的设计中，所述业务信息或所述第一调度消息通过以下方式中的一种发送：自定义数据帧、以太网帧、光网络终端管理控制接口OMCI协议帧。该设计中，控制节点和网络节点之间的交互消息可以通过新增帧方式来实现，也可以通过复用已有帧方式来实现，从而可以实现本申请提供的方法，避免空口的随机退避冲突。
第二方面，本申请实施例提供一种调度方法，该方法包括：网络节点向控制节点上报业务信息，所述业务信息用于指示网络节点需要通过信道传输的业务数据的信息；所述网络节点接收所述控制节点发送的第一调度消息，所述第一调度消息用于指示允许所述网络节点竞争信道；所述网络节点根据所述第一调度消息竞争信道。
在一种可能的设计中，所述方法还包括：所述网络节点向所述控制节点上报第一响应消息，所述第一响应消息用于指示所述网络节点竞争到信道。
在一种可能的设计中，所述方法还包括：所述网络节点通过以下方式中的至少一种向所述控制节点更新业务信息：
方式一、所述网络节点向控制节点上报第二响应消息，所述第二响应消息用于指示所述网络节点在当前调度周期的业务数据传输完成之前或之后更新的业务信息；
方式二、所述网络节点周期性上报更新的业务信息。
在一种可能的设计中，所述业务信息包括以下信息中的至少一种：业务类型、业务流量、业务时延、业务优先级。
在一种可能的设计中，所述方法还包括：若所述网络节点检测到存在待发送或接收的第一数据，向所述控制节点上报第一请求消息，所述第一请求消息用于请求优先占用信道发送或接收所述第一数据；或者，若所述网络节点检测到存在待发送或接收的第一数据，通过所述业务信息携带优先请求信息，所述优先请求信息用于请求优先占用信道发送或接收所述第一数据；所述网络节点已发送或接收所述第一数据之后，向所述控制节点上报第一指示消息，所述第一指示消息用于指示所述网络节点已发送或接收所述第一数据。
在一种可能的设计中，所述第一调度消息包括以下信息：网络节点标识、开启调度信息。
在一种可能的设计中，所述业务信息或所述第一调度消息通过以下方式中的一种发送：自定义数据帧、以太网帧、OMCI协议帧。
第三方面，本申请实施例提供一种调度系统，所述系统包括控制节点和N个网络节点；其中，所述控制节点可以执行上述第一方面任一可能的设计中提供的方法，各所述网络节点可以执行上述第二方面任一可能的设计中提供的方法。
第四方面，本申请实施例提供一种调度装置，所述装置包括收发单元和处理单元。其中，所述收发单元、所述处理单元执行的功能可以和上述第一方面中任一可能的设计或实现方式中涉及的控制节点的步骤相对应。
第五方面，本申请实施例提供一种调度装置，所述装置包括收发单元和处理单元。其中，所述收发单元、所述处理单元执行的功能可以和上述第二方面中任一可能的设计或实现方式中涉及的网络节点执行的步骤相对应。
第六方面，本申请实施例还提供了一种网络设备，所述网络设备包括一个或多个处理器，所述处理器与存储器耦合，所述存储器存储计算机程序代码，所述计算机程序代码包括计算机指令。所述处理器执行所述存储器中的计算机指令，以执行上述第一方面任一可能的设计中提供的方法。可选地，该网络设备还包括通信接口，处理器与通信接口耦合。该通信接口可以是收发器或输入/输出接口；当该网络设备为网络设备中包含的芯片时，该通信接口可以 是芯片的输入/输出接口。可选地，收发器可以为收发电路，输入/输出接口可以是输入/输出电路。
第七方面，本申请实施例还提供了一种网络设备，所述网络设备包括一个或多个处理器和存储器，所述存储器与所述处理器耦合，所述存储器存储计算机程序代码，所述计算机程序代码包括计算机指令。所述处理器执行所述存储器中的计算机指令，以执行上述第二方面任一可能的设计中提供的方法。可选地，该网络设备还包括通信接口，处理器与通信接口耦合。该通信接口可以是收发器或输入/输出接口；当该网络设备为网络设备中包含的芯片时，该通信接口可以是芯片的输入/输出接口。可选地，收发器可以为收发电路，输入/输出接口可以是输入/输出电路。
第八方面，本申请实施例还提供了一种无线组网系统，包括如上述第六方面所提供的网络设备、以及N个如上述第七方面所提供的网络设备。
第九方面，本申请实施例还提供一种计算机可读存储介质，所述计算机可读存储介质存储有计算机程序，当所述计算机程序被计算机执行时，使第一方面任一种可能的设计中提供的方法被实现，或使第二方面任一种可能的设计中提供的方法被实现。
第十方面，本申请实施例还提供了一种计算机程序产品，该计算机程序产品包括：计算机程序代码，当计算机程序代码被网络设备的处理器运行时，使得网络设备执行上述第一方面任一种可能的设计中的方法，或使得网络设备执行上述第二方面任一种可能的设计中的方法。
第十一方面，本申请实施例还提供一种芯片，用于读取并执行存储器中存储的软件程序，以实现上述第一方面任一种可能的设计中的方法，或实现上述第二方面任一种可能的设计中的方法。其中，所述存储器可以与所述芯片相连，或所述存储器也可以内置于所述芯片中。
上述第二方面至第十一方面中任一方面的有益效果请具体参阅上述第一方面中各种可能的设计的有益效果，在此不再赘述。
附图说明
图1为本申请实施例中一种可能的WLAN网络架构示意图；
图2为本申请实施例中EDCA参数集示意图；
图3为本申请实施例中一种可能的为STA侧配置的EDCA参数示意图；
图4为本申请实施例中一种可能的竞争信道示意图；
图5A为本申请实施例中一种应用于FTTR的光通信系统拓扑结构示意图；
图5B为本申请实施例中另一种应用家庭网络的光通信系统拓扑结构示意图；
图6为本申请实施例中一种可能的调度方法流程示意图之一；
图7A为本申请实施例中一种可能的调度方法流程示意图之二；
图7B为本申请提供的第一请求消息的示例；
图7C为本申请提供的第一指示消息的示例；
图8为本申请提供的调度消息的示例；
图9为本申请实施例中一种可能的调度方法流程示意图之三；
图10为本申请提供的第一响应消息的示例；
图11为本申请提供的第二响应消息的示例；
图12A～12E为本申请实施例提供的以太网帧的示例；
图13为本申请实施例提供的OMCI协议帧的示例；
图14为本申请实施例中一种调度装置的结构示意图；
图15为本申请实施例中另一种调度装置的结构示意图；
图16为本申请实施例中提供的一种芯片的结构示意图。
具体实施方式
应理解，说明书通篇中提到的“一个实施例”、“一个实现方式”、“一个实施方式”或“一示例”意味着与实施例有关的特定特征、结构或特性包括在本申请的至少一个实施例中。因此，在整个说明书各处出现的“在一个实施例中”、“一个实现方式”、“一个实施方式”或“在一示例中”未必一定指相同的实施例。此外，这些特定的特征、结构或特性可以任意适合的方式结合在一个或多个实施例中。应理解，在本申请的各种实施例中，上述各过程的序号的大小并不意味着执行顺序的先后，各过程的执行顺序应以其功能和内在逻辑确定，而不应对本申请实施例的实施过程构成任何限定。
另外，本文中术语“系统”和“网络”在本文中常被可互换使用。本文中术语“和/或”，仅仅是一种描述关联对象的关联关系，表示可以存在三种关系，例如，A和/或B，可以表示：单独存在A，同时存在A和B，单独存在B这三种情况。另外，本文中字符“/”，一般表示前后关联对象是一种“或”的关系。应理解，在本申请实施例中，“与A相应的B”表示B与A相关联，根据A可以确定B。但还应理解，根据A确定B并不意味着仅仅根据A确定B，还可以根据A和/或其它信息确定B。以及，除非有相反的说明，本申请实施例提及“第一”、“第二”等序数词是用于对多个对象进行区分，不用于限定多个对象的顺序、时序、优先级或者重要程度。此外，本申请实施例和权利要求书及附图中的术语“包括”和“具有”不是排他的。例如，包括了一系列步骤或模块的过程、方法、系统、产品或设备没有限定于已列出的步骤或模块，还可以包括没有列出的步骤或模块。
参见图1所示，为一种可能的WLAN网络架构示意图，WLAN网络架构中包括无线控制器(本申请实施例中也可称为“控制节点”)、无线接入点(本申请实施例中也可称为“网络节点”)和终端设备。无线控制器用于对接入点进行业务配置和射频配置。无线接入点，可以简称为接入点(access point，AP)。AP用于为关联的STA提供业务访问。终端设备作为STA可以关联到接入点。
终端设备，可以包括移动电话(或称为“蜂窝”电话)，具有移动终端设备的计算机，便携式、袖珍式、手持式、计算机内置的移动装置等。例如，个人通信业务(personal communication service，PCS)电话、无绳电话、会话发起协议(session initiation protocol，SIP)话机、无线本地环路(wireless local loop，WLL)站、个人数字助理(personal digital assistant，PDA)、等设备。终端设备也可以是计算机、平板电脑、电子阅读器等，也可以是智能家居设备，比如智能电视、智能音箱等等。作为示例而非限定，在本申请实施例中，该终端设备还可以是可穿戴设备。可穿戴设备也可以称为穿戴式智能设备或智能穿戴式设备等，是应用穿戴式技术对日常穿戴进行智能化设计、开发出可以穿戴的设备的总称，如眼镜、手套、手表、服饰及鞋等。可穿戴设备即直接穿在身上，或是整合到用户的衣服或配件的一种便携式设备。可穿戴设备不仅仅是一种硬件设备，更是通过软件支持以及数据交互、云端交互来实现强大的功能。广义穿戴式智能设备包括功能全、尺寸大、可不依赖智能手机实现完整或者部分的功 能，例如：智能手表或智能眼镜等，以及只专注于某一类应用功能，需要和其它设备如智能手机配合使用，如各类进行体征监测的智能手环、智能头盔、智能首饰等。
需要说明的是，Wi-Fi信道是由AP和STA共享的。目前，AP和STA各自使用一套增强分布式信道接入(enhanced distribution channel access，EDCA)参数来竞争Wi-Fi信道，获得发送机会。EDCA参数的配置由AP来决定。各个AP配置自身的EDCA参数，并广播给接入该AP的各个STA。接入同一AP的多个STA需要听从由AP广播的同一套EDCA参数。AP可以通过信标(Beacon)帧广播EDCA参数。Beacon帧是802.11WLAN协议定义的一个周期性触发的管理帧。Beacon帧携带多种网络中必要的信息。Beacon帧包括AP广播给STA的EDCA参数集(parameter set)。Beacon帧还可以包括AP自身使用的EDCA参数集。EDCA参数集元素(EDCA parameter set element)包括服务质量(quality of service，QoS)参数集。其中，QoS参数集中包括STA针对不同访问类别(access category，AC)的QoS参数。访问类别也可以称为接入类别。访问类别包括：AC_BE(含义为尽力而为(best effort))、AC_BK(含义为背景(background))、AC_VI(含义为视频(video))以及AC_VO(含义为语音(voice))。每种访问类别的QoS参数(即访问信道配置参数)，如指数形式竞争窗口(exponent form of contention window，ECM)的最小尺寸和最大尺寸、传输机会(transmission opportunitie，TXOP)限制等。这样，通过对每种访问类别的QoS参数设置不同的数值，可以使一些多媒体实时业务(如AC_VI、AC_VO类型的业务)有更多的机会访问信道，从而减小多媒体实时业务的时延，使多媒体实时业务的数据传输更加流畅，提高了用户的体验。
示例性地，参见图2所示，为Beacon帧包括的EDCA参数集(parameter set)。元素标识(element ID)，是EDCA参数集元素的唯一标识，用于与其他元素区分开。长度(length)，是EDCA参数集元素的参数长度，不包括元素标识和长度字段。
服务质量信息(quality of service information，QoS info)，在该字段中，还包括了一个子选项，该子选项为EDCA参数集更新计数器(EDCA parameter set update count)，用于通知终端EDCA参数集元素是否改变。
其中，该EDCA参数集元素还包含每种访问类别的参数记录字段，每个参数记录字段中分别定义了STA执行该访问类别时的QoS参数，如图2所示，每个访问类别的参数记录字段中均包含AC索引(AC index，ACI)/仲裁帧间空间数(arbitration interframe space number，AIFSN)、指数形式竞争窗口、传输机会(transmission opportunity，TXOP)限制。
其中：ACI/AIFSN中包括AIFSN。AIFSN指示AP(或STA)访问网络时，在短帧间空间(short interframe space，SIFS)时间后再延后的时隙数，该参数值越小，AP(或STA)为访问Wi-Fi信道所等待的时间就越短。
ECW为EDCA的竞争窗口大小，该值决定了平均退避时间的大小，该值越小，平均退避时间就越短，其中，该ECW参数包括ECW的最小尺寸(ECWmin)和ECW的最大尺寸(ECWmax)；
TXOP限制表示STA占用Wi-Fi信道传输数据的时间限制，该值越大，STA能够持续占用信道的时间就越长。
AP将EDCA参数集元素广播至STA。该EDCA参数集元素中包括有AP为STA设置的处理各个访问类别的QoS参数集。AP为不同的访问类别配置的QoS参数不同。例如，为需要实时传输的AC_VI和AC_VO配置较小AIFSN，ECWmin和ECWmax，以及较大的TxOP，而为其他的访问类别配置较大AIFSN，ECWmin和ECWmax，以及较小的TxOP，从而使得AC_VI和AC_VO业务在访问Wi-Fi信道时拥有较高的优先级，而其他业务拥有较低优先级， 满足实时业务的需要，获得更好的业务体验。作为一种示例，一种可能的为STA侧配置的EDCA参数如图3所示。
参见图4所示，STA在接收到EDCA参数集元素后，需要使用信道发送业务数据时，STA监听信道是否繁忙，当检测到信道闲，开始AIFS(AIFS＝SIFS(16us)+AIFSN(AC)×slot(9us))倒计时。如图4所示，优先级越高的AC业务，AIFS越短。当AIFS倒计时到0，开始退避(backoff)倒计数。Backoff倒计数由CWmin决定。各STA的退避倒计数在0～CWmin中随机选择，退避的倒计时间＝退避倒计数*slot(9us)。优先级越高的AC，CWmin初始值越小，随机到的退避倒计数大概率更小。可以优先抢占信道。抢占信道后，根据TxOP的数值决定占用信道时长。VI、VO业务相比BE、BK可以更长时间的占用信道。此外，AP通常也需要使用信道发送业务数据，例如一些控制信息等，目前AP竞争信道的实现方式与图4中示出的STA示出的实现方式类似。
如背景技术中介绍到的内容，随着网络的发展，家庭网络中的设备越来越多，多个设备在相同时刻竞争Wi-Fi信道的几率也越来越大。因此，多个设备在相同时刻竞争Wi-Fi信道可能就会产生随机退避冲突，导致发包失败，降低网络吞吐，增加业务时延等问题。
有鉴于此，本申请实施例提供一种调度方法，用以提供一种可行的方式来避免空口的随机退避冲突，从而可以提升无线网络中通过信道传输数据的效率，提高无线网络的整网性能。
本申请实施例可以适用于采用光纤入房间(fiber to the room，FTTR)的WLAN部署方式，FTTR中将光纤铺设至每一个房间，通过在每个房间部署边缘网络设备来实现家庭网关互连。FTTR能够满足在线教育、居家办公和家庭娱乐等新业务应用对带宽、时延等的高要求。边缘网络设备可以是edge ONT，或者是AP，也即可以作为无线网络中的网络节点。在FTTR应用场景中，部署网关设备来对边缘网络设备进行管理。网关设备可以是光网关、ONT或者PON网关等，也即可以作为无线网络中的控制节点。
作为一种示例，参见图5A所示为一种应用于FTTR的光通信系统拓扑结构示意图。应用于FTTR的光通信系统中至少包括光网关、分光器和多个边缘光网络终端(edge optical network terminal，edge ONT)。本申请实施例中edge ONT也可以称为EDGE ONT，还可以称为Edge ONT。光网关可以通过分光器分别与多个EDGE ONT进行通信。光通信系统中还包括OLT。光网关部署于OLT与edge ONT之间。在FTTR场景下，光网关通过光纤入户连接到家庭信息箱，经过分光器连接到各个房间，每个房间部署一个边缘(Edge)ONT，信息箱处的光网关对多个Edge ONT进行协同管理。FTTR架构下的多个ONT与光网关之间通过光纤连接，控制管理资源不占用Wi-Fi空口，对比多AP Wi-Fi级联方案，可以提高光网关管理的实时性。终端设备可以接入Edge ONT来实现网络通信。
作为另一种示例，参见图5B所示为另一种应用家庭网络的光通信系统拓扑结构示意图。光通信系统中至少包括ONT和多个AP。ONT用于对每个房间部署的AP进行协同管理。
FTTR的光通信系统可以采用无源光网络(passive optical network，PON)。PON可以是吉比特无源光网络(gigabit-capable PON，GPON)、以太网无源光网络(ethernet PON，EPON)、十吉以太无源光网络(10Gb/s ethernet passive optical network，10G-EPON)、时分和波分复用无源光网络(time and wavelength division multiplexing passive optical network，TWDM-PON)、十吉比特无源光网络(10gigabit-capable passive optical network，XG-PON)或者十吉比特对称无源光网络(10-gigabit-capable symmetric passive optical network，XGS-PON)等。未来演进的新技术，将会将PON的速率提升到25Gbps、50Gbps甚至100Gbps， 因此可以本申请还可以应用更高传输速率的PON。
本申请实施例中利用FTTR架构下，网关设备对边缘网络设备协同管理的优势，由网络设备集中决策边缘网络设备竞争信道的先后顺序，以避免随机退避冲突，进而优化整网性能。需要说明的是，本申请也可以应用于非FTTR架构下，任意由控制节点和网络节点组成的通信系统的架构，均可适用于本申请实施例，以上仅是以FTTR架构作为一种示例，并非限定。
以下结合附图对本申请实施例提供的方法进行详细说明。
参阅图6，为本申请实施例提供的一种调度方法的交互流程图。
步骤601、控制节点接收N个网络节点(如图6中示出的网络节点1至网络节点N，需要说明的是，网络节点1至网络节点N仅作为区分)分别上报的业务信息，所述业务信息用于指示网络节点需要通过信道传输的业务数据的信息，所述N为正整数。示例性的，业务信息可以包括但不限于以下信息：业务类型、业务流量、业务时延、业务优先级。需要说明的是，控制节点本身也可以作为一个网络节点，该场景下所述N个网络节点还可以包含所述控制节点，此时控制节点可以通过内部上报等方式接收自身上报的业务信息。
示例性的，控制节点可以多次接收网络节点的业务信息，在每个调度周期决策当前调度周期被调度的网络节点时，控制节点可以基于各网络节点最新的业务信息进行集中决策。
一种可选的实施例中，N个网络节点可以周期性上报业务信息，例如每秒都上报一次业务信息，以便于控制节点可以根据各网络节点最新的业务信息进行集中调度的决策，从而可以提升无线网络中的调度准确性和整网性能。其中，各网络节点还可以对应设置不同的周期，例如，下挂终端设备较多的网络节点可以设置较短的周期，而下挂终端设备较少的网络节点可以设置较长的周期。进一步的，本申请实施时，各网络节点还可以监测不同时间段的业务流量情况，可以在不同时间段设置不同的周期，例如在凌晨时段可以设置较长的周期，在傍晚时段可以设置较短的周期。这样，一方面可以保证调度准确性，另一方面还可以降低网络节点和控制节点的资源消耗。
另一可选的实施例中，网络节点还可以在每次被调度，且通过信道完成业务数据传输之前或者之后，向控制节点上报更新的业务信息，以便于控制节点可以及时获取到该网络节点最新的业务信息，进而可以生成更为准确的调度决策。可实施为，在上一调度周期中被调度的网络节点在竞争到信道之后，以及在业务数据传输完成之前或者之后，控制节点接收到网络节点上报第二响应消息，并根据所述第二响应消息获取网络节点最新的业务信息，用以准确的决策当前调度周期被调度的网络节点。
需要说明的是，本申请不限定各网络节点向控制节点上报业务信息的实现方式，可以存在部分网络节点(例如未被调度的网络节点)通过周期性上报方式更新业务信息，也可以存在一些被调度的网络节点在被调度时，及时通过第二响应消息上报更新的业务信息，或者被调度的网络节点还可以同时通过周期性上报方式来更新业务信息。
此外，控制节点在接收到网络节点更新的业务信息之后，对之前获取的该网络节点的业务信息进行更新。可选的，控制节点根据更新的业务信息可以丢弃历史业务信息，将更新的业务信息作为网络节点的业务信息；或者，还可实施为，根据更新的业务信息增量更新之前获取的网络节点的业务信息，实施时可根据实际场景进行确定。
并且，在无线网络初始构建或者存在新上线的网络节点的场景下(例如新增的网络节点或者断电之后重新开机的网络节点)，每个网络节点可以上报初始的业务信息，一方面可以通知控制节点存在新增的网络节点，另一方面可以使得控制节点获取到该网络节点的业务信息。 另一方面，基于本申请实施例提供的控制节点具有集中调度网络节点发送数据的功能，网络节点在未接收到网络节点的业务信息，或者在调度网络节点之后无法成功接收到网络节点的响应消息，控制节点也可以主动下发用于测试的调度信息，避免由于设备故障、消息传输丢失等问题而导致调度异常。例如，控制节点在无法根据网络节点的业务信息，确定被调度的网络节点时，可以依次通过调度消息调度连接的网络节点。
步骤602、所述控制节点根据所述N个网络节点分别上报的业务信息，确定当前调度周期被调度的M个网络节点(如图6中的网络节点1至网络节点M，其中，网络节点1至网络节点M也仅作为区分)，所述M为正整数；可以理解，所述M小于或等于所述N。此外，若控制节点确定当前调度周期不存在被调度的网络节点(也即M为0，例如，各网络节点保持静默状态时)，则控制节点可以预设时长之后，再进行下一调度周期的决策；其中，预设时长可以根据设置的调度周期决定，在不同的时刻范围内，调度周期对应的时长可以不同。
其中，在避免存在空口竞争的冲突问题的基础上，为了提升无线网络的整网性能和传输效率，控制节点还可以确定被调度的M个网络节点之间互相不存在干扰。可选的，若第一网络节点和第二网络节点处于不同的信道，可以确定两者之间不存在干扰，则控制节点可以在当前调度周期同时调度第一网络节点和第二网络节点。另一可选的，若第一网络节点和第二网络节点由于距离较远，覆盖范围之间不存在交叠覆盖区，则也可以确定两者之间不存在干扰，则控制节点可以在当前调度周期同时调度第一网络节点和第二网络节点；其中，若第一网络节点和第二网络节点互相无法扫描到对方，或者即使扫描到对方，检测到的信号强度小于或等于指定阈值，则可以判断为两者之间距离较远不存在干扰。
一种可选的实施例中，控制节点可根据但不限于以下方式中的至少一种来确定网络节点的优先级，进而可以根据网络节点的优先级决策开启哪些网络节点的调度：
1)、若所述N个网络节点分别上报的业务信息中包含所述业务类型，根据所述业务类型以及预先配置的业务类型优先级确定网络节点的优先级。
示例性的，业务类型可以表示为前述实施例中的AC_BE、AC_BK、AC_VI以及AC_VO。若网络节点的业务类型为多媒体实时业务(如AC_VI、AC_VO类型的业务)，则可以确定该网络节点具有较高的优先级。需要说明的是，预先配置的业务类型还可以通过其他类型来配置，各业务类型对应的优先级也可以根据实际应用场景进行预先配置，本申请对此不进行限定。
2)、若所述N个网络节点分别上报的业务信息中包含所述业务流量，根据所述业务流量确定网络节点的优先级。其中，网络节点的业务流量越大，控制节点可以确定网络节点具有越高的优先级。这样，通过该实施方式可以实现优先对业务流量需求大的网络节点的优先调度。例如，假设网络中包含网络节点1和网络节点2，网络节点1上报的业务流量为1024MB，网络节点2上报的业务流量为10MB，由于网络节点1的业务流量大于网络节点2，控制节点可以优先调度网络节点1。这样，可以避免发生由于网络节点1无法发送业务而导致网络中的存储压力过大等问题。
3)、若所述N个网络节点分别上报的业务信息中包含所述业务时延，根据所述业务时延确定网络节点的优先级。
其中，网络节点对业务时延要求越高，控制节点确定网络节点具有越高的优先级；或者，网络节点的业务时延越大，控制节点可以确定网络节点具有越高的优先级。这样，通过该实施方式可以满足一些业务对于时延的要求；例如，业务1的时延要求小于7ms，而业务2没 有时延要求，则控制节点可以优先调度请求传输业务1的网络节点1。也可以避免业务时延较大的网络节点被调度时，影响整网的传输效率；例如，假设网络中包含网络节点1和网络节点2，网络节点1上报的业务时延为10s，网络节点2上报的业务时延为1s，由于网络节点1的业务时延大于网络节点2，控制节点可以优先调度网络节点1。
4)、若所述N个网络节点分别上报的业务信息中包含所述业务优先级，根据所述业务优先级确定网络节点的优先级。
示例性的，业务优先级可以为预先设置的，例如，预先设置业务1为最高优先级，而业务2为最低优先级。或者，也可以为根据用户账号信息确定的，例如，用户1在指定平台上开启有VIP会员，则网络节点在传输该指定平台对应的业务时，标识用户1对应的业务数据具有业务优先级。
其中，控制节点在根据上述方式中的多种来确定网络节点的优先级时，还可以结合各方式对应的权重，确定网络节点的优先级。例如，业务优先级对应的权重可以为50％、业务类型对应的权重可以为20％、业务流量对应的权重可以为15％以及业务时延对应的权重为15％。这样，控制节点可以综合考虑各网络节点的业务数据的多种场景，以得到更加准确的决策结果。
需要说明的是，在以上各方式中，控制节点也可以直接根据网络节点的业务信息中包含的信息，直接被调度的网络节点，而无需间接先确定网络节点的优先级再确定被调度的网络节点。
另一种可选的实施例中，若存在第一网络节点具有优先发送或接收第一数据的需求，则控制节点也可以根据第一网络节点的请求，确定不开启所述当前调度周期的调度，为第一网络节点预留一定时间窗口，以使所述第一网络节点优先占用信道；或者，优先调度第一网络节点，例如，在调度当前周期的M个网络节点之前，优先调度第一网络节点。
一种可能的场景中，目前无线网络中大部分业务为传输控制协议(transmission control protocol，TCP)业务，而传输TCP业务的吞吐量往往会受到往返时延(round-trip time，RTT)(往返时延表示发送端发送数据开始到发送端接收到来自接收端的确认所经历的时延)；其中，RTT越小，传输TCP业务的吞吐量越高。在该场景下，若空口中由于竞争存在干扰，则TCP的确认(acknowledge，ACK)消息所需要的时间会增加，从而导致RTT变高，进而影响整网的传输效率。
基于此，本申请实施时各网络节点可以自身检测是否存在优先占用信道发送或接收第一数据的需求，例如上述场景中需要优先占用信道接收TCP ACK消息，以避免增加RTT。假设存在第一网络节点存在发送或接收第一数据的需求，所述第一网络节点可以上报第一请求消息，所述第一请求消息用于请求优先占用信道传输第一数据；或者，所述第一网络节点还可以在上报业务信息(或发送第一响应消息或第二响应消息等消息)时携带用于请求优先占用信道的优先请求信息。控制节点若接收到所述第一请求消息，或者从网络节点发送的其他消息中获取到所述优先请求信息，则可以确定第一网络节点具有优先占用信道的需求。本申请实施时，根据网络中的实际配置，控制节点可以通过反馈授权消息，以通知允许第一网络节点优先占用信道；或者，控制节点还可以直接根据第一网络节点的优先请求，调整集中调度的决策或者顺序，此配置下第一网络节点可以在发送第一请求消息或者优先请求信息之后，直接通过信道传输数据。
可选的，控制节点可以根据第一请求消息或者业务信息中包含的优先请求信息确定不开 启所述当前调度周期的调度、或优先调度第一网络节点、或不开启所述当前调度周期与所述第一网络节点可能存在干扰的第二网络节点的调度。参阅图7A，为本申请实施例提供的一种调度方法的交互流程示意图。在控制节点通过步骤603进行当前调度周期的调度之前，控制节点与网络节点还可能存在以下交互流程：
步骤701、若存在第一网络节点检测到存在待发送或接收的第一数据。示例性，通常网络节点向接收方发送2～3个TCP数据之后，接收方会回复一个TCP ACK消息，基于此，各网络节点可以统计发送TCP数据的数量，若数量大于预设数量阈值(假设为n，n可以为2或3等)，则可以确定网络节点存在待发送或接收的第一数据。其中，第一网络节点可以为N个网络节点中的任一网络节点，图7A中以第一网络节点作为示例；具体实现时第一网络节点也可以为M个网络节点中的任一网络节点，本申请对比不进行限定。
步骤702、所述第一网络节点上报第一请求消息，所述第一请求消息用于请求优先占用信道发送或接收第一数据。参阅图7B，为本申请实施例提供的第一请求消息的示例。所述第一请求消息可以包括但不限于包括以下信息：消息类型、网络节点标识、优先请求、保留位。其中，所述消息类型可以指示该消息为第一请求消息，所述网络节点标识可以指示第一网络节点。所述保留位用于为待开发功能或未开发功能预先保留的字段，用于扩展消息功能，后续实施例中涉及到保留位同理，后续不再重复说明。
步骤703、控制节点根据所述第一请求消息，确定不开启所述当前调度周期的调度；或者，优先调度所述第一网络节点；或者，确定不开启当前调度周期中与第一网络节点满足预设条件的第二网络节点的调度。其中，所述预设条件包括以下信息：所述第二网络节点与所述第一网络节点处于相同的信道，第一网络节点检测到第二网络节点的信号强度大于指定阈值或第二网络节点检测到第一网络节点的信号强度大于指定阈值，也即若第二网络节点与第一网络节点同时竞争信道，则可能存在退避冲突问题。反之，可以理解，若第一网络节点和第二网络节点处于不同的信道，或者由于距离较远不存在交叉覆盖区域，则即使第一网络节点和第二网络节点同时通过信道传输数据，也不存在退避冲突问题，基于此，控制节点可以通过允许多个网络节点竞争信道，从而可以提升传输数据的效率。
此外，控制节点若确定第一网络节点为当前调度周期中被调度的M个网络节点中的其中一个网络节点，则控制节点还可以继续当前调度周期的调度。这样，不仅可以满足第一网络节点优先占用信道的需求，也可以保障整网的发送效率。
步骤704、所述第一网络节点确定已发送或接收所述第一数据。
步骤705、所述第一网络节点上报第一指示消息，所述第一指示消息用于指示所述第一网络节点已发送或接收所述第一数据。可选的，若控制节点在步骤703中确定不开启所述当前调度周期的调度，则此时根据第一指示消息可以恢复当前调度周期的调度。另一可选的，若控制节点在步骤703中确定不开启第二网络节点在当前调度周期的调度，则此时根据第一指示消息可以恢复对第二网络节点的调度。参阅图7C，为本申请实施例提供的第一指示消息的示例。所述第一指示消息可以包括但不限于包括以下信息：消息类型、网络节点标识、已传输(发送或接收)第一数据、保留位。
此外，可以理解，在每个调度周期，都可以存在网络节点发起如图7A所示的交互流程，用以优先占用信道来发送或接收第一数据，以上仅以一个调度周期作为示例。
步骤603、所述控制节点向所述M个网络节点发送第一调度消息，所述第一调度消息用于指示允许所述M个网络节点竞争信道。可选的，控制节点可以通过单播方式，向所述M个网络节点发送第一调度消息。另一可选的，控制节点还可以通过广播或组播方式发送第一 调度消息，以使所述M个网络节点接收到所述第一调度消息。
参阅图8，为本申请提供的调度消息的示例。所述调度消息(可以为所述第一调度消息，或以下实施例中涉及到的第二调度消息)可以包括但不限于以下消息：消息类型、网络节点标识、开启调度信息、空口速率、聚合数、发送功率、保留位。其中，所述开启调度信息可以为指示开启调度还是关闭调度，各网络节点可以根据网络节点标识确定是否开启调度；或者，所述开启调度信息还可以为仅指示开启调度，此时网络节点标识可以仅包含被调度的网络节点。例如，调度消息还可以包含指示以下信息：指示功率、信道、天线极化方向、天线波束方向等。
步骤604、所述M个网络节点分别根据所述第一调度消息竞争信道。示例性的，若网络节点接收到第一调度消息，且所述第一调度消息包含所述网络节点的标识，以及开启调度信息为允许，则网络节点此时可以去竞争信道。进一步的，在网络节点竞争到信道之后再去发送数据。相比于相关技术中，网络节点通过自由竞争和随机退避等方式来获取信道发送数据的机会，本申请实施例可以避免发生由于随机退避可能导致的冲突问题。可以理解，若存在网络节点没有接收到第一调度消息，或者虽然接收到第一调度消息但指示不开启调度，则网络节点此时不去竞争信道，继续等待控制节点对下一调度周期的决策结果。
一种可能的实施方式中，各网络节点在被调度之后，还可以及时向控制节点上报被调度的情况，以便于控制节点及时更新各网络节点的业务信息，实现更准确的调度。参阅图9，为本申请实施例中另一种可能的调度方法流程示意图。
步骤605、所述M个网络节点分别上报的第一响应消息，所述第一响应消息用于指示网络节点竞争到信道。
参阅图10，为本申请实施例提供的第一响应消息的示例。所述第一响应消息可以包括但不限于包括以下信息：消息类型、网络节点标识、竞争到信道((backoff done，BO_done)、保留位。
步骤606、控制节点根据所述第一响应消息和所述N个网络节点分别上报的业务信息，确定下一调度周期被调度的P个网络节点，所述P为正整数；可以理解，所述P小于或等于所述N。其中，所述下一调度周期的决策方式可以参阅前述实施例中介绍的内容，在此不再赘述。
步骤607、控制节点向所述P个网络节点发送第二调度消息，所述第二调度消息用于指示允许所述P个网络节点竞争信道。其中，若P为0时，控制节点也可以等待预设时长之后，重新进行后续调度周期的调度决策。
步骤608、所述M个网络节点分别上报第二响应消息，所述第二响应消息用于指示网络节点在当前调度周期的业务数据传输完成之前或之后更新的业务信息。可选的，网络节点可以在业务数据发送完成之后，可以立即上报第二响应消息，从而可以及时的通知控制节点。另一可选的，若网络节点传输的业务数据的时延性要求不高，网络节点也可以在多次被调度(允许竞争信道)之后，再上报第二响应消息，从而可以减少网络中的负载。实际实现时，可以根据实际需求调整具体的上报方式，例如，若实际需求更关注网络中的负载，则可以采用多次调度之后再统一上报的方式。
参阅图11，为本申请实施例提供的第二响应消息的示例。所述第二响应消息可以包括但不限于包括以下信息：消息类型、网络节点标识、发送完成信息、业务流量、业务时延、业务类型、业务优先级、保留位。其中，所述第二响应消息中的业务流量、业务时延、业务类型和业务优先级为所述M个网络节点在当前调度周期中发送之后更新的业务信息，该更新的 业务信息可以作为所述M个网络节点重新上报的业务信息，控制节点可以根据更新的业务信息，继续确定后续调度周期被调度的网络节点。
在前述实施例的内容中，涉及到的第一请求消息、第一指示消息、调度消息、第一响应消息和第二响应消息的示例，为通过新增帧的方式来实现的，本申请实施时，在无线网络中还可以通过在已有帧中复用的方式来实现。一示例性的，参阅图12A至12E，为本申请实施例提供的以太网帧的示例，通过在以太网帧中的有效载荷(payload)字段扩展本申请实施例中涉及到的各种消息，其中以太网包头通常包含目的地址、源地址长度和类型。另一示例性的，参阅图13，为本申请实施例提供的光网络终端管理控制接口(optical network terminal management and control interface，OMCI)协议帧的示例，还可以通过在无源光纤网络(passive optical network，PON)所采用的OMCI协议帧中扩展本申请实施例中所涉及到的各种消息，其中，OMCI协议帧包括：GPON封装模式(GPON encapsulation mode，GEM)头部(header)、事务关联标识(transaction correlation identifier)、消息类型(message type)、设备标识(device identifier)、消息标识(message identifier)、消息内容(message contents)和OMCI尾部(trailer)。
通过本申请实施例提供的方法，控制节点可以实现对多个网络节点的集中控制，通过对各网络节点的业务信息的统计，进而可以决策允许各网络节点发送数据的先后顺序。这样，在网络中，控制节点在每个调度周期内调度的网络节点被允许在当前调度周期竞争信道，以可以通过信道发送数据，而没有被调度的网络节点需要等待下一调度周期的调度结果。相比于相关技术中各网络节点通过自由竞争信道的方式来说，该方法可以避免空口的随机退避冲突，各网络节点可以根据控制节点的集中控制，实现数据的顺序发送，从而可以提升网络中整网的发送效率。
基于上述方法实施例相同的发明构思，本申请实施例还提供一种调度装置1400，如图14所示，该装置可以设置在控制节点上。所述调度装置1400包括：收发单元1401以及处理单元1402，调度装置1400可用于实现上述方法实施例中描述的方法。其中，可选的收发单元1401以及处理单元1402可以通过通信线路1403相互连接；通信线路1403可以是外设部件互连标准(peripheral component interconnect，简称PCI)总线或扩展工业标准结构(extended industry standard architecture，简称EISA)总线等。所述通信线路1403可以分为地址总线、数据总线、控制总线等。为便于表示，图14中仅用一条粗线表示，但并不表示仅有一根总线或一种类型的总线。
所述收发单元1401，用于接收N个网络节点分别上报的业务信息，所述业务信息用于指示网络节点需要通过信道传输的业务数据的信息，所述N为正整数；所述处理单元1402，用于根据所述N个网络节点分别上报的业务信息，确定当前调度周期被调度的M个网络节点，所述M为正整数，所述M小于或等于所述N；所述收发单元1401，还用于向所述M个网络节点发送第一调度消息，所述第一调度消息用于指示允许所述M个网络节点竞争信道。
在一种可能的设计中，所述收发单元1401，还用于接收所述M个网络节点分别上报的第一响应消息，所述第一响应消息用于指示网络节点竞争到信道；所述处理单元1402，还用于根据所述第一响应消息和所述N个网络节点分别上报的业务信息，确定下一调度周期被调度的P个网络节点，所述P为正整数，所述P小于或等于所述N；所述收发单元1401，还用于向所述P个网络节点发送第二调度消息，所述第二调度消息用于指示允许所述P个网络节点竞争信道。
在一种可能的设计中，所述处理单元1402，还用于通过以下方式中的至少一种更新网络 节点的业务信息：
方式一、通过所述收发单元1401接收所述M个网络节点分别上报的第二响应消息，所述第二响应消息用于指示网络节点在当前调度周期的业务数据传输完成之前或之后更新的业务信息；
方式二、通过所述收发单元1401接收所述N个网络节点分别周期性上报的更新的业务信息。
在一种可能的设计中，所述业务信息包括以下信息中的至少一种：业务类型、业务流量、业务时延、业务优先级；所述处理单元1402根据所述N个网络节点分别上报的业务信息，确定当前调度周期被调度的M个网络节点时，具体用于：若所述N个网络节点分别上报的业务信息中包含所述业务类型，根据所述业务类型以及预先配置的业务类型优先级确定网络节点的优先级；若所述N个网络节点分别上报的业务信息中包含所述业务流量，根据所述业务流量确定网络节点的优先级；若所述N个网络节点分别上报的业务信息中包含所述业务时延，根据所述业务时延确定网络节点的优先级；若所述N个网络节点分别上报的业务信息中包含所述业务优先级，根据所述业务优先级确定网络节点的优先级；根据所述网络节点的优先级，确定当前调度周期被调度的M个网络节点。
在一种可能的设计中，所述收发单元1401，还用于向所述M个网络节点发送第一调度消息之前，若接收到第一网络节点上报的第一请求消息，或者，若确定所述第一网络节点的业务信息中还包括优先请求信息，则确定所述第一网络节点请求优先占用信道；其中，所述第一请求消息或者所述优先请求信息用于请求优先占用信道，以发送或者接收第一数据；所述处理单元1402，还用于在接收到所述第一网络节点上报的第一指示消息后，进行所述当前调度周期的调度，所述第一指示消息用于指示所述第一网络节点已发送或接收所述第一数据；或者，所述处理单元1402，还用于在接收到所述第一网络节点上报的第一指示消息后，进行第二网络节点在当前调度周期的调度，所述第二网络节点与所述第一网络节点满足预设条件；所述预设条件包括以下信息：所述第二网络节点与所述第一网络节点处于相同的信道，第一网络节点检测到第二网络节点的信号强度大于指定阈值或第二网络节点检测到第一网络节点的信号强度大于指定阈值。
在一种可能的设计中，所述第一调度消息包括以下信息：网络节点标识、开启调度信息。
在一种可能的设计中，所述业务信息或所述第一调度消息通过以下方式中的一种发送：自定义数据帧、以太网帧、OMCI协议帧。
另一种示例中，图14示出的调度装置还可以设置在网络节点上。此示例下，所述收发单元1401，用于向控制节点上报业务信息，所述业务信息用于指示网络节点需要通过信道传输的业务数据的信息；所述收发单元1401，还用于接收所述控制节点发送的第一调度消息，所述第一调度消息用于指示允许所述网络节点竞争信道；所述处理单元1402，用于根据所述第一调度消息竞争信道。
在一种可能的设计中，所述收发单元1401，还用于向所述控制节点上报第一响应消息，所述第一响应消息用于指示所述网络节点竞争到信道。
在一种可能的设计中，所述收发单元1401，还用于通过以下方式中的至少一种向所述控制节点更新业务信息：
方式一、向控制节点上报第二响应消息，所述第二响应消息用于指示所述网络节点在当前调度周期的业务数据传输完成之前或之后更新的业务信息；
方式二、周期性上报更新的业务信息。
在一种可能的设计中，所述业务信息包括以下信息中的至少一种：业务类型、业务流量、业务时延、业务优先级。
在一种可能的设计中，所述处理单元1402，还用于检测到存在待发送或接收的第一数据；所述收发单元1401，还用于向所述控制节点上报第一请求消息，所述第一请求消息用于请求优先占用信道发送或接收第一数据；所述收发单元1401，还用于已发送或接收所述第一数据之后，向所述控制节点上报第一指示消息，所述第一指示消息用于指示所述网络节点已发送或接收所述第一数据。
在一种可能的设计中，所述第一调度消息包括以下信息：网络节点标识、开启调度信息。
在一种可能的设计中，所述业务信息或所述第一调度消息通过以下方式中的一种发送：自定义数据帧、以太网帧、OMCI协议帧。
需要说明的是，本申请实施例中对模块的划分是示意性的，仅仅为一种逻辑功能划分，实际实现时可以有另外的划分方式，例如多个单元或组件可以结合或者可以集成到另一个系统，或一些特征可以忽略，或不执行。另外，在本申请各个实施例中的各功能单元可以集成在一个处理单元中，也可以是单独物理存在，也可以两个或两个以上单元集成在一个单元中。上述集成的单元既可以采用硬件的形式实现，也可以采用软件功能单元的形式实现。
集成的单元如果以软件功能单元的形式实现并作为独立的产品销售或使用时，可以存储在一个计算机可读取存储介质中。基于这样的理解，本申请的技术方案本质上或者说对相关技术做出贡献的部分或者该技术方案的全部或部分可以以软件产品的形式体现出来，该计算机软件产品存储在一个存储介质中，包括若干指令用以使得一台计算机设备(可以是个人计算机，服务器，或者网络设备等)或处理器(processor)执行本申请各个实施例方法的全部或部分步骤。而前述的存储介质包括：U盘、移动硬盘、只读存储器(read-only memory，ROM)、随机存取存储器(random access memory，RAM)、磁碟或者光盘等各种可以存储程序代码的介质。
基于与上述调度方法相同的构思，如图15所示，本申请实施例还提供了另一种调度装置1500的结构示意图。调度装置1500可用于实现上述方法实施例中描述的方法，可以参见上述方法实施例中的说明。调度装置1500可以包括一个或多个处理器1501。处理器1501可以是通用处理器或者专用处理器等。例如可以是基带处理器、或中央处理器。基带处理器可以用于对通信协议以及通信数据进行处理，中央处理器可以用于对调度装置(如，基站、终端、或芯片等)进行控制，执行软件程序，处理软件程序的数据。调度装置可以包括收发单元，用以实现信号的输入(接收)和输出(发送)。例如，收发单元可以为收发器，射频芯片等。
调度装置1500包括一个或多个处理器1501，一个或多个处理器1501可实现上述所示的实施例中所示的方法。
可选的，处理器1501除了实现上述所示的实施例的方法，还可以实现其他功能。
可选的，一种设计中，处理器1501可以执行指令，使得调度装置1500执行上述方法实施例中描述的方法。指令可以全部或部分存储在处理器内，如指令1503，也可以全部或部分存储在与处理器耦合的存储器1502中，如指令1504，也可以通过指令1503和1504共同使得调度装置1500执行上述方法实施例中描述的方法。
在又一种可能的设计中调度装置1500中可以包括一个或多个存储器1502，其上存有指令1504，指令可在处理器上被运行，使得调度装置1500执行上述方法实施例中描述的方法。可选的，存储器中还可以存储有数据。可选的处理器中也可以存储指令和/或数据。例如，一个或多个存储器1502可以存储上述实施例中所描述的对应关系，或者上述实施例中所涉及的 相关的参数或表格等。处理器和存储器可以单独设置，也可以集成在一起。
在又一种可能的设计中，调度装置1500还可以包括收发器1505以及天线1506。处理器1501可以称为处理单元，对装置(终端或者基站)进行控制。收发器1505可以称为收发机、收发电路、或者收发单元等，用于通过天线1506实现装置的收发功能。
应注意，本申请实施例中的处理器可以是一种集成电路芯片，具有信号的处理能力。在实现过程中，上述方法实施例的各步骤可以通过处理器中的硬件的集成逻辑电路或者软件形式的指令完成。上述的处理器可以是通用处理器、数字信号处理器(digital signal processor，DSP)、专用集成电路(application specific integrated circuit，ASIC)、现成可编程门阵列(field programmable gate array，FPGA)或者其他可编程逻辑器件、分立门或者晶体管逻辑器件、分立硬件组件。可以实现或者执行本申请实施例中的公开的各方法、步骤及逻辑框图。通用处理器可以是微处理器或者该处理器也可以是任何常规的处理器等。结合本申请实施例所公开的方法的步骤可以直接体现为硬件译码处理器执行完成，或者用译码处理器中的硬件及软件模块组合执行完成。软件模块可以位于随机存储器，闪存、只读存储器，可编程只读存储器或者电可擦写可编程存储器、寄存器等本领域成熟的存储介质中。该存储介质位于存储器，处理器读取存储器中的信息，结合其硬件完成上述方法的步骤。
可以理解，本申请实施例中的存储器可以是易失性存储器或非易失性存储器，或可包括易失性和非易失性存储器两者。其中，非易失性存储器可以是只读存储器(ROM)、可编程只读存储器(programmable ROM，PROM)、可擦除可编程只读存储器(erasable PROM，EPROM)、电可擦除可编程只读存储器(electrically EPROM，EEPROM)或闪存。易失性存储器可以是随机存取存储器(RAM)，其用作外部高速缓存。通过示例性但不是限制性说明，许多形式的RAM可用，例如静态随机存取存储器(static RAM，SRAM)、动态随机存取存储器(dynamic RAM，DRAM)、同步动态随机存取存储器(synchronous DRAM，SDRAM)、双倍数据速率同步动态随机存取存储器(double data rate SDRAM，DDR SDRAM)、增强型同步动态随机存取存储器(enhanced SDRAM，ESDRAM)、同步连接动态随机存取存储器(synchlink DRAM，SLDRAM)和直接内存总线随机存取存储器(direct rambus RAM，DR RAM)。应注意，本文描述的系统和方法的存储器旨在包括但不限于这些和任意其它适合类型的存储器。
本申请实施例还提供一种调度系统，所述系统可以包括上述方法实施例中介绍到控制节点和N个网络节点。其中，控制节点可执行如上述方法实施例中介绍到的控制节点可以实现的内容，各网络节点可执行如上述方法实施例中介绍到的网络节点可以实现的内容。
本申请实施例还提供了一种计算机可读存储介质，其上存储有计算机程序，该计算机程序被计算机执行时实现上述所示的任一方法实施例的调度方法。
本申请实施例还提供了一种计算机程序产品，该计算机程序产品被计算机执行时实现上述所示的任一方法实施例的调度方法。
在上述实施例中，可以全部或部分地通过软件、硬件、固件或者其任意组合来实现。当使用软件实现时，可以全部或部分地以计算机程序产品的形式实现。计算机程序产品包括一个或多个计算机指令。在计算机上加载和执行计算机指令时，全部或部分地产生按照本申请实施例的流程或功能。计算机可以是通用计算机、专用计算机、计算机网络、或者其他可编程装置。计算机指令可以存储在计算机可读存储介质中，或者从一个计算机可读存储介质向另一个计算机可读存储介质传输，例如，计算机指令可以从一个网站站点、计算机、服务器或数据中心通过有线(例如同轴电缆、光纤、数字用户线(digital subscriber line，DSL))或 无线(例如红外、无线、微波等)方式向另一个网站站点、计算机、服务器或数据中心进行传输。计算机可读存储介质可以是计算机能够存取的任何可用介质或者是包含一个或多个可用介质集成的服务器、数据中心等数据存储设备。可用介质可以是磁性介质(例如，软盘、硬盘、磁带)、光介质(例如，高密度数字视频光盘(digital video disc，DVD))、或者半导体介质(例如，固态硬盘(solid state disk，SSD))等。
如图16所示，本申请实施例还提供了一种芯片1600，包括输入输出接口1601和逻辑电路1602，输入输出接口1601用于接收/输出代码指令或信息，逻辑电路1602用于执行代码指令或根据信息，以执行上述所示的任一方法实施例的调度方法。
芯片1600可以实现上述实施例中处理单元和/或收发单元所示的功能。
本领域普通技术人员可以意识到，结合本文中所公开的实施例描述的各示例的单元及算法步骤，能够以电子硬件、计算机软件或者二者的结合来实现，为了清楚地说明硬件和软件的可互换性，在上述说明中已经按照功能一般性地描述了各示例的组成及步骤。这些功能究竟以硬件还是软件方式来执行，取决于技术方案的特定应用和设计约束条件。专业技术人员可以对每个特定的应用来使用不同方法来实现所描述的功能，但是这种实现不应认为超出本申请的范围。
所属领域的技术人员可以清楚地了解到，为了描述的方便和简洁，上述描述的系统、装置和单元的具体工作过程，可以参考前述方法实施例中的对应过程，在此不再赘述。
在本申请所提供的几个实施例中，应该理解到，所揭露的装置和方法，可以通过其它的方式实现。

Claims (25)

  1. 一种调度方法，其特征在于，包括：
    控制节点接收N个网络节点分别上报的业务信息，所述业务信息用于指示网络节点需要通过信道传输的业务数据的信息，所述N为正整数；
    所述控制节点根据所述N个网络节点分别上报的业务信息，确定当前调度周期被调度的M个网络节点，所述M为正整数，所述M小于或等于所述N；
    所述控制节点向所述M个网络节点发送第一调度消息，所述第一调度消息用于指示允许所述M个网络节点竞争信道。
  2. 根据权利要求1所述的方法，其特征在于，所述方法还包括：
    所述控制节点接收所述M个网络节点分别上报的第一响应消息，所述第一响应消息用于指示网络节点竞争到信道；
    所述控制节点根据所述第一响应消息和所述N个网络节点分别上报的业务信息，确定下一调度周期被调度的P个网络节点，所述P为正整数，所述P小于或等于所述N；
    所述控制节点向所述P个网络节点发送第二调度消息，所述第二调度消息用于指示允许所述P个网络节点竞争信道。
  3. 根据权利要求1或2所述的方法，其特征在于，所述方法还包括：
    所述控制节点通过以下方式中的至少一种更新网络节点的业务信息：
    所述控制节点接收所述M个网络节点分别上报的第二响应消息，所述第二响应消息用于指示网络节点在当前调度周期的业务数据传输完成之前或之后更新的业务信息；
    所述控制节点接收所述N个网络节点分别周期性上报的更新的业务信息。
  4. 根据权利要求1至3中任一项所述的方法，其特征在于，所述业务信息包括以下信息中的至少一种：业务类型、业务流量、业务时延、业务优先级；
    所述控制节点根据所述N个网络节点分别上报的业务信息，确定当前调度周期被调度的M个网络节点，包括：
    若所述N个网络节点分别上报的业务信息中包含所述业务类型，根据所述业务类型以及预先配置的业务类型优先级确定网络节点的优先级；若所述N个网络节点分别上报的业务信息中包含所述业务流量，根据所述业务流量确定网络节点的优先级；若所述N个网络节点分别上报的业务信息中包含所述业务时延，根据所述业务时延确定网络节点的优先级；若所述N个网络节点分别上报的业务信息中包含所述业务优先级，根据所述业务优先级确定网络节点的优先级；
    所述控制节点根据所述网络节点的优先级，确定当前调度周期被调度的M个网络节点。
  5. 根据权利要求1至4中任一项所述的方法，其特征在于，所述控制节点向所述M个网络节点发送第一调度消息之前，所述方法还包括：
    若所述控制节点接收到第一网络节点上报的第一请求消息，或者，若所述控制节点确定所述第一网络节点的业务信息中还包括优先请求信息，则确定所述第一网络节点请求优先占用信道；其中，所述第一请求消息或所述优先请求信息用于请求优先占用信道，以发送或者接收第一数据；
    所述控制节点在接收到所述第一网络节点上报的第一指示消息后，进行所述当前调度周期的调度，所述第一指示消息用于指示所述第一网络节点已发送或接收所述第一数据；或者，
    所述控制节点在接收到所述第一网络节点上报的第一指示消息后，进行第二网络节点在当前调度周期的调度，所述第二网络节点与所述第一网络节点满足预设条件；其中，所述预设条件包括以下信息：所述第二网络节点与所述第一网络节点处于相同的信道，第一网络节点检测到第二网络节点的信号强度大于指定阈值或第二网络节点检测到第一网络节点的信号强度大于所述指定阈值。
  6. 根据权利要求1至5中任一所述的方法，其特征在于，所述第一调度消息包括以下信息：网络节点标识、开启调度信息。
  7. 根据权利要求1至6中任一所述的方法，其特征在于，所述业务信息或所述第一调度消息通过以下方式中的一种发送：自定义数据帧、以太网帧、光网络终端管理控制接口OMCI协议帧。
  8. 一种调度方法，其特征在于，包括：
    网络节点向控制节点上报业务信息，所述业务信息用于指示网络节点需要通过信道传输的业务数据的信息；
    所述网络节点接收所述控制节点发送的第一调度消息，所述第一调度消息用于指示允许所述网络节点竞争信道；
    所述网络节点根据所述第一调度消息竞争信道。
  9. 根据权利要求8所述的方法，其特征在于，所述方法还包括：
    所述网络节点向所述控制节点上报第一响应消息，所述第一响应消息用于指示所述网络节点竞争到信道。
  10. 根据权利要求8或9所述的方法，其特征在于，所述方法还包括：
    所述网络节点通过以下方式中的至少一种向所述控制节点更新业务信息：
    所述网络节点向控制节点上报第二响应消息，所述第二响应消息用于指示所述网络节点在当前调度周期的业务数据传输完成之前或之后更新的业务信息；
    所述网络节点周期性上报更新的业务信息。
  11. 根据权利要求8至10中任一项所述的方法，其特征在于，所述业务信息包括以下信息中的至少一种：业务类型、业务流量、业务时延、业务优先级。
  12. 根据权利要求8至11中任一项所述的方法，其特征在于，所述方法还包括：
    若所述网络节点检测到存在待发送或接收的第一数据，向所述控制节点上报第一请求消息，所述第一请求消息用于请求优先占用信道发送或接收所述第一数据；或者，若所述网络节点检测到存在待发送或接收的第一数据，通过所述业务信息携带优先请求信息，所述优先请求信息用于请求优先占用信道发送或接收所述第一数据；
    所述网络节点已发送或接收所述第一数据之后，向所述控制节点上报第一指示消息，所述第一指示消息用于指示所述网络节点已发送或接收所述第一数据。
  13. 根据权利要求8至12中任一项所述的方法，其特征在于，所述第一调度消息包括以下信息：网络节点标识、开启调度信息。
  14. 根据权利要求8至13中任一项所述的方法，其特征在于，所述业务信息或所述第一调度消息通过以下方式中的一种发送：自定义数据帧、以太网帧、OMCI协议帧。
  15. 一种调度系统，其特征在于，所述系统包括控制节点、N个网络节点，所述N为正整数；
    所述N个网络节点，用于分别向控制节点上报业务信息，所述业务信息用于指示网络节点需要通过信道传输的业务数据的信息；
    所述控制节点，用于：
    接收所述N个网络节点分别上报的业务信息；
    根据所述N个网络节点分别上报的业务信息，确定当前调度周期被调度的M个网络节点，所述M为正整数，所述M小于或等于所述N；
    向所述M个网络节点发送第一调度消息，所述第一调度消息用于指示允许所述网络节点竞争信道；
    所述M个网络节点，还用于分别接收所述第一调度消息，以及根据所述第一调度消息竞争信道。
  16. 一种调度装置，其特征在于，所述装置包括收发单元和处理单元；
    所述收发单元，用于接收N个网络节点分别上报的业务信息，所述业务信息用于指示网络节点需要通过信道传输的业务数据的信息，所述N为正整数；
    所述处理单元，用于根据所述N个网络节点分别上报的业务信息，确定当前调度周期被调度的M个网络节点，所述M为正整数，所述M小于或等于所述N；
    所述收发单元，还用于向所述M个网络节点发送第一调度消息，所述第一调度消息用于指示允许所述M个网络节点竞争信道。
  17. 根据权利要求16所述的装置，其特征在于，所述收发单元，还用于接收所述M个网络节点分别上报的第一响应消息，所述第一响应消息用于指示网络节点竞争到信道；
    所述处理单元，还用于根据所述第一响应消息和所述N个网络节点分别上报的业务信息，确定下一调度周期被调度的P个网络节点，所述P为正整数，所述P小于或等于所述N；
    所述收发单元，还用于向所述P个网络节点发送第二调度消息，所述第二调度消息用于指示允许所述P个网络节点竞争信道。
  18. 根据权利要求16或17所述的装置，其特征在于，所述处理单元，还用于通过以下方式中的至少一种更新网络节点的业务信息：
    通过所述收发单元接收所述M个网络节点分别上报的第二响应消息，所述第二响应消息用于指示网络节点在当前调度周期的业务数据传输完成之前或之后更新的业务信息；
    通过所述收发单元接收所述N个网络节点分别周期性上报的更新的业务信息。
  19. 根据权利要求16至18中任一项所述的装置，其特征在于，所述业务信息包括以下信息中的至少一种：业务类型、业务流量、业务时延、业务优先级；
    所述处理单元根据所述N个网络节点分别上报的业务信息，确定当前调度周期被调度的M个网络节点时，具体用于：
    若所述N个网络节点分别上报的业务信息中包含所述业务类型，根据所述业务类型以及预先配置的业务类型优先级确定网络节点的优先级；若所述N个网络节点分别上报的业务信息中包含所述业务流量，根据所述业务流量确定网络节点的优先级；若所述N个网络节点分别上报的业务信息中包含所述业务时延，根据所述业务时延确定网络节点的优先级；若所述N个网络节点分别上报的业务信息中包含所述业务优先级，根据所述业务优先级确定网络节点的优先级；
    根据所述网络节点的优先级，确定当前调度周期被调度的M个网络节点。
  20. 根据权利要求16至19中任一项所述的装置，其特征在于，所述收发单元，还用于向所述M个网络节点发送第一调度消息之前，若接收到第一网络节点上报的第一请求消息，或者，若确定所述第一网络节点的业务信息中还包括优先请求信息，则确定所述第一网络节点优先请求占用信道；其中，所述第一请求信息或者所述优先请求信息用于请求优先占用信道， 以发送或者接收第一数据；
    所述处理单元，还用于在接收到所述第一网络节点上报的第一指示消息后，进行所述当前调度周期的调度，所述第一指示消息用于指示所述第一网络节点已发送或接收所述第一数据；或者，
    所述处理单元，还用于在接收到所述第一网络节点上报的第一指示消息后，进行第二网络节点在当前调度周期的调度，所述第二网络节点与所述第一网络节点满足预设条件；所述预设条件包括以下信息：所述第二网络节点与所述第一网络节点处于相同的信道，第一网络节点检测到第二网络节点的信号强度大于指定阈值或第二网络节点检测到第一网络节点的信号强度大于指定阈值。
  21. 一种调度装置，其特征在于，所述装置包括收发单元和处理单元；
    所述收发单元，用于向控制节点上报业务信息，所述业务信息用于指示网络节点需要通过信道传输的业务数据的信息；
    所述收发单元，还用于接收所述控制节点发送的第一调度消息，所述第一调度消息用于指示允许所述网络节点竞争信道；
    所述处理单元，用于根据所述第一调度消息竞争信道。
  22. 根据权利要求21所述的装置，其特征在于，所述收发单元，还用于向所述控制节点上报第一响应消息，所述第一响应消息用于指示所述网络节点竞争到信道。
  23. 根据权利要求21或22所述的装置，其特征在于，所述收发单元，还用于通过以下方式中的至少一种向所述控制节点更新业务信息：
    向控制节点上报第二响应消息，所述第二响应消息用于指示所述网络节点在当前调度周期的业务数据传输完成之前或之后更新的业务信息；
    周期性上报更新的业务信息。
  24. 根据权利要求21至23中任一项所述的装置，其特征在于，所述业务信息包括以下信息中的至少一种：业务类型、业务流量、业务时延、业务优先级。
  25. 根据权利要求21至24中任一项所述的装置，其特征在于，所述处理单元，还用于检测到存在待发送或接收的第一数据；
    所述收发单元，还用于向所述控制节点上报第一请求消息，所述第一请求消息用于请求优先占用信道发送或接收所述第一数据；
    所述收发单元，还用于已发送或接收所述第一数据之后，向所述控制节点上报第一指示消息，所述第一指示消息用于指示所述网络节点已发送或接收所述第一数据。
PCT/CN2023/074646 2022-02-23 2023-02-06 一种调度方法、系统及装置 WO2023160365A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202210167775.2A CN116684981A (zh) 2022-02-23 2022-02-23 一种调度方法、系统及装置
CN202210167775.2 2022-02-23

Publications (1)

Publication Number Publication Date
WO2023160365A1 true WO2023160365A1 (zh) 2023-08-31

Family

ID=87764774

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2023/074646 WO2023160365A1 (zh) 2022-02-23 2023-02-06 一种调度方法、系统及装置

Country Status (2)

Country Link
CN (1) CN116684981A (zh)
WO (1) WO2023160365A1 (zh)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106332153A (zh) * 2015-06-30 2017-01-11 华为技术有限公司 一种wlan中的带宽控制方法及装置
US20170171890A1 (en) * 2015-12-11 2017-06-15 Huawei Technologies Co., Ltd. Method and system for contention-based channel allocation
US20190289633A1 (en) * 2016-11-17 2019-09-19 Yonggang Fang Slotted ofdma based channel access
WO2021230764A1 (en) * 2020-05-15 2021-11-18 Huawei Technologies Co., Ltd Devices and methods for a wireless multi ap network
WO2022021819A1 (zh) * 2020-07-31 2022-02-03 中兴通讯股份有限公司 一种业务的接入方法、装置及系统

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106332153A (zh) * 2015-06-30 2017-01-11 华为技术有限公司 一种wlan中的带宽控制方法及装置
US20170171890A1 (en) * 2015-12-11 2017-06-15 Huawei Technologies Co., Ltd. Method and system for contention-based channel allocation
US20190289633A1 (en) * 2016-11-17 2019-09-19 Yonggang Fang Slotted ofdma based channel access
WO2021230764A1 (en) * 2020-05-15 2021-11-18 Huawei Technologies Co., Ltd Devices and methods for a wireless multi ap network
WO2022021819A1 (zh) * 2020-07-31 2022-02-03 中兴通讯股份有限公司 一种业务的接入方法、装置及系统

Also Published As

Publication number Publication date
CN116684981A (zh) 2023-09-01

Similar Documents

Publication Publication Date Title
US20190306790A1 (en) Method and apparatus for managing target wake time in a communication network
KR100645539B1 (ko) 무선 랜 시스템의 무선 자원 사용 장치 및 방법
US7535919B2 (en) Wireless communication method adapting priority for transmitting packets in WPAN
JP2005501466A (ja) 近傍情報及び公示伝送時間を利用する無衝突伝送スケジューリングのためのシステム及び方法
KR101184094B1 (ko) 무선랜 시스템에서의 스케줄링 방법
US20030223365A1 (en) Class of dynamic programming schedulers
WO2022143176A1 (zh) 业务传输方法、装置及系统
KR20050062747A (ko) 하이브리드 내재 토큰 ｃｓｍａ/ｃａ 프로토콜.
US20190357053A1 (en) Neighbor Awareness Networking Time Slot Allocation
KR20040082588A (ko) 모바일 애드 혹 네트워크에서 이동 단말기의 매체 액세스제어 프로토콜 계층 모듈 및 매체 액세스 제어 프로토콜계층 모듈의 프레임 송수신 방법
JP7491389B2 (ja) 基地局及び端末
WO2015081718A1 (zh) 无线网络的通信处理方法及装置
TW202224477A (zh) 用於調度資料傳輸之裝置和方法
US20040085993A1 (en) Shared-medium contention algorithm exhibiting fairness
WO2023160365A1 (zh) 一种调度方法、系统及装置
US20230269804A1 (en) Base station and terminal apparatus
Rathnakar Acharya et al. WLAN QoS issues and IEEE 802.11 e QoS enhancement
WO2024192994A1 (zh) 从设备、主设备、通信系统和数据传输方法
WO2024214276A1 (ja) アクセスポイント及び端末
CN114584216B (zh) 一种无线局域网的参数配置方法及装置
WO2024214275A1 (ja) アクセスポイント及び端末
WO2024009452A1 (ja) 無線装置及び無線通信方法
WO2023021608A1 (ja) 送信局及び受信局
WO2024009451A1 (ja) 無線装置及び無線通信方法
US20040085992A1 (en) Shared-medium contention algorithm exhibiting fairness

Legal Events

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

Ref document number: 23758990

Country of ref document: EP

Kind code of ref document: A1

WWE Wipo information: entry into national phase

Ref document number: 2023758990

Country of ref document: EP

ENP Entry into the national phase

Ref document number: 2023758990

Country of ref document: EP

Effective date: 20240829

NENP Non-entry into the national phase

Ref country code: DE

WWE Wipo information: entry into national phase

Ref document number: 11202405738P

Country of ref document: SG