METHOD AND SYSTEM FOR HANDLING QUEUES IN COMMUNICATION NETWORKS, CORRESPONDING COMPUTER PROGRAM PRODUCT
    1.
    发明申请
    METHOD AND SYSTEM FOR HANDLING QUEUES IN COMMUNICATION NETWORKS, CORRESPONDING COMPUTER PROGRAM PRODUCT 有权
    通信网络处理系统的方法与系统,相应的计算机程序产品

    公开(公告)号:US20130028220A1

    公开(公告)日:2013-01-31

    申请号:US13639373

    申请日:2010-04-06

    IPC分类号: H04W72/04

    摘要: In a communication network, a node receives from user equipment information on the length of a queue of information units to be transmitted to the node from the user equipment. The information, for possible use by the node in scheduling transmission of these information units from the user equipment, is in the form of quantized queue length information indicative of a lower bound and an upper bound for the queue length. Transmission of information units from the user equipment to the node is detected at the node, and an improved estimate of the queue length is produced by correcting the lower bound and the upper bound via subtraction of the number of the detected information units transmitted from the user equipment to the node.

    摘要翻译: 在通信网络中,节点从用户设备接收关于从用户设备发送到节点的信息单元的队列长度的信息。 节点可用于从用户设备调度这些信息单元的可能使用的信息是指示队列长度的下限和上限的量化的队列长度信息的形式。 在节点处检测到从用户设备到节点的信息单元的传输,并且通过减去从用户发送的检测到的信息单元的数量来校正下限和上限来产生队列长度的改进的估计 设备到节点。

    Method and system for handling queues in communication networks, corresponding computer program product
    2.
    发明授权
    Method and system for handling queues in communication networks, corresponding computer program product 有权
    通信网络中处理队列的方法和系统,相应的计算机程序产品

    公开(公告)号:US08767760B2

    公开(公告)日:2014-07-01

    申请号:US13639373

    申请日:2010-04-06

    IPC分类号: H04L12/28

    摘要: In a communication network, a node receives from user equipment information on the length of a queue of information units to be transmitted to the node from the user equipment. The information, for possible use by the node in scheduling transmission of these information units from the user equipment, is in the form of quantized queue length information indicative of a lower bound and an upper bound for the queue length. Transmission of information units from the user equipment to the node is detected at the node, and an improved estimate of the queue length is produced by correcting the lower bound and the upper bound via subtraction of the number of the detected information units transmitted from the user equipment to the node.

    摘要翻译: 在通信网络中,节点从用户设备接收关于从用户设备发送到节点的信息单元的队列长度的信息。 节点可用于从用户设备调度这些信息单元的可能使用的信息是指示队列长度的下限和上限的量化的队列长度信息的形式。 在节点处检测到从用户设备到节点的信息单元的传输,并且通过减去从用户发送的检测到的信息单元的数量来校正下限和上限来产生队列长度的改进的估计 设备到节点。

    LTE scheduling
    3.
    发明授权
    LTE scheduling 有权
    LTE调度

    公开(公告)号:US08964867B2

    公开(公告)日:2015-02-24

    申请号:US14001969

    申请日:2011-03-03

    摘要: A method executed in a wireless communication network including at least one base station associated to a corresponding area transmitting/receiving data to/from corresponding user terminals located within the area. The method generates a user-rate matrix for each base station. Each element of the user-rate matrix provides a corresponding score, in terms of achievable rate, to a user terminal or group of user terminals within the corresponding area when a transmission is made to/from the user terminal or group of user terminals, respectively, from/to the base station by employing a selected transmission mode. The method further processes the elements of the user-rate matrix to create a scheduling list sorting the elements by a decreasing score, and associating to each user terminal a corresponding selected transmission mode based on the scheduling list for the transmission/reception of data to/from the base station.

    摘要翻译: 一种在无线通信网络中执行的方法,该无线通信网络包括至少一个与相应区域相关联的基站,所述对应区域向位于该区域内的相应用户终端发送/接收数据。 该方法为每个基站生成一个用户速率矩阵。 用户速率矩阵的每个元素分别在向用户终端或用户终端组进行传输时向对应区域内的用户终端或用户终端组提供可实现的速率的对应分数 ,通过采用所选择的传输模式从/到基站。 该方法进一步处理用户速率矩阵的元素以创建通过递减分数排序元素的调度列表,并且基于用于/接收数据的调度列表将每个用户终端相应的所选传输模式关联到/ 从基站。

    LINK SCHEDULING ALGORITHM FOR OFDMA WIRELESS NETWORKS WITH RELAY NODES
    4.
    发明申请
    LINK SCHEDULING ALGORITHM FOR OFDMA WIRELESS NETWORKS WITH RELAY NODES 有权
    用于具有中继节点的OFDMA无线网络的链路调度算法

    公开(公告)号:US20130336200A1

    公开(公告)日:2013-12-19

    申请号:US14001882

    申请日:2011-03-03

    IPC分类号: H04W40/22

    摘要: A method scheduling link activations within a wireless communications network including at least one network cell including a base station providing radio coverage over the network cell and at least one relay node putting the base station into communication with a user equipment within the network cell over an access link. The relay node communicates with the base station over a backhaul link. The method includes estimating, for the relay node, an access link capacity according to status information indicative of a status of the user equipment associated with the relay node, estimating a backhaul link capacity of the relay node according to the status information, and scheduling, for the relay node, either a backhaul link activation or an access link activation such that one of the backhaul link and access link is activated, in a predetermined time interval, based on a comparison between the access capacity and backhaul capacity.

    摘要翻译: 一种在无线通信网络内调度链路激活的方法,包括至少一个网络小区,所述至少一个网络小区包括在所述网络小区上提供无线覆盖的基站以及至少一个中继节点,所述至少一个中继节点将所述基站与所述网络小区内的用户设备通过接入 链接。 中继节点通过回程链路与基站进行通信。 所述方法包括根据指示与所述中继节点相关联的所述用户设备的状态的状态信息,为所述中继节点估计接入链路容量,根据所述状态信息估计所述中继节点的回程链路容量,以及调度, 对于中继节点,基于访问容量和回程容量之间的比较,在预定的时间间隔中,回程链路激活或接入链路激活,使得回程链路和接入链路中的一个被激活。

    SCHEDULING ALGORITHM FOR WIRELESS COMMUNICATION NETWORKS
    5.
    发明申请
    SCHEDULING ALGORITHM FOR WIRELESS COMMUNICATION NETWORKS 有权
    无线通信网络的调度算法

    公开(公告)号:US20140355540A1

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

    申请号:US14368392

    申请日:2011-12-29

    IPC分类号: H04W72/12 H04L25/02

    摘要: A method scheduling resources allocation within a wireless communications network including at least one network cell including a central unit providing coverage over the network cell and managing at least one transmission frame for putting the central unit into communication with at least one user equipment. The method includes: retrieving input parameters including, for each user equipment, a channel quality parameter indicating a measured/estimated channel quality based on actual network cell conditions; applying a de-contextualization function to each channel quality parameter for obtaining a corresponding atomic channel quality parameter indicating channel quality de-contextualized from the actual network cell conditions; performing a scheduling algorithm providing a binary allocation matrix indicating each scheduled physical resource block, transmission frame and user equipment; and applying a contextualization function to the allocation matrix obtaining transport block size data usable by the scheduled transmission frame for transport blocks transmissions from or towards each scheduled user equipment.

    摘要翻译: 一种在无线通信网络内调度资源分配的方法,包括至少一个网络小区,所述至少一个网络小区包括提供所述网络小区覆盖的中央单元,并管理至少一个传输帧,以使所述中央单元与至少一个用户设备通信。 该方法包括:基于实际的网络小区状况,检索包括针对每个用户设备的指示测量/估计的信道质量的信道质量参数的输入参数; 对每个信道质量参数应用去背景化功能,以获得指示从实际网络小区状况去背景化的信道质量的对应的原子信道质量参数; 执行提供指示每个调度的物理资源块,传输帧和用户设备的二进制分配矩阵的调度算法; 以及将上下文化功能应用于所述分配矩阵,获得由所述调度传输帧可用的传输块大小数据,用于传输来自或向每个调度的用户设备传输块传输。

    LTE SCHEDULING
    6.
    发明申请
    LTE SCHEDULING 有权
    LTE调度

    公开(公告)号:US20130329826A1

    公开(公告)日:2013-12-12

    申请号:US14001969

    申请日:2011-03-03

    IPC分类号: H04B7/04

    摘要: A method executed in a wireless communication network including at least one base station associated to a corresponding area transmitting/receiving data to/from corresponding user terminals located within the area. The method generates a user-rate matrix for each base station. Each element of the user-rate matrix provides a corresponding score, in terms of achievable rate, to a user terminal or group of user terminals within the corresponding area when a transmission is made to/from the user terminal or group of user terminals, respectively, from/to the base station by employing a selected transmission mode. The method further processes the elements of the user-rate matrix to create a scheduling list sorting the elements by a decreasing score, and associating to each user terminal a corresponding selected transmission mode based on the scheduling list for the transmission/reception of data to/from the base station.

    摘要翻译: 一种在无线通信网络中执行的方法,该无线通信网络包括至少一个与相应区域相关联的基站,所述对应区域向位于该区域内的相应用户终端发送/接收数据。 该方法为每个基站生成用户速率矩阵。 用户速率矩阵的每个元素分别在向用户终端或用户终端组进行传输时向对应区域内的用户终端或用户终端组提供可实现的速率的对应分数 ,通过采用所选择的传输模式从/到基站。 该方法进一步处理用户速率矩阵的元素以创建通过递减分数对元素进行排序的调度列表,并且基于用于/接收数据的调度列表将每个用户终端相应的所选传输模式关联到/ 从基站。

    Link scheduling algorithm for OFDMA wireless networks with relay nodes
    7.
    发明授权
    Link scheduling algorithm for OFDMA wireless networks with relay nodes 有权
    具有中继节点的OFDMA无线网络的链路调度算法

    公开(公告)号:US09107150B2

    公开(公告)日:2015-08-11

    申请号:US14001882

    申请日:2011-03-03

    摘要: A method scheduling link activations within a wireless communications network including at least one network cell including a base station providing radio coverage over the network cell and at least one relay node putting the base station into communication with a user equipment within the network cell over an access link. The relay node communicates with the base station over a backhaul link. The method includes estimating, for the relay node, an access link capacity according to status information indicative of a status of the user equipment associated with the relay node, estimating a backhaul link capacity of the relay node according to the status information, and scheduling, for the relay node, either a backhaul link activation or an access link activation such that one of the backhaul link and access link is activated, in a predetermined time interval, based on a comparison between the access capacity and backhaul capacity.

    摘要翻译: 一种在无线通信网络内调度链路激活的方法,包括至少一个网络小区,所述至少一个网络小区包括在所述网络小区上提供无线覆盖的基站以及至少一个中继节点,所述至少一个中继节点将所述基站与所述网络小区内的用户设备通过接入 链接。 中继节点通过回程链路与基站进行通信。 所述方法包括根据指示与所述中继节点相关联的所述用户设备的状态的状态信息,为所述中继节点估计接入链路容量,根据所述状态信息估计所述中继节点的回程链路容量,以及调度, 对于中继节点,基于访问容量和回程容量之间的比较,在预定的时间间隔中,回程链路激活或接入链路激活,使得回程链路和接入链路中的一个被激活。

    Method of scheduling transmission in a communication network, corresponding communication node and computer program product
    8.
    发明授权
    Method of scheduling transmission in a communication network, corresponding communication node and computer program product 有权
    在通信网络中调度传输的方法,对应的通信节点和计算机程序产品

    公开(公告)号:US09036624B2

    公开(公告)日:2015-05-19

    申请号:US13518778

    申请日:2009-12-24

    摘要: Data streams are transmitted from a node towards a receiver in a communication network in the form of data packets for playout via a reproduction buffer at the receiver. The data packets are arranged in a scheduling queue and dropped from the scheduling queue if their sojourn time in the queue exceeds a given drop deadline. The reproduction buffer is emulated at the node in order to determine respective playout values for the data packets which are indicative of expected playout instants for the data packets by the reproduction buffer at the receiver. The drop deadlines are assigned to the data packets as a function of the respective playout values determined via the reproduction buffer as emulated at the node.

    摘要翻译: 数据流以数据包的形式从通信网络中的节点向接收器发送,以便经由接收机处的再现缓冲器进行播放。 数据包排列在调度队列中,如果队列中的逗留时间超过给定的丢弃时间,则从调度队列中删除。 在节点处仿真再现缓冲器,以便确定由接收机上的再现缓冲器指示数据分组的预期播出时刻的数据分组的相应播出值。 根据在节点处仿真的经由再现缓冲器确定的相应播放值的函数,将丢弃最后期限分配给数据分组。

    METHOD OF SCHEDULING TRANSMISSION IN A COMMUNICATION NETWORK, CORRESPONDING COMMUNICATION NODE AND COMPUTER PROGRAM PRODUCT
    9.
    发明申请
    METHOD OF SCHEDULING TRANSMISSION IN A COMMUNICATION NETWORK, CORRESPONDING COMMUNICATION NODE AND COMPUTER PROGRAM PRODUCT 有权
    在通信网络中调度传输的方法,相应的通信节点和计算机程序产品

    公开(公告)号:US20120250678A1

    公开(公告)日:2012-10-04

    申请号:US13518778

    申请日:2009-12-24

    IPC分类号: H04L12/66

    摘要: Data streams are transmitted from a node towards a receiver in a communication network in the form of data packets for playout via a reproduction buffer at the receiver. The data packets are arranged in a scheduling queue and dropped from the scheduling queue if their sojourn time in the queue exceeds a given drop deadline. The reproduction buffer is emulated at the node in order to determine respective playout values for the data packets which are indicative of expected playout instants for the data packets by the reproduction buffer at the receiver. The drop deadlines are assigned to the data packets as a function of the respective playout values determined via the reproduction buffer as emulated at the node.

    摘要翻译: 数据流以数据包的形式从通信网络中的节点向接收器发送,以便经由接收机处的再现缓冲器进行播放。 数据包排列在调度队列中,如果队列中的逗留时间超过给定的丢弃时间,则从调度队列中删除。 在节点处仿真再现缓冲器,以便确定由接收机上的再现缓冲器指示数据分组的预期播出时刻的数据分组的相应播出值。 根据在节点处仿真的经由再现缓冲器确定的相应播放值的函数,将丢弃最后期限分配给数据分组。