34 results about "Packet scheduling" patented technology

Innovations in packet scheduling, which allow a scheduling mechanism to approximate fine-grained rate adjustments and cycle-granularity inter-packet spacing for packets of a flow, are described herein. For example, in an iteration of a scheduler loop, a sender determines whether a proximity condition is satisfied for the next packet of a flow. The proximity condition depends at least in part on how long a target next send time is after a current time. The next packet is scheduled for transmission if the next packet is due or if the proximity condition is satisfied for the next packet. When the next packet is scheduled for transmission, the sender sends the next packet and updates the target next send time based at least in part on a target transmission rate.

The application provides a power deterministic network routing and packet scheduling method and system, the method comprising: determining the feasible path set from the source to the destination node for each deterministic flow according to the network and traffic model; constructing the three-dimensional scheduling variable consisting of the path, time offset and CSQF period specification set for each flow; jointly solving the three-dimensional variable of each flow to obtain the routing and packet scheduling scheme satisfying the resource, sending, delay and period constraint with the minimum objective function, the objective function being used to realize the double load balancing of the link and period window; and calculating the network remaining resource based on the obtained scheme and allocating the transmission resource for the non-deterministic flow according to the network remaining resource. Through the three-dimensional joint scheduling of the routing, time and period and the double load balancing of the link and window, the application can significantly reduce the jitter under the strict delay constraint, effectively improve the network resource utilization and the reliability of the deterministic service.

A base station may transmit, to a wireless device, configuration parameters of a downlink control channel. The configuration parameters may indicate features such as a time interval in which the downlink control channel is configured, and a starting symbol, and the base station may use the downlink control channel for transmitting packet scheduling information. The base station may configure a primary cell and a secondary cell, which a wireless device may use to communicate with the base station. A downlink channel of the primary cell may comprise acknowledgement for information transmitted via the primary cell as well as for information transmitted via the secondary cell.

The embodiment of the invention provides a message scheduling method and a related device so as to ensure that jitter of a service flow can be controlled within a required range. The method comprises the following steps: acquiring message scheduling information, wherein the message scheduling information is used for indicating a target queuing sequence of messages of N service flows in a target queue; and sending the message in the target queue according to the message scheduling information.

To provide a packet scheduling technique in a communication device constituting a fronthaul.SOLUTION: A communication device constituting a fronthaul of a radio access network includes a plurality of ports for receiving each of a plurality of packets, a priority calculation unit for calculating a priority of each of the plurality of packets, a plurality of queues corresponding to each of the plurality of ports for storing each of the plurality of packets, a scheduler for determining a transmission order of each of the plurality of packets based on the priority, and a transmission unit for transmitting each of the plurality of packets based on the transmission order. The priority is based on an allowed delay deadline of each of the plurality of packets.SELECTED DRAWING: Figure 5

A method for packet scheduling, a network device, a storage medium, and a computer program product are disclosed. The method may include acquiring a local deadline time indicative of a maximum allowable residence time of a packet at a local node; acquiring a cumulative deadline time indicative of a sum of each local deadline time that the packet goes through at each upstream node via which the packet is transferred, and a cumulative residence time indicative of the sum of each local residence time that the packet goes through at each upstream node via which the packet is transferred; and calculating a deadline time adjustment value according to the local deadline time, the cumulative deadline time, and the cumulative residence time; and adjusting a time at which the packet is sent according to the deadline time adjustment value.

Systems, methods, and devices that perform computing operations are provided. In one example, a system includes a least one node, the at least one node having one or more processors, each having associated memory, a clock, a scheduler, the scheduler monitoring one or more of rates, rates of lanes, rates at which packets are sent, times, latencies of packets, topology, communication states, nodes, and packets in the system, an attribute monitor that measures counters for one or more of congestion state, line rate, and communication attributes. A packet scheduler determines a destination node based on information from the scheduler and the attribute monitor, and sends at least a portion of a packet to the destination node.

The invention relates to a method and a system for realizing integrated accurate fault positioning of an optical switch and an optical link by a DM path based on bidirectional voltage constraint, and belongs to the technical field of optical networks. Comprising the following steps: constructing a dynamic traffic hotspot according to traffic matrix decomposition and a multi-stage packet scheduling model, including a traffic accumulation stage, a traffic scheduling stage and a traffic exchange stage, so as to reduce a monitoring range; an optical switch and an optical link are mapped into the virtual network topology, and monitoring priority labels are given to nodes and edges; a DM-Trals monitoring path based on bidirectional voltage constraint is designed, dense monitoring is carried out on a high-priority area, and conventional monitoring is carried out on a low-priority area; an efficient integer linear programming model is designed, rapid link fault positioning is realized through mathematical constraints, and a virtual network topology formed by dynamic traffic hotspots is adapted at the same time. According to the invention, the monitoring scale is greatly reduced, and rapid, efficient and low-cost fault location of the optical switch and the link is realized by deploying the minimum number of monitors.

The invention relates to the technical field of network communication, in particular to a programmable data packet scheduling method and system for a network switching chip, and the method comprises the steps: constructing a hierarchical scheduling tree; the hierarchical scheduling tree comprises a leaf node level and a root node level, and each node is provided with a bitmap mapping bucket queue, a dynamic priority window mapping module and a reconfigurable priority calculator. According to the method, the technical problem that an existing scheduler is insufficient in flexibility, performance and expansibility can be solved, and then multi-algorithm dynamic deployment, priority range expansion and hierarchical scheduling optimization are achieved while the linear speed processing performance is kept.

The present disclosure relates to a 5G or 6G communication system for supporting higher data rates. A method performed by an SMF in a communication system includes receiving a PCC rule from a PCF, the PCC rule including a protocol descriptor indicating that a PDU set-based FEC is supported, transmitting packet processing information to a UPF, the packet processing information including detection rule information for distinguishing between an FEC source packet and an FEC repair packet in the PDU set-based FEC, and transmitting a QoS configuration file to an AMF, the QoS configuration file including detection rule information for distinguishing the FEC source packet from the FEC repair packet in the PDU set-based FEC. The QoS profile includes QoS rules that are updated based on the PCC rules.

The invention provides a dynamic data packet scheduling method and system, and belongs to the field of data processing. Wireless state sensing, real-time flow sensing and TSN time constraint analysis mechanisms are introduced to the DS-TT side, closed-loop control is formed through dynamic scheduling decision and scheduling execution feedback, and time sensing cooperative scheduling of the TSN across the 5G network and the time sensitive network is achieved. According to the method, the influence of wireless fluctuation on high-priority data packet time delay can be reduced, scheduling conflicts are reduced, the resource utilization efficiency is improved, it is guaranteed that a key time sensitive network TSN service is forwarded in a specified time window, and the method is suitable for deterministic communication scenes such as intelligent manufacturing, rail transit and electric power automation.

The invention discloses a P4-based early flow type identification and flow scheduling method, system and device, and the method comprises the steps: S1, extracting a quintuple from a data packet arriving at a programmable switch, and carrying out the bidirectional flow identification, so as to determine the flow ID of the data packet; synchronously compressing the length of the data packet to obtain a compressed packet length characteristic value, and executing a multi-stage dynamic priority decision process based on a packet counter associated with the flow ID and a sliding window for storing a historical compressed packet length characteristic value, and determining a current priority for the data packet; and S2, calculating a scheduling HVT Rank value according to the determined current priority, the virtual completion time of the previous data packet associated with the flow ID and the compressed packet length characteristic value, and queuing and scheduling the data packets according to the scheduling HVT Rank value. The method can adapt to a dynamic self-adaptive data packet scheduling mechanism in a highly dynamic SAGINs environment.

Provided in the embodiments of the present application are a packet scheduling method and a related apparatus, so as to ensure that jitter of traffic flows can be controlled within a required range. The method comprises: acquiring packet scheduling information, wherein the packet scheduling information is used for indicating a target queuing order of packets of N traffic flows in a target queue; and on the basis of the packet scheduling information, sending the packets in the target queue.

The application relates to a command package scheduling management method and device, computer equipment, a readable storage medium and a program product. The method comprises the following steps: sequentially loading a command package from a target hardware command queue description; the target hardware command queue description comprises a first command package, a second command package and an event waiting command package, the second command package depends on the first command package, the event waiting command package is arranged in front of the second command package, and the event waiting command package is a command package for dependency check on the second command package; the target hardware command queue description is configured with a corresponding dependency relationship storage; if the currently loaded command package is the event waiting command package, the execution state identifier of the first command package is inquired from the dependency relationship storage, and when the execution state identifier of the first command package indicates that the first command package has been completed, the second command package is continuously loaded from the target hardware command queue description. The method can improve the hardware resource utilization rate.

There is provided a method performed at a switch in a computer network for scheduling packets based on an assigned priority in a probabilistic manner. A packet includes priority information in its header. When the packet is received by a switch in the network, its priority is retrieved and mapped to a value within a range for comparison with a random value. The mapped value is compared to the random value and on the basis of that comparison, the packet is either dropped, marked with an ECN bit, or enqueued in normal fashion.

A computerized method for processing packets in parallel using a reorder queue is described. As packets are received, it is determined which packet is the first packet in the flow. Once identified, the first packet in the flow, along with all other packets in the flow, is sent to the reorder queue while only a copy of the first packet in the flow is sent to a packet scheduler for processing on one of a plurality of processing cores. After the copy of the first packet in the flow is processed, the reorder queue releases each of the packets for the flow from the reorder queue in an order in which they were received. Thereafter, each of the packets released from the reorder queue are processed based on the processing of the copy of the first packet.

A method of managing data traffic between a source entity and a recipient entity, and corresponding entity and computer program. The method is for managing data traffic between a source entity and a recipient entity, implementing the following steps: selecting, for the source entity and the recipient entity, at least one policy for scheduling application data packets exchanged between the source entity and the recipient entity, taking into account at least one characteristic of an application associated with the application data, and establishing at least one connection between the source entity and the recipient entity, on which the at least one selected packet scheduling policy is implemented.

The invention discloses a business process management method and a storage medium, and the method comprises the steps: receiving a task generation request sent by a business system through an application programming interface, and generating a to-be-processed task according to the task generation request; calling an upgrade management module to read the to-be-processed task, and obtaining business process information corresponding to the to-be-processed task; calling an upgrade management module to assemble the to-be-processed task and the business process information to obtain a data packet; calling an upgrade management module to determine a target data collection module according to access routing information of a master control process in the server, and sending a data packet to the target data collection module; calling a target data collection module to send a data packet to a master control process in the server; and the server calls the master control process to schedule the service process to run according to the data packet. The management efficiency of the business process is improved.

Examples described herein relate to a network interface device. The network interface device can include circuitry to select a packet for transmission from among at least one time-based queue and at least one priority-based queue based on a departure time stamp value associated with the packet and a current time value. The network interface device can include circuitry to cause transmission of the selected packet. The circuitry can select a packet for transmission from the at least one time-based queue based on the current time value and based on the associated departure time stamp value.

A mobile communication device including a processor configured to obtain a data packet scheduling information; determine a computation load of a packet processing pipeline based on the data packet scheduling information; generate a power consumption profile of the processor based on the computation load; and control a plurality of cores of the processor based on the power consumption profile.

The application discloses a kind of early flow type identification and traffic scheduling method, system and equipment based on P4, comprising: step S1.to the data packet arriving programmable switch, extract quintuple and carry out bidirectional flow identification to determine its flow ID;Synchronous compression is carried out to data packet length to obtain compressed packet length characteristic value, and based on the packet counter associated with the flow ID and the sliding window of historical compressed packet length characteristic value storage, execute multi-stage dynamic priority decision process, determine a current priority for the data packet;Step S2.according to the current priority determined, the virtual completion time of the last data packet associated with the flow ID, and the compressed packet length characteristic value, calculate a scheduling HVT Rank value, and according to the scheduling HVT Rank value, the data packet is queued and scheduled.The application can adapt to the dynamic adaptive data packet scheduling mechanism of SAGINs highly dynamic environment.

A data forwarding method includes, after congestion of an egress queue is relieved, a network device that receives a packet from an upstream node, and determines whether a storage device associated with the egress queue buffers a previous packet that belongs to a same data flow as the packet. When the storage device does not buffer the previous packet, the network device schedules the packet to the egress queue, to forward the packet to a downstream node, where the storage device is configured to receive, during congestion of the egress queue, a packet sent by the network device.

This invention provides a command packet scheduling component, method, and electronic device, relating to the field of computer technology. The component includes at least two task queues and an arbitration module. At least two pipes are connected one-to-one with the at least two task queues, and the arbitration module connects to all task queues. Each pipe is used to split received command packets to obtain tasks to be scheduled. Each task queue is used to cache the tasks to be scheduled after being split by the corresponding pipe, and, with authorization from the arbitration module, sends the tasks to be scheduled to the target work pool. In this invention, pipes can split command packets in advance without waiting for authorization from the arbitration module and cache them in the corresponding task queues, making full use of the pipes' hardware resources and avoiding waste. Simultaneously, task queues can directly send tasks to be scheduled after obtaining authorization, saving the time spent splitting command packets after authorization, improving the task sending rate of the CPD (Command Packet Scheduling) system, and thus improving the task processing rate of the artificial intelligence processor.

The invention relates to the technical field of deterministic traffic scheduling of a time-sensitive network, in particular to a traffic scheduling method for an EPL-TSN heterogeneous convergence network and a TSN controller and the TSN controller, and the method comprises the following steps: setting a macro scheduling period of an Internet gateway through the TSN controller, setting a macro transmission time slot in the macro scheduling period, and transmitting the macro transmission time slot to the EPL-TSN heterogeneous convergence network; dividing a macro transmission time slot to obtain a plurality of data packet scheduling periods, and setting a data packet transmission time slot in the data packet scheduling periods; after the internet gateway receives the polling response data packet, the polling response data packet is sent to the corresponding access TSN switch in the next nearest data packet transmission time slot; and after receiving the polling response data packet, the access TSN switch controls the polling response data packet to wait for a set waiting time and then sends the polling response data packet. According to the invention, the problem that the delay jitter of one polling cycle is caused because the data packet in the EPL network needs to wait for the next transmission time slot when the current transmission time slot is missed is solved.

The invention discloses a data packet scheduling method and device, electronic equipment and a storage medium. The method comprises the following steps: determining data packet metadata of a to-be-processed data packet, and determining a dynamic characteristic parameter based on the data packet metadata; determining a first label of the to-be-processed data packet based on the data packet metadata; the first label is used for indicating the service type of the to-be-processed data packet; determining a second label of the to-be-processed data packet based on the dynamic characteristic parameters; the second label is used for indicating the predicted flow type of the to-be-processed data packet; determining a first scheduling strategy of the to-be-processed data packet based on the first label and the second label, and writing a hardware queue identifier corresponding to the first scheduling strategy into data packet metadata; the first scheduling strategy is used for describing conditions and actions for triggering and calling the to-be-processed data packet. According to the method, the traffic is smoothed fundamentally in a burst traffic or complex traffic mixed scene, queue accumulation is avoided, and queue delay and jitter are reduced to the minimum.

The application provides a command packet splitting component, method, electronic equipment and storage medium, and relates to the technical field of computers.The method comprises an upstream module and a command packet scheduling top-level module, and the upstream module and the command packet scheduling top-level module are both based on at least one virtual function area for hardware resource division, wherein the command packet scheduling top-level module is used for authorizing the upstream modules of different virtual function areas to perform parallel splitting on the command packets in the case of receiving task issuing requests sent by the upstream modules of different virtual function areas.In the application, the command packet scheduling top-level modules in different virtual function areas can simultaneously receive task issuing requests sent by the upstream modules in the virtual function areas, the mutual waiting and mutual blocking behaviors between different virtual function areas are avoided, and the task issuing speed of the CPD in the multi-virtual function mode and the task processing capacity of the artificial intelligence processor are greatly improved.

The application relates to a wireless signal transceiving device scheduling method and system. The method comprises the following steps: a device scheduling software first schedules an antenna to track a satellite and outputs a state, then allocates digital signal processing devices in sequence, known signals are configured according to a preset scheme, unknown signals are detected and then processed, and an allocation result is output; after load balancing through deduplication and path adjustment, an instruction is output. A data packet is output after digital signal processing device processing, and the scheduling software distributes data in combination with a server load. A judgment result is output after server processing, and monitoring software feeds back device abnormalities. The scheduling software optimizes the load or shifts a fault load according to the judgment result, schedules redundant devices to detect new signals and allocate resources, and recycles idle resources. When a signal is transmitted, tasks are allocated in sequence according to load weights, and are transmitted after modulation and amplification. The method can reduce the redundancy of devices in a system, improve the utilization rate of the devices, and increase the reliability of system operation.

Various aspects of this disclosure relate generally to wireless communication. In some aspects, the wireless device can receive data packets on an isochronous (ISO) link. The wireless device can transmit low-power (LE) packets with feedback of the data packets. Numerous other aspects are described.

The application discloses a flow label-based traffic scheduling method, device and equipment. The method comprises the following steps: a source computing node divides the service flow in a single RDMA queue pair into multiple independent sub-flows based on a preset semantic boundary; the source computing node generates an IPv6 flow label for each sub-flow, and fills the IPv6 flow label into the corresponding field of an IPv6 header when encapsulating a data packet; and the source computing node and / or a network node schedules the data packets of different sub-flows to different network paths for transmission based on the IPv6 flow label in a path selection process. The application can greatly improve the traffic entropy of the network by performing semantic subdivision on the service flow in the queue pair, dividing the service flow into multiple independent sub-flows, and allocating different IPv6 flow labels to each sub-flow, so that the elephant flow can be transmitted through multiple paths, and the out-of-order problem caused by the multi-path transmission can be avoided by using the intermittent characteristics of the traffic.