会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明申请
    • NETWORK ADDRESS LOOKUP BASED ON BLOOM FILTERS
    • 基于BLOOM过滤器的网络地址查找
    • US20100040066A1
    • 2010-02-18
    • US12190633
    • 2008-08-13
    • Fang HaoMuralidharan S. KodialamTirunell V. LakshmanHaoyu Song
    • Fang HaoMuralidharan S. KodialamTirunell V. LakshmanHaoyu Song
    • H04L12/56
    • H04L45/00H04L45/745H04L45/7457
    • In one embodiment, IP lookup into a routing table having prefixes of different prefix lengths is performed using a Bloom filter that was programmed with the prefixes corresponding to all of the different prefix lengths without having to expand any of the prefixes programmed into the Bloom filter. Membership probes are performed into the Bloom filter using candidate prefix values of a given network address. The Bloom filter can be implemented in a distributed manner using Bloom sub-filters, where each Bloom sub-filter is hashed based on a set of hash functions, where each different hash function in the set corresponds to a different prefix length in the routing table. Each Bloom sub-filter can in turn be implemented using a plurality of practically realizable multi-port memory devices controlled by a port scheduler. False-positive matches can be detected and next-hop information for true-positive matches retrieved using an off-chip, hash-based prefix table.
    • 在一个实施例中,使用具有与所有不同前缀长度相对应的前缀编程的布隆过滤器来执行具有不同前缀长度的前缀的路由表的IP查找,而不必将编程到布隆过滤器中的任何前缀扩展。 使用给定网络地址的候选前缀值对Bloom过滤器进行成员资格探测。 Bloom过滤器可以使用Bloom子过滤器以Bloom子过滤器实现,其中每个Bloom子过滤器基于一组散列函数进行散列,其中集合中的每个不同的散列函数对应于路由表中的不同的前缀长度 。 可以使用由端口调度器控制的多个实际可实现的多端口存储器件来实现每个Bloom子滤波器。 可以检测到假阳性匹配,并使用片外基于散列的前缀表检索真正匹配的下一跳信息。
    • 4. 发明授权
    • Network address lookup based on bloom filters
    • 基于布隆过滤器的网络地址查找
    • US08018940B2
    • 2011-09-13
    • US12190633
    • 2008-08-13
    • Fang HaoMuralidharan S. KodialamTirunell V. LakshmanHaoyu Song
    • Fang HaoMuralidharan S. KodialamTirunell V. LakshmanHaoyu Song
    • H04L12/56
    • H04L45/00H04L45/745H04L45/7457
    • In one embodiment, IP lookup into a routing table having prefixes of different prefix lengths is performed using a Bloom filter that was programmed with the prefixes corresponding to all of the different prefix lengths without having to expand any of the prefixes programmed into the Bloom filter. Membership probes are performed into the Bloom filter using candidate prefix values of a given network address. The Bloom filter can be implemented in a distributed manner using Bloom sub-filters, where each Bloom sub-filter is hashed based on a set of hash functions, where each different hash function in the set corresponds to a different prefix length in the routing table. Each Bloom sub-filter can in turn be implemented using a plurality of practically realizable multi-port memory devices controlled by a port scheduler. False-positive matches can be detected and next-hop information for true-positive matches retrieved using an off-chip, hash-based prefix table.
    • 在一个实施例中,使用具有与所有不同前缀长度相对应的前缀编程的布隆过滤器来执行具有不同前缀长度的前缀的路由表的IP查找,而不必将编程到布隆过滤器中的任何前缀扩展。 使用给定网络地址的候选前缀值对Bloom过滤器进行成员资格探测。 Bloom过滤器可以使用Bloom子过滤器以Bloom子过滤器实现,其中每个Bloom子过滤器基于一组散列函数进行散列,其中集合中的每个不同的散列函数对应于路由表中的不同的前缀长度 。 可以使用由端口调度器控制的多个实际可实现的多端口存储器件来实现每个Bloom子滤波器。 可以检测到假阳性匹配,并使用片外基于散列的前缀表检索真正匹配的下一跳信息。
    • 8. 发明申请
    • METHOD AND APPARATUS FOR TRANSPARENT CLOUD COMPUTING WITH A VIRTUALIZED NETWORK INFRASTRUCTURE
    • 用虚拟网络基础设施进行透明云计算的方法与装置
    • US20110090911A1
    • 2011-04-21
    • US12582939
    • 2009-10-21
    • Fang HaoT.V. LakshmanSarit MukherjeeHaoyu Song
    • Fang HaoT.V. LakshmanSarit MukherjeeHaoyu Song
    • H04L12/56
    • H04L12/4641G06F9/45558G06F2009/45595H04L12/4633H04L49/70
    • A capability is provided for providing transparent cloud computing with a virtualized network infrastructure. A method for enabling use of a resource of a data center as an extension of a customer network includes receiving, at a forwarding element (FE), a packet intended for a virtual machine hosted at an edge domain of the data center, determining a VLAN ID of the VLAN for the customer network in the edge domain, updating the packet to include the VLAN ID of the VLAN for the customer network in the edge domain, and propagating the updated packet from the FE toward virtual machine. The edge domain supports a plurality of VLANs for a respective plurality of customer networks. The packet includes an identifier of the customer network and a MAC address of the virtual machine. The VLAN ID of the VLAN for the customer network in the edge domain is determined using the identifier of the customer network and the MAC address of the virtual machine. The FE may be associated with the edge domain at which the virtual machine is hosted, an edge domain of the data center that is different than the edge domain at which the virtual machine is hosted, or the customer network. Depending on the location of the FE at which the packet is received, additional processing may be provided as needed.
    • 提供了一种提供透明云计算与虚拟化网络基础架构的能力。 用于使数据中心的资源能够用作客户网络的扩展的方法包括在转发元件(FE)处接收旨在用于驻留在数据中心的边缘域的虚拟机的分组,确定VLAN 边缘域中客户网络的VLAN ID,更新报文,包括边缘域中客户网络的VLAN的VLAN ID,并将更新的报文从FE传播到虚拟机。 边缘域为相应的多个客户网络支持多个VLAN。 该分组包括客户网络的标识符和虚拟机的MAC地址。 边缘域中客户网络的VLAN的VLAN ID使用客户网络的标识符和虚拟机的MAC地址来确定。 FE可以与托管虚拟机的边缘域,数据中心的边缘域与虚拟机所在的边缘域或客户网络相关联。 根据接收到分组的FE的位置,可以根据需要提供额外的处理。
    • 10. 发明申请
    • METHOD AND APPARATUS FOR GENERATING A SHAPE GRAPH FROM A BINARY TRIE
    • 用于从二进制生成形状图的方法和装置
    • US20110137930A1
    • 2011-06-09
    • US12633845
    • 2009-12-09
    • Fang HaoMuralidharan KodialamT.V. LakshmanHaoyu Song
    • Fang HaoMuralidharan KodialamT.V. LakshmanHaoyu Song
    • G06F17/30
    • G06F17/30958
    • A capability is provided for representing a set of data values using data structures, including converting a binary trie data structure representing the set of data values to a shape graph data structure representing the set of data values. The shape graph data structure is generated from the binary trie data structure based on the shapes of the sub-trees rooted at the nodes of the binary trie data structure. The shape graph includes vertices representing shapes of the sub-trees of the binary trie data structure. A shape graph data structure permits operations similar to the operations that may be performed on the binary trie data structure for performing lookups for data values from the set of data values, while at the same time reducing the structural redundancy of the binary trie data structure such that the shape graph data structure provides significant improvements in memory usage over the binary trie data structure.
    • 提供了一种用于使用数据结构表示一组数据值的能力,包括将表示该组数据值的二进制特里数据结构转换为表示数据值集合的形状图数据结构。 形状图数据结构是从二进制trie数据结构生成的基于二叉树数据结构的节点的子树的形状。 形状图包括表示二进制trie数据结构的子树形状的顶点。 形状图数据结构允许类似于可以对二进制特里数据结构执行的操作的操作,以执行来自该组数据值的数据值的查找,同时减少二进制特里数据结构的结构冗余, 形状图数据结构在二进制数据结构中提供了对存储器使用的显着改进。