会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 5. 发明授权
    • Network communication protocol for large scale distribution of streaming content
    • 网络通信协议大规模分发流媒体内容
    • US07613979B1
    • 2009-11-03
    • US11296642
    • 2005-12-07
    • James E. MarrPayton R. WhiteAttila VassGary Zalewski
    • James E. MarrPayton R. WhiteAttila VassGary Zalewski
    • H03M13/00H04L1/18
    • H03M13/3761
    • Forward error correction may be implemented in a network having first, second and third nodes. The second node receives streaming media message packets and one or more check packets from an upstream first node. The second node transmits the message packets and check packets to a downstream third node. The second node uses the check packets to decode missing message packets and transmits the decoded missing packets to the third node before the missing message packets are to be presented by the third node. The third node may receive message packets and a first set of check packets from the second node and a second set of check packets from the first node. The third node may use check packets from both sets to decode missing message packets.
    • 可以在具有第一,第二和第三节点的网络中实现前向纠错。 第二节点从上游第一节点接收流媒体消息分组和一个或多个检查分组。 第二节点将消息包发送到下游第三节点。 第二节点使用检查分组来解码丢失的消息分组,并且在第三节点出现丢失的消息分组之前将解码的丢失分组发送到第三节点。 第三节点可以接收来自第二节点的消息分组和第一组校验分组以及来自第一节点的第二组校验分组。 第三节点可以使用来自两个集合的检查分组来解码丢失的消息分组。
    • 7. 发明授权
    • Broadcast messaging in peer to peer overlay network
    • 对等覆盖网络中的广播消息传递
    • US07468952B2
    • 2008-12-23
    • US11291121
    • 2005-11-29
    • Yutaka TakedaHoward BerkeyPayton R. WhiteAttila Vass
    • Yutaka TakedaHoward BerkeyPayton R. WhiteAttila Vass
    • H04L1/00H04L12/28
    • H04L12/1854
    • Broadcast messages are efficiently directed to nodes of an overlay network. Broadcast messages include an End ID parameter specifying the range of key values for nodes that should receive the broadcast message. Each node of an overlay network maintains a list of finger nodes and their respective key values. Upon receiving a broadcast message, a node assigns a finger node a new End ID value based upon the End ID value of the broadcast message or the key value of an adjacent finger node. The node compares a finger node's new End ID value with the finger node's key value to determine whether to forward the broadcast message to that finger node. A broadcast message forwarded to a finger node includes an End ID parameter equal to the new End ID value determined for the finger node. Nodes can aggregate response messages from its finger nodes.
    • 广播消息被有效地指向覆盖网络的节点。 广播消息包括指定应该接收广播消息的节点的密钥值的范围的结束ID参数。 覆盖网络的每个节点维护手指节点及其各自的键值的列表。 在接收到广播消息时,节点基于广播消息的结束ID值或相邻手指节点的密钥值来分配手指节点新的结束ID值。 节点将手指节点的新结束ID值与手指节点的键值进行比较,以确定是否将广播消息转发到该手指节点。 转发到手指节点的广播消息包括等于为手指节点确定的新的结束ID值的结束ID参数。 节点可以聚合来自其手指节点的响应消息。
    • 9. 发明申请
    • Atomic operation involving processors with different memory transfer operation sizes
    • 具有不同内存传输操作大小的处理器的原子操作
    • US20070130438A1
    • 2007-06-07
    • US11291306
    • 2005-12-01
    • James MarrJohn BatesAttila VassTatsuya Iwamoto
    • James MarrJohn BatesAttila VassTatsuya Iwamoto
    • G06F13/28
    • G06F9/3879G06F9/526G06F2209/521
    • Atomic operations may be implemented on a processor system having a main memory and two or more processors including a power processor element (PPE) and a synergistic processor element (SPE) that operate on different sized register lines. A main memory address containing a primitive is divided into a parity byte and two or more portions, wherein the parity byte includes at least one bit. A value of the parity byte determines which of the two or more portions is a valid portion and which of them is an invalid portion. The primitive is of a memory size that is larger than a maximum size for atomic operation with the PPE and less than or equal to a maximum size for atomic operation with the SPE. Read with reservation and conditional write instructions are used by both the PPE and SPE to access or update a value of the atomic.
    • 原子操作可以在具有主存储器和两个或更多个处理器的处理器系统上实现,所述处理器包括在不同大小的寄存器线上操作的功率处理器元件(PPE)和协同处理器元件(SPE)。 包含原语的主存储器地址被划分为奇偶校验字节和两个或多个部分,其中奇偶校验字节包括至少一个位。 奇偶校验字节的值确定两个或多个部分中的哪一个是有效部分,哪些是无效部分。 原始内存大小大于使用PPE进行原子操作的最大大小,小于或等于使用SPE进行原子操作的最大大小。 读取预留和条件写入指令由PPE和SPE使用来访问或更新原子的值。
    • 10. 发明申请
    • Broadcast messaging in peer to peer overlay network
    • 对等覆盖网络中的广播消息传递
    • US20070121570A1
    • 2007-05-31
    • US11291121
    • 2005-11-29
    • Yutaka TakedaHoward BerkeyPayton WhiteAttila Vass
    • Yutaka TakedaHoward BerkeyPayton WhiteAttila Vass
    • H04B7/212
    • H04L12/1854
    • Broadcast messages are efficiently directed to nodes of an overlay network. Broadcast messages include an End ID parameter specifying the range of key values for nodes that should receive the broadcast message. Each node of an overlay network maintains a list of finger nodes and their respective key values. Upon receiving a broadcast message, a node assigns a finger node a new End ID value based upon the End ID value of the broadcast message or the key value of an adjacent finger node. The node compares a finger node's new End ID value with the finger node's key value to determine whether to forward the broadcast message to that finger node. A broadcast message forwarded to a finger node includes an End ID parameter equal to the new End ID value determined for the finger node. Nodes can aggregate response messages from its finger nodes.
    • 广播消息被有效地指向覆盖网络的节点。 广播消息包括指定应该接收广播消息的节点的密钥值的范围的结束ID参数。 覆盖网络的每个节点维护手指节点及其各自的键值的列表。 在接收到广播消息时,节点基于广播消息的结束ID值或相邻手指节点的密钥值来分配手指节点新的结束ID值。 节点将手指节点的新结束ID值与手指节点的键值进行比较,以确定是否将广播消息转发到该手指节点。 转发到手指节点的广播消息包括等于为手指节点确定的新的结束ID值的结束ID参数。 节点可以聚合来自其手指节点的响应消息。