Apparatus and method for priority transmission scheme

Abstract

The invention relates to a device and a method for a priority transmission scheme. Aspects of the present disclosure include methods, controllers, and / or computer readable media for providing a first queue having a first plurality of transmission opportunities to a plurality of nodes to transmit first information of a first priority; granting a first permission to at least a first subset of the plurality of nodes to transmit at least a first portion of the first information of the first priority; and after transmitting the first information, replacing a second queue having a second plurality of transmission opportunities for the plurality of nodes to transmit second information of a second priority with a third queue having a third plurality of transmission opportunities for the plurality of nodes to transmit third information of a third priority, the third priority is higher than the second priority.

Description

[0001] Cross - Reference to Related Applications

[0002] This patent application claims priority to U.S. Non - Provisional Application No. 18 / 402421, titled "Apparatus and Method for Priority Transmission Scheme", filed on January 2, 2024, which is hereby incorporated herein by reference in its entirety. Technical Field

[0003] This disclosure relates to devices and methods for a priority transmission scheme. Background Art

[0004] In a computer network, multiple devices can be connected together via one or more buses for communication inside and outside the network. These devices may need to share resources such as communication channels and / or bandwidth. For the various interconnected devices, there may be many ways to implement resource scheduling. Examples of resource scheduling include First - In - First - Out (FIFO) and polling. However, the above - mentioned scheduling schemes may have various drawbacks. Therefore, improvements are desirable. Summary of the Invention

[0005] The following presents a simplified overview of one or more aspects in order to provide a basic understanding of these aspects. This overview is not an extensive overview of all contemplated aspects, and is neither intended to identify key or critical elements of all aspects nor to describe the scope of any or all aspects. Its sole purpose is to present some concepts of one or more aspects in a simplified form as a prelude to the more detailed description presented later.

[0006] Aspects of the present disclosure include methods, controllers, and / or non - transitory computer - readable media for the purposes of: providing a first queue with a first plurality of transmission opportunities to a plurality of nodes to transmit first information of a first priority; granting a first permission to at least a first subset of the plurality of nodes to transmit at least a first portion of the first information of the first priority; and after transmitting the first information, replacing a second queue with a second plurality of transmission opportunities for the plurality of nodes to transmit second information of a second priority with a third queue with a third plurality of transmission opportunities for the plurality of nodes to transmit third information of a third priority, the third priority being higher than the second priority.

[0007] To achieve the above and related purposes, one or more aspects include the features fully described and particularly pointed out in the claims below. The following description and the drawings set forth in detail certain illustrative features of one or more aspects. However, these features are only indicative of the few ways in which the principles of the various aspects may be employed, and this description is intended to include all such aspects and their equivalents. Brief Description of the Drawings

[0008] Aspects of the disclosure will be described below in conjunction with the accompanying drawings, which are used for illustration and not limitation of the disclosed aspects, where like reference numerals represent like elements, and where:

[0009] Figure 1 Shows an example of a priority transmission scheme according to aspects of the present disclosure.

[0010] Figure 2 Shows an example of a network for implementing a priority transmission scheme according to aspects of the present disclosure.

[0011] Figure 3A -B shows an example of resources during the implementation of a priority transmission scheme according to aspects of the present disclosure.

[0012] Figure 4 Shows an example of an end node for implementing a priority transmission scheme according to aspects of the present disclosure.

[0013] Figure 5 Shows an example of a controller for implementing the above priority transmission scheme according to aspects of the present disclosure.

[0014] Figure 6 Shows an example of a method for implementing a priority transmission scheme according to aspects of the present disclosure. Detailed Description

[0015] The detailed description set forth below in connection with the appended drawings is intended as a description of various configurations and is not intended to represent the only configurations in which the concepts described herein may be practiced. The detailed description includes specific details for the purpose of providing a thorough understanding of various concepts. However, it will be apparent to those skilled in the art that these concepts may be practiced without these specific details. In some instances, well-known structures and components are shown in block diagram form to avoid obscuring such concepts.

[0016] Aspects of the present disclosure include a scheme that allows for the implementation of priority transmission arbitration on a shared network bus (such as an IEEE 10BASE-T1S shared multi-point bus). The bus may support Physical Layer Collision Avoidance (PLCA) or other optimized polling bus access methods (such as time division multiplexing), where the end of each cycle may be identified by each node sharing the bus. The cost of supporting this scheme may include a slight reduction in the overall bandwidth efficiency of the network segment. This solution may be interoperable with devices that do not support the priority scheme. Devices that are not supported may operate as if they were transmitting at a specific priority (e.g., the highest or lowest priority).

[0017] In some cases, a network may include multiple devices interconnected by one or more buses. In some cases (i.e., fairness of bus access), devices sharing a network bus may operate with the same priority. As a result, high-priority traffic is delayed by low-priority traffic. This may limit the effectiveness of the network for certain applications where latency of certain high-priority messages is important. The lack of network priority also limits the functions that can be implemented in the MAC layer.

[0018] In some cases, the IEEE 10BASE-T1S bus (or other buses supporting sequential polling access) may not support inter-node priority. It supports within a node (e.g., between priority queues within a specific node). Aspects of the present disclosure include a method of implementing inter-node priority support and combining it with existing intra-node priority.

[0019] Traditional solutions may include allowing the transmission cycle to be interrupted after any node on the shared bus transmits a data frame. Then, the cycle returns to the start. Nodes on the shared bus transmit in ascending order of identifier value. Thus, this solution gives priority to nodes with lower identifier values. This is non-standard and requires additional unapproved signals on the bus.

[0020] In some aspects of the present disclosure, each PLCA cycle is reserved for a specific priority. The maximum number of PLCA cycles is set by the available priority queues on the segment (e.g., if a segment only supports 4 priorities, then the complete PLCA priority cycle will be 4 cycles). The complete priority cycle can start from the highest priority supported on the segment. If no frame is transmitted within a cycle, the next PLCA cycle represents the next supported priority. Each node keeps track of the current PLCA cycle priority.

[0021] In certain aspects of the present disclosure, there can be two options to control the reset of the current priority cycle. For the first option, after the priority of each transmitted frame, the system returns to the highest priority supported on the segment. This can occur for both frame and node priorities. Under this option, a node with a high-priority frame can control the bandwidth. For the second option, after a PLCA cycle including at least one transmitted frame, the priority returns to the highest priority supported on the segment. This provides frame priority but with node fairness. Here, if a higher-priority frame arrives at the exit queue of a node, it may have to wait for a lower-priority frame (the current PLCA priority cycle) to complete before having the opportunity to transmit its frame. If the current node supports the current priority, is in its PLCA transmission opportunity time slot, and has a frame available, the current node can transmit. Otherwise, the node must wait until the above conditions are met.

[0022] Figure 1Shows an example of a priority transmission scheme 100 according to aspects of the present disclosure. Scheme 100 can be executed by an end node and / or one or more sub-components or controllers of the end node. In scheme 100, shared bus access rights can be granted in an optimized scheme, such as a polling scheme. If a node does not quickly utilize the transmission opportunity, the opportunity is passed to the next node in the round. Each cycle represents a priority (stored in priority_cnt). The completion of each cycle is signaled by cycle_end. When a cycle completes without any node transmitting a data frame on the shared bus, the priority count can be decremented to the next supported segment priority count. When the minimum supported segment priority cycle completes, the priority is reset to the maximum supported segment priority.

[0023] In some aspects, when a frame of data is received (frame_received) within a cycle, there may be two options. First, each node immediately resets its priority to the maximum supported segment priority. From that point on, only the node with the frame of the highest priority can transmit. Second, each node resets its priority to the maximum supported segment priority at the end of the current cycle. The node with the current active priority can transmit until the end of the cycle.

[0024] In some aspects, when a node has a frame that matches the current cycle priority and the corresponding time slot of the node matches, the node can transmit its frame. The supported priorities can be configured for each node. The segment-supported priorities can be a superset of all the supported node priorities.

[0025] At 105, scheme 100 can start allocating resources for the transmission of information associated with the highest priority. In some aspects, scheme 100 can include multiple priorities (also referred to as priorities). Scheme 100 can allocate one or more time slots for connected devices to transmit information of the highest priority (such as data). These devices may or may not have data to transmit. Scheme 100 can wait for a first time period.

[0026] At 110, in some aspects, scheme 100 can start allocating resources for the transmission of information associated with the second highest priority after the first time period expires, without transmitting any information of the highest priority. Scheme 100 can wait for a second time period. The second time period can be the same as or different from the first time period. If there is no information for transmission, scheme 100 can start allocating resources for the transmission of information associated with the next highest priority, and so on.

[0027] At 115, if there is information for transmission associated with the current priority (e.g., the second highest priority), scheme 100 can wait for the transmission opportunity (TO) associated with the current priority.

[0028] At 120, the solution 100 may send information associated with the second highest priority. After transmitting the information associated with the second highest priority, the solution 100 may return to 105 to start allocating resources for transmitting information associated with the highest priority.

[0029] Figure 2 An example of an environment 200 implementing a priority transmission scheme in accordance with aspects of the present disclosure is shown. In some aspects, the environment 200 may include a plurality of end nodes 210-1, 210-2... 210-n, where n is a positive integer configured to send and / or receive information. The current transmission scheme may be implemented by the plurality of end nodes 210-1, 210-2... 210-n.

[0030] In certain aspects, the current scheme may implement priority access to the bus among the end nodes. The bus access may operate using a scheme such as round-robin. Each round may represent a decreasing priority selection. Each node may transmit based on whether they have a transmission queue configured for the current priority. After any node sends a frame, the priority may be reset to the maximum priority. After the minimum priority transmission opportunity, the priority may be restored to the maximum priority. The current scheme may be compatible with other standards, such as existing IEEE standards.

[0031] In one aspect, each of the plurality of end nodes 210-1, 210-2... 210-n may have a host controller 230 configured to operate the respective end node. For example, the host controller 230 may be configured to send data to local queues TC 1... TC. The host controller 230 may be configured to receive data through a receive (RX) media access control (MAC) interface.

[0032] In some aspects, each of the plurality of end nodes 210-1, 210-2... 210-n may have local queues TC 1... TC m associated with different transmission priorities, where m is a positive integer. One of the plurality of end nodes 210-1, 210-2... 210-n may place the information with the highest priority in the first local queue TC 1, the information with the second highest priority in the second local queue TC 2, and so on. The local queues may indicate the order of transmitting information from the respective end nodes to an external device. The information with the highest priority (i.e., the information in the first local queue TC 1) may be sent first, and then the remaining information in the remaining queues (if any) may be sent in sequence. Although Figure 2The multiple end nodes 210-1, 210-2... 210-n shown in [figure] have the same number of priorities. However, aspects of the present disclosure include a priority transmission scheme that is also applicable to multiple terminal nodes 210-1, 210-2... 210-n having different numbers of priorities.

[0033] In some aspects, each of the multiple end nodes 210-1, 210-2... 210-n may include a priority controller 232 configured to control a multiplexer 234. For example, the priority controller 232 may determine a data sequence from local queues TC 1... TC m for the multiplexer 234 to transmit. Each of the multiple end nodes 210-1, 210-2... 210-n may include a transmit (TX) MAC and a receive (RX) MAC interface, as well as a T1S PHY interface, which may be a 10BASE-T1S half-duplex physical interface.

[0034] Aspects of the present disclosure may include implementing a priority transmission scheme at the physical interface 250 of the multiple end nodes 210-1, 210-2... 210-n. The physical interface 250 may be an interface that bridges the T1S PHY interfaces of the multiple end nodes 210-1, 210-2,... 210-n and other external devices.

[0035] In some aspects, the current scheme may allocate a first resource, such as a time slot of network bandwidth, for transmitting information of a first priority. If the first resource is not used to transmit information, the scheme may allocate a second resource for transmitting information of a second priority lower than the first priority. If some or all of the first resources (i.e., by one or more of the multiple end nodes 210-1, 210-2... 210-n) are used to transmit information, the current scheme may allocate a third resource for transmitting information of the highest priority. Specifically, the current scheme may allocate the third resource for transmitting information in the TC 1 queue (if any) of the multiple end nodes 210-1, 210-2... 210-n. Here, according to certain aspects of the present disclosure, the first priority may be either the highest priority or any of the lower priorities.

[0036] In some aspects, the current scheme may allocate the third resource after transmitting information (of the first priority) at all of the multiple end nodes 210-1, 210-2... 210-n having information available for transmission. Thus, the current scheme may include waiting for all the information in the TC 1 queue of the multiple end nodes 210-1, 210-2... 210-n to be sent before allocating the third resource. This is referred to as the first sub-scheme.

[0037] In other aspects, the current solution can allocate a third resource after a first end node among multiple end nodes 210-1, 210-2... 210-n having information available for transmission transmits the (first-priority) information. Thus, before allocating the third resource, the current solution may wait for only one end node to finish transmitting. This is referred to as the second sub-solution. Other solutions according to aspects of the present disclosure may also be implemented.

[0038] For example, the current solution can switch between the two sub-solutions described above. In another example, when operating in the second sub-solution, if the first priority is also the highest priority, the current solution can avoid allocating the third resource. In another example, when operating in the second sub-solution, the current solution can randomly select an end node to transmit the first-priority information. In another example, when operating in the second sub-solution, the current solution can utilize a polling scheme to select an end node to transmit the first-priority information. Other variations are possible.

[0039] Figure 3A -B shows an example of resources during the implementation of a priority transmission scheme according to aspects of the present disclosure. In Figure 3A the example shown in -B, the network includes four end nodes (end nodes 0, 1, 2, and 3) and four priorities (levels 1, 2, 3, and 4). The resources allocated for each priority can be separated by beacon signals.

[0040] In some aspects of the present disclosure, the first FIG. 300 shows a priority transmission scheme without priority reset. Here, the first resource (first transmission queue) associated with priority opportunity 1 (PO 1, highest priority - level 1) can include four time slots allocated for four end nodes to transmit information of the highest priority (level 1). Since none of the end nodes has any information for transmission (level 1 priority), the scheme continues to allocate the second resource (second transmission queue) associated with PO 2 (second highest priority - level 2) for the four end nodes. Since no end node has any information for transmission (having level 2 priority), the scheme can continue to perform the same operation for the third resource (third transmission queue) and the fourth resource (fourth transmission queue).

[0041] In one aspect of the present disclosure, the second figure 330 shows a priority transmission scheme implementing the first sub-scheme. Here, the first resource (the first transmission queue) associated with priority opportunity 1 (PO 1, the highest priority - level 1) may include four time slots allocated to four end nodes for transmitting information of the highest priority (level 1). Since none of the end nodes has any information (priority level 1) for transmission, the scheme continues to allocate a second resource (the second transmission queue) associated with PO 2 (the second highest priority - level 2) to the four end nodes. However, both end node 1 and end node 3 have information (of the second highest priority) to send. Thus, both end node 1 and 3 can send the corresponding information. After all level 2 information has been sent, the scheme can perform priority reset. After the priority reset, the scheme can allocate a third resource (the third transmission queue) associated with PO 1 (the highest priority - level 1) after the beacon. Thus, after all level 2 information has been sent, any end node can give priority to sending level 1 information without waiting for the possible transmission of level 3 and level 4 information.

[0042] In certain aspects of the present disclosure, the third figure 360 shows a priority transmission scheme implementing the second sub-scheme. Here, the first resource (the first transmission queue) associated with priority opportunity 1 (PO 1, the highest priority - level 1) may include four time slots allocated to four end nodes for transmitting information of the highest priority (level 1). Since none of the end nodes has any information (priority 1) for transmission, the scheme continues to allocate a second resource (the second transmission queue) associated with PO 2 (the second highest priority - level 2) to the four end nodes. However, both end node 1 and end node 3 have information (of the second highest priority) to send. Since the scheme may be operating in the second sub-scheme, only end node 1 can send the corresponding information. Thus, after sending the level 2 information of end node 1, the scheme can perform priority reset without allowing end node 3 to send. After the priority reset, the scheme can allocate a third resource (the third transmission queue) associated with PO 1 (the highest priority - level 1) to end nodes 2 and 3 before the beacon for transmitting information. Next, another priority reset may occur in the scheme so as to allocate resources associated with PO1 (the highest priority - level 1) to end nodes 0 - 3 after the beacon for transmitting information. Since none of the end nodes has any information (priority level 1) for transmission, the scheme can continue to allocate a fourth resource (the fourth transmission queue) associated with PO 2 (the second highest priority - level 2) to the four end nodes. End node 3 still has information to transmit because during PO 2 (i.e., the second transmission opportunity), end node 3 was unable to transmit due to priority reset. Thus, during the fourth resource, an opportunity can be given for end node 3 to send.

[0043] In some aspects, when the scheme operates in the second sub - scheme, the scheme can track the nodes that could not be transmitted due to priority reset (i.e., end - node 3 in the third figure 360). In the next opportunity to transmit with the same priority, the scheme can give priority to the nodes that could not be transmitted due to priority reset.

[0044] In certain aspects of the present disclosure, the fourth figure 390 shows another example of a priority transmission scheme. Here, the first resource (the first transmission queue) associated with priority opportunity 1 (PO 1, highest priority - level 1) can include four time slots allocated for four end - nodes to transmit information of the highest priority (level 1). Both end - node 1 and end - node 2 have information to send (with the highest priority). Both end - node 1 and end - node 2 can send their respective information. Thus, after sending the level 1 information of end - node 1 and end - node 2, the scheme can perform a priority reset to level 1 again. After the priority reset, the scheme can allocate a second resource (the second transmission queue) associated with PO 1 (highest priority - level 1) after the beacon. Since none of the end - nodes has any information for transmission (level 1 priority), the scheme can continue to allocate a third resource (the third transmission queue) associated with PO 2 (second - highest priority - level 2) for the four end - nodes.

[0045] Figure 4 Shows an example of an interface that can implement the priority transmission scheme according to aspects of the present disclosure. Referring to Figure 2 and Figure 4 , Figure 4 The figure shown shows end - node 210. The priority transmission scheme can be implemented at a first location 410 between the transmission (TX) media access control (TX MAC) interface of end - node 210 and the T1S physical interface of end - node 210, or at a second location 420 at the T1S physical (T1S PHY) interface of end - node 210.

[0046] Specifically, aspects of the present disclosure may include the TX MAC notifying the T1S PHY of the priority of the next frame it wants to transmit. When the PLCA priority period matches this priority, the MAC is allowed to transmit its frame. In some aspects, 3 or 4 bits can be transmitted.

[0047] In other aspects, the PHY can notify the MAC of the PLCA period, and the MAC can track the priority of the current PLCA period. When the PLCA priority period matches this priority, the MAC is allowed to send its frame. In some aspects, it may only be necessary to transmit the detection of the COMMIT field from the PHY to the MAC. One or more bits can be used for communication.

[0048] Figure 5 FIG. 500 illustrates an example of a controller 500 for implementing the above-described priority transmission scheme in accordance with aspects of the present disclosure. The controller 500 may be in a single package or as a chipset component having multiple components. The controller 500 may include a processor 510 configured to execute instructions stored in a memory 520. The memory 520 may include computer-executable instructions. The controller 500 may include an interface circuit 530 configured to provide a hardware interface with external devices. The controller 500 may include a communication circuit 540 configured to communicate via a wired or wireless communication channel. The controller 500 may include a memory 550 configured to store digital information. The controller 500 may include an input / output (I / O) interface device 560 configured to receive input signals and / or transmit output signals.

[0049] In some aspects of the present disclosure, the controller 500 may include a resource manager 570 configured to manage resources based on the priority of information for transmission. For example, the resource manager 570 may be configured to provide resources / queues, grant transmission permissions, and / or replace transmission resources / queues with resources / queues of equal or higher priority. The resource manager 570 may be implemented as hardware or software. The resource manager 570 may be an independent circuit and / or a combination thereof implemented by the processor 510 executing instructions in the memory.

[0050] In one aspect, the processor 510, the memory 520, the interface circuit 530, the communication circuit 540, the memory 550, and / or the I / O interface device 560 may be communicatively coupled to a bus 590 configured to exchange information between the processor 510, the memory 520, the interface circuit 530, the communication circuit 540, the memory 550, and / or the input / output interface device 560.

[0051] The controller 500 may be implemented as a host controller 230 and / or a priority controller 232.

[0052] Figure 6 FIG. 600 illustrates an example of a method 600 for implementing a transmission priority scheme in accordance with aspects of the present disclosure. The method 600 may be implemented by the controller 500 and / or one or more sub-components of the controller 500, such as the resource manager 570.

[0053] At 605, the method 600 may include providing a first queue having a first plurality of transmission opportunities to a plurality of nodes to transmit first information of a first priority. For example, the resource manager 570 and / or the controller 500 may be configured to and / or define a first queue for providing a first plurality of transmission opportunities to a plurality of nodes to transmit first information of a first priority.

[0054] At 610, method 600 may include granting a first permission to at least a first subset of the plurality of nodes to transmit at least a first portion of the first information of the first priority. For example, resource manager 570 and / or controller 500 may be configured to and / or define for granting a first permission to at least a first subset of the plurality of nodes to transmit at least a first portion of the first information of the first priority.

[0055] At 615, method 600 may include, after transmitting the first information, replacing a second queue having a second plurality of transmission opportunities for the plurality of nodes to transmit second information of a second priority with a third queue having a third plurality of transmission opportunities for the plurality of nodes to transmit third information of a third priority, the third priority being higher than the second priority. For example, resource manager 570 and / or controller 500 may be configured to and / or define for, after transmitting the first information, replacing a second queue having a second plurality of transmission opportunities for the plurality of nodes to transmit second information of a second priority with a third queue having a third plurality of transmission opportunities for the plurality of nodes to transmit third information of a third priority, the third priority being higher than the second priority.

[0056] In summary, embodiments of the present disclosure may include one or any combination of the following aspects.

[0057] Aspects of the present disclosure include a method including: providing a first queue having a first plurality of transmission opportunities to a plurality of nodes to transmit first information of a first priority; granting a first permission to at least a first subset of the plurality of nodes to transmit at least a first portion of the first information of the first priority; and after transmitting the first information, replacing a second queue having a second plurality of transmission opportunities for the plurality of nodes to transmit second information of a second priority with a third queue having a third plurality of transmission opportunities for the plurality of nodes to transmit third information of a third priority, the third priority being higher than the second priority.

[0058] Aspects of the present disclosure include the above method, further including granting a second permission to at least a second subset of the plurality of nodes to transmit at least a third portion of the third information of the third priority.

[0059] Aspects of the present disclosure include any one of the above methods, wherein granting the first permission to the first subset of the plurality of nodes for transmission includes: granting the first permission to a first node of the at least first subset to transmit a first plurality of bits of the first information; and granting the first permission to a second node of the at least second subset to transmit a second plurality of bits of the first information.

[0060] Aspects of the present disclosure include any of the above methods, wherein granting a first permission to a first subset of the plurality of nodes for transmission includes: granting a first permission to a first node of the at least first subset to transmit a first plurality of bits of the first information; and not granting a first permission to the remaining nodes of the at least first subset to transmit the remaining bits of the first information.

[0061] Aspects of the present disclosure include any of the above methods, wherein replacing the second queue includes replacing the first queue after granting the first permission to the first node.

[0062] Aspects of the present disclosure include any of the above methods, and further include granting a second permission to at least a second subset of the plurality of nodes to transmit at least a third portion of third information of the third priority.

[0063] Aspects of the present disclosure include any of the above methods, and further include providing a fourth queue with a fourth plurality of transmission opportunities to a second node of the at least first subset to transmit a second plurality of bits of the first information.

[0064] Aspects of the present disclosure include any of the above methods, and further include granting a third permission to the second node to transmit a second plurality of bits of the first information.

[0065] Aspects of the present disclosure include any of the above methods, and further include providing a beacon resource between the first plurality of transmission opportunities and the third plurality of transmission opportunities.

[0066] The detailed description described above in conjunction with the drawings describes examples and does not represent the only examples that can be implemented or that are within the scope of the claims. The term "example" as used in this specification means "serving as an example, instance, or illustration" and not "preferred" or "superior to other examples". The detailed description includes specific details to assist in understanding the described technology. However, these technologies can be practiced without these specific details. For example, changes can be made to the functions and arrangements of the elements discussed without departing from the scope of the present disclosure. In addition, various examples can appropriately omit, replace, or add various procedures or components. For example, the described methods can be performed in a different order than the described order, and various steps can be added, omitted, or combined. In addition, features described with respect to some examples can be combined in other examples. In some cases, well-known structures and devices are shown in block diagram form to avoid obscuring the concepts of the described examples.

[0067] Information and signals can be represented using any of a variety of different technologies and techniques. For example, data, instructions, commands, information, signals, bits, symbols, and chips that may be referenced throughout the above description can be represented by voltage, current, electromagnetic waves, magnetic fields or particles, optical fields or particles, computer-executable code or instructions stored on a computer-readable medium, or any combination thereof.

[0068] Several aspects of a telecommunications system will now be described with reference to various devices and methods. These devices and methods will be described in detail below and illustrated in the drawings by various blocks, components, circuits, processes, algorithms, etc. (collectively referred to as "elements"). These elements can be implemented using electronic hardware, computer software, or any combination thereof. Whether an element is implemented as hardware or software depends on the particular application and the design constraints imposed on the overall system.

[0069] For example, an element, any part of an element, or any combination of elements can be implemented as a "processing system" that includes one or more processors. Examples of processors include microprocessors, microcontrollers, graphics processing units (GPUs), central processing units (CPUs), application processors, digital signal processors (DSPs), reduced instruction set computing (RISC) processors, system-on-a-chip (SoCs), baseband processors, field-programmable gate arrays (FPGAs), programmable logic devices (PLDs), state machines, gated logic, discrete hardware circuits, and other suitable hardware configured to perform the various functions described in this disclosure. One or more processors in the processing system can execute software. Software should be construed broadly as instructions, instruction sets, code, code segments, program code, programs, subprograms, software components, applications, software applications, software packages, routines, subroutines, objects, executable files, execution threads, processes, functions, etc., whether referred to as software, firmware, middleware, microcode, hardware description language, or otherwise.

[0070] Thus, in one or more example embodiments, the described functions can be implemented using hardware, software, or any combination thereof. If implemented in software, the functions can be stored on a computer-readable medium or encoded as one or more instructions or code.

[0071] The various illustrative blocks and components described in connection with the disclosure of this document can be implemented or performed with a specially programmed device, such as, but not limited to, a processor, a digital signal processor (DSP), an ASIC, an FPGA or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof, which are designed to perform the functions described herein. A specially programmed processor can be a microprocessor, but in the alternative, the processor can be any conventional processor, controller, microcontroller, or state machine. A specially programmed processor can also be implemented as a combination of computing devices, such as a combination of a DSP and a microprocessor, multiple microprocessors, one or more microprocessors in conjunction with a DSP core, or any other such configuration.

[0072] The functions described herein can be implemented in hardware, software executed by a processor, firmware, or any combination thereof. If implemented in software executed by a processor, the functions can be stored or transmitted as one or more instructions or code on a non-transitory computer-readable medium. Other examples and implementations are within the scope and spirit of the present disclosure and the appended claims. For example, due to the nature of software, the above functions can be implemented using software, hardware, firmware, hardwired, or any combination thereof, executed by a specially programmed processor. The features implementing the functions can also be physically located in various positions, including being distributed such that portions of the functions are implemented at different physical locations. Additionally, as used herein, including in the claims, "or" as used in a list of items beginning with "at least one" represents a disjunctive list, e.g., a list of "at least one of A, B, or C" represents A or B or C or AB or AC or BC or ABC (i.e., A and B and C).

[0073] Computer-readable media includes computer storage media and communication media including any medium that facilitates transfer of a computer program from one place to another. The storage media may be any available media that can be accessed by a general purpose or special purpose computer. By way of example, and not limitation, computer-readable media may include RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage or other magnetic storage devices, or any other medium that can be used to carry or store desired program code means in the form of instructions or data structures and that can be accessed by a general purpose or special purpose computer or a general purpose or special purpose processor. In addition, any connection is properly termed a computer-readable media. For example, if the software is transmitted from a website, server, or other remote source using a coaxial cable, fiber optic cable, twisted pair, Digital Subscriber Line (DSL), or wireless technologies such as infrared, radio, and microwave, then the coaxial cable, fiber optic cable, twisted pair, or DSL, or the infrared, radio, and microwave wireless technologies are included in the definition of the medium. Disk and optical disks as used herein include compact disc (CD), laser disc, optical disc, digital versatile disc (DVD), floppy disk, and Blu-ray disc where disks typically reproduce data magnetically, while optical disks reproduce data optically with lasers. Combinations of the above are also included within the scope of computer-readable media.

[0074] The foregoing description of the disclosure has been provided to enable a person skilled in the art to make or use the disclosure. Various modifications to the disclosure will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other variations without departing from the spirit or scope of the disclosure. In addition, while the elements of the described aspects may be described or claimed in the singular, the plural form is contemplated unless explicitly stated to the contrary. Also, unless otherwise stated, any part of any aspect may be used in conjunction with any other part of any other aspect. Accordingly, the disclosure is not limited to the examples and designs described herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.

Claims

1. A communication method in a network, comprising: Providing a first queue with a first plurality of transmission opportunities to a plurality of nodes for transmitting first information of a first priority; Granting a first permission to at least a first subset of the plurality of nodes to transmit at least a first portion of the first information of the first priority; And After transmitting the first information, replacing a second queue having a second plurality of transmission opportunities for the plurality of nodes to transmit second information of a second priority with a third queue having a third plurality of transmission opportunities for the plurality of nodes to transmit third information of a third priority, the third priority being higher than the second priority.

2. The method according to claim 1, further comprising granting a second permission to at least a second subset of the plurality of nodes to transmit at least a third portion of the third information of the third priority.

3. The method according to claim 1, wherein granting the first permission to the first subset of the plurality of nodes for transmission comprises: Granting a first permission to a first node of the at least first subset to transmit a first plurality of bits of the first information; And Granting the first permission to a second node of the at least second subset to transmit a second plurality of bits of the first information.

4. The method according to claim 1, wherein granting the first permission to the first subset of the plurality of nodes for transmission comprises: Granting a first permission to a first node of the at least first subset to transmit a first plurality of bits of the first information; and Not granting the first permission to the remaining nodes of the at least first subset to transmit the remaining bits of the first information.

5. The method according to claim 4, wherein replacing the second queue comprises replacing the first queue after granting the first permission to the first node.

6. The method according to claim 5, further comprising granting a second permission to at least a second subset of the plurality of nodes to transmit at least a third portion of the third information of the third priority.

7. The method according to claim 6, further comprising providing a fourth queue with a fourth plurality of transmission opportunities to a second node of the at least first subset for transmitting a second plurality of bits of the first information.

8. The method according to claim 7, further comprising granting a third permission to the second node to transmit the second plurality of bits of the first information.

9. The method according to claim 1, further comprising providing a beacon resource between the first plurality of transmission opportunities and the third plurality of transmission opportunities.

10. A controller of an end node, comprising: One or more memories, including instructions; and One or more processors, communicatively coupled to the one or more memories and configured to execute the instructions to: Provide a first queue with a first plurality of transmission opportunities to a plurality of end nodes for transmitting first information of a first priority; Grant a first permission to at least a first subset of the plurality of end nodes to transmit at least a first portion of the first information of the first priority; And After transmitting the first information, replace a second queue having a second plurality of transmission opportunities for the plurality of end nodes to transmit second information of a second priority with a third queue having a third plurality of transmission opportunities for the plurality of end nodes to transmit third information of a third priority, the third priority being higher than the second priority.

11. The controller according to claim 10, wherein the one or more processors are further configured to grant a second permission to at least a second subset of the plurality of end nodes to transmit at least a third portion of the third information of the third priority.

12. The controller according to claim 10, wherein granting a first permission to a first subset of the plurality of end nodes for transmission includes: granting a first permission to a first node of the at least first subset to transmit a first plurality of bits of the first information; and granting the first permission to a second node of the at least second subset to transmit a second plurality of bits of the first information.

13. The controller according to claim 10, wherein granting a first permission to a first subset of the plurality of end nodes for transmission includes: granting a first permission to a first node of the at least first subset to transmit a first plurality of bits of the first information; and not granting a first permission to the remaining end nodes of the at least first subset to transmit the remaining bits of the first information.

14. The controller according to claim 13, wherein replacing the second queue includes replacing the first queue after granting the first permission to the first node.

15. The controller according to claim 14, wherein the one or more processors are further configured to grant a second permission to at least a second subset of the plurality of end nodes to transmit at least a third portion of the third information of the third priority.

16. The controller according to claim 15, wherein the one or more processors are further configured to: provide a fourth queue having a fourth plurality of transmission opportunities for a second node of the at least first subset to transmit a second plurality of bits of the first information.

17. The controller according to claim 16, wherein the one or more processors are further configured to grant a third permission to the second node to transmit a second plurality of bits of the first information.

18. The controller according to claim 10, wherein the one or more processors are further configured to provide beacon resources between the first plurality of transmission opportunities and the third plurality of transmission opportunities.

19. A non-transitory computer-readable medium storing instructions that, when executed by one or more processors of a controller of an end node, cause the one or more processors to: provide a first queue having a first plurality of transmission opportunities to a plurality of end nodes to transmit first information of a first priority; grant a first permission to at least a first subset of the plurality of end nodes to transmit at least a first portion of the first information of the first priority; and After transmitting the first information, replace a second queue having a second plurality of transmission opportunities for the plurality of end nodes to transmit second information of a second priority with a third queue having a third plurality of transmission opportunities for the plurality of end nodes to transmit third information of a third priority, the third priority being higher than the second priority.

20. The non-transitory computer-readable medium of claim 19, further comprising instructions for granting a second permission to at least a second subset of the plurality of end nodes to transmit at least a second portion of the third information of the third priority.

Images