会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 4. 发明申请
    • SYSTEM AND METHOD FOR MICROECONOMIC MULTIPLEXING OF DATA OVER COMMUNICATION CHANNELS
    • 用于通信通道数据的微型多路复用的系统和方法
    • US20120170475A1
    • 2012-07-05
    • US13014181
    • 2011-01-26
    • Steven SREBRANIG
    • Steven SREBRANIG
    • H04L12/28H04L12/26
    • H04L47/824H04L47/525H04W72/0453
    • A system and method for optimal allocation of bandwidth in a multichannel transmission channel. In an embodiment, a system may allocate a specific amount of bandwidth in the transmission channel in order to maximize the value of the data that is transmitted on a per-channel basis. Typically, a transmission channel has enough bandwidth to accommodate the minimum bandwidth for all data across all channels. The excess bandwidth may be allocated in an optimal manner so as to provide additional bandwidth for the most valuable channels. The maximum allocation of bandwidth is a point in which allocating additional bandwidth to a channel does not yield any additional value. Such an allocation may be accomplished using an iterative analysis of the available bandwidth and a microeconomic-based analysis of the subjective value of each channel.
    • 一种用于在多信道传输信道中最佳分配带宽的系统和方法。 在一个实施例中,系统可以在传输信道中分配特定量的带宽,以便最大化在每个信道的基础上发送的数据的值。 通常,传输信道具有足够的带宽以适应所有信道上的所有数据的最小带宽。 可以以最佳方式分配超额带宽,以便为最有价值的信道提供额外的带宽。 带宽的最大分配是向频道分配附加带宽不产生任何附加值的点。 可以使用可用带宽的迭代分析和对每个信道的主观价值的基于微观经济的分析来实现这种分配。
    • 8. 发明申请
    • SHARED WEIGHTED FAIR QUEUING (WFQ) SHAPER
    • 共享加权公平队伍(WFQ)形状
    • US20100302942A1
    • 2010-12-02
    • US12852960
    • 2010-08-09
    • Laxman ShankarShekhar Ambe
    • Laxman ShankarShekhar Ambe
    • H04L12/26
    • H04L12/2898H04L47/10H04L47/115H04L47/215H04L47/22H04L47/2408H04L47/50H04L47/525H04L47/6215H04L47/623H04L47/627
    • A network device includes a port, a buffer, a flow control module, and a service differentiation module. The port is configured to send and receive a packet, wherein the port is connected to a network entity. The buffer is configured to store the packet. The flow control module is configured to control the transmission of the packet within the network device. The service differentiation module is coupled with the buffer and the flow control module. The service differentiation module is configured to regulate storage of the packet in the buffer and to regulate the transmission of the packet from the network device to the network entity. The service differentiation module is also configured to determine excess bandwidth available within the network device and to allocate the excess bandwidth to transmit the packet to the network entity.
    • 网络设备包括端口,缓冲器,流控制模块和服务区分模块。 该端口被配置为发送和接收分组,其中端口连接到网络实体。 缓冲区被配置为存储数据包。 流控制模块被配置为控制网络设备内的分组的传输。 服务差异化模块与缓冲器和流量控制模块相结合。 服务区分模块被配置为调节分组在缓冲器中的存储并且调节分组从网络设备到网络实体的传输。 服务区分模块还被配置为确定在网络设备内可用的额外带宽并且分配额外的带宽以将分组发送到网络实体。
    • 9. 发明申请
    • 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.
    • 通过宽带通信网络提供高速,优先的数据分组传送的系统和方法,避免在数据分组传输中引起不必要的延迟。 该系统采用分层,实时加权的令牌桶优先级方案,提供公平共享可用网络带宽。 在层次结构的每个级别使用至少一个令牌桶,以便提供包含在多个订户的服务计划中的提供服务应用的数据流。 每个令牌桶通过,丢弃或标记符合使用考虑到数据包的优先级的算法后续丢弃数据流中包含的数据包的资格,包括对严格的严格的高严格中等严格的低优先级 优先级不能被覆盖。 算法还考虑了低优先级数据分组的至少一个子集的加权优先级。 对这些低优先级数据分组的优先级进行加权,以便在低优先级数据流之间公平共享可用网络带宽,并且确保所有低优先级数据流都不被缺乏服务。