Patent classifications
H04L47/52
INTEGRATED TRAFFIC PROFILE FOR INDICATING CONGESTION AND PACKET DROP FOR CONGESTION AVOIDANCE
A system for facilitating an integrated traffic profile for indicating congestion and packet drop is provided. During operation, the system can determine a first traffic profile indicating whether to drop a packet based on the utilization of a queue. The packets from the queue can be forwarded via an egress port reachable via a fabric. The system can also determine a second traffic profile indicating whether to indicate congestion in the packet based on the utilization. The system can then determine a third traffic profile by combining the first and second traffic profiles. The third traffic profile can indicate acceptance at the queue for a subset of packets being selected for dropping based on the utilization. Subsequently, the system can, if the packet is selected for dropping, determine whether to accept the packet at the queue and set a congestion indicator in the packet based on the third traffic profile.
Packet transfer apparatus, method, and program
A packet transfer apparatus is configured to perform packet exchange processing for exchanging multiple continuous packets with low delay while maintaining fairness between communication flows of the same priority level. The packet transfer apparatus includes: a packet classification unit; queues that holds the classified packets for each classification; and a dequeue processing unit that extracts packets from the queues. The dequeue processing unit includes a scheduling unit that controls the packet extraction amount extracted from the queue for a specific communication flow based on information on the amount of data that is requested by the communication flow and is to be continuously transmitted in packets.
Method and Apparatus for Queue Scheduling
Embodiments of this application disclose a method and an apparatus for queue scheduling, to reduce a network latency in a packet transmission process. The method includes: A first device obtains a first packet balance when scheduling a first queue, where the first packet balance indicates a volume of packets that can be dequeued from the first queue; and the first device schedules a second queue based on the first packet balance.
Multi-radio device
One example discloses a multi-radio device, including: a controller configured to be coupled to a radio; wherein the controller is configured to receive a request to communicate a signal with an initial communication priority from the radio; wherein the controller includes a priority offset module configured to, adjust the initial communication priority by a first offset; and wherein the controller includes a priority escalator module configured to, adjust the initial communication priority by a second offset.
DETERMINING RATE DIFFERENTIAL WEIGHTED FAIR OUTPUT QUEUE SCHEDULING FOR A NETWORK DEVICE
A network device may receive packets and may calculate, during a time interval, an arrival rate and a departure rate, of the packets, at one of multiple virtual output queues. The network device may calculate a current oversubscription factor based on the arrival rate and the departure rate, and may calculate a target oversubscription factor based on an average of previous oversubscription factors associated with the multiple virtual output queues. The network device may determine whether a difference exists between the target oversubscription factor and the current oversubscription factor and may calculate, when the difference exists, a scale factor based on the current oversubscription factor and the target oversubscription factor. The network device may calculate new scheduling weights based on prior scheduling weights and the scale factor, and may process packets received by the multiple virtual output queues based on the new scheduling weights.
DETERMINING RATE DIFFERENTIAL WEIGHTED FAIR OUTPUT QUEUE SCHEDULING FOR A NETWORK DEVICE
A network device may receive packets and may calculate, during a time interval, an arrival rate and a departure rate, of the packets, at one of multiple virtual output queues. The network device may calculate a current oversubscription factor based on the arrival rate and the departure rate, and may calculate a target oversubscription factor based on an average of previous oversubscription factors associated with the multiple virtual output queues. The network device may determine whether a difference exists between the target oversubscription factor and the current oversubscription factor and may calculate, when the difference exists, a scale factor based on the current oversubscription factor and the target oversubscription factor. The network device may calculate new scheduling weights based on prior scheduling weights and the scale factor, and may process packets received by the multiple virtual output queues based on the new scheduling weights.
CLOUD-NATIVE WORKLOAD OPTIMIZATION
Techniques for orchestrating workloads based on policy to operate in optimal host and/or network proximity in cloud-native environments are described herein. The techniques may include receiving flow data associated with network paths between workloads hosted by a cloud-based network. Based at least in part on the flow data, the techniques may include determining that a utilization of a network path between a first workload and a second workload is greater than a relative utilization of other network paths between the first workload and other workloads. The techniques may also include determining that reducing the network path would optimize communications between the first workload and the second workload without adversely affecting communications between the first workload and the other workloads. The techniques may also include causing at least one of a redeployment or a network path re-routing to reduce the networking proximity between the first workload and the second workload.
Systems and methods for transport capacity scheduling
The present disclosure relates to systems and methods for transport capacity scheduling. The systems and methods may determine a target region, wherein a plurality of service requests that satisfy a preset condition initiate from the target region. The systems and methods may determine a non-busy region based on information of the target region. The non-busy region may include one or more available service providers that are free to accept a service request. The systems and methods may transmit, via a network, a scheduling instruction associated with the plurality of service requests to a user terminal associated with at least one of the one or more available service providers in the non-busy region. The scheduling instruction may include information inquiring whether the at least one of the one or more available service providers in the non-busy region agrees to go to the target region.
Techniques to manage data transmissions
A transmitter can manage when a transmit queue is permitted to transmit and an amount of data permitted to be transmitted. After a transmit queue is permitted to transmit, the transmit queue can be placed in a sleep state if the transmit queue has exceeded its permitted data transmission quota. The wake time of the transmit queue can be scheduled based on a token accumulation rate for the transmit queue. The token accumulation rate can be increased if the transmit queue has other data to transmit after the data transmission. The token accumulation rate can be decreased if the transmit does not have other data to transmit.
MANAGEMENT OF PORT CONGESTION
Examples described herein relate to a switch comprising: circuitry to detect congestion at a target port and re-direct one or more packets directed to the target port to one or more other ports for re-circulation via one or more uncongested ports based on congestion at the target port. In some examples, the circuitry is to identify the target port in the re-directed one or more packets. In some examples, the circuitry is to transmit a congestion level indicator to the one or more other ports based on a congestion level of the target port.