会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Network optimization using distributed virtual resources
    • 使用分布式虚拟资源进行网络优化
    • US08868675B2
    • 2014-10-21
    • US12328747
    • 2008-12-04
    • Udayakumar Srinivasan
    • Udayakumar Srinivasan
    • G06F15/167G06F15/16G06F9/50H04L29/08
    • G06F9/5077H04L67/10
    • In one example embodiment, an apparatus may include a first virtual machine provided on a first local device of a plurality of local devices, wherein a portion of resources of the first local device are allocated to the first virtual machine. A virtualization software switch may be provided on the first local device, configured to forward or redirect at least some traffic from the first local device to a WAN (Wide Area Network) optimization virtual appliance, the WAN optimization virtual appliance including at least the first virtual machine, a second virtual machine on a second local device of the plurality of local devices, and a distributed WAN optimization application running at least on the first and second virtual machines.
    • 在一个示例实施例中,设备可以包括设置在多个本地设备的第一本地设备上的第一虚拟机,其中第一本地设备的资源的一部分被分配给第一虚拟机。 可以在第一本地设备上提供虚拟化软件交换机,该虚拟化软件交换机被配置为将至少一些来自第一本地设备的业务转发或重定向到WAN(广域网)优化虚拟设备,所述WAN优化虚拟设备至少包括所述第一虚拟设备 机器,多个本地设备的第二本地设备上的第二虚拟机,以及至少在第一和第二虚拟机上运行的分布式WAN优化应用。
    • 7. 发明授权
    • Dynamic load balancing without packet reordering
    • 动态负载均衡,无需重新排序
    • US08705366B2
    • 2014-04-22
    • US13355968
    • 2012-01-23
    • Joji Thomas MekkattuparambanNarender EnduriUdayakumar Srinivasan
    • Joji Thomas MekkattuparambanNarender EnduriUdayakumar Srinivasan
    • H04L12/26
    • H04L49/90
    • Flows of packets are dynamically mapped to resource queues. Flows of packets are received at a network device to be routed from the network device in a network. Each flow comprises packets to be sent from a source to a connection. Data is stored for a queue allocation table that maintains a plurality of buckets to which received packets for a flow are assigned and indicating which of a plurality of resource queues are allocated for respective buckets. For each packet in a flow, a hash function is computed from values in a header of the packet and the packet is assigned to one of the plurality of buckets based on the computed hash function. One of a plurality of resource queues is allocated for each bucket to which packets are assigned based on the computed hash function.
    • 数据包流动态映射到资源队列。 在网络设备处接收到分组流,从网络中的网络设备进行路由。 每个流包括要从源发送到连接的数据包。 存储用于维护多个桶的队列分配表的数据,多个桶被分配给接收到的流的分组,并且指示为相应的桶分配多个资源队列中的哪一个。 对于流中的每个分组,根据分组的报头中的值计算哈希函数,并且基于所计算的散列函数将分组分配给多个分组中的一个。 基于所计算的散列函数,为分配了分组的每个分配桶分配多个资源队列中的一个。
    • 9. 发明申请
    • Dynamic Queuing and Pinning to Improve Quality of Service on Uplinks in a Virtualized Environment
    • 动态排队和固定,提高虚拟化环境中上行链路的服务质量
    • US20120127857A1
    • 2012-05-24
    • US12950124
    • 2010-11-19
    • Nadathur Srinivasan SundarTimothy J. KuikUdayakumar SrinivasanBehzad R. Dastur
    • Nadathur Srinivasan SundarTimothy J. KuikUdayakumar SrinivasanBehzad R. Dastur
    • H04L12/26
    • H04L47/2425H04L45/00H04L45/24H04L47/12H04L47/2408H04L47/76H04L47/805
    • Techniques are provided for improve quality of service on uplinks in a virtualized environment. At a server apparatus having a plurality of physical links configured to communicate traffic over a network to or from the server apparatus, forming an uplink group comprising a plurality of physical links. A first class of service is defined that allocates a first share of available bandwidth on the uplink group, and a second class of service is defined that allocates a second share of available bandwidth on the uplink group. The bandwidth for the first class of service is allocated across the plurality of physical links of the uplink group, and the bandwidth for the second class of service is allocated across the plurality of physical links of the uplink group. Traffic rates are monitored on each of the plurality of physical links to determine if a physical link is congested indicating that a bandwidth deficit exists for a class of service. In response to determining that one of the plurality of physical links is congested, bandwidth is reallocated for a class of service to reduce the bandwidth deficit for a corresponding class of service.
    • 提供了在虚拟化环境中提高上行链路服务质量的技术。 在具有多个物理链路的服务器装置中,形成包括多个物理链路的上行链路组,该多个物理链路被配置为通过网络向服务器装置或从服务器装置传送业务。 定义了第一类服务,其在上行链路组上分配可用带宽的第一份额,并且定义了在上行链路组上分配可用带宽的第二份额的第二类服务。 用于第一类服务的带宽被分配在上行链路组的多个物理链路上,并且在上行链路组的多个物理链路上分配用于第二类服务的带宽。 在多个物理链路中的每一个上监视业务速率,以确定物理链路是否拥塞,指示对于一类服务存在带宽缺陷。 响应于确定多个物理链路中的一个物理链路是拥塞的,为一类服务重新分配带宽,以减少相应类别的服务的带宽赤字。
    • 10. 发明授权
    • Method and system for redundancy suppression in data transmission over networks
    • 网络数据传输冗余抑制方法与系统
    • US07721020B2
    • 2010-05-18
    • US11328050
    • 2006-01-09
    • Udayakumar Srinivasan
    • Udayakumar Srinivasan
    • G06F13/00
    • G06F11/1443
    • Methods, systems and apparatus for suppressing redundancy in data transmission over networks are provided. Data segments are transmitted from a transmitting DPU to a receiving DPU. Initially, only signatures of the transmitted data segments are stored in a cache at the transmitting DPU. A data segment is stored in the cache only if it satisfies a redundancy-suppressing admission policy. Such a data segment is referred to as a redundant data segment. The redundant data segment is also stored in a cache at the receiving DPU. The transmitting DPU transmits the signatures of the redundant data segments to the receiving DPU, which then extracts the redundant data segments from its cache. Therefore, transmission of the redundant data segments is suppressed.
    • 提供了用于抑制网络上的数据传输冗余的方法,系统和装置。 数据段从发送DPU发送到接收DPU。 最初,只有发送的数据段的签名被存储在发送DPU的高速缓存中。 仅当数据段满足冗余抑制接纳策略时才将数据段存储在高速缓存中。 这样的数据段被称为冗余数据段。 冗余数据段也存储在接收DPU的高速缓存中。 发送DPU将冗余数据段的签名发送到接收DPU,接收DPU然后从其高速缓存中提取冗余数据段。 因此,抑制冗余数据段的传输。