127 results about "Fair scheduling" patented technology

The invention relates to a wireless telecommunication system including at least one Base Station (BS) for communicating with at least one multihop Relay Node (RN) using a wireless link of a first type and with at least one local user equipment unit (UE) located within a range of the base station (BS) using at least one wireless link of a second type, wherein the wireless link of the first type is used to transmit a combined data flow encapsulating multiple individual data flows relating to different services and / or remote user equipment (UE) units. In order to enable a global fair scheduling, the base station (BS) is further configured to receive at least one local fairness parameter from the multihop relay node (RN), said local fairness parameter representing a fairness of the distribution of radio resources of the relay node (RN) over the individual data flows in the combined data flow and to execute a global fair scheduling procedure for determining a fair distribution of available radio resources of the base station (BS) over said at least one wireless link of the first type and said at least one wireless link of the second type, wherein the local fairness parameter is used as a parameter in said global fair scheduling procedure.

A fair scheduling system with methodology for fairly scheduling queries for execution by a database management system is disclosed. The techniques involve obtaining computer-executable query jobs and cost estimates to execute the query jobs. For example, the cost estimate can be a number of results the query is expected to return. Based on the cost estimates, the fair scheduling system causes the database management system to execute the query jobs as separately executable sub-query tasks in a round-robin fashion which can decrease latency of low cost queries concurrently executing with high cost queries.

The present invention provides hierarchical structures of queues and schedulers for switches and routers with, preferably fully-connected, mesh fabrics, for efficiently and properly handling the quality or service requirements of multiple network services, such as ATM and IP, in switch or router. The switches of this invention provide, for example, fair allocation of bandwidths to different network services, to different QoS classes within network services, and to different resources within the switch by use of, preferably, weighted, fair scheduling methods. The switches and routers of this invention are particularly directed to multi-protocol, high-throughput communication application, but may have wide applicability in systems generally where data packets are switched or routed.

A method allocates resource in an Orthogonal Frequency-Division Multiple Access (OFDMA) network, including a set of Base Stations (BSs) and a set of Mobile Stations (MSs) for each BS. OFDMA frame are constructed as multiple resource blocks, and each resource block contains symbols transmitted on different subcarriers. A cluster is formed from adjacent sectors of different neighboring cells to jointly optimize the resource allocation in multiple frames, and three non-overlap zones are sequentially identified in cluster: cell center zone, cell edge zone, and cluster corner zone. Resource allocation includes intra-cluster proportional fair scheduling and inter-cluster interference mitigation. Intra-cluster scheduling further includes resource allocation for cell center zone and resource allocation for cell edge zone.

The present invention provides switches and routers, preferably with fully-connected mesh fabrics, that transmit data through the switch fabric in variable-size data units. Variable-size data units allow switches and routers to provide throughputs close to hardware capabilities, eliminating the need for over-capacity hardware in the switch fabric and other components. Along with variably-size data units, preferred embodiments of this invention include scheduling methods that provide fair allocation of pre-determined bandwidths to different protocols, to different classes of service within protocols, and to different resources within the switch by use of certain weighted, fair scheduling methods. The switches and routers of this invention are particularly directed to multi-protocol, high-throughput communication applications, but may have wide applicability in systems generally where data packets are switched or routed.

The present invention provides hierarchical structures of queues and schedulers for switches and routers with, preferably fully-connected, mesh fabrics, for efficiently and properly handling the quality or service requirements of multiple network services, such as ATM and IP, in switch or router. The switches of this invention provide, for example, fair allocation of bandwidths to different network services, to different QoS classes within network services, and to different resources within the switch by use of, preferably, weighted, fair scheduling methods. The switches and routers of this invention are particularly directed to multi-protocol, high-throughput communication application, but may have wide applicability in systems generally where data packets are switched or routed.

The present invention provides a method and an apparatus for scheduling a flow on an output link among a plurality of flows of incoming packet traffic at a network device associated with a data network. A scheduler comprises scheduler logic that uses a credit counter per flow to keep track of the service difference received between two or more flows and selects the flow for service next that has the maximum credit value. The scheduler logic decrements the current credit value by the amount of service received based on either the packet size or a ratio of the packet size and a weight value of the front-end packet of the next flow of outgoing packet stream selected for service and is being currently served. To specify a minimum guaranteed bandwidth for a specific flow, the scheduler logic selectively updates the corresponding indication of serving an outgoing packet on the output link for the plurality of flows of outgoing packet stream including the first and second indications based on the update value for the larger indication. When a current credit value drops below a threshold value, regardless of a state of a particular flow, the credit counters of all the flows in the plurality of flows of outgoing packet stream may be updated. The scheduler logic implements a fair scheduling algorithm with characteristics approximating the characteristics of timestamp schedulers but without their computational complexity. A relatively reduced calculation complexity of the scheduler logic with low bounded delay enables use thereof in high-speed networks devices, such as a packet router.

The invention discloses a joint power control and proportional fair scheduling method for D2D communication in a cellular network, relates to the field of D2D communication in the cellular network, and aims to solve the problem of common-channel interference between users and the problem of fairness between the users due to the fact that the maximum throughput capacity of a system is used as a target in the existing interference suppression algorithm. An optimal power control method is used for realizing interference suppression. Meanwhile, aiming at the problem of user fairness caused by the time-varying characteristic of a channel under the condition of coexistence of multiple users, the invention adopts the proportional fair scheduling method so as to meet the demand of the users for the fairness. A cellular network model for multiplexing uplink resources for D2D communication is constructed, and mathematical modeling and solving for joint power control and proportional fair scheduling are carried out for the network model. The interference suppression method for joint power control and proportional fair scheduling, which is provided by the invention, can guarantee the quality of user communication and improve the throughput capacity and the fairness of the system.

A pipelined scheduler which allows easy implementation and control and further fair scheduling among input lines of a crossbar high speed switch fabric is discussed. By means of a round-robin communication scheme, a systematically ordered sequence of visits to time slots can be obtained regardless of whether the number of scheduler modules is even or odd by framing the time axis and using a priority matrix to reserve future time slots. Further, a Carry Over Round-robin Pipelined Scheduler (CORPS) achieves scalability to a large number of ports. Moreover, CORPS achieves one scheduling decision per line per slot, by scheduling packets in future slots. It is well suited to the support of Quality of Service traffic, since the choice of the queues to be scheduled is arbitrary. CORPS limits itself to resolve, in a fair way, the contention for output ports.

An apparatus and method for Proportional Fair (PF) scheduling for multicast services in a communication system are provided. In the PF scheduling method, a multicast PF metric is calculated over every AMC level provided by the system using the channel status information and average data rates of MSs, and an AMC level maximizing the multicast PF metric is selected as a multicast service rate.

The embodiment of the invention discloses two proportional fair scheduling methods assisted by using statistical channel information in a downlink multiuser multi-input multi-output transmission system, namely the scheduling matching method and the matching scheduling method, wherein the scheduling matching method mainly comprises the following steps: each user feeds back instantaneous CQI (Channel Quality Indicator) to a base station in each time slot, the base station schedules the first user by using the maximum normalized CQI standard and simultaneously selects other users mutually orthogonal to the statistical characteristic direction of the first user to form a scheduling set; and the matching scheduling method mainly comprises the following steps: the base station makes users with mutually orthogonal statistical characteristic direction form a group, each user feeds back the instantaneous CQI to the base station in each time slot, and the base station selects a scheduling group according to various standards. The invention has the advantages of low feedback expense and low calculation complexity, different scheduling standards can be freely set, the service quality of users is satisfied, and meanwhile, the invention also has the characteristic of considering the throughout and the fairness of the system.

A method of allocating resources in a wireless multi-user network is disclosed, comprising the following steps: —performing a proportional fair scheduling in time and frequency domain based on the bitrate for each user and the channel quality measurements for each chunk per user; and—performing a power allocation in the following way: o if the traffic load is above a threshold: allocating the uniform power to all subcarriers o if the traffic load is below the threshold, adapting a channel-dependent power allocation scheme.

A SYN packet bandwidth Distributed Denial-of-Service (DDoS) attack is defended against by intercepting and identifying SYN packets in a “DDoS gateway” advantageously positioned at the edge of the network to be protected (e.g., one hop upstream from the protected link), and by queuing these intercepted SYN packets in a separate queue from other TCP packet queues. Edge per-flow queuing is employed to provide isolation among individual TCP connections sharing the link. A fair scheduling algorithm such as round robin scheduling is used to ensure that SYN packets (such as those generated as part of a SYN bandwidth attack) cannot overwhelm the egress link in the presence of other TCP packets.

The invention provides a vehicle-road communication downlink wireless resource distribution system, comprising a business flow input module and a business classifier connected with the business flow input module. The business classifier is used for classifying business flows. The business classifier is connected with a first scheduling module and a second scheduling module. The first scheduling module is used for scheduling real-time business flows in a differentiate manner. The second scheduling module is used for scheduling non-real-time business flows. The first scheduling module is also connected with the second scheduling module, so that the real-time business flows are enabled to have the priority in scheduling. When the real-time business flows are scheduled and wireless resources are surplus, the scheduling of the non-real-time business flows is started. According to the algorithm provided by the invention, channel sensing requirements are met, time delay QoS (Quality of Service) guarantee of the real-time business flow is provided, the priority of business flows related to traffic safety and the fair scheduling of concurrent real-time business flows are both considered, and the balance among the throughput, the fair index and the QoS support is ensured.

The invention discloses a method for determining the business priority for a high-speed downlink package access (HSDPA) system, and relates to a mixed business scheduling technology in the HSDPA system. The technical proposal adopted is put forward to improve the service quality under the condition of mixed services of three types, which is to determine the scheduling priority at least according to the priority indicator parameter of the scheduling service and the priority parameter determined by the Proportional Fair Scheduling (PFS). The invention simultaneously discloses a device of achieving the method, which is to schedule the services according to the priority determination method. The invention further discloses a scheduling device based on the scheduling method. The invention enhances the service quality of HSDPA system.

The invention relates to a multi-service integration dispatching method that supports the medium access control layer. The order of priority for system dispatching radio bearer services in each dispatching time unit TTI is as follows: a delay-constrained (GD) service, a minimum guaranteed bandwidth (GB) service and a best effort (BE) service; in the course of dispatching, if resource blocks are not used up when the resource blocks are dispatched to a certain radio bearer, the rest of the resource blocks will be dispatched to other radio bearers in the same UE as the radio bearer; if the rest of the number of resource blocks is zero, the average speed of all radio bearers will be renewed and next dispatching time unit will be entered. The invention avoids the problem that a service of high priority occupies resources of a service of low priority and ensures minimum QOS requirements of two services using definite proportional fair scheduling algorithm specific to GD and GB services.

The invention relates to a power generation margin distribution method for a photovoltaic power station based on power grid security constraints and belongs to the field of running and control technologies of new energy electric power systems. The power generation margin distribution method for the photovoltaic power station based on power grid security constraints includes that according to a fair scheduling principle, after the photovoltaic power station enters a free power generation state, the space of a power grid for performing photovoltaic power generation is uniformly distributed for each photovoltaic power station according to a minimum load rate deviation method, on the one hand, unnecessary photovoltaic power discarding due to a too small active set value of the photovoltaic power generation is avoided, and on the other hand, the problem that the power output by the photovoltaic power generation surpasses the power grid bearing capacity due to a too large active set value due to distributing the photovoltaic power generation capacity is avoided. The power generation margin distribution method for the photovoltaic power station based on power grid security constraints is integrated in a photovoltaic power generation active control master station run by a dispatching center to enable the system to implement an optimal control strategy in real time according to the photovoltaic power generation running state and the power grid running state, maintain enough backspin security space for the power grid, guarantee the active power security of the section of a connecting wire of the photovoltaic power station and the power grid and guarantee the fair scheduling among the photovoltaic power stations.

The invention relates to a scheduling method and a scheduling system. The scheduling method comprises the following steps of obtaining pre-allocated scheduling information; respectively splitting various pre-allocated work and rest information of all scheduling personnel into a plurality of business components; packaging and combining all split business components to multiple groups of page information according to the scheduling personnel to which the business components belong; respectively associating multiple groups of page information with the corresponding scheduling personnel; and generating a scheduling list according to the scheduling information and all page information obtained after associating the scheduling personnel. According to the scheduling method and the scheduling system, on the basis of transformation of a scheduling mode, a manager liberates from the heavy scheduling and works more easily, the work enthusiasm of the staff is further improved based on a fair scheduling result, and through increasing the number of service people at the peak period, the service perception and the satisfaction of a customer are improved.

The embodiments of the invention provide a data flow scheduling method and apparatus under a long term evolution (LTE) network. The method comprises: according to priorities of data packets, placing the data packets in each data queue of a media access control layer to form a data queue with at least two priorities; according to the priorities of the data queue, calculating transmission cut-off time of the data packets in the data queue; when user equipment enters a caution area, updating the transmission cut-off time of the data packets in data queue with at least one priority to be a time point within a current scheduling period; and distributing resource blocks to the data packets respectively according to the priorities of the data queue and the transmission cut-off time of the data packets in the data queen. According to the embodiments of the invention, fair scheduling of multimedia flows and conventional data flows is realized, and at the same time, the influence exerted by hard switching on the service quality of the multimedia flows can also be reduced.

The invention discloses dynamic resource allocation method and equipment of a multi-cell wireless communication system. In the invention, a controller receives channel state information, intercell interference information and flow demand information; global optimization is carried out on sub-channel allocation according to the received information so as to ensure that uplink throughput and downlink throughput of the system realize maximization; a sub-channel allocation result is sent to a base station, the base station is used for designating all time slots of all frames by using a proportional fair scheduling algorithm aiming at all service varieties according to the received sub-channel allocation result; and results designated by the time slots are sent to a mobile station. According to the technical scheme of the invention, by considering factors of a QoS requirement of a user, the intercell interference and the uplink flow requirement and the like, the invention ensures that each user can obtain broadband resources matched with the flow requirement and the QoS requirement, and improves the uplink and the downlink throughput of the system.

The invention is applicable to the technical field of computers, and provides an IO scheduling method based on an array / LUN, and the IO scheduling method based on the array / LUN is applied to a memory system. The method comprises the following steps: receiving a command for setting a priority for the array / LUN, and setting a plurality of priorities for the array / LUN; and carrying out IO scheduling processing to the array / LUN according to the priorities of the array / LUN. Preferably, the memory system is further used for receiving a processing command for defining an IO to the array / LUN. The invention further correspondingly provides an IO scheduling apparatus based on the array / LUN. According to the IO scheduling method based on the array / LUN and the IO scheduling apparatus based on the array / LUN, the priorities are set for the array / LUN in the memory system, the IO is subjected to fair scheduling, and the mutual influences among the arrays / LUNs can be effectively prevented.

The proportion equity dispatch algorithm (PEDA) possesses multiple dispatch modes of providing multi choices between throughput of sector and service fairness for operation manager. The method includes following steps: (1) determining configuration parameter for each mode of PEDA; (2) saving the said configuration parameters in base station; (3) using far end maintenance platform or near end maintenance platform sends the selected dispatch mode in PEDA to base station; (4) after receiving dispatch mode of modified PEDA, base station makes appointed mode effect instantly or in time.

The object of the present invention is to provide a reporting strategy for uplink scheduling request information in wireless telecommunication network. Above all, a method for the user equipment to report the uplink scheduling request information to the base station in wireless telecommunication network is disclosed. Firstly, the user equipment computes the overall service data amount of all radio bearers in each group of radio bearers in the buffer of the user equipment; then the user equipment only reports group-related information of triggered one or more groups of radio bearers to the base station. The present invention further proposes a method in the user equipment in wireless telecommunication network for reporting the emergency information to the base station, that is, the user equipment judges whether each radio bearer is in the emergency, and when one or more radio bearers are in the emergency, the user equipment sends emergency indication information to the base station. By the combination of the two reporting method, the base station can realize efficient and fair scheduling.

The invention discloses a new energy field station power limiting time period active distribution method. The method comprises the steps of obtaining a new energy power limiting total demand in an area; Analyzing a plurality of indexes of each new energy field station to form a calculation method of each index; Carrying out comprehensive evaluation on the plurality of indexes, and calculating a comprehensive evaluation index of each new energy field station; And calculating the limited electric quantity of each new energy field station according to the comprehensive evaluation index of each new energy field station. The invention provides a new energy field station power limiting time period active distribution method. the distribution strategy is dynamically optimized by comprehensively considering the actual operation condition of each new energy field station; According to the historical operation trend, the electric quantity transaction completion condition and the system stable operation support condition of the new energy field station, the electric quantity sharing coefficient of each new energy field station in the electricity limiting time period is established, so that the new energy field station with excellent operation condition and low transaction electric quantity completion condition can carry out more active power output in the electricity limiting time period,and fair scheduling is ensured.

The invention discloses a task scheduling method and electronic equipment. The method includes: monitoring system running status, wherein the system running status includes status of a target process;and adopting a task scheduling strategy, which corresponds to the target process, for task scheduling according to the system running status, wherein the target process is a process related to virtual reality (VR) and / or augmented reality (AR). The above-mentioned method is used for alleviating technical problems which exist in the prior art and are that operating systems adopting a fair scheduling strategy cannot satisfy requirements of real-time display of AR / VR equipment, and screen tearing and blurred screens are caused, and a technical effect of ensuring real-time performance of displayis realized.

Fair scheduling in broadcast environments is disclosed. In one embodiment, a computerized system includes a link through which packets are transmitted, and a plurality of nodes. Each node transmits a packet through the link when counting from a back-off interval reaches a predetermined transmission time. The back-off interval for each packet is based on at least a start tag of the packet, which is assigned to the packet when it arrives at or within the node for transmission over the link, such as at a controller (e.g., a medium-access controller, or MAC) of the node.

The invention provides a network selection method based on weighted optimal bipartite graph matching. The network selection method based on weighted optimal bipartite graph matching comprises the following steps that (1) the parameters of user present service quality, service demands and network performance all serve as input parameters and applied to the network selection process in a cloud processing center; (2) if the number of users is larger than the number of candidate networks, multi-user fair scheduling is conducted firstly; (3) a bipartite graph model is created for the network selection question; (4) the matching degree of the demands and the network performance of each pair of users is calculated, and network selection based on bipartite graph optimal matching is achieved; (5) the network load conditions are detected, and other networks are reselected for the users in an overload network and the users with access being blocked. According to the network selection method based on weighted optimal bipartite graph matching, a heterogeneous network convergence scene is combined with the multi-user scheduling technology, a complicated problem is divided into simple partial problems to be solved, and low-complexity optical network selection integrating the user demand and the network performance is achieved.

The invention discloses a load-monitoring-based hybrid scheduling method under a Hadoop cloud platform. A load-monitoring-based hybrid scheduling scheme is provided by analyzing scheduling effects and respective application scenarios of a Max-D algorithm, an FIFO algorithm and a fair scheduling algorithm. The one the most proper for the current load condition is selected from the three algorithms by monitoring a system load in real time. Compared with the single application of one scheduling algorithm, the scheme has significant advantages and is adaptive to changes in the load in a Hadoop system, so that the system can retain good performance.

The embodiment of the invention discloses a resource scheduling method ad a base station, wherein the method comprises a step that: the base station measures the movement speed of at least one user, divides the user to a speed grade corresponding to the movement speed of the user and determines users who are qualified to participate in scheduling in the corresponding speed grades within a scheduling updating period T(i and j) corresponding to the each speed grade, wherein the T(i and j) is less than or equal to a channel coherence time T(coh, i and j) of the corresponding speed grade; the T(coh, i and j) is determined by the corresponding speed grade and a carrier frequency point of a resource block to be distributed, wherein i is the speed grade, and j is the carrier frequency point of the resource block to be distributed; and resource block is distributed to the user having a highest priority level from all the determined users who are qualified to participate in scheduling; therefore, the proportional fair scheduling complexity is lowered effectively, and the scheduling time is shortened.