会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 41. 发明授权
    • Scalable atomic multicast
    • 可扩展的原子组播
    • US06959323B1
    • 2005-10-25
    • US09384699
    • 1999-08-27
    • Hong-Yi TzengYin Zhang
    • Hong-Yi TzengYin Zhang
    • G06F15/16G06F15/173H04L12/18H04L12/56H04L29/08
    • H04L12/1881H04L47/10H04L47/15H04L47/34H04L67/02
    • This document describes a protocol for reliably synchronizing states of nodes in a distributed environment through use of a Scalable Atomic Multicast (SAM) Service that ensures both atomicity and total order among messages sent to a multicast group. In addition to possessing good scalability property, this fault-tolerant protocol does not require explicit knowledge of multicast group membership, allows for non-disturbing state synchronization, and supports asynchronous non-blocking communications. According to one aspect of this invention, a dedicated sequencer is responsible solely for assigning sequence numbers to the multicast messages. The sequencer does not multicast the messages. Another aspect of the invention is the use of receiver-driven negative acknowledgments. According to third aspect, the invention supports message consolidation and garbage collection.
    • 本文档描述了一种通过使用可扩展原子组播(SAM)服务可靠地同步分布式环境中的节点状态的协议,该可扩展原子组播(SAM)服务确保发送到多播组的消息的原子性和总顺序。 除了具有良好的可扩展性,该容错协议不需要对组播组成员资格的明确知识,允许非干扰状态同步,并支持异步非阻塞通信。 根据本发明的一个方面,专用定序器仅用于为多播消息分配序列号。 定序器不会组播消息。 本发明的另一方面是使用接收机驱动的否定确认。 根据第三方面,本发明支持消息合并和垃圾收集。
    • 42. 发明申请
    • Method and apparatus for sketch-based detection of changes in network traffic
    • 用于基于草图检测网络流量变化的方法和装置
    • US20050039086A1
    • 2005-02-17
    • US10867265
    • 2004-06-14
    • Balachander KrishnamurthySubhabrata SenYin ZhangYan Chen
    • Balachander KrishnamurthySubhabrata SenYin ZhangYan Chen
    • G06F13/00H04L12/24H04L12/26H04L12/56H04L29/06H02H3/05
    • H04L41/142H04L41/147H04L63/1408H04L63/1441
    • A sketch-based change detection technique is introduced for anomaly detection and other applications that can benefit from having a quick and efficient change detection mechanism. The technique is capable of detecting significant changes in massive data streams with a large number of network time series. As part of the technique, we designed a variant of the sketch data structure, called k-ary sketch, uses a constant, small amount of memory, and has constant per-record update and reconstruction cost. A variety of time series forecast models are implemented on top of such summaries and detect significant changes by looking for flows with large forecast errors. Heuristics for automatically configuring the forecast model parameters are presented. Real Internet traffic data is used to demonstrate that the sketch-based change detection method is highly accurate when compared with per-flow analysis, and can be implemented at low computation and memory costs. The results validate using the technique as a building block for network anomaly detection and traffic measurement in large computer networks.
    • 引入了一种基于草图的变更检测技术,用于异常检测和其他可以从快速有效的变化检测机制中受益的应用。 该技术能够通过大量网络时间序列来检测海量数据流的重大变化。 作为技术的一部分,我们设计了草图数据结构的一个变体,称为k-ary素描,使用常量,少量的内存,并具有不断的每记录更新和重建成本。 在这些总结之上还实施了各种时间序列预测模型,并通过查找具有较大预测误差的流量来检测重大变化。 介绍了自动配置预测模型参数的启发式。 实时互联网流量数据用于表明基于草图的变更检测方法与流量分析相比是高度准确的,可以以低计算和内存成本实现。 结果验证了该技术作为大型计算机网络中网络异常检测和流量测量的基础。
    • 47. 发明申请
    • EFFICIENTLY DISTRIBUTING VIDEO CONTENT USING A COMBINATION OF A PEER-TO-PEER NETWORK AND A CONTENT DISTRIBUTION NETWORK
    • 使用对等网络和内容分发网络的组合高效地分发视频内容
    • US20120297405A1
    • 2012-11-22
    • US13109690
    • 2011-05-17
    • Yin ZhangLili Qiu
    • Yin ZhangLili Qiu
    • H04H60/33
    • H04N7/15H04H20/08H04L67/06H04L67/1085H04L67/1095
    • A method, system and computer program product for efficiently distributing video content. A peer-to-peer network and a content distribution network are used in combination to distribute video content. A content distribution network relies on servers distributed across the Internet to achieve high quality content delivery at a high cost. A peer-to-peer network distributes content among peers without incurring server side cost but may experience poor performance. The peer-to-peer network and the content distribution network are leveraged in a manner that achieves high content delivery and low cost by allowing the peer-to-peer network to serve as much content as possible while using the content distribution network to bootstrap the content in the peer-to-peer network and using it as a fallback whenever the peer-to-peer network has insufficient bandwidth, insufficient quality or when the missing piece of video content in the video buffer of the client device has an immediate deadline.
    • 一种用于有效分发视频内容的方法,系统和计算机程序产品。 组合使用对等网络和内容分发网络来分发视频内容。 内容分发网络依赖于分布在互联网上的服务器,以高成本实现高质量的内容传送。 对等网络在对等体之间分配内容,而不会导致服务器端成本,但可能会遇到较差的性能。 通过允许对等网络在使用内容分发网络引导时能够尽可能多的内容来实现高内容传送和低成本的方式来利用对等网络和内容分发网络 对等网络中的内容,并且当对等网络具有不足的带宽,质量不足或客户端设备的视频缓冲区中缺少的视频内容片段具有即时截止时间时,将其用作回退。
    • 48. 发明授权
    • Method and apparatus for finding critical traffic matrices
    • 用于查找关键业务矩阵的方法和装置
    • US08228803B1
    • 2012-07-24
    • US11477437
    • 2006-06-28
    • Zihui GeYin Zhang
    • Zihui GeYin Zhang
    • H04L1/00
    • H04Q3/0062
    • Method and apparatus for determining at least one critical traffic matrix from a plurality of traffic matrices, where each of the plurality of traffic matrices is organized into at least one of a plurality of clusters, for a network is described. In one embodiment, a merging cost is calculated for each possible pair of clusters within a plurality of clusters. A pair of traffic matrices that is characterized by having the least merging cost is then merged. The calculating and the merging steps are subsequently repeated until a predefined number of clusters remains, wherein the remaining clusters are used to determine at least one critical traffic matrix.
    • 描述了一种用于从多个业务矩阵确定至少一个关键业务矩阵的方法和装置,其中多个业务矩阵中的每一个被组织成用于网络的多个集群中的至少一个。 在一个实施例中,针对多个聚类中的每个可能的聚类对来计算合并成本。 然后合并具有最小合并成本的一对业务矩阵。 随后重复计算和合并步骤,直到保持预定数量的簇,其中剩余的簇用于确定至少一个关键业务矩阵。