会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Scaleable flow-based application and subscriber traffic control
    • 可扩展的基于流的应用和用户流量控制
    • US07743166B2
    • 2010-06-22
    • US10673999
    • 2003-09-30
    • Kurt A. DobbinsBrett A. MillerBruce E. Caram
    • Kurt A. DobbinsBrett A. MillerBruce E. Caram
    • G06F15/16
    • H04L47/10H04L45/02H04L45/38H04L47/2441H04L63/164H04L67/20
    • Methods and systems for providing scaleable flow based application control in private and public Internet. A flow table can be used to control the application and subscriber traffic for communication flows in access networks. The flow table entry can provide granular, unidirectional packet transmission of data for all or a subset of all host and application communications originating from or destined to network hosts in the access network. Using a flow table entry for multiple unidirectional packet transmissions of data provides efficient use of flow table entries and allows varying operator control of application communication exchanges between network hosts and applications. By using variable masking techniques, the flow table can be used for varying degrees of control over the packet transmissions in the network.
    • 在私人和公共互联网中提供可扩展的基于流程的应用程序控制的方法和系统。 可以使用流程表来控制接入网络中的通信流的应用和用户流量。 流表条目可以为来自或去往接入网络中的网络主机的所有主机和应用通信的全部或一个子集提供数据的粒度单向分组传输。 对数据的多个单向数据包传输使用流表条目提供了流表条目的有效使用,并允许变更操作员控制网络主机和应用程序之间的应用程序通信交换。 通过使用可变掩蔽技术,流表可用于对网络中的分组传输的不同程度的控制。
    • 3. 发明申请
    • Hierarchical virtual queuing
    • 分层虚拟排队
    • US20080159135A1
    • 2008-07-03
    • US11648141
    • 2006-12-29
    • Bruce E. Caram
    • Bruce E. Caram
    • H04L12/26
    • H04L47/10H04L47/215H04L47/29H04L47/31H04L47/32H04L47/50H04L47/525H04L47/60H04L47/6215H04W28/10
    • A system and method of providing high speed, prioritized delivery of data packets over broadband communications networks that avoids inducing unwanted latency in data packet transmission. The system employs a hierarchical, real-time, weighted token bucket prioritization scheme that provides for fair sharing of the available network bandwidth. At least one token bucket is employed at each level of the hierarchy to meter data flows providing service applications included in multiple subscribers' service plans. Each token bucket passes, discards, or marks as being eligible for subsequent discarding data packets contained in the data flows using an algorithm that takes into account the priority of the data packets, including strict high, strict medium, and strict low priorities corresponding to strict priority levels that cannot be overridden. The algorithm also takes into account weighted priorities of at least a subset of the low priority data packets. The priority levels of these low priority data packets are weighted to provide for fair sharing of the available network bandwidth among the low priority data flows, and to assure that none of the low priority data flows is starved of service.
    • 通过宽带通信网络提供高速,优先的数据分组传送的系统和方法,避免在数据分组传输中引起不必要的延迟。 该系统采用分层,实时加权的令牌桶优先级方案,提供公平共享可用网络带宽。 在层次结构的每个级别使用至少一个令牌桶,以便提供包含在多个订户的服务计划中的提供服务应用的数据流。 每个令牌桶通过,丢弃或标记符合使用考虑到数据包的优先级的算法后续丢弃数据流中包含的数据包的资格,包括对严格的严格的高严格中等严格的低优先级 优先级不能被覆盖。 算法还考虑了低优先级数据分组的至少一个子集的加权优先级。 对这些低优先级数据分组的优先级进行加权,以便在低优先级数据流之间公平共享可用网络带宽,并且确保所有低优先级数据流都不被缺乏服务。
    • 6. 发明授权
    • Hierarchical virtual queuing
    • 分层虚拟排队
    • US07826358B2
    • 2010-11-02
    • US11648141
    • 2006-12-29
    • Bruce E. Caram
    • Bruce E. Caram
    • H04L12/56
    • H04L47/10H04L47/215H04L47/29H04L47/31H04L47/32H04L47/50H04L47/525H04L47/60H04L47/6215H04W28/10
    • A system and method of providing high speed, prioritized delivery of data packets over broadband communications networks that avoids inducing unwanted latency in data packet transmission. The system employs a hierarchical, real-time, weighted token bucket prioritization scheme that provides for fair sharing of the available network bandwidth. At least one token bucket is employed at each level of the hierarchy to meter data flows providing service applications included in multiple subscribers' service plans. Each token bucket passes, discards, or marks as being eligible for subsequent discarding data packets contained in the data flows using an algorithm that takes into account the priority of the data packets, including strict high, strict medium, and strict low priorities corresponding to strict priority levels that cannot be overridden. The algorithm also takes into account weighted priorities of at least a subset of the low priority data packets. The priority levels of these low priority data packets are weighted to provide for fair sharing of the available network bandwidth among the low priority data flows, and to assure that none of the low priority data flows is starved of service.
    • 通过宽带通信网络提供高速,优先的数据分组传送的系统和方法,避免在数据分组传输中引起不必要的延迟。 该系统采用分层,实时加权的令牌桶优先级方案,提供公平共享可用网络带宽。 在层次结构的每个级别使用至少一个令牌桶,以便提供包含在多个订户的服务计划中的提供服务应用的数据流。 每个令牌桶通过,丢弃或标记符合使用考虑到数据包的优先级的算法后续丢弃数据流中包含的数据包的资格,包括对严格的严格的高严格中等严格的低优先级 优先级不能被覆盖。 算法还考虑了低优先级数据分组的至少一个子集的加权优先级。 对这些低优先级数据分组的优先级进行加权,以便在低优先级数据流之间公平共享可用网络带宽,并且确保所有低优先级数据流都不被缺乏服务。