Patent classifications
H04L12/875
Traffic control apparatus, buffering control method and packet relay apparatus
A traffic control apparatus at which packets of a plurality of packet flows arrive includes a plurality of buffers corresponding to a plurality of times, a selector configured to read a packet accumulated in one of the plurality of buffers corresponding to a current time, and a scheduler configured to decide one of the plurality of buffers to accumulate a packet of each of the plurality of packet flows. The scheduler attempts, for each of the plurality of packet flows, accumulation of packets which are reached during a predetermined period under a condition that, as quantity of packets accumulated in the plurality of buffers is larger, the number of buffers into which packets can be accumulated becomes smaller after the predetermined period.
Input devices in high latency networks
A first computing device is provided for interacting with an input device across a network The computing device includes processors configured to run an executable, acquire device information, determine network latency, determine a data buffer queue size, provide the data buffer queue size to a second computing device, request device data from the second computing device, acquire data from the second computing device, and provide that data to the executable. A second computing device is included for providing sending device data across a network. The computing device includes processors configured to acquire polling information from an input device, provide that information to a first computing device, acquire a data buffer queue size from the second computing device, create a data buffer queue, read data from the input device, store the data, acquire requests for data from the first computing device, and provide stored data to the first computing device.
Indicating delays added to packets due to retransmission
System and method indicating delays added to packets due to retransmission events. The method includes the steps of receiving multiple packet streams and multiplexing them into a first multiplexed packet stream; storing in memory the first multiplexed packet stream together with time indications; receiving a retransmission request and selecting data for retransmission; multiplexing the first multiplexed packet stream and the data for retransmission into a second multiplexed packet stream; utilizing the time indications for calculating delays that were added to packets of the second multiplexed packet stream as a result of fulfilling the retransmission request; adding the calculated delays to at least some of the packets of the second multiplexed packet stream; and transmitting the second multiplexed packet stream.
Monitoring packet residence time and correlating packet residence time to input sources
An output circuit, included in a device, may determine counter information associated with a packet provided via an output queue managed by the output circuit. The output circuit may determine that a latency event, associated with the output queue, has occurred. The output circuit may provide the counter information and time of day information associated with the counter information. The output circuit may provide a latency event notification associated with the output queue. An input circuit, included in the device, may receive the latency event notification associated with the output queue. The input circuit may determine performance information associated with an input queue. The input queue may correspond to the output queue and may be managed by the input circuit. The input circuit may provide the performance information associated with the input queue and time of day information associated with the performance information.
METHOD AND APPARATUS FOR ACTIVE QUEUE MANAGEMENT FOR WIRELESS NETWORKS USING SHARED WIRELESS CHANNEL
A method of managing a queue and a communication node that may maintain state information for each flow of a corresponding node, may estimate a time of arrival of each packet of each flow based on flow information that is received from other communication nodes within a collision range and that includes the number of flows and the state information, and may determine dropping and queue scheduling associated with the packets based on the estimated time of arrival (ETA).
TRAFFIC SHAPER WITH POLICER(S) AND ADAPTIVE TIMERS
Apparatuses, methods and storage medium associated with a traffic shaper having one or more policers and adaptive timers are disclosed herein. The traffic shaper is to shape packet traffics of a plurality of regulated traffic generating entities. The policer is to process incoming packets of the regulated traffic generating entities and determine whether to forward or temporarily hold the packets. A buffer is to store the packets to be temporarily held; and the timer task manager is to process timer tasks of the regulated traffic generating entities and determine whether to discard the timer tasks or forward to regulate release of held packets of the regulated traffic generating entities. Other embodiments may be disclosed or claimed.
Time Stamp Conversion in an Interface Bridge
A technology is described for converting a time tag in a message. The message can be received from a military standard-1760 (MIL-STD-1760) bus controller. The message can include a time tag in accordance with a first time stamping technique. The time tag in the message can be detected as being in accordance with the first time stamping technique based on contents of the message. A recomputed time tag for the message can be determined in accordance with a second time stamping technique. The message with the recomputed time tag can be transmitted to a Universal Armament Interface (UAI) remote terminal
Techniques for enabling packet prioritization without starvation in communications networks
A method is provided in one example embodiment and includes determining whether a packet received at a network node in a communications network is a high priority packet; determining whether a low priority queue of the network node has been deemed to be starving; if the packet is a high priority packet and the low priority queue has not been deemed to be starving, adding the packet to a high priority queue, wherein the high priority queue has strict priority over the low priority queue; and if the packet is a high priority packet and the low priority queue has been deemed to be starving, adding the packet to the low priority queue.
Method and system for storing packets for a bonded communication links
Method and system for storing packets received from a bonded communication links according to latency of the communication link that has the largest latency among all communication links of the bonded communication links. Embodiments of present inventions can be applied to bonded communication links, including wireless connection, Ethernet connection, Internet Protocol connection, asynchronous transfer mode, virtual private network, WiFi, high-speed downlink packet access, GPRS, LTE, and X.25. The present invention presents methods comprising the steps of estimating storage size of a queue, wherein the queue is for storage the one or more packets received from the bonded communication links. The storage size is based on one or more factors, including largest latency, bandwidth of each of the plurality of communication links, and allowed time duration of packet storage
Power-Aware Network Communication
This application describes client devices that control network transmission based on a power state. The client device determines a power state of the computing device and a priority of an application executing on the computing device. The client device determines whether to permit the application to communicate with a remote network accessible device via the network communication hardware based at least on the priority of the application and the power state of the computing device. Also described is a power state service that selects a client device to be provided with a notification based on power states of the client devices.