利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

83 条记录 (耗时 0.015 秒)

    SCHEDULING BEST EFFORT FLOWS IN BROADBAND WIRELESS NETWORKS
    31.
    发明公开
    SCHEDULING BEST EFFORT FLOWS IN BROADBAND WIRELESS NETWORKS 有权
    EINTEILEN VON BEST-EFFORT-FLÜSSEN在DRAHTLOSEN BREITBANDNETZEN

    公开(公告)号：EP2208323A1

    公开(公告)日：2010-07-21

    申请号：EP08846876.4

    申请日：2008-11-05

    申请人： QUALCOMM Incorporated

    发明人： MADAN, Ritesh ,  DAS, Arnab ,  RANGAN, Sundeep ,  RAY, Siddharth

    IPC分类号： H04L12/56

    CPC分类号： H04L47/6265 ,  H04L47/50 ,  H04L47/566

    摘要： Systems and methodologies are described that facilitate scheduling best effort flows in broadband or wideband wireless communication networks. The systems can include devices and/or component that effectuate associating utility functions to multiple disparate flows based on traffic conditions extant in the wireless system, ascertaining the average rate at which the flow has been serviced in the past, and utilizing the utility function associated with the flow or the average rate that the flow has been serviced in the past to optimally schedule the flow.

    摘要翻译： 描述了有助于调度宽带或宽带无线通信网络中的努力流程的系统和方法。 该系统可以包括基于无线系统中存在的交通状况来实现将效用函数与多个不同的流相关联的设备和/或组件，确定在过去服务流程的平均速率，以及利用与 流量或流量在过去服务的平均速率，以最佳地安排流量。

    PROCEDE ET SYSTEME DE SELECTION DE PAQUETS EN FONCTION DU VOLUME EMIS PAR CONNEXION
    34.
    发明授权
    PROCEDE ET SYSTEME DE SELECTION DE PAQUETS EN FONCTION DU VOLUME EMIS PAR CONNEXION 有权
    方法和系统针对封装所发送体积PRO基于连接的分拣

    公开(公告)号：EP1733515B1

    公开(公告)日：2008-06-11

    申请号：EP04702723.0

    申请日：2004-01-16

    申请人： FRANCE TELECOM

    发明人： BROWN, Patrick ,  AYESTA, Urtzi ,  AVRATCHENKOV, Konstantin, Le Trianon, Bât. A ,  NYBERG, Eva

    IPC分类号： H04L12/56 ,  H04L29/08 ,  H04L29/06 ,  H04L12/26

    CPC分类号： H04L47/6265 ,  H04L47/50 ,  H04L47/522

    摘要： The invention relates to a method for selection by a downstream device (3a, 3b, 3c) of data packets of connections of a network transmitted by at least one upstream device (1) according to a predetermined threshold for quantities of data transmitted by said connections. The method consists in the following:- at the beginning of each connection-, initialization by each upstream device (1) of a counter for packets transmitted according to a set of predetermined initial values such that the difference between two initial consecutive values is greater than the predetermined threshold, then incrementation thereof by a predetermined value for each transmitted packet, defining the current counting value of the packet; reception by the downstream device (3a, 3b, 3c) of each IP packet of each connection, and comparison of the predetermined threshold with the difference between the current counting value and the initial value which is immediately lower than the set of initial predetermined values, enabling selection of packets corresponding to connections that have transmitted less data than the predetermined threshold, vis-a-vis packets corresponding to connections that have transmitted more data than the predetermined threshold.

    摘要翻译： 通过由至少一个上游装置雅丁mitted到预定的阈值对由所述连接mitted反式数据的量反式的网络的连接的数据分组的下游设备进行选择的方法，包括：对于每个连接，初始化由计数器的每个上游装置 为报文发送到gemäß一组预定的初始值的，与两个连续的初始值大于所述阈值之间的差值，然后通过对每个反包mitted预定值递增，电流 - 定义信息包的计数值; 接收由每个连接的每个IP数据包的下游设备，并且与所述当前计数值与初始值立即高于设定初始值的降低之间的差的阈值的比较，可实现的数据包的选择为连接thathave反mitted更少的数据 大于阈值，相比于连接的数据包thathave反式mitted更多。

    SCHEDULING BY A FRACTION OF REMAINING TIME TO BE ALLOCATED OVER REMAINING SERVICE INTERVAL
    35.
    发明公开
    SCHEDULING BY A FRACTION OF REMAINING TIME TO BE ALLOCATED OVER REMAINING SERVICE INTERVAL 审中-公开
    BY终止服务周期其余的方式分配分数休息时间

    公开(公告)号：EP1759497A1

    公开(公告)日：2007-03-07

    申请号：EP05751676.7

    申请日：2005-06-10

    申请人： Koninklijke Philips Electronics N.V.

    发明人： SOOMRO, Amjad ,  SCHMITT, Ruediger

    IPC分类号： H04L12/56 ,  H04L12/28 ,  H04Q7/38

    CPC分类号： H04L47/826 ,  H04L47/14 ,  H04L47/50 ,  H04L47/56 ,  H04L47/623 ,  H04L47/626 ,  H04L47/6265 ,  H04W72/1257

    摘要： A method of scheduling by a fraction of remaining time to be allocated over a remaining service interval, wherein with respect to a minimum of delay bound or a maximum service interval for a traffic stream, servicing first a particular stream 'i' with the highest ratio of the remaining channel time to be allocated in a service period SP to the remaining time is to be serviced first before the service period SP elapses. The sub-steps include (a) obtaining a factor U; for each particular traffic stream i of a plurality of traffic streams, wherein U, for each particular traffic stream I of a plurality of traffic streams, wherein (equation I), otherwise Ui =1, wherein Tiar is equal to remaining time to be allocated, and Tidr is equal to time before an initial Service period Sip including at least one of a Delay Bound and a Maximum Service Interval elapses; (b) selecting a particular Ui factor obtained in step (a) that has a maximum value of the plurality of streams; and (c) servicing the particular stream selected in step (b) by providing channel access time.

    摘要翻译： 在剩余服务间隔被分配通过的剩余时间的几分之一的调度的方法，相对于最小结合延迟或用于业务流的最大服务间隔的worin，第一服务特定流的“i”与最高比 的剩余的信道时间可以在服务期间S P 到的剩余时间分配要被服务期间S P 过去之前先得到服务。 子步骤包括：（a）获得的因子U; 对于每个特定的交通流i的业务流中的多个，worin U，为业务流的复数，worin（方程I）中的每个特定业务流I，否则Ú I = 1，worinŤ 我 AR 是等于剩余时间被分配，并且T 我 博士是等于时间之前到初始 服务期间S 我 p 包括受约束的延迟中的至少一个和最大服务间隔流逝; （B）选择特定û I 在步骤（a）得到确实因子具有数据流的多个最大值; 和（c）通过提供信道接入时间在服务步骤（b）中选择的特定流。

    SCHEDULING A SHARED RESOURCE AMONG SYNCHRONOUS AND ASYNCHRONOUS PACKET FLOWS
    39.
    发明公开
    SCHEDULING A SHARED RESOURCE AMONG SYNCHRONOUS AND ASYNCHRONOUS PACKET FLOWS 有权
    规划同步和异步PACKAGE河之间的分布式资源

    公开(公告)号：EP1495600A1

    公开(公告)日：2005-01-12

    申请号：EP02747651.4

    申请日：2002-07-01

    申请人： Telecom Italia S.p.A.

    发明人： LENZINI, Lucianoc/o Telecom Italia S.p.A. ,  MINGOZZI, Enzoc/o Telecom Italia Lab S.p.A. ,  SCARRONE, Enzoc/o Telecom Italia Lab S.p.A. ,  STEA, Giovannic/o Telecom Italia Lab S.p.A.

    IPC分类号： H04L12/64 ,  H04L12/56

    CPC分类号： H04L47/24 ,  H04L12/6418 ,  H04L47/50 ,  H04L47/521 ,  H04L47/522 ,  H04L47/562 ,  H04L47/621 ,  H04L47/6225 ,  H04L47/6265 ,  H04L2012/6421 ,  H04L2012/6451 ,  H04L2012/6456

    摘要： Each synchronous flow (i=1, 2, ..., Ns) is associated to a respective synchronous capacity value (Hi) that is related the period of time for which a synchronous flow can be serviced before the server moves on. This value can be selected either according to a local allocation criteria or according to a global allocation criteria. Each asynchronous flow (i=1, 2, ..., NA) s is associated to a respective first value indicating the delay to be made up so that the respective queue has the right to be serviced and to another value indicating the instant in which the server visited the respective queue in the previous cycle. Each queue associated to a synchronous flow (h) is then serviced for a period of time that is related to be aforesaid synchronous capacity value, while each queue associated to an asynchronous flow (i) is serviced only if the server's visit occurs before the expected moment. The server's visit (10) to the synchronous queues should preferably take place during two successive cycles in order to optimise the use of the resources available.

    摘要翻译： （I = 1，2 ...，N 取值）每个同步流被关联到一respectivement同步容量值（H I ）确实涉及的时间期间 该服务器移动之前同步流可以提供服务。 此值可以被选择要么gemäß到本地分配标准或gemäß到全局分配标准。 每个异步流（I = 1，2，...，N A ）■被关联到respectivement firstValue指示的延迟来弥补所以没有respectivement队列已经被服务的权利 是前述的同步容量值，（并anotherValue指示所述服务器访问相关联的同步流（小时respectivement队列的时刻），然后提供服务的一段时间没有涉及，而每个队列相关联，以在异步流 我）被响应，只有当预期的前一刻服务器的访问的发生。 服务器的访问（10）到所述同步队列shoulderstand优选发生在两个连续周期以优化使用可用资源。