58 results about "Packet scheduling" patented technology

The invention provides a self-adaptive data packet scheduling method based on approximate quantiles and multiple queues on a programmable data plane, and aims to solve the problem that the scheduling performance and the resource efficiency are difficult to balance in the prior art. According to the method, lightweight ranking scoring, dynamic queue mapping and a cascade enqueue strategy are combined. A relative priority score of the data packet is efficiently calculated through a minimum-maximum normalization mechanism; adaptively mapping the data packets to one of a plurality of FIFO queues according to the scores and real-time congestion conditions of the queues, and providing a fast channel for extremely high priority traffic; and when the target queue is full, trying to store the data packet into a queue with a lower priority in a cascading manner so as to avoid unnecessary discarding. According to the method, resource consumption and implementation complexity are remarkably reduced while the approximate ideal PIFO scheduling performance is achieved, and the method is particularly suitable for resource-limited environments such as a software-defined network and edge computing.

The invention discloses a network data quality evaluation method and system and a related device, relates to the field of Internet, and is applied to a network data quality evaluation system, and the method comprises the steps: obtaining at least one data packet of a session in a network link through a bypass technology; respectively storing the at least one data packet into a plurality of first queues according to streams, analyzing the at least one data packet, and scheduling the at least one data packet to a second queue according to the streams after the at least one data packet is analyzed; obtaining the data packet from the second queue, and updating the record content of the flow table according to the analysis information of the data packet; when the data transmission in the session is finished, the recorded content of the flow table is analyzed, and the integrity of the session is determined; and determining the quality of the session for transmitting the data packet by using the network link according to the integrity of the session. According to the application, the data packet is obtained through the bypass technology mirror image, the data packet is stored according to the stream, the integrity of the session is determined by analyzing the recorded content in the stream table, and the evaluation of the network data quality is realized.

The invention provides a command packet scheduling component and method and electronic equipment, and relates to the technical field of computers, the component comprises at least two task queues and an arbitration module, at least two pipelines are connected with the at least two task queues in a one-to-one correspondence manner, and the arbitration module is connected with all the task queues; each pipeline is used for splitting a received command packet to obtain a to-be-scheduled task; each task queue is used for caching the to-be-scheduled tasks after the corresponding pipeline is split, and issuing the to-be-scheduled tasks to the target work pool under the condition of authorization of the arbitration module. In the invention, the pipeline can split the command packet in advance without waiting for the authorization of the arbitration module, and caches the command packet to the corresponding task queue, so that the hardware resources of the pipeline are fully utilized, and the waste of the hardware resources is avoided. And meanwhile, the task queue can directly issue the to-be-scheduled task after obtaining authorization, so that the splitting time of the command packet after authorization is saved, and the task issuing rate of the CPD is improved, thereby improving the task processing rate of the artificial intelligence processor.

The invention discloses a fine-grained flow scheduling priority marking system for a hardware unloading network, which comprises a packet analysis module for extracting quintuple flow identification information from a data packet and supporting multi-layer protocol field extraction, and a flow table module for maintaining the real-time state of the current active data flow by adopting a double-hash table structure and supporting parallel search and update, the priority judgment module is used for allocating scheduling priorities to current messages through configurable boundary matching rules on the basis of state information returned by a flow table, the message recombination and marking module is used for encoding priority labels into DSCP fields of an IPv4 message header, and the whole system adopts a full-assembly-line hardware architecture and can be ensured to continuously run at a linear speed under a 100Gbps network load. Dynamic packet-by-packet scheduling control is supported, a scheduling priority based on a real-time flow state can be given to each data packet, and fine scheduling of network resources is realized.

The application discloses a multi-service traffic grouping scheduling method for a P4 switch processor core, mainly comprising a feature extraction method based on a statistical interval and a Sketch, comprehensive data packet time correlation and traffic dynamic change, an optimized Bloom filter conflict detection mechanism, improved adaptability and accuracy of the algorithm in a limited resource environment; a decision tree model is combined with scheduling, a decision tree is reconstructed to adapt to a P4 switch operation mode and data processing demand, high-precision service flow classification under line-speed operation is ensured; a grouping scheduling method AD-PIFO is designed based on variable priority, data packet forwarding priority is dynamically adjusted, different service QoS demand is met, and the overall performance and efficiency of the switch are improved. The method is outstanding in high-priority traffic throughput and low-latency performance, and the medium-low-priority traffic throughput is better than that of similar algorithms, is stable and effective under different load conditions, has reasonable additional time overhead of data packet transmission, and is widely used in SDN network optimization data packet scheduling scenes.

The application relates to a tlp packet scheduling method and device, a data processor network card and a storage medium. The method comprises the following steps: acquiring an index_tlp packet, a ring_tlp packet, a net_desc_tlp packet, a blk_desc_tlp packet, a net_pkt_tlp packet and a blk_pkt_tlp packet respectively; inputting the net_pkt_tlp packet and the blk_pkt_tlp packet into a first-level scheduling module of a data processor network card, performing balanced scheduling through a target algorithm in the first-level scheduling target, obtaining the scheduled net_pkt_tlp packet and blk_pkt_tlp packet; then inputting the scheduled net_pkt_tlp packet and blk_pkt_tlp packet, the index_tlp packet, the ring_tlp packet, the net_desc_tlp packet and the blk_desc_tlp packet into a second-level scheduling module of the data processor network card, performing round-robin scheduling through a round-robin scheduling algorithm in the second-level scheduling module, and obtaining the scheduling sequence of various tlp packets. The method can improve the scheduling efficiency of the tlp packet by setting multiple levels of packet scheduling, the first-level scheduling can ensure the balanced scheduling of the storage and network flow, and the second-level scheduling can ensure the balanced scheduling of various tlp packets.

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.

The application discloses a message scheduling method, a feature library updating method, a message scheduling system and a network edge device, and relates to the technical field of networks, and comprises the following steps: capturing data messages flowing through the network edge device and extracting plaintext feature information; matching the extracted plaintext feature information with records in a local first feature library; when the matching is successful, determining a target priority for forwarding scheduling based on a corresponding service category identifier; when no record is matched, forwarding at a default priority, and uploading the message or a feature digest thereof to an artificial intelligence server as a to-be-processed object; receiving a second feature library issued by the artificial intelligence server and updating the first feature library; the second feature library is obtained by updating the first feature library according to an analysis result of the to-be-processed object by using a large language model deployed by the artificial intelligence server. The application realizes automatic updating of a feature library relied on by new application traffic classification and priority allocation.

A method, a network element, a system and a storage medium for processing a quality of service (QoS) parameter, the method comprising: a control plane network element obtaining a first QoS parameter between a terminal device and a user plane function network element; obtaining capability information of a first network domain, determining a second QoS parameter of the first network domain according to the capability information of the first network domain and the first QoS parameter, and sending first information of the second QoS parameter to the first network domain. The first network domain comprises at least one of a radio access network, a backhaul network and the user plane function network element. By adopting the scheme, the accuracy of data packet scheduling and user experience can be improved.

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.

The invention provides a command packet splitting component and method, electronic equipment and a storage medium, and relates to the technical field of computers, the method comprises the steps that an upstream module and a command packet scheduling top layer module are included, and the upstream module and the command packet scheduling top layer module carry out hardware resource division based on at least one virtual function region; wherein the command packet scheduling top layer module is used for authorizing the upstream modules of the different virtual function areas to carry out parallel splitting on command packets under the condition that task issuing requests sent by the upstream modules of the different virtual function areas are received. In the invention, the command packet scheduling top layer modules in different virtual function areas can simultaneously receive the task issuing requests sent by the upstream modules in the virtual function areas where the command packet scheduling top layer modules are located, so that mutual waiting and mutual blocking behaviors among different virtual function areas are avoided, the task issuing speed of CPD in a multi-virtual function mode is greatly improved, and the task issuing efficiency is improved. And the task processing capability of the artificial intelligence processor.

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 application provides a dynamic data packet scheduling method and system, and belongs to the field of data processing. The application introduces wireless state perception, real-time flow perception and TSN time constraint analysis mechanism on the DS-TT side, and forms a closed-loop control through dynamic scheduling decision and scheduling execution feedback, so as to realize time perception collaborative scheduling of cross 5G network and time sensitive network TSN. The application can reduce the influence of wireless fluctuation on the time delay of high priority data packet, reduce scheduling conflict and improve resource utilization efficiency, guarantee that the key time sensitive network TSN service is completed within the specified time window, and is suitable for deterministic communication scenes such as intelligent manufacturing, rail transit and power automation.

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 present invention discloses a multipath information packet encoding and scheduling method for minimizing latency. The method includes: updating lost information packets at the transmitting end through feedback information; planning the transmission order of each packet within a packet scheduling window based on the different transmission rates, feedback delays, and path erasure probabilities of multiple paths; estimating the total number of lost information packets based on the feedback information at the beginning of the scheduling window, and arranging the transmission of repair coding packets at the beginning of the scheduling window and forward error correction coding packets at the end of the scheduling window based on the feedback information delay; and overcoming data packet loss caused by channel errors. The present invention estimates packet loss within the feedback delay, transmits information packets and coding packets in the order they are received, and introduces repair coding packets and forward error correction coding packets to achieve, with virtually no information redundancy, reduced end-to-end latency for information packet transmission in multipath networks with feedback lag.

Innovations in packet scheduling are described herein that allow scheduling mechanisms to approximate fine-grained rate adjustments and periodic-grained inter-packet spacing for packets of a flow. For example, in an iteration of a scheduler loop, the transmitter determines whether a proximity condition is satisfied for a next packet of the flow. The proximity condition depends, at least in part, on how long the target next transmission time follows the current time. If the next packet expires or if a proximity condition is satisfied for the next packet, the next packet is scheduled for transmission. When a next packet is scheduled for transmission, the transmitter transmits the next packet and updates the target next transmission time based at least in part on the target transmission rate.

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.