知搜-全球专利检索

  1. Login
  2. Sign Up

Search Results

10071 records (took 0.067 seconds)

    LONGEST QUEUE IDENTIFICATION
    95.
    发明申请
    LONGEST QUEUE IDENTIFICATION 审中-公开

    公开(公告)号：US20170295113A1

    公开(公告)日：2017-10-12

    申请号：US15091890

    申请日：2016-04-06

    Applicant: Andrea Francini ,  Wolfram Lautenschlaeger

    Inventor： Andrea Francini ,  Wolfram Lautenschlaeger

    IPC: H04L12/861 ,  H04L12/863

    CPC classification number: H04L49/90 ,  H04L47/50 ,  H04L47/622 ,  H04L47/6255

    Abstract: The present disclosure generally discloses a longest queue identification mechanism. The longest queue identification mechanism, for a set of queues of a buffer, may be configured to identify the longest queue of the set of queues and determine a length of the longest queue of the set of queues. The longest queue identification mechanism may be configured to identify the longest queue of the set of queues using only two variables including a longest queue identifier (LQID) variable for the identity of the longest queue and a longest queue length (LQL) variable for the length of the longest queue. It is noted that the identity of the longest queue of the set of queues may be an estimate of the identity of the longest queue and, similarly, that the length of the longest queue of the set of queues may be an estimate of the length of the longest queue.

    Sparsification of pairwise cost information
    97.
    发明授权
    Sparsification of pairwise cost information 有权

    公开(公告)号：US09667499B2

    公开(公告)日：2017-05-30

    申请号：US14484688

    申请日：2014-09-12

    Applicant: Yihao Zhang ,  Gordon Wilfong ,  Michael Scharf

    Inventor： Yihao Zhang ,  Gordon Wilfong ,  Michael Scharf

    IPC: G06F15/173 ,  H04L12/24

    CPC classification number: H04L41/12 ,  H04L41/0813 ,  H04L41/0893 ,  H04L41/147

    Abstract: A capability for sparsifying a representation of pairwise cost information is presented herein. The capability for sparsifying a representation of pairwise cost information may be used to sparsify a representation of pairwise cost information for a set of nodes. The sparsification of a representation of pairwise cost information for a set of nodes may provide thereby a sparsified representation of the pairwise cost information for the set of nodes. The sparsification of the representation of pairwise cost information for the set of nodes may be based on clustering of the nodes of the set of nodes into clusters. The sparsification of the representation of pairwise cost information for the set of nodes may be based on calculation of intra-cluster costs and inter-cluster costs, where the intra-cluster costs and inter-cluster costs are calculated based on the pairwise cost information of the representation of the pairwise cost information for the set of nodes.

    Opportunistic information forwarding using wireless terminals in the internet-of-things
    98.
    发明授权
    Opportunistic information forwarding using wireless terminals in the internet-of-things 有权
    在互联网上使用无线终端的机会信息转发

    公开(公告)号：US09565633B2

    公开(公告)日：2017-02-07

    申请号：US14323146

    申请日：2014-07-03

    Applicant: Dragan Samardzija ,  Howard Huang ,  Vijay Venkateswaran ,  Chih-Kuang Lin ,  Irwin Kennedy ,  Richard Abbot

    Inventor： Dragan Samardzija ,  Howard Huang ,  Vijay Venkateswaran ,  Chih-Kuang Lin ,  Irwin Kennedy ,  Richard Abbot

    IPC: H04W52/02 ,  H04L29/08 ,  H04W4/00 ,  H04W56/00 ,  H04W84/18

    CPC classification number: H04W52/0229 ,  H04L67/12 ,  H04W4/80 ,  H04W56/001 ,  H04W84/18 ,  Y02D70/1242 ,  Y02D70/1262 ,  Y02D70/142 ,  Y02D70/144 ,  Y02D70/162 ,  Y02D70/164

    Abstract: A capability for opportunistic forwarding of information using a wireless terminal is presented. An energy limited node includes a wake-up circuit configured to detect a wake-up signal from a wireless terminal where the wake-up signal includes a modulated waveform signal, and a communication module configured to switch, based on a control signal generated by the wake-up circuit, from a sleep mode in which the communication module is not operable to communicate with the wireless terminal to an active mode in which the communication module is operable to communicate with the wireless terminal. A wireless terminal includes a first wireless communication interface configured for communication with a device using a wireless communication protocol, a second wireless communication interface configured for wireless communication with a wireless access node of a wireless network, and a processor configured to support opportunistic forwarding of information between the device and the wireless access node of the wireless network.

    Abstract translation: 介绍了使用无线终端机会转发信息的能力。 能量限制节点包括被配置为检测来自无线终端的唤醒信号的唤醒电路，其中唤醒信号包括调制波形信号，以及通信模块，被配置为基于由 唤醒电路，其中通信模块不可操作以与无线终端通信的休眠模式到通信模块可操作以与无线终端通信的活动模式。 无线终端包括被配置为与使用无线通信协议的设备进行通信的第一无线通信接口，被配置用于与无线网络的无线接入节点进行无线通信的第二无线通信接口，以及被配置为支持信息的机会转发的处理器 在无线网络的设备和无线接入节点之间。

    System and method for mitigating network congestion using fast congestion detection in a wireless radio access network (RAN)
    99.
    发明授权
    System and method for mitigating network congestion using fast congestion detection in a wireless radio access network (RAN) 有权
    在无线无线接入网（RAN）中使用快速拥塞检测来减轻网络拥塞的系统和方法

    公开(公告)号：US09544812B2

    公开(公告)日：2017-01-10

    申请号：US14610565

    申请日：2015-01-30

    Applicant: Edward Grinshpun ,  Qi Liao ,  David Faucher ,  Zulfiquar Sayeed ,  Sameer Sharma

    Inventor： Edward Grinshpun ,  Qi Liao ,  David Faucher ,  Zulfiquar Sayeed ,  Sameer Sharma

    IPC: H04W4/00 ,  H04W28/02

    CPC classification number: H04W28/0289 ,  H04L43/0817 ,  H04L47/24 ,  H04W28/02 ,  H04W28/0231 ,  H04W28/0252 ,  H04W28/0278 ,  H04W28/0284

    Abstract: Fast congestion detection is implemented in a wireless radio access network (RAN) to mitigate congestion by classifying bearers into bearer types using bearer metrics and monitoring bearers for type specific anomalies to obtain anomaly data. Congestion is detected based on the anomaly data to obtain congestion information that is exported to a network node to mitigate network congestion. Bearer metrics include radio link protocol (RLC) buffer size information, physical resource block (PRB) utilization information, and transmission burst interval information. The transmission burst interval information includes information on time intervals between successive time periods when a RLC buffer is empty. The bearers are classified into Type I and Type II bearers. Type I bearers are bearers displaying bursty data transfer behavior, and Type II bearers are bearers displaying a continuous stream of data transfer behavior.

    Abstract translation: 在无线无线电接入网络（RAN）中实现快速拥塞检测，以通过使用承载度量将承载类型分类为承载类型来减轻拥塞，并且针对类型特定异常来监视承载以获得异常数据。 基于异常数据检测到拥塞，以获得导出到网络节点的拥塞信息，以减轻网络拥塞。 承载度量包括无线链路协议（RLC）缓冲器大小信息，物理资源块（PRB）利用信息和传输突发间隔信息。 发送突发间隔信息包括关于RLC缓冲器为空的连续时间段之间的时间间隔的信息。 承运人分为第一类和第二类承运人。 类型I承载是显示突发数据传输行为的承载，类型II承载是显示连续的数据传输行为流的承载。

    Method And Apparatus For Provisioning Resources Using Clustering
    100.
    发明申请
    Method And Apparatus For Provisioning Resources Using Clustering 有权
    使用聚类提供资源的方法和装置

    公开(公告)号：US20160294722A1

    公开(公告)日：2016-10-06

    申请号：US14674812

    申请日：2015-03-31

    Applicant: Alcatel-Lucent USA Inc. ,  ALCATEL LUCENT

    Inventor： Randeep S Bhatia ,  Bhawna Gupta ,  Elisha Rosensweig

    IPC: H04L12/911 ,  H04L12/24

    CPC classification number: H04L47/70 ,  H04L41/5012 ,  H04L41/5096 ,  H04L43/0876 ,  H04L43/10 ,  H04L43/16

    Abstract: Various embodiments provide a method and apparatus for allocating resources to applications (e.g., application processes) using pre-provisioned resource configurations (e.g., VMs or containers) that are based on clustered historical resource usage data. In particular, the set of pre-provisioned resources required to support elasticity in a set of applications is reduced by determining a subset of pre-provisioned resource configurations that are able to be reused across multiple applications. A pre-provisioned resource configuration being based on a determined dominant center for the resource cluster associated with the pre-provisioned resource configuration.

    Abstract translation: 各种实施例提供了使用基于聚集的历史资源使用数据的预先提供的资源配置（例如，VM或容器）向应用（例如，应用程序进程）分配资源的方法和装置。 特别地，通过确定能够跨多个应用重复使用的预先配置的资源配置的子集来减少在一组应用程序中支持弹性所需的一组预先提供的资源。 预先配置的资源配置基于与预先配置的资源配置相关联的资源集群的确定的主要中心。

Patent Agency Ranking