48 results about "Packet schedule" patented technology

The present packet scheduling algorithm gives cellular network operators greater flexibility in adjusting the way resources are allocated among interactive best-effort data users. Best effort data users with different radio link qualities may have different amounts of data delivered to them using the same amount of radio resource. In the context of link adaptation, this characteristic complicates the fairness issue in cellular environments and has a profound impact on the overall system performance. As a result, the present packet scheduling algorithm is capable of allocating radio resource dynamically, not only based on channel conditions, but also to achieve different performance trade-offs among users with different link qualities. According to the algorithm, channel quality is determined for each user, channel efficiency is calculated and the channel efficiency value is used as the primary factor in weighting the delivery of packets to (or from) a given user. In a packet schedule weighting equation, a value of exponent may be varied from negative to positive to give good (or bad) users better service. However, performance of users with bad channel qualities degrades the performance of good channel users in a disproportionate manner. It is shown that it is frequently preferable to favor users with good channel qualities.

A packet schedule timestamp is provided. A schedule information packet includes a packet schedule timestamp that represents the relative timing of data packets in a particular bitstream of a multiplexed transport stream. The schedule information packet further provides information about the timing of packets within a bitstream or multiple bitstreams before actual packet arrivals. Look-ahead processing techniques are provided to improve the efficiency of compressed bitstream storage and delivery, such as program stream to transport stream conversion and statistical multiplexing. The packet schedule information can be inserted into the bitstream it describes for transmission or storage with it. Other features, such as timing reconstruction, are also provided. The packet schedule information can be used to reconstruct the timing of the transport packets to their original state.

This invention provides a system, method and apparatus for managing congestion on heterogeneous network communication links, the first communication link and second communication link being heterogeneous with respect to each other. The system, method and apparatus including a routing decision module, the routing decision module evaluating a queue of information packets scheduled for transmission across the first communication link to determine whether to generate a command signal to route a portion of information packets over the second communication link. The system, method and apparatus may further include a communication link threshold module, the communication link threshold module storing threshold limit values corresponding to a first communication link technology of the first communication link.

A packet schedule timestamp is provided. A schedule information packet includes a packet schedule timestamp that represents the relative timing of data packets in a particular bitstream of a multiplexed transport stream. The schedule information packet further provides information about the timing of packets within a bitstream or multiple bitstreams before actual packet arrivals. Look-ahead processing techniques are provided to improve the efficiency of compressed bitstream storage and delivery, such as program stream to transport stream conversion and statistical multiplexing. The packet schedule information can be inserted into the bitstream it describes for transmission or storage with it. Other features, such as timing reconstruction, are also provided. The packet schedule information can be used to reconstruct the timing of the transport packets to their original state.

A computer-implemented method for scheduling a packet for transmission in a wireless local area network can be used to account for hidden and / or exposed terminals. The method includes determining whether the packet is to be transmitted to a computing device through a wireless access point that is in conflict with at least one other computing device associated with a different access point. The method further includes determining whether there is a conflicting packet scheduled to be transmitted for any conflicting computing devices associated with a different access points and scheduling the packet for transmission based on any conflicting packets. The method yet further includes forwarding the packet to a wireless access point at the scheduled time.

A system, modem, receiver, transmitter and method for improving transmission performance. A coefficient may be calculated using a received signal. A process may be performed on at least one data packet scheduled for transmission based on the calculated coefficient. The process may improve transmission performance.

The invention includes an apparatus and method for switching packets through a switching fabric. The apparatus includes a plurality of input ports and output ports for receiving arriving packets and transmitting departing packets, a switching fabric for switching packets from the input ports to the output ports, and a plurality of schedulers controlling switching of packets through the switching fabric. The switching fabric includes a plurality of virtual output queues associated with a respective plurality of input-output port pairs. One of the schedulers is active during each of a plurality of timeslots. The one of the schedulers active during a current timeslot provides a packet schedule to the switching fabric for switching packets through the switching fabric during the current timeslot. The packet schedule is computed by the one of the schedulers active during the current timeslot using packet departure information for packets departing during previous timeslots during which the one of the schedulers was active and packet arrival information for packets arriving during previous timeslots during which the one of the schedulers was active.

Disclosed is a method and apparatus for compensating for a performance degradation of an application session in a plurality of application sessions associated with a network link. The performance of each application session in the plurality of application sessions associated with the network link is determined. The performance of each application session in the plurality is then compared. From this comparison, a lowest performance application session in the plurality of application sessions is identified. Corrective action is performed on packets scheduled to be transmitted over the lowest performance application session.

The present invention provides an energy-saving method and an energy-saving system for a communication base station. The energy-saving method includes the following steps: S3. Scheduling unscheduled data packets within the scheduling period, and preferentially scheduling the data packets to a certain location within the scheduling period. The nth symbol of the time slot, wherein, the duration of the scheduling cycle is longer than the duration of the time slot, and the n is a natural number and the value range is the number of symbols of the time slot; S5, the data packet scheduled into the nth symbol is given priority Exhaust the number of available resource blocks of the carrier bandwidth; if the data packet scheduled to the nth symbol has not exhausted the number of available resource blocks of the carrier bandwidth, the process enters step S501; if the scheduled to the nth If the data packets in the symbol can exhaust the available resource blocks of the carrier bandwidth, but the remaining data packets do not exhaust the available resource blocks of the carrier bandwidth, then the process enters step S503 or S505. The invention can reduce the energy consumption of the base station.