H04L12/863

METHOD AND APPARATUS FOR REORDERING

Aspects of the disclosure provide a method for reordering. The method includes receiving, by a terminal device, a stream of data units from a wireless network. The data units have respective sequence numbers. Further, the method includes reordering at a protocol layer in a protocol stack, the data units for a next process according to the sequence numbers, determining a dependency relationship of a data unit to one or more missing data units that have sequence numbers prior to the data unit, and advancing, out of order of the sequence numbers, the data unit to the next process when the data unit is independent of the one or more missing data units.

SYSTEMS AND METHODS FOR REAL-TIME STRUCTURED OBJECT DATA AGGREGATION AND CONTROL LOOP FEEDBACK

Systems and methods for real-time message processing and control loop feedback are described. A stream processing system includes (i) a publish/subscribe and message queueing subsystem and (ii) an execution subsystem. A real-time stream of transactions is received at the publish/subscribe and message queueing subsystem. A job is created to aggregate data from the real-time stream of transactions with data from one or more other streams received at the publish/subscribe and messaging queueing subsystem. The job is executed at the execution subsystem, and the aggregated data resulting from the execution of the job is received at the publish/subscribe and message queueing subsystem. At least a portion of the aggregated data is provided as input to a control loop feedback process, which is executed to generate a result.

HIGH-SPEED TRACE FUNCTIONALITY IN AN ON-DEMAND SERVICES ENVIRONMENT
20170223089 · 2017-08-03 ·

Techniques and architectures to provide trace functionality. Trace record data is received from a plurality of client threads executed by one or more processors. The trace record data is stored in a plurality of chunks maintained in an in-use list. The in-use list has a chunk for individual use by the corresponding client threads. Chunks in the in-use list are moved to a completed queue when a chunk in the in-use list is substantially full. A chunk from a free list is placed in the in-use list to replace removed chunks. The chunks from the completed queue are stored in at least one memory device.

Rate adaptation across asynchronous frequency and phase clock domains

A rate adaptation system includes a barrel shift slot register and a rate adaptation register. The barrel shift slot register includes a plurality of slots with one of a valid read request or a dummy read request. A rate adaptation register is configured to sequentially cycle through the slots of the barrel shift register in response to a clock providing valid read requests to a FIFO buffer and to skip provision of valid read requests for clock cycles of the first clock associated with slots that include dummy read requests. The rate adaption register may also receive data blocks from the FIFO buffer and provide those data blocks to another FIFO buffer.

Apparatus and method for forwarding handover data in wireless communication system

A technique forwards handover data in a wireless communication system. A base station apparatus includes a first buffer for storing downlink data of a terminal, a handover agent for, when the terminal performs a handover, performing scheduling on data which is stored in the first buffer for at least one terminal including the terminal that performs the handover so that an interruption time of the at least one terminal is reduced in order to forward the data to a target base station, and a communication unit for transmitting the data according to a scheduling result of the handover agent.

Seamless switching for multihop hybrid networks

Seamless path switching is made possible in a multi-hop network based upon stream marker packets and additional path distinguishing operations. A device receiving out-of-order packets on the same ingress interface is capable of determining a proper order for the incoming packets having different upstream paths. Packets may be reordered at a relay device or a destination device based upon where a path update is initiated. Reordering packets from the various upstream paths may be dependent upon a type of service associated with the packet.

Communication device and packet scheduling method
09722942 · 2017-08-01 · ·

A communication device, includes: a plurality of queues each configured to accumulate a packet; a scheduler configured to provide a permissible readout amount to each of the plurality of queues in accordance with an order that is based on a priority of each queue; a read processor configured to read out the packet from the plurality of queues, the permissible readout amount being consumed according to amount of the packets read out; and an accumulation amount counter configured to count an accumulation amount of the packets accumulated in each of the plurality of queues, wherein the accumulation amount counter notifies the scheduler of a change in the accumulation amount, and wherein the scheduler adjusts the priority of, among the plurality of queues, the queue of which the accumulation amount has changed, in response to the notification from the accumulation amount counter.

Communication device and communication method
09722941 · 2017-08-01 · ·

A communication device includes: a plurality of output ports; a plurality of queues in which packets are stored so as to be sorted into groups of packets that are output from an identical output port in an identical time period, from among the plurality of output ports; a plurality of first selectors that respectively corresponds to the plurality of output ports, and each of which switches a queue from which packets that are output from the output port are read, between the plurality of queues each time the time period elapses; and a second selector that switches a first selector from which packets are output, between the plurality of first selectors, at time intervals in accordance with output rates of packets of the plurality of output ports.

PACKET COLORING IN WIRELESS COMMUNICATION SYSTEMS
20170279730 · 2017-09-28 ·

A buffer stores only packets in one or more high-priority traffic flows in a first portion. The size of the first portion is determined based on an estimated maximum volume of traffic in the at least one high-priority traffic flow. The buffer stores packets in either the one or more high-priority traffic flows or one or more low-priority traffic flows in a second portion. The buffer stores only packets in the one or more low-priority traffic flows in a third portion. A processor marks the packets in the first portion and the second portion with a high-priority color prior to transmission of the packets. The processor marks the packets in the third portion with a low-priority color prior to transmission of the packets.

Controlling notification based on power expense and social factors

In one embodiment, a computer system receives an indication of a power state of a client device, identifies messages to be sent to the client device, determines a transmit cost and a value of each of the messages, and stores at least one of the messages in a queue based on the transmit cost and value of the message.