H04L47/58

Communication apparatus having delay guarantee shaping function

An object is to provide a communication apparatus, a communication method, and a program capable of avoiding an increase in network load when input traffic continues to be large and a communication delay when input traffic is very small. A communication apparatus according to the present invention prepares three token buckets and can transfer, discard, or hold a packet in accordance with the amount of tokens in each token bucket. This enables the communication apparatus to operate so as not to exceed a set maximum bandwidth when large traffic is received for the delay guarantee shaping. Further, When the maximum bandwidth is exceeded, the communication apparatus can select whether to discard a packet to prioritize a delay guarantee or to hold a packet to prioritize no loss of packets. Furthermore, the communication apparatus can immediately transmit a packet without increasing a communication delay when input traffic is very small.

BACKPRESSURE SIGNALING FOR WIRELESS COMMUNICATIONS

Methods, systems, and devices for wireless communications are described. In some wireless systems, a base station centralized unit (CU) may communicate with a user equipment (UE) through a multi-hop backhaul architecture. This multi-hop backhaul connection may include a donor base station and any number of relay base stations connected via backhaul links. In some cases, the relay base stations or the UE may experience data congestion in a logical channel-specific buffer. The relay base stations or UE may implement backpressure signaling (e.g., in the medium access control (MAC) layer) to mitigate the congestion. A wireless device operating as a mobile termination (MT) endpoint may transmit a backpressure report message to a wireless device operating as a base station distributed unit (DU) endpoint for the logical channel. The base station DU may adjust a scheduling rate for data unit transmissions over the indicated logical channel based on the backpressure report.

RELEASE-TIME BASED PRIORITIZATION OF ON-BOARD CONTENT
20240163218 · 2024-05-16 ·

Approaches are described for release-time-driven (RTD) prioritization of on-board content scheduling and delivery to in-transit transport craft via communications systems. In context of a constrained network, content is scheduled to be delivered to those in-transit on-board media servers in a manner driven by respective release times and other prioritization factors associated with the updated content. Each content is associated with a RTD priority profile that can define a release time, a release priority, and a profile plot for the content. The RTD priority profiles can be used to compute priority surfaces that define priority scores over a multidimensional space for a particular time. A subset of the content can be selected for delivery based on the priority surfaces, and can be scheduled for delivery according to network capacity determinations.

Distributing and rate limiting packets among multiple paths in a single stage switching topology to a reordering node

One embodiment includes multiple distribution nodes sending packets of different ordered sets of packets among multiple packet switching devices arranged in a single stage topology to reach a reordering node. The reordering node receives these packets sent over the different paths and stores them in reordering storage, such as, but not limited to, in queues for each distribution node and packet switching device combination. The reordering node sends packets stored in the reordering storage from the reordering node in original orderings. In response to determining that an aggregation quantum of packets received from the multiple distribution nodes via a particular packet switching device and stored in the reordering storage is outside a range or value, packets being communicated via the particular packet switching device to the reordering node are rate limited.

SYSTEMS AND METHODS FOR PREDICTIVE SCHEDULING AND RATE LIMITING
20190215277 · 2019-07-11 ·

Systems and methods are disclosed for enhancing network performance by using modified traffic control (e.g., rate limiting and/or scheduling) techniques to control a rate of packet (e.g., data packet) traffic to a queue scheduled by a Quality of Service (QoS) engine for reading and transmission. In particular, the QoS engine schedules packets using estimated packet sizes before an actual packet size is known by a direct memory access (DMA) engine coupled to the QoS engine. The QoS engine subsequently compensates for discrepancies between the estimated packet sizes and actual packet sizes (e.g., when the DMA engine has received an actual packet size of the scheduled packet). Using these modified traffic control techniques that leverage estimating packet sizes may reduce and/or eliminate latency introduced due to determining actual packet sizes.

SCALABLE TRAFFIC MANAGEMENT FOR MULTIPLE LEVELS OF QUALITY OF SERVICE

Packets are differentiated based on their traffic class. A traffic class is allocated bandwidth for transmission. One or more core or thread can be allocated to process packets of a traffic class for transmission based on allocated bandwidth for that traffic class. If multiple traffic classes are allocated bandwidth, and a traffic class underutilizes allocated bandwidth or a traffic class is allocated insufficient bandwidth, then allocated bandwidth can be adjusted for a future transmission time slot. For example, a higher priority traffic class with excess bandwidth can share the excess bandwidth with a next highest priority traffic class for use to allocate packets for transmission for the same time slot. In the same or another example, bandwidth allocated to a traffic class depends on an extent of insufficient allocation or underutilization of allocated bandwidth such that a traffic class with insufficient allocated bandwidth in one or more prior time slot can be provided more bandwidth in a current time slot and a traffic class with underutilization of allocated bandwidth can be provided with less allocated bandwidth for a current time slot.

PACKET PROCESSING TECHNIQUE FOR A COMMUNICATION NETWORK

A system comprising one or more network elements and configured to process at least first and second packet flows. The system comprises a first packet gate selectively switchable between an open state for packet transmission and a closed state and an associated first packet queue. The first packet gate and the first packet queue are configured to handle first packet flow packets. The system further comprises a second packet queue configured to handle second packet flow packets. Moreover, the system comprises at least one processor configured to control switching of the first packet gate between the open state and the closed state based on the occurrence of a first event associated with the second packet queue to trigger transmission of the first packet flow packets in a relative transmission order among the first packet flow packets and the second packet flow packets.

SYSTEMS AND METHODS FOR PROVIDING LOCKLESS BIMODAL QUEUES FOR SELECTIVE PACKET CAPTURE

In a network system, an application receiving packets can consume one or more packets in two or more stages, where the second and the later stages can selectively consume some but not all of the packets consumed by the preceding stage. Packets are transferred between two consecutive stages, called producer and consumer, via a fixed-size storage. Both the producer and the consumer can access the storage without locking it and, to facilitate selective consumption of the packets by the consumer, the consumer can transition between awake and sleep modes, where the packets are consumed in the awake mode only. The producer may also switch between awake and sleep modes. Lockless access is made possible by controlling the operation of the storage by the producer and the consumer both according to the mode of the consumer, which is communicated via a shared memory location.

Polling parameter adjustment

An approach, executed by a computer, includes receiving at least an initial polling quantity and an initial polling frequency and polling an endpoint application using the initial polling quantity and the initial polling frequency. The approach includes determining a first number of events not consumed in a queue of a listening application and a second number of events generated at the endpoint application and remaining in a queue at the endpoint application and comparing the number of events in each queue. The approach includes adjusting at least one of the initial polling quantity and the initial polling frequency based, at least in part, on the comparison of the first number of events not consumed in the queue of the listening application and the second number of events generated at the endpoint application and remaining in the queue at the endpoint application.

VIRTUALIZING DCB SETTINGS FOR VIRTUAL NETWORK ADAPTERS
20190089640 · 2019-03-21 ·

Methods and devices for data packet transmission at a host computer device hosting a virtual machine may include receiving, at a virtual administrator component operating on the virtual machine, virtual enhanced transmission selection (ETS) settings information from the host computer device. The methods and devices may include creating at least one priority rule for tagging one or more data packets from an application executing on the virtual machine with a virtual priority value based on the virtual ETS settings information. The methods and devices may include tagging the one or more data packets with the virtual priority value based on the at least one priority rule. The methods and devices may include transmitting the one or more data packets with the virtual priority value to the host computer device.