System and method for queueing and scheduling of information units in communication systems

Abstract

The present disclosure provides a system (106) and a method for Queueing and scheduling of information units in communication systems The system (106) receives one or more information units from one or more user equipments (UEs) (102). The system (106) configures the one or more information units into one or more queues based on a set of information structures received by a network node and classifies the one or more queues into one or more sub queues. The system (106) prioritizes execution of the one or more sub queues based on a delay budget. The system (106) dynamically configures a waiting time associated with the one or more sub queues to enable transmission of the one or more information units within the delay budget.

Description

SYSTEM AND METHOD FOR QUEUEING AND SCHEDULING OF INFORMATION UNITS IN COMMUNICATION SYSTEMSFIELD OF INVENTION

[0001] The embodiments of the present disclosure generally relate to a field of communication networks. More particularly, the present disclosure relates to a 5 system and a method for queueing and scheduling of information units in communication systems.BACKGROUND

[0002] The following description of the related art is intended to provide 10 background information pertaining to the field of the disclosure. This section may include certain aspects of the art that may be related to various features of the present disclosure. However, it should be appreciated that this section is used only to enhance the understanding of the reader with respect to the present disclosure, and not as admissions of the prior art.15

[0003] Due to an improvement in networking systems, there has been an increase in the number of applications for networking systems. Many of these applications require some specific QoS (Quality of Service,) failing that may cause some catastrophic results, or even if not catastrophic, the results may end up being useless or the results do not make sense. Generally, an application has20 multiple QoS attributes like delay budget, packet loss rate, etc. The delay budget of an application is the maximum delay the application can withstand from a source to a destination. The delay incurred within a system or a queue for an application or job is related to the order in which the applications are getting scheduled.25

[0004] Conventionally, a Round Robin scheduler schedules user equipments (UEs) in a round robin manner. The Round Robin scheduler allocates equal resources to each UE one after the other sequentially. Since, the Round Robin scheduler does not take Channel Quality Indicator (CQI) information of the UEs into account, the scheduling outcome results in a sub-optimal throughput and30 without meeting Quality of Service (QoS) requirements of the information units of the UEs. A max-CQI scheduler schedules a UE with a highest CQI among allthe available UEs. The max-CQI scheduler maximizes the throughput, but is less fair to UEs with lesser CQI. Such a scheduling strategy leads to deterioration in user experience. Further, a Proportional Fair scheduler tries to maximize throughput while providing fairness to all the UEs. But the Proportional Fair scheduler does not consider the QoS requirements (e.g., delay guarantee) of the applications.

[0005] Prior art CN107733689 discloses a dynamic weighting polling dispatching strategy process based on priority. For data flow of different priorities, the dynamic weighting polling dispatching strategy process based on priority is divided into queue management module and polling dispatching module, and all business in network are divided into n priority queue by queue management module. After a backbone network node receives a business data packet, the business datum packet priority up to backbone network node is determined according to the QoS demand of business and the business data packet isaccording to priority inserted into corresponding caching sub queue. A polling dispatching module carries out cycle polling according to the queue length of current each sub queue, the busy degree of each sub queue is calculated, busy degree is ranked up with a poll weighted value such that busy degree ranking results dynamic adjusts sub- individual queue, each sub queue of poll, and sends packet successively.

[0006] Prior art CN101465794 discloses a method for dividing a service packet into a real-time service packet and a non-real-time service packet according to the service packet header information. The method includes judging whether a legal real-time service packet exists in the real-time service packet according to a shaping virtual clock algorithm, if so, sending the legal real-time service packet by adopting the shaping virtual clock algorithm, otherwise, sending a non-real- time service packet. The method includes determining if a new legal real-time service packet appears in the process of sending the non-real-time service, stopping sending the non-real-time service packet and sending the new legal realtime service packet.

[0007] Prior art US2010150120 discloses a system for providing a mobile, broadband, routable internet (MBRI), in which multiple mobile devices interact as nodes in which packets are IP routable to the individual device independent of fixed infrastructure elements, and where the nodes provide functional interaction with other nodes to enhance MBRI operability. The system enables a network characteristic to improve network operability for a mobile application.

[0008] Prior art CN113806049 discloses a method that after receiving tasks from different sources, summarizes the tasks from the same source to the same task group. The method includes putting tasks of different task groups into a task regulation queue in turn, and outputting the tasks of a plurality of task groups through the task regulation queue. The method includes monitoring the output tasks, acquiring the number of tasks of the same task group in a preset state, determining the corresponding task group as a target task group based on the task number range in which the number of tasks is positioned, and stopping putting thetasks of the target task group into the task regulation queue.

[0009] Conventional systems and methods are inefficient in scheduling the applications. There is, therefore, a need in the art to provide an improved system and a method that can mitigate the deficiencies of the prior art(s).OBJECTS OF THE INVENTION

[0010] Some of the objects of the present disclosure, which at least one embodiment herein satisfies are listed herein below.

[0011] It is an object of the present disclosure to provide a system and a method for queueing and scheduling of information units in communication systems that receives information units from user equipments (UEs) connected to the network node of a base station, and routers and switches in the case of wireline communication.

[0012] It is an object of the present disclosure to provide a system that configures the information units into queues based on a set of information structures received by the network node and classifies the queues into sub queues.

[0013] It is an object of the present disclosure to provide a system that prioritizes execution of the sub queues based on a delay budget associated with the information units, where the delay budget is based on Quality of Service (QoS) parameters associated with the information units of UEs.

[0014] It is an object of the present disclosure to provide a system that dynamically configures a waiting time associated with the information units to enable transmission of the information units to the network node within the delay budget of the traffic.SUMMARY

[0015] This section is provided to introduce certain objects and aspects of the present disclosure in a simplified form that are further described below in the detailed description. This summary is not intended to identify the key features or the scope of the claimed subject matter.

[0016] In an aspect, the present disclosure relates to a system for scheduling uplink and downlink transmissions. The system includes a processor. A memory is operatively coupled with the processor, wherein said memory stores instructions which, when executed by the processor, cause the processor to receive one or more information units from one or more user equipments (UEs) connectedto the network node. The processor configures the one or more information units into one or more queues based on a set of information structures received by the network node and classify the one or more queues into one or more sub queues. The processor prioritizes execution of the one or more sub queues based on a delay budget, where the delay budget is based on one or more Quality of Service (QoS) parameters associated with the one or more information units of the one or more UEs. The processor dynamically configures a waiting time associated with the one or more information units to enable transmission of the one or more information units to the network node within the delay budget.

[0017] In an embodiment, the one or more information units may include one or more resources configured within a structure.

[0018] In an embodiment, the processor may be configured to modify the waiting time associated with the one or more resources based on processing of the one or more resources from the frame structure.

[0019] In an embodiment, the processor may be configured to generate a queue structure specifying creation of the one or more queues for each kind of services associated with the one or more information units and classify the one or more queues into the one or more sub queues.

[0020] In an embodiment, processing by the processor may include prioritizing execution of at least one sub queue one among the one or more sub queues prior to expiry of the waiting time associated with said at least sub queue based on an event or an interrupt.

[0021] In an embodiment, the processor may be configured to dynamically execute the one or more information units from the one or more sub queues.

[0022] In an embodiment, the processor may be configured to process at least one sub queue among the one or more sub queues prior to expiry of the waiting time associated with the one or more information units configured in a first queue among the one or more sub queues.

[0023] In an embodiment, the processor may be configured to allocate one or more resource blocks (RBs) to the one or more information units of the one or more UEs until complete utilization of the one or more resource blocks (RBs) or based on a number of the one or more information units in a First In First Out (FIFO) queue.

[0024] In an aspect, the present disclosure relates to a method for scheduling uplink and downlink transmissions. The method includes receiving, one or more information units from one or more user equipments (UEs). The method includes configuring, the one or more information units into one or more queues based on a set of information structures received and classifying the one or more queues into one or more sub queues. The method includes prioritizing, execution of the one or more sub queues based on a delay budget, where the delay budget is based on one or more Quality of Service (QoS) parameters associated with the one or more information units of the one or more UEs. The method includes dynamicallyconfiguring, a waiting time associated with the one or more information units to enable transmission of the one or more information units within the delay budget..

[0025] In an embodiment, the one or more sub queues may include one or more information units configured within a queue structure.

[0026] In an embodiment, the method may include modifying, the waiting time associated with the one or more sub queues based on processing of the one or more information units from the queue structure.

[0027] In an embodiment, the method may include generating, a queue structure specifying creation of the one or more queues for each kind of services associated with the one or more information units and classifying the one or more queues into the one or more sub queues.

[0028] In an embodiment, the method may include a queue structure specifying creation of queues for each kind of services associated with information units and classifying the queue into one or more sub queues.

[0029] In an embodiment, the method may include processing, by prioritizing execution of at least one sub queue one among the one or more sub queues prior to expiry of the waiting time associated with said at least sub queue based on an event or an interrupt.

[0030] In an embodiment, the method may include dynamically executing, the one or more information units from the one or more sub queues.

[0031] In an embodiment, the method may include processing, at least one sub queue among the one or more sub queues prior to expiration of the waiting time associated with the one or more sub queues configured in a first queue among the one or more sub queues.

[0032] In an embodiment, the method may include allocating, of one or more resource blocks (RBs) to the one or more information units of the one or more UEs until complete utilization of the one or more resource blocks (RBs) or based on a number of the one or more information units in a First In First Out (FIFO) queue.BRIEF DESCRIPTION OF DRAWINGS

[0033] The accompanying drawings, which are incorporated herein, and constitute a part of this disclosure, illustrate exemplary embodiments of the disclosed methods and systems which like reference numerals refer to the sameparts throughout the different drawings. Components in the drawings are not necessarily to scale, emphasis instead being placed upon clearly illustrating the principles of the present disclosure. Some drawings may indicate the components using block diagrams and may not represent the internal circuitry of each component. It will be appreciated by those skilled in the art that disclosure of such drawings includes the disclosure of electrical components, electronic components, or circuitry commonly used to implement such components.

[0034] FIG. 1 illustrates an example system architecture (100) for implementing a proposed system (102), in accordance with an embodiment of the present disclosure.

[0035] FIG. 2 illustrates an example block diagram (200) of a proposed system (102), in accordance with an embodiment of the present disclosure.

[0036] FIG. 3 illustrates an example schematic representation (300) of the proposed system (102), in accordance with an embodiment of the present disclosure.

[0037] FIG. 4 illustrates an example schematic representation (400) of queueing implemented by the proposed system (106), in accordance with an embodiment of the present disclosure.

[0038] FIG. 5 illustrates an example flow diagram (500) implemented by the proposed system (102), in accordance with an embodiment of the present disclosure.

[0039] FIG. 6 illustrates a graph (600) depicting comparison between scheduling of high priority jobs by the proposed system (102) and a conventional Quality of Service (QoS) scheduler, in accordance with an embodiment of the present disclosure.

[0040] FIG. 7 illustrates a graph (700) depicting comparison between scheduling of low priority jobs by the proposed system (102) and the conventional Quality ofService (QoS) scheduler, in accordance with an embodiment of the present disclosure.

[0041] FIG. 8 illustrates an example computer system (800) in which or with which embodiments of the present disclosure may be implemented.

[0042] The foregoing shall be more apparent from the following more detailed description of the disclosure.DEATILED DESCRIPTION

[0043] In the following description, for the purposes of explanation, various specific details are set forth in order to provide a thorough understanding of embodiments of the present disclosure. It will be apparent, however, that embodiments of the present disclosure may be practiced without these specific details. Several features described hereafter can each be used independently of one another or with any combination of other features. An individual feature may not address all of the problems discussed above or might address only some of the problems discussed above. Some of the problems discussed above might not be fully addressed by any of the features described herein.

[0044] The ensuing description provides exemplary embodiments only and is not intended to limit the scope, applicability, or configuration of the disclosure. Rather, the ensuing description of the exemplary embodiments will provide those skilled in the art with an enabling description for implementing an exemplary embodiment. It should be understood that various changes may be made in the function and arrangement of elements without departing from the spirit and scope of the disclosure as set forth.

[0045] Specific details are given in the following description to provide a thorough understanding of the embodiments. However, it will be understood by one of ordinary skill in the art that the embodiments may be practiced without these specific details. For example, circuits, systems, networks, processes, and other components may be shown as components in block diagram form in order not to obscure the embodiments in unnecessary detail. In other instances, well-known circuits, processes, algorithms, structures, and techniques may be shown without unnecessary detail to avoid obscuring the embodiments.

[0046] Also, it is noted that individual embodiments may be described as a process that is depicted as a flowchart, a flow diagram, a data flow diagram, a structure diagram, or a block diagram. Although a flowchart may describe the operations as a sequential process, many of the operations can be performed in parallel or concurrently. In addition, the order of the operations may be re- arranged. A process is terminated when its operations are completed but could have additional steps not included in a figure. A process may correspond to amethod, a function, a procedure, a subroutine, a subprogram, etc. When a process corresponds to a function, its termination can correspond to a return of the function to the calling function or the main function.

[0047] The word “exemplary” and / or “demonstrative” is used herein to mean serving as an example, instance, or illustration. For the avoidance of doubt, the subject matter disclosed herein is not limited by such examples. In addition, any aspect or design described herein as “exemplary” and / or “demonstrative” is not necessarily to be construed as preferred or advantageous over other aspects or designs, nor is it meant to preclude equivalent exemplary structures and techniques known to those of ordinary skill in the art. Furthermore, to the extentthat the terms “includes,” “has,” “contains,” and other similar words are used in either the detailed description or the claims, such terms are intended to be inclusive in a manner similar to the term “comprising” as an open transition word without precluding any additional or other elements.

[0048] Reference throughout this specification to “one embodiment” or “an embodiment” or “an instance” or “one instance” means that a particular feature, structure, or characteristic described in connection with the embodiment is included in at least one embodiment of the present disclosure. Thus, the appearances of the phrases “in one embodiment” or “in an embodiment” in various places throughout this specification are not necessarily all referring to thesame embodiment. Furthermore, the particular features, structures, orcharacteristics may be combined in any suitable manner in one or more embodiments.

[0049] The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the disclosure. As used herein, the singular forms “a”, “an”, and “the” are intended to include the plural forms as well, unless the context indicates otherwise. It will be further understood that the terms “comprises” and / or “comprising,” when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and / or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and / or groups thereof. As used herein, the term “and / or” includes any and all combinations of one or more of the associated listed items.

[0050] The present disclosure describes a system that uses queues and partitions each queue into dynamically configured delay-based sub-queues to provide delay guarantee to jobs with specific Quality of Service (QoS) requirements. The queues have associated priority or order and the system ensures execution of jobs with the delay guarantee.

[0051] Various embodiments of the present disclosure will be explained in detail with reference to FIGs. 1-8.

[0052] FIG. 1 illustrates an example system architecture (100) for implementing a proposed system (106), in accordance with an embodiment of the present disclosure.

[0053] As illustrated in FIG. 1, in an embodiment, the system (106) may receive information units associated with one or more user equipments (UEs) (102-1, 102-2... 102-N). The information units may include but not limited to bits, bytes, symbol, packets, and frames. In one embodiment, the system (106) may be communicatively coupled to a network node of a base station, the system may also include switches and routers. A person skilled in the art may understand that the one or more user equipments (102-1, 102-2... 102-N) may be collectivelyreferred as an UE (102) or UEs (102) throughout the disclosure. The UEs (102) may be connected to the system (106) through a network (104).

[0054] In an embodiment, the user equipment (102) may include, but not be limited to, a mobile, a laptop, etc. Further, the user equipment (102) may include one or more in-built or externally coupled accessories including, but not limited to, a visual aid device such as a camera, audio aid, microphone, or keyboard.Further, the user equipment (102) may include a mobile phone, smartphone, virtual reality (VR) devices, augmented reality (AR) devices, a laptop, a general- purpose computer, a desktop, a personal digital assistant, a tablet computer, and a mainframe computer. Additionally, input devices for receiving input from a user such as a touchpad, touch-enabled screen, electronic pen, and the like may be used.

[0055] In an embodiment, the network (104) may include, by way of example but not limitation, at least a portion of one or more networks having one or more nodes that transmit, receive, forward, generate, buffer, store, route, switch, process, or a combination thereof, etc. one or more messages, packets, signals,waves, voltage or current levels, some combination thereof, or so forth. The network (104) may also include, by way of example but not limitation, one or more of a wireless networks, a wired network, an internet, an intranet, a public network, a private network, a packet-switched network, a circuit-switched network, an ad hoc network, an infrastructure network, a Public-SwitchedTelephone Network (PSTN), a cable network, a cellular network, a satellite network, a fiber optic network, or some combination thereof.

[0056] In an embodiment, the system (106) may include an instant scheduler that decides the UE-wise Physical Resource Block (PRB) allocation for every slot. In Frequency Division Duplexing (FDD), both Physical Downlink Shared Channel (PDSCH) and Physical Uplink Shared Channel (PUSCH) allocations may be output per slot, while in Time Division Duplexing (TDD), the appropriate (PDSCH or PUSCH) allocation may be output every slot either in downlink or uplink.

[0057] In an embodiment, the system (106) may receive the one or more 0 information units from the UEs (102) connected to the network node. Each information unit may include several data packets, where the data packets mayarrive in an approximately periodic rate and may be transmitted (served) one packet at a step. The instant scheduler (of the system (106)) may decide upon the data packet to be transmitted at each time slot.

[0058] In an embodiment, the system (106) may configure the one or more information units into one or more queues based on a set of information structures received by the network node and classify the one or more queues into one or more sub queues. The set of information structures may include a traffic flow template, where the traffic flow template is a collection of one or more bits from one or more of the identifiers but not limited to source and destination IP, sourceand destination Media Access Control (MAC), source and destination port ID, type of Service ID, QoS ID, etc.

[0059] In an embodiment, the system (106) may provide delay guarantee to the one or more information units with specific QoS requirements. Information units or jobs may include but not limited to bits, bytes, data packets, tasks where the one or more queues may include each kind of job. Queues may be associated with a scheduler based on a traffic flow template. The number of sub queues in a queue may be determined by the delay budget for the respective QoS service as provided by the standards. Each sub queue of a queue may include a dynamically configured waiting time based on the queue and the requirement of the service.The system (106) may include a frame scheduler (also referred as the instant scheduler) and a processor (202) for providing delay guarantee to the one or more information units with specific QoS requirements. In an embodiment, the frame scheduler may receive the jobs from queues and puts them into a First in First out (FIFO) queue. There may be one queue for each kind of job and each of the one or more queues may include an associated order or priority. Queues for jobs with smaller or lesser delay budget may include a higher priority. The frame scheduler may use queues with Lsub queues, where L = ⌊d / w⌋, d is delay budget of the respective QoS, w is the dynamically configured waiting time of each sub queue. Therefore L is dynamically varying. Jobs on their arrival may be inserted in one of the sub queues (based on an arrival level) of a queue. Similarly, jobs may bedeparted from one of the sub queues (based on a departure level) of the same queue. The offset between arrival and departure levels may be L — 1, where L is the number of sub queues in the queue. The arrival and departure levels may keep rotating at completion of each frame. The arrival and departure levels may include the following:Arrival level number = (Arrival level number + 1) % LDeparture level number = (Departure level number + 1) % L

[0060] All the jobs in the departure level sub queue may be departed before expiring of the waiting time. If by any chance, a job / jobs (may include packets or applications to be executed within a sub queue) could not depart from the departure level before expiring of waiting time, the jobs may be moved to the head (or beginning) of next departure level sub queue in the same queue. The departed jobs may be stored in the FIFO queue. For example, the configured waiting time of sub queues with w = 10 ms and a QoS with the delay budget as0 ms, may include L=3 sub queues. The offset between the arrival level and departure level may be 2.

[0061] In an embodiment, the system (106) may calculate the required resource blocks for jobs in the FIFO queue based on the parameters (e.g., Radio Access technology (RAT) type, bits in the job etc.). A resource block includes one or more sub-carriers or a group of sub-bands in case of wireless communication and a group of wavelengths in case of WDM systems, or one or more channels in case of TDM systems, or one or more tunnels in case of GMPLS systems, etc.

[0062] All the available resource blocks (RBs) may be allocated to jobs in the FIFO queue one by one. The system (106) may keep on being allocating resource blocks to jobs until either available resource blocks become zero or the FIFO queue becomes empty. For example, consider the configured waiting time of sub queues w = 10 ms and a job with delay budget as 30 s, The number of sub queues in the queue for this QoS is 3. The instant scheduler included in the system (106) may schedule the jobs within 3 frames or waiting time interval, i.e., the delay budget of the job. The packet departure level may keep rotating at the expiry of waiting time of the one or more sub queues. Thus, each job gets achance to be scheduled before the end of its delay budget. On the other hand, for other jobs, one of the conventional schedulers may be used.

[0063] In an embodiment, the system (106) may dynamically configure the waiting time associated with the one or more information units to enable transmission of the one or more information units to the network node within the delay budget of the traffic.

[0064] In an embodiment, the system (106) may prioritize execution of the one or more sub queues based on a delay budget associated with the one or more information units, where the delay budget may be based on one or more Quality of Service (QoS) parameters associated with the information units of UEs (102). Further, the system (106) may modify the waiting time associated with the one or more sub queues based on processing of the one or more information units from the queue structure. The system (106) may dynamically execute the one or more information units from the one or more sub queues in any order within the delay budget.

[0065] In an embodiment, the system (106) for processing the one or more resources, may prioritize execution of at least one sub queue one among the one or more sub queues prior to expiry of the waiting time associated with said at least sub queue based on an event or an interrupt. An event may lead to out of order execution.

[0066] In an embodiment, the system (106) may generate a queue structure specifying creation of the one or more queues for each kind of services associated with the one or more information units and classify the one or more queues into the one or more sub queues.

[0067] In an embodiment, the system (106) may process at least one sub queue among the one or more sub queues prior to expiry of the waiting time associated with the one or more sub queues configured in a first queue among the one or more sub queues.

[0068] In one or more embodiments, the frame scheduler may use conventional schedulers (e.g., Round Robin, Proportional Fair, etc.) to schedule jobs in the oneor more queues. The frame scheduler may select the one or more jobs and put them into the FIFO queue.

[0069] In one or more embodiments, the system (106) may use a combination of schedulers. A first scheduler may include an instant scheduler that uses queues and partitions each queue into dynamically configured delay-based sub-queues to provide delay guarantee to jobs with specific Quality of Service (QoS) requirements. The second scheduler may use conventional schedulers (e.g., Round Robin, Proportional Fair etc.) to schedule jobs in the one or more queues.

[0070] Although FIG. 1 shows exemplary components of the system architecture (100), in other embodiments, the system architecture (100) may include fewer components, different components, differently arranged components, or additional functional components than depicted in FIG. 1. Additionally, or alternatively, one or more components of the system architecture (100) may perform functions described as being performed by one or more other components of the system architecture (100).

[0071] FIG. 2 illustrates an example block diagram (200) of a proposed system (102), in accordance with an embodiment of the present disclosure.

[0072] Referring to FIG. 2, the system (106) may comprise one or more processor(s) (202) that may be implemented as one or more microprocessors, microcomputers, microcontrollers, digital signal processors, central processing units, logic circuitries, and / or any devices that process data based on operational instructions. Among other capabilities, the one or more processor(s) (202) may be configured to fetch and execute computer-readable instructions stored in a memory (204) of the system (106). The memory (204) may be configured to store one or more computer-readable instructions or routines in a non-transitory computer readable storage medium, which may be fetched and executed to create or share data packets over a network service. The memory (204) may comprise any non-transitory storage device including, for example, volatile memory such as random-access memory (RAM), or non-volatile memory such as erasable programmable read only memory (EPROM), flash memory, and the like.

[0073] In an embodiment, the system (106) may include an interface(s) (206). The interface(s) (206) may comprise a variety of interfaces, for example, interfaces for data input and output (I / O) devices, storage devices, and the like. The interface(s) (206) may also provide a communication pathway for one ormore components of the system (106). Examples of such components include, but are not limited to, processing engine(s) (208) and a database (210), where the processing engine(s) (208) may include, but not be limited to, a data ingestion engine (212).

[0074] In an embodiment, the processing engine(s) (208) may be implemented as a combination of hardware and programming (for example, programmable instructions) to implement one or more functionalities of the processing engine(s) (208). In examples described herein, such combinations of hardware and programming may be implemented in several different ways. For example, the programming for the processing engine(s) (208) may be processor-executable instructions stored on a non-transitory machine-readable storage medium and the hardware for the processing engine(s) (208) may comprise a processing resource (for example, one or more processors), to execute such instructions. In the present examples, the machine-readable storage medium may store instructions that, when executed by the processing resource, implement the processing engine(s) (208). In such examples, the system (106) may comprise the machine-readable storage medium storing the instructions and the processing resource to execute the instructions, or the machine-readable storage medium may be separate but accessible to the system (106) and the processing resource. In other examples, the processing engine(s) (208) may be implemented by electronic circuitry.

[0075] In an embodiment, the processor (202) may be incorporated as a single core or a multi-core processor. The single core processor includes one processing unit (core) that handles all tasks and operations. The multi -core processor has multiple processing units (cores) on a single chip. Each core can execute instructions independently, allowing for parallel processing. The multi-core processor can handle multiple tasks at once, making it ideal for multitasking, heavy computing tasks and modem software. The multi-core processor cansignificantly improve performance for tasks that support parallel processing or multi-threading.

[0076] In an embodiment, the processor (202) may be coupled to routers and switches in the case of wireline networks. Wireline networks refer to telecommunications systems that use physical, wired connections to transmit data, voice, and video signals. Unlike wireless networks, which use radio frequencies, wireline networks rely on various types of cables and infrastructure. These networks are essential for providing broadband internet, traditional phone services, and cable television.

[0077] In an embodiment, the processor (202) may receive one or more information units through the data ingestion engine (212). The processor (202) may record the one or more information units in the database (210).

[0078] In an embodiment, the processor (202) may receive the one or more information units from the UEs (102) connected to a network node. The one or more sub queues may include one or more information units configured within a queue structure. The processor (202) may configure the one or more information units into one or more queues based on a set of information structures received by the network node and classify the one or more queues into one or more sub queues. The set of information structures may include a traffic flow template, where the traffic flow template is a collection of one or more bits from one or more of the identifiers but not limited to source and destination IP, source and destination MAC, source and destination Port ID, type of Service ID, QoS ID, etc.

[0079] In an embodiment, the processor (202) may dynamically configure the waiting time associated with the one or more information units to enable transmission of the one or more information units to the network node within the delay budget of the traffic.

[0080] In an embodiment, the processor (202) may generate a queue structure specifying creation of the one or more queues for each kind of services associated with the one or more information units and classify the one or more queues into the one or more sub queues.

[0081] In an embodiment, the processor (202) for processing the one or more information units, may prioritize execution of at least one sub queue one among the one or more sub queues prior to expiry of the waiting time associated with said at least sub queue based on an event or an interrupt.

[0082] In an embodiment, the processor (202) may process at least one sub queue among the one or more sub queues prior to expiry of the waiting time associated with the one or more sub queues configured in a first queue among the one or more sub queues.

[0083] In an embodiment, the processor (202) may allocate one or more resource blocks (RBs) to the one or more information units until complete utilization of the of the one or more resource blocks (RBs) or based on a number of the one or more information units in a First In First Out (FIFO) queue.

[0084] FIG. 3 illustrates an example schematic representation (300) of the proposed system (102), in accordance with an embodiment of the present disclosure.

[0085] As illustrated in FIG. 3, in an embodiment, the system (106) may include a first scheduler (302) that receives the one or more information units from the UEs (102). The first scheduler (302) may configure the one or more information units into one or more queues based on a set of information structures received by the network node and classify the one or more queues into one or more sub queues (306-1, 306-2). Further, the first scheduler (302) may prioritize execution of the one or more sub queues (306-1, 306-2) based on a delay budget, where the delay budget may be based on one or more Quality of Service (QoS) parameters associated with the information units of the one or more UEs (102). The firstscheduler (302) may dynamically configure the waiting time associated with the one or more information units to enable transmission of the one or more information units to the network node within the delay budget of the traffic.

[0086] As illustrated in FIG. 3, in an embodiment, the system (106) may include a second scheduler (304) that uses conventional schedulers that may include but not limited to a Round Robin scheduler and a Proportional Fair scheduler to schedule jobs in the one or more sub queues (308).

[0087] FIG. 4 illustrates an example schematic representation (400) of queueing implemented by the proposed system (106), in accordance with an embodiment of the present disclosure.

[0088] As illustrated in FIG. 4, the schematic representation (400) illustrates sub queues of a job (packet) (402) with a delay budget as 30 ms and waiting time of 1.0 ms. In an embodiment, the system (106) may receive the job (304) on arrival, where the job (404) may be inserted into one of the one or more sub queues (Arrival level). Further, the system (106) may enable packet departure (404) from one of the sub queues (Departure level). The arrival and departure levels may be rotated across the one or more sub queues.

[0089] FIG. 5 illustrates an example flow diagram (500) implemented by the proposed system (106), in accordance with an embodiment of the present disclosure.

[0090] As illustrated in FIG. 5, the flow diagram (500) may include the following steps:

[0091] At step 502: The system (106) may collect necessary information about jobs (packets) on their arrival.

[0092] At step 504: The system (106) may prioritize jobs based on one or more parameters.

[0093] At step 506: The system (106) may schedule jobs from the queue.

[0094] At step 508: The jobs may be queued by the system (106) for allocation of resources.

[0095] At step 510: The system (106) may partition queues into one or more sub queues.

[0096] At step 512: The system (106) may configure waiting time in each of the one or more sub queues.

[0097] At step 514: The system (106) may associate the scheduler with queues using an instant scheduler or other conventional schedulers.

[0098] At step 516: The system (106) may schedule jobs from the one or more sub queues before the waiting time associated with the jobs in the one or more sub queues.

[0099] At step 518: The system (106) may allocate resources to the scheduled jobs based on the relevant information, e.g., the RAT Type.

[0100] FIG. 6 illustrates a graph (600) depicting comparison between scheduling of high priority jobs by the proposed system (106) and a conventional Quality of Service (QoS) scheduler, in accordance with an embodiment of the present disclosure.

[0101] As illustrated in FIG. 6, in an embodiment, 5.2% of the high-priority jobs miss their delay budget using an instant scheduler (incorporated with the system (106) compared to 11.2% of the high-priority jobs missing their delay budget using the QoS scheduler. This is based on a mean and standard deviations associated with the instant scheduler and the QoS scheduler (mean(instant ) = 0,22, mea.n(QoS) = 0.39, SD(instant) = 0.33, SD(QoS) = 0.49). Hence, the instant scheduler has a 115.3% better performance compared to the QoS scheduler.

[0102] FIG. 7 illustrates a graph (700) depicting comparison between scheduling of low priority jobs by the proposed system (106) and the conventional Quality of Service (QoS) scheduler, in accordance with an embodiment of the present disclosure.

[0103] As illustrated in FIG. 7, in an embodiment, 4.6% of the lower-priority jobs miss their delay budget using an instant scheduler (incorporated with the system (106) compared to 5.6% of the lower-priority jobs missing their delay budget using the QoS scheduler. This is based on a mean and standard deviations associated with the instant scheduler and the QoS scheduler ( mean(instant) = 0.29, mean(QoS) = 0.43, SD (instant) = 0.47, SD(QoS) = 0.57). Hence, the instant scheduler has a 21.7% better performance compared to the QoS scheduler.

[0104] Further, the QoS scheduler uses a single shared queue for all jobs while the instant scheduler uses one queue for each kind of job. Furthermore, the QoS.......scheduler considers the ratio waiting time of the job / delay budget of the job for calculating priority, theinstant scheduler uses queues that are prioritized based on the delay budget. TheQoS scheduler also uses a token bucket mechanism to prevent starvation among jobs that incurs performance degradation for high priority jobs. However, for poisson arrival jobs, the instant scheduler schedules jobs in a more aggressive manner compared to QoS scheduler, as the instant scheduler does not use the token bucket mechanism. Table 1 shows a parameter comparison of the various schedulers, where all schedulers have same order of execution and there are enough RBs to serve the UEs (102).Serial Parameter RR PF Instant No. Scheduler Scheduler Scheduler 1 Throughput (kbps) 619 735 795 2 Spectral Efficiency 30.95 36.75 39.75(b / kHz)3 RB Utilization 2.48 2.94 3.18 4 Fairness 0.982 0.991 0.989Table 1

[0105] As shown in Table 1, throughput mainly depends on order of execution and then on initial RBs allocated and throughput is optimal for instant scheduler as long as there are enough RBs. If RBs are less than required, throughput of the instant scheduler depends on an order of execution. If higher MCS is executed first, throughput may improve. But the order of executiondepends on the QCI priority. So, connection admission control (CAC) is important for better performance of QoS-scheduler. The instant scheduler has optimal throughput. The PF scheduler has better throughput compared to the RR scheduler because the PF scheduler assigns RBs initially based on priority whereas RR just divides the RBs equally among UEs (102).

[0106] FIG. 8 illustrates an exemplary computer system (800) in which or with which embodiments of the present disclosure may be implemented.

[0107] As shown in FIG. 8, the computer system (800) may include an external storage device (810), a bus (820), a main memory (830), a read-only memory (840), a mass storage device (850), a communication port(s) (860), and a processor (870). A person skilled in the art will appreciate that the computersystem (800) may include more than one processor and communication ports. The processor (870) may include various modules associated with embodiments of the present disclosure. The communication port(s) (860) may be any of an RS-232 port for use with a modem-based dialup connection, a 10 / 100 Ethernet port, a Gigabit or 10 Gigabit port using copper or fiber, a serial port, a parallel port, or other existing or future ports. The communication ports(s) (860) may be chosen depending on a network, such as a Local Area Network (LAN), Wide Area Network (WAN), or any network to which the computer system (800) connects.

[0108] In an embodiment, the main memory (830) may be Random Access Memory (RAM), or any other dynamic storage device commonly known in the art. The read-only memory (840) may be any static storage device(s) e.g., but not limited to, a Programmable Read Only Memory (PROM) chip for storing static information e.g., start-up or basic input / output system (BIOS) instructions for the processor (870). The mass storage device (850) may be any current or future mass storage solution, which can be used to store information and / or instructions. Exemplary mass storage solutions include, but are not limited to, Parallel Advanced Technology Attachment (PAT A) or Serial Advanced Technology Attachment (SATA) hard disk drives or solid-state drives (internal or external, e.g., having Universal Serial Bus (USB) and / or Firewire interfaces).

[0109] In an embodiment, the bus (820) may communicatively couple the processor(s) (870) with the other memory, storage, and communication blocks. The bus (820) may be, e.g. a Peripheral Component Interconnect (PCI) / PCI Extended (PCI-X) bus, Small Computer System Interface (SCSI), USB, or the like, for connecting expansion cards, drives, and other subsystems as well as other buses, such a front side bus (FSB), which connects the processor (870) to the computer system (800).

[0110] In another embodiment, operator and administrative interfaces, e.g., a display, keyboard, and cursor control device may also be coupled to the bus (820) to support direct operator interaction with the computer system (800). Other operator and administrative interfaces can be provided through network connections connected through the communication port(s) (860). Componentsdescribed above are meant only to exemplify various possibilities. In no way should the aforementioned exemplary computer system (800) limit the scope of the present disclosure.

[0111] While considerable emphasis has been placed herein on the preferred embodiments, it will be appreciated that many embodiments can be made and that many changes can be made in the preferred embodiments without departing from the principles of the disclosure. These and other changes in the preferred embodiments of the disclosure will be apparent to those skilled in the art from the disclosure herein, whereby it is to be distinctly understood that the foregoing descriptive matter is to be implemented merely as illustrative of the disclosure and not as a limitationADVANTAGES OF THE INVENTION

[0112] The present disclosure provides a system that uses queues and sub queues in the scheduler design and enables delay guarantee to jobs.

[0113] The present disclosure provides a system that uses a scheduler for scheduling jobs with a guaranteed Quality of Service (QoS).

[0114] The present disclosure provides a system that schedules jobs within a delay budget of the job.

Claims

AMENDED CLAIMSreceived by the International Bureau on 27 May 2026 (27.05.2026) 1. A system (106) for scheduling uplink and downlink transmissions, the system (106) comprising:a processor (202);a memory (204) operatively coupled with the processor (202), wherein said memory (204) stores instructions which, when executed by the processor (202), cause the processor (202) to:receive one or more information units from one or more user equipments (UEs) (102) connected to a network node;configure the one or more information units into one or more queues based on a set of information structures received by the network node and classify the one or more queues into one or more sub queues;prioritize execution of the one or more sub queues based on a delay budget, wherein the delay budget is based on one or more Quality of Service (QoS) parameters associated with the one or more information units of the one or more UEs (102);partition each of the one or more queues into the one or more sub queues based on the delay budget associated with a respective QoS requirement;configure a dynamically varying waiting time associated with each of the one or more sub queues;maintain rotating arrival levels and departure levels among the one or more sub queues; andprocess the one or more information units from a departure-level sub queue prior to expiry of the dynamically configured waiting time to enable transmission of the one or more information units to the network node within the delay budget.

2. The system (106) as claimed in claim 1, wherein the one or more sub queues comprise one or more information units configured within a queue structure.

3. The system (106) as claimed in claim 2, wherein the processor (202) is configured to dynamically modify the waiting time associated with the one or more sub queues based on processing of the one or more information units from the queue structure.

4. The system (106) as claimed in claim 1, wherein the processor (202) is configured to generate a queue structure specifying creation of the one or more queues for for different service types associated with the one or more information units and classification of the one or more queues into the one or more sub queues.

5. The system (106) as claimed in claim 2, wherein processing by the processor (202) comprises:prioritizing execution of at least one sub queue one among the one or more sub queues prior to expiry of the waiting time associated with said at least sub queue based on an event or an interrupt.

6. The system (106) as claimed in claim 2, wherein the processor (202) is configured to dynamically execute the one or more information units from the one or more sub queues according to rotating arrival and departure levels.

7. The system (106) as claimed in claim 2, wherein the processor (202) is configured to process at least one sub queue prior to expiration of the dynamically configured waiting time associated with the one or more information units configured in a first queue among the one or more queues.

8. The system (106) as claimed in claim 1, wherein the processor (202) is configured to allocate one or more resource blocks (RBs) to the one or more information units of the after delay-guaranteed scheduling from the plurality of sub queues and based on at least one of complete utilization of the of the one or more resource blocks (RBs) or based on a number of the one or more information units in a First In First Out (FIFO) queue.

9. A method (600) for scheduling uplink and downlink transmissions, the method (600) comprising:receiving (602), one or more information units from one or more user equipments (UEs) (102);configuring (604), the one or more information units into one or more queues based on a set of information structures received and classifying the one or more queues into one or more sub queues;prioritizing (606), execution of the one or more sub queues based on a delay budget, wherein the delay budget is based on one or more Quality of Service (QoS) parameters associated with the one or more information units of the one or more UEs;partitioning each of the one or more queues into the one or more sub queues based on the delay budget associated with a respective QoS requirement;configuring a dynamically varying waiting time associated with each of the one or more sub queues;maintaining rotating arrival levels and departure levels among the one or more sub queues; andprocessing the one or more information units from a departure-level sub queue prior to expiry of the dynamically configured waiting time to enable transmission of the one or more information units to the network node within the delay budget.

10. The method (600) as claimed in claim 9, wherein the one or more sub queues comprise one or more information units configured within a queue structure.

11. The method (600) as claimed in claim 10, comprising dynamically modifying, the waiting time associated with the one or more sub queues based on processing of the one or more information units from the queue structure.

12. The method (600) as claimed in claim 9, comprising generating, the queue structure specifying creation of the one or more queues for different service types associated with the one or more information units and classifying the one or more queues into the one or more sub queues.

13. The method (600) as claimed in claim 10, comprising processing, by prioritizing execution of at least one sub queue one among the one or more sub queues prior to expiry of the waiting time associated with said at least sub queue based on an event or an interrupt.

14. The method (600) as claimed in claim 10, comprising dynamically executing, the one or more information units from the one or more sub queues according to rotating arrival and departure levels.

15. The method (600) as claimed in claim 10, comprising processing, at least one sub queue prior to expiration of the dynamically configured waiting time associated with the one or more information units configured in a first queue among the one or more queues.

16. The method (600) as claimed in claim 9, comprising allocating one or more resource blocks (RBs) to the one or more information units of the after delay-guaranteed scheduling from the plurality of sub queues and based on at least one of: complete utilization of the of the one or more resource blocks (RBs) or based on a number of the one or more information units in a First In First Out (FIFO) queue.

Images