公开(公告)号：ES2367156T3

公开(公告)日：2011-10-28

申请号：ES08846877

申请日：2008-11-05

Applicant: QUALCOMM INC

Inventor： MADAN RITESH ,  DAS ARNAB ,  RANGAN SUNDEEP ,  RAY SIDDHARTH

IPC: H04L12/56

Abstract: Un procedimiento (500, 600) que facilita la planificación de un flujo de máximo esfuerzo y un flujo con un requisito de retardo dentro de un entorno de comunicaciones inalámbricas, que comprende: recibir (502, 602) al menos uno entre un flujo sensible al retardo con un requisito de retardo y un flujo de máximo esfuerzo; adjudicar (504, 604) una primera parte de ancho de banda al flujo sensible al retardo; adjudicar una segunda parte de ancho de banda al flujo de máximo esfuerzo; readjudicar (506, 606) la primera parte de ancho de banda a un nivel reducido de ancho de banda y la segunda parte de ancho de banda a un nivel aumentado de ancho de banda si se satisface el requisito de retardo; readjudicar (508, 608) la primera parte del ancho de banda a un nivel aumentado de ancho de banda y la segunda parte del ancho de banda a un nivel reducido de ancho de banda si no se satisface el requisito de retardo; y mantener (510, 610) un nivel de ancho de banda para la primera parte del ancho de banda y la segunda parte del ancho de banda si el requisito de retardo es equivalente a la primera parte del ancho de banda.

公开(公告)号：UA96223C2

公开(公告)日：2011-10-10

申请号：UAA201006879

申请日：2008-11-05

Applicant: QUALCOMM INC

Inventor： MADAN RITESH ,  DAS ARNAB ,  RANGAN SUNDEEP ,  RAY SIDDHARTH

IPC: H04L12/56

Abstract: Описанысистемыи способы, которыесодействуютдинамическомукорректированиюприоритетовпланированияотносительнокомбинациипотоков, чувствительныхк задержке, стребованиямизадержки, ипотоков "лучшееизвозможного". Системыи способыобеспечиваютоптимальныеи эффективныеспособыдляобеспечениявозможностикорректированияв режимереальноговремении предоставленияполосыпропусканиядлякомбинациипотоков "лучшееизвозможного" изпотоков, чувствительныхк задержке. Вчастности, выделениеполосыпропусканиякорректируетсядлякаждогопакетаданныхтак, чтобытребованиязадержкибылиудовлетворены, аполосапропускания, котораяосталась, можетбытьпредоставленапотокам "лучшееизвозможного".

公开(公告)号：HK1148626A1

公开(公告)日：2011-09-09

申请号：HK11102801

申请日：2011-03-21

Applicant: QUALCOMM INC

Inventor： MADAN RITESH ,  DAS ARNAB ,  RANGAN SUNDEEP ,  RAY SIDDHARTH

IPC: H04W20090101

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.

公开(公告)号：WO2009061794A2

公开(公告)日：2009-05-14

申请号：PCT/US2008082448

申请日：2008-11-05

Applicant: QUALCOMM INC ,  DAS ARNAB ,  MADAN RITESH ,  RANGAN SUNDEEP ,  SHAKKOTTAI SANJAY ,  RAY SIDDHARTH

Inventor： DAS ARNAB ,  MADAN RITESH ,  RANGAN SUNDEEP ,  SHAKKOTTAI SANJAY ,  RAY SIDDHARTH

IPC: H04L12/56

CPC classification number: H04L47/10 ,  H04L47/14 ,  H04L47/2441 ,  H04L47/283 ,  H04L47/30 ,  H04L47/70 ,  H04L47/762 ,  H04L47/803 ,  H04L47/824 ,  H04W72/12 ,  H04W72/1205 ,  H04W72/1231

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

公开(公告)号：WO2009061775A2

公开(公告)日：2009-05-14

申请号：PCT/US2008082420

申请日：2008-11-05

Applicant: QUALCOMM INC ,  MADAN RITESH ,  DAS ARNAB ,  RANGAN SUNDEEP ,  RAY SIDDHARTH

Inventor： MADAN RITESH ,  DAS ARNAB ,  RANGAN SUNDEEP ,  RAY SIDDHARTH

IPC: H04W72/04

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: 描述了有助于将调度算法分成能够同时服务于宽带通信网络中的多个不同流的背景和前景方面的系统和方法。 本文提供的系统任意选择预期时间范围，基于系统所观察到的多个流来生成最佳带宽分配目标，并且利用最优带宽目标来在整个预期时间范围内向用户分配流。