Scheduling a mix of best effort (BE) and delay QoS flows
    11.
    发明授权
    Scheduling a mix of best effort (BE) and delay QoS flows 有权
    调度尽力而为(BE)和延迟QoS流

    公开(公告)号:US08265019B2

    公开(公告)日:2012-09-11

    申请号:US12261319

    申请日:2008-10-30

    Abstract: Systems and methodologies are described that facilitate dynamically adjusting scheduling priorities in relation to a combination of delay sensitive flows with delay requirements and best effort flows. The systems and methodologies provide optimal and efficient techniques to enable real time adjustment and assignment of bandwidth for a combination of best effort flows and delay sensitive flows. In particular, the bandwidth allocation is adjusted for each data packet such that delay requirements are met and the remaining bandwidth can be assigned to best effort flows.

    Abstract translation: 描述了系统和方法,其有助于动态地调整与具有延迟要求和尽力而为流的延迟敏感流的组合相关的调度优先级。 这些系统和方法提供了最佳和有效的技术,以实现对最佳努力流和延迟敏感流的组合的实时调整和带宽分配。 特别地,针对每个数据分组调整带宽分配,使得满足延迟要求,并且可以将剩余带宽分配给尽力而为流。

    UNBUNDLING PACKETS RECEIVED IN WIRELESS COMMUNICATIONS
    13.
    发明申请
    UNBUNDLING PACKETS RECEIVED IN WIRELESS COMMUNICATIONS 失效
    在无线通信中接收到的分组

    公开(公告)号:US20100208654A1

    公开(公告)日:2010-08-19

    申请号:US12652665

    申请日:2010-01-05

    CPC classification number: H04L47/10 H04L47/14 H04L47/24 H04W28/065

    Abstract: Systems and methodologies are described that facilitate unbundling and processing partial packet data units (PDU). PDUs can be transmitted at a communication layer and can include partial PDUs of a disparate communication layer. Complete SDUs can be determined in the partial PDU and provided to an upper communication layer. In addition, however, the partial PDU can comprise a partial SDU. Upon receiving a remaining or additional portion of the partial PDU, a remaining or additional portion of the partial SDU can be combined with the partial SDU to create a complete SDU (or a larger portion thereof). Where a complete SDU is created, it can be provided to an upper communication layer. Alternatively, the partial PDU can be combined with the remaining portion of the partial PDU to generate a complete or larger PDU, from which the previously incomplete SDU can be retrieved and provided to an upper communication layer.

    Abstract translation: 描述了便于拆分和处理部分分组数据单元(PDU)的系统和方法。 PDU可以在通信层发送,并且可以包括不同通信层的部分PDU。 完整的SDU可以在部分PDU中确定并提供给上层通信层。 然而,此外,部分PDU可以包括部分SDU。 在接收到部分PDU的剩余部分或附加部分时,部分SDU的剩余部分或附加部分可以与部分SDU组合以创建完整的SDU(或其较大部分)。 在创建完整的SDU的地方,可以将其提供给上层通信层。 或者,部分PDU可以与部分PDU的剩余部分组合以生成完整或更大的PDU,从该PDU可以检索先前不完整的SDU并将其提供给上层通信层。

    TECHNIQUE FOR BUNDLE CREATION
    14.
    发明申请
    TECHNIQUE FOR BUNDLE CREATION 审中-公开
    组合创作技巧

    公开(公告)号:US20100135326A1

    公开(公告)日:2010-06-03

    申请号:US12620504

    申请日:2009-11-17

    CPC classification number: H04W28/065 H04L69/16 H04L69/161 H04L69/166 H04L69/32

    Abstract: Systems and methodologies are described that facilitate creating a packet bundle of Internet Protocol (IP) packets that can be utilized for Just-In-Time (JIT) processing and/or offline processing. In general, upon receipt or detection of incoming IP packets, two or more IP packets can be bundled or packaged together to create a packet bundle. Furthermore, the packet bundle can be created based upon a timer in which a maximum size of the packet bundle and a maximum number of IP packets within a packet bundle can be maintained.

    Abstract translation: 描述了有助于创建可用于即时(JIT)处理和/或离线处理的因特网协议(IP)分组的分组束的系统和方法。 一般来说,在接收或检测到IP分组时,可以将两个或更多个IP分组捆绑或打包在一起以创建分组束。 此外,可以基于可以保持分组束的最大大小和分组束内的最大数目的IP分组的定时器来创建分组束。

    METHODS AND APPARATUS FOR REDUCING OR AVOIDING USE OF NON-SHIFT BASED DIVISIONS IN A COMMUNICATIONS DEVICE
    15.
    发明申请
    METHODS AND APPARATUS FOR REDUCING OR AVOIDING USE OF NON-SHIFT BASED DIVISIONS IN A COMMUNICATIONS DEVICE 有权
    用于减少或避免在通信设备中使用非移位分区的方法和装置

    公开(公告)号:US20090248770A1

    公开(公告)日:2009-10-01

    申请号:US12412340

    申请日:2009-03-26

    Abstract: Methods and apparatus which reduce or completely eliminate non-shift based divisions as part of estimating transmitted symbols and/or generating slicing parameters corresponding to two symbol transmission streams in a wireless communication system are described. A linear least squares error estimation filtering module performs symbol estimations and/or slicing parameter generation while avoiding non-shift based division operations. The linear least squares estimation module generates intermediate parameters, and implements equations which facilitate symbol estimation utilizing shift based divisions while avoiding non-shift based divisions.

    Abstract translation: 描述了作为在无线通信系统中估计传输符号和/或生成与两个符号传输流相对应的限幅参数的一部分来减少或完全消除基于非移位的部分的方法和装置。 线性最小二乘误差估计滤波模块执行符号估计和/或限制参数生成,同时避免基于非移位的划分操作。 线性最小二乘估计模块生成中间参数,并且实现方便符号估计的等式,利用基于移位的划分,同时避免基于非移位的划分。

    SCHEDULING A MIX OF BEST EFFORT (BE) AND DELAY QOS FLOWS
    16.
    发明申请
    SCHEDULING A MIX OF BEST EFFORT (BE) AND DELAY QOS FLOWS 有权
    调整最佳效果(延迟)和延迟QOS流量的混合

    公开(公告)号:US20090116439A1

    公开(公告)日:2009-05-07

    申请号:US12261319

    申请日:2008-10-30

    Abstract: Systems and methodologies are described that facilitate dynamically adjusting scheduling priorities in relation to a combination of delay sensitive flows with delay requirements and best effort flows. The systems and methodologies provide optimal and efficient techniques to enable real time adjustment and assignment of bandwidth for a combination of best effort flows and delay sensitive flows. In particular, the bandwidth allocation is adjusted for each data packet such that delay requirements are met and the remaining bandwidth can be assigned to best effort flows.

    Abstract translation: 描述了系统和方法,其有助于动态地调整与具有延迟要求和尽力而为流的延迟敏感流的组合相关的调度优先级。 这些系统和方法提供了最佳和有效的技术,以实现对最佳努力流和延迟敏感流的组合的实时调整和带宽分配。 特别地,针对每个数据分组调整带宽分配,使得满足延迟要求,并且可以将剩余带宽分配给尽力而为流。

    PACKET BUNDLING AT THE PDCP LAYER
    18.
    发明申请
    PACKET BUNDLING AT THE PDCP LAYER 失效
    在PDCP层的包装

    公开(公告)号:US20100208632A1

    公开(公告)日:2010-08-19

    申请号:US12652636

    申请日:2010-01-05

    CPC classification number: H04W28/065 H04W80/02

    Abstract: Certain aspects of the present disclosure provide a technique for bundling the received service data units (SDU) in a first communication layer to generate a protocol data unit (PDU) to pass to a second communication layer. For example, one or more packet data convergence protocol (PDCP) SDUs may be concatenated to generate a PDCP PDU and be sent to a radio link control (RLC) layer in the transmitter side. Similarly, one or more PDCP SDUs may be extracted from a PDCP PDU in the receiver side.

    Abstract translation: 本公开的某些方面提供了用于在第一通信层中捆绑所接收的服务数据单元(SDU)以产生要传递到第二通信层的协议数据单元(PDU)的技术。 例如,一个或多个分组数据会聚协议(PDCP)SDU可以被级联以产生PDCP PDU并被发送到发射机侧的无线电链路控制(RLC)层。 类似地,可以从接收机侧的PDCP PDU提取一个或多个PDCP SDU。

    DIVISION OF THE SCHEDULING ALGORITHM INTO BACKGROUND AND FOREGROUND ALGORITHMS
    19.
    发明申请
    DIVISION OF THE SCHEDULING ALGORITHM INTO BACKGROUND AND FOREGROUND ALGORITHMS 有权
    将调度算法分解为背景和前缀算法

    公开(公告)号:US20090116438A1

    公开(公告)日:2009-05-07

    申请号:US12261297

    申请日:2008-10-30

    CPC classification number: H04L47/823 H04L47/70 H04W16/22 H04W72/04 H04W72/12

    Abstract: Systems and methodologies are described that facilitate dividing scheduling algorithms into background and foreground aspects capable of simultaneously servicing a multiplicity of disparate flows in wideband communications networks. The systems provided herein arbitrarily select prospective time horizons, generate optimal bandwidth allocation targets based on a plurality of flows observed by the system, and utilizes the optimal bandwidth targets to assign flows to users over the entirety of the prospective time horizon.

    Abstract translation: 描述了有助于将调度算法分解成能够同时服务于宽带通信网络中的多个不同流的背景和前景方面的系统和方法。 本文提供的系统任意选择预期时间间隔,基于系统观察到的多个流生成最优带宽分配目标,并利用最优带宽目标在整个预期时间范围内为用户分配流量。

    Scheduling QOS flows in broadband wireless communication systems
    20.
    发明授权
    Scheduling QOS flows in broadband wireless communication systems 有权
    在宽带无线通信系统中调度QOS流

    公开(公告)号:US08923157B2

    公开(公告)日:2014-12-30

    申请号:US12264051

    申请日:2008-11-03

    Abstract: Systems and methodologies are described that facilitate enhanced resource scheduling for a wireless communication system. As described herein, packets associated with a common flow that arrive within a predetermined time period following a leading packet associated with the flow can be grouped into respective packet bursts. Subsequently, system bandwidth, transmit power, and/or other communication resources can be scheduled based on an analysis of the respective packet bursts. As provided herein, by analyzing respective packet bursts in lieu of individual packets, computational and resource overhead required for resource scheduling can be significantly reduced. In one example described herein, a resource schedule is determined by selecting one or more flows to be assigned bandwidth from among a plurality of flows based on an analysis of packet bursts respectively associated with the flows. Sufficient bandwidth can subsequently be scheduled for the selected flows for transmission of the respectively associated packet bursts.

    Abstract translation: 描述了促进无线通信系统的增强的资源调度的系统和方法。 如本文所述,与在与流相关联的前导分组之后的预定时间段内到达的公共流相关联的分组可以被分组为相应的分组突发。 随后,可以基于相应分组突发的分析来调度系统带宽,发射功率和/或其他通信资源。 如本文提供的,通过分析各个分组突发来代替各个分组,可以显着地减少资源调度所需的计算和资源开销。 在本文描述的一个示例中,基于与流分别相关联的分组突发的分析,通过从多个流中选择要分配带宽的一个或多个流来确定资源调度。 随后可以为所选择的流调度足够的带宽以传输分别相关联的分组突发。

Patent Agency Ranking