会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 63. 发明申请
    • Content Delivery in Wireless Wide Area Networks
    • 无线广域网内容交付
    • US20160205016A1
    • 2016-07-14
    • US15075975
    • 2016-03-21
    • Steve J. Shattil
    • Steve J. Shattil
    • H04L12/721H04W72/04H04L29/06
    • H04L67/101H04L41/12H04L41/147H04L45/70H04L67/1014H04L67/1021H04L67/327H04L67/42H04W40/02H04W40/12H04W40/20H04W72/0453H04W84/18Y02D70/1224Y02D70/1242Y02D70/1262Y02D70/1264Y02D70/142Y02D70/144Y02D70/164Y02D70/22Y02D70/30
    • A set of edge servers in a content delivery network is selected to serve a set of users. Selection comprises constructing a trellis having a number of states at least equal to a number of edge servers in the edge-server set, wherein each state comprises a plurality of nodes, each node corresponding to one of a plurality of candidate edge servers. A fitness function is calculated based on network performance improvement and cost corresponding to each candidate edge server. A trellis-exploration algorithm is used to select the edge-server set by identifying a path through the trellis having optimal path metrics derived from the fitness function. The algorithm provides interconnects between each node of a first state to each of a plurality of nodes in a next state, and for each node in a state, a path is selected that corresponds to a best path metric that connects to a node in a previous state, wherein the best path metric comprises the fitness function. Data signals are transmitted to each edge server in the edge-server set for storage, which are then delivered to requesting client devices.
    • 选择内容传送网络中的一组边缘服务器来服务于一组用户。 选择包括构建具有至少等于边缘服务器集合中的边缘服务器的数量的多个状态的网格,其中每个状态包括多个节点,每个节点对应于多个候选边缘服务器之一。 基于每个候选边缘服务器的网络性能改进和成本计算适应度函数。 网格搜索算法用于通过识别通过具有从适应度函数导出的最优路径度量的网格的路径来选择边缘服务器集合。 该算法在第一状态的每个节点与下一状态中的多个节点中的每个节点之间提供互连,并且对于处于状态的每个节点,选择对应于连接到前一个节点中的节点的最佳路径量度的路径 状态,其中最佳路径度量包括适应度函数。 数据信号被传送到用于存储的边缘服务器集合中的每个边缘服务器,然后将其传送到请求客户端设备。
    • 67. 发明授权
    • Cooperative subspace multiplexing in content delivery networks
    • 内容传送网络中的合作子空间复用
    • US08942082B2
    • 2015-01-27
    • US14168442
    • 2014-01-30
    • Steve J Shattil
    • Steve J Shattil
    • H04J11/00H04L1/06H04B7/02H04J13/00H04L27/26H04L12/707H04J13/12H04L5/00H04W72/04
    • H04L1/0681H04B7/026H04J13/0003H04J13/004H04J13/12H04L1/0077H04L5/0021H04L27/2601H04L27/2602H04L27/2614H04L45/24H04L2001/0097H04W72/046
    • A source node selects a plurality of original data components to transfer to at least one destination node. A plurality of transmitting nodes cooperatively encodes the original data components to generate a plurality of subspace coded components and a corresponding code matrix. Each of the transmitting nodes transmits a subset of the plurality of subspace coded components and corresponding code matrix, wherein at least one of the transmitting nodes has a rank that is insufficient for decoding the plurality of subspace coded components. A destination node may employ a plurality of receiving nodes to cooperatively receive a plurality of subspace coded components and their corresponding code vectors, wherein the rank of at least one of the receiving nodes is insufficient for decoding the coded components. The destination node builds up the dimension of the subspace spanned by code vectors it collects from the receiving nodes so it can decode the coded components.
    • 源节点选择多个原始数据分量以传送到至少一个目的地节点。 多个发送节点协作地对原始数据分量进行编码以产生多个子空间编码分量和相应的代码矩阵。 每个发送节点发送多个子空间编码分量的子集和相应的代码矩阵,其中发送节点中的至少一个具有不足以解码多个子空间编码分量的等级。 目的地节点可以使用多个接收节点来协作地接收多个子空间编码分量及其对应的码矢量,其中至少一个接收节点的等级不足以解码编码分量。 目的地节点通过从接收节点收集的代码向量构建子空间的维度,从而可以对已编码的组件进行解码。