会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 6. 发明申请
    • ASYMMETRIC END HOST REDUNDANCY ELIMINATION FOR NETWORKS
    • 不平等的终端主机对网络的排除
    • US20110282932A1
    • 2011-11-17
    • US12781782
    • 2010-05-17
    • Ramachandran RamjeeBhavish AggarwalPushkar ChitnisGeorge VargheseAshok AnandChitra MuthukrishnanAthula Balachandran
    • Ramachandran RamjeeBhavish AggarwalPushkar ChitnisGeorge VargheseAshok AnandChitra MuthukrishnanAthula Balachandran
    • G06F15/16
    • H04L67/1002
    • An end host redundancy elimination system and method to provide redundancy elimination as an end system service. Embodiments of the system and method use optimization techniques that reduce server central processing unit (CPU) load and memory footprint as compared to existing approaches. For server storage, embodiments of the system and method use a suite of highly-optimized data structures for managing metadata and cached payloads. An optimized asymmetric max-match technique exploits the inherent structure in data maintained at the server and client and ensures that client processing load is negligible. A load-adaptive fingerprinting technique is used that is much faster than current fingerprinting techniques while still delivering similar compression. Load-adaptive means that embodiments of the fingerprinting technique can adapt CPU usage depending on server load. Embodiments of the system and method operate above the transmission control protocol (TCP) layer, thereby reducing the number of roundtrips needed for data transfer.
    • 终端主机冗余消除系统和方法,作为终端系统服务提供冗余消除。 与现有方法相比,系统和方法的实施例使用减少服务器中央处理单元(CPU)负载和存储器占用的优化技术。 对于服务器存储,系统和方法的实施例使用一组高度优化的数据结构来管理元数据和缓存的有效载荷。 优化的非对称最大匹配技术利用了在服务器和客户机上维护的数据的固有结构,并确保客户端处理负载可以忽略不计。 使用比当前指纹技术更快的负载自适应指纹技术,同时仍然提供类似的压缩。 负载自适应意味着指纹技术的实施例可以根据服务器负载来调整CPU使用。 系统和方法的实施例在传输控制协议(TCP)层之上操作,从而减少数据传输所需的往返次数。
    • 7. 发明授权
    • Modification of policing methods to make them more TCP-friendly
    • 修改监管方法使其更加TCP友好
    • US07817556B2
    • 2010-10-19
    • US11408293
    • 2006-04-20
    • Rong PanFlavio BonomiGeorge Varghese
    • Rong PanFlavio BonomiGeorge Varghese
    • G01R31/08
    • H04L47/215H04L47/193H04L47/20
    • Various improvements are provided for prior art policing methods, including token bucket methods and virtual time policing methods. Some preferred methods of the invention involve assigning a non-zero drop probability even when the packet would otherwise have been transmitted according to a prior art policing method. For example, a non-zero drop probability may be assigned even when there are sufficient tokens in a token bucket to allow transmission of the packet. A non-zero drop probability may be assigned, for example, when a token bucket level is at or below a predetermined threshold or according to a rate at which a token bucket is being emptied. Some implementations involve treating a token bucket as a virtual queue wherein the number of free elements in the virtual queue is proportional to the number of remaining tokens in the token bucket. Such implementations may involve predicting a future virtual queue size according to a previous virtual queue size and using this predicted value to calculate a drop probability.
    • 为现有技术的管理方法提供了各种改进,包括令牌桶方法和虚拟时间监管方法。 本发明的一些优选方法涉及分配非零丢弃概率,即使当根据现有技术的监管方法将分组以其他方式传输时也是如此。 例如,即使在令牌桶中有足够的令牌来允许分组的传输,也可以分配非零丢弃概率。 例如,当令牌桶级别等于或低于预定阈值时或者根据令牌桶被清空的速率时,可以分配非零丢弃概率。 一些实现涉及将令牌桶视为虚拟队列,其中虚拟队列中的空闲元素的数量与令牌桶中剩余令牌的数量成正比。 这样的实现可以涉及根据先前的虚拟队列大小预测未来的虚拟队列大小,并且使用该预测值来计算丢弃概率。