会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 31. 发明授权
    • Apparatus and method for protection in a data center
    • 数据中心保护装置及方法
    • US09066160B2
    • 2015-06-23
    • US13350457
    • 2012-01-13
    • Fang HaoMuralidharam S. KodialamTirunell V. LakshmanHaoyu SongMartin Zimgibl
    • Fang HaoMuralidharam S. KodialamTirunell V. LakshmanHaoyu SongMartin Zimgibl
    • H04B10/00H04Q11/00
    • H04B10/032H04B10/038H04B10/27H04L1/22H04Q11/00
    • A manner of providing redundancy protection for a data center network that is both reliable and low-cost. In a data center network where the data traffic between numerous access nodes and a network core layer via primary aggregation nodes, an optical network device such as and OLT (optical line terminal) is provided as a backup aggregation node for one or more of the primary aggregation nodes. When a communication path through a primary aggregation node fails, traffic is routed through the optical network device. In a preferred embodiment, a communication link is formed from a plurality of access nodes to a single port of the OLT or other optical network device via an optical splitter that combines upstream transmissions and distributes downstream transmissions. The upstream transmissions from the plurality of access nodes may occur according to an allocation schedule generated when the backup aggregation node is needed.
    • 为可靠和低成本的数据中心网络提供冗余保护的方式。 在通过主聚合节点在多个接入节点和网络核心层之间的数据业务的数据中心网络中,提供诸如OLT(光线路终端)之类的光网络设备作为主要的一个或多个的备份聚合节点 聚合节点。 当通过主聚合节点的通信路径发生故障时,流量将通过光网络设备进行路由。 在优选实施例中,通过组合上行传输并分发下行传输的光分路器,从多个接入节点到OLT或其他光网络设备的单个端口形成通信链路。 来自多个接入节点的上行传输可以根据需要备份聚合节点时生成的分配调度进行。
    • 32. 发明授权
    • Method and apparatus for generating a shape graph from a binary trie
    • 用于从二进制trie生成形状图的方法和装置
    • US08631043B2
    • 2014-01-14
    • US12633845
    • 2009-12-09
    • Fang HaoMuralidharan KodialamTirunell V. LakshmanHaoyu Song
    • Fang HaoMuralidharan KodialamTirunell 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数据结构的子树形状的顶点。 形状图数据结构允许类似于可以对二进制特里数据结构执行的操作的操作,以执行来自该组数据值的数据值的查找,同时减少二进制特里数据结构的结构冗余, 形状图数据结构在二进制数据结构中提供了对存储器使用的显着改进。
    • 34. 发明授权
    • Softrouter protocol disaggregation
    • Softrouter协议分解
    • US08432787B2
    • 2013-04-30
    • US13290633
    • 2011-11-07
    • Furquan Ahmed AnsariMartin HavemannTirunell V. LakshmanThyagarajan NandagopalRamachandran RamjeeThomas Y. Woo
    • Furquan Ahmed AnsariMartin HavemannTirunell V. LakshmanThyagarajan NandagopalRamachandran RamjeeThomas Y. Woo
    • G06F11/00H04J3/16
    • H04L45/64H04L45/00H04L45/52H04L45/60
    • A SoftRouter architecture deconstructs routers by separating the control entities of a router from its forwarding components, enabling dynamic binding between them. In the SoftRouter architecture, control plane functions are aggregated and implemented on a few smart servers which control forwarding elements that are multiple network hops away. A dynamic binding protocol performs network-wide control plane failovers. Network stability is improved by aggregating and remotely hosting routing protocols, such as OSPF and BGP. This results in faster convergence, lower protocol messages processed, and fewer route changes following a failure. The SoftRouter architecture includes a few smart control entities that manage a large number of forwarding elements to provide greater support for network-wide control. In the SoftRouter architecture, routing protocols operate remotely at a control element and control one or more forwarding elements by downloading the forwarding tables, etc. into the forwarding elements. Intra-domain routing and inter-domain routing are also included.
    • SoftRouter架构通过将路由器的控制实体与其转发组件分离来解构路由器,从而实现它们之间的动态绑定。 在SoftRouter架构中,控制平面功能在几个智能服务器上进行聚合和实现,这些智能服务器控制多个网络跳转的转发元素。 动态绑定协议执行网络范围的控制平面故障转移。 通过聚合和远程托管路由协议(如OSPF和BGP)来提高网络的稳定性。 这导致更快的收敛,更低的协议消息被处理,并且在故障之后更少的路由改变。 SoftRouter架构包括几个智能控制实体,它们管理大量转发元素,为网络范围的控制提供更大的支持。 在SoftRouter架构中,路由协议在控制元件上进行远程操作,并通过将转发表等下载到转发元件中来控制一个或多个转发元素。 还包括域内路由和域间路由。
    • 35. 发明申请
    • PRIVACY-PRESERVING ADVERTISEMENT TARGETING USING RANDOMIZED PROFILE PERTURBATION
    • 隐私保护使用随机配置文件的广告策略
    • US20130060601A1
    • 2013-03-07
    • US13225878
    • 2011-09-06
    • Muralidharan S. KodialamTirunell V. LakshmanSarit Mukherjee
    • Muralidharan S. KodialamTirunell V. LakshmanSarit Mukherjee
    • G06Q30/00
    • G06Q30/02
    • A distribution and scheduling system for advertisements that targets ads to users and maximizes service-provider revenue without having full knowledge of user-profile information. Each user device stores a user profile and is pre-loaded with a set of ads that could possibly be shown during a timeslot. Each user device selects and displays an ad based on the user profile but does not identify the selected ad to the service provider. Instead, the user devices provide perturbed user-profile information in the form of Boolean vectors, which the service provider uses in conjunction with a guaranteed-approximation online algorithm to estimate the number of users that saw a particular ad. Thus, the service provider can charge advertisers for the number of times their ads are viewed, without knowing the users' profiles or which ads were viewed by individual users, and users can view the targeted ads while maintaining privacy from the service provider.
    • 用于向用户展示广告的广告的分发和调度系统,并且在不了解用户简档信息的情况下最大化服务提供商收入。 每个用户设备存储用户简档,并且预先加载可能在时隙期间显示的一组广告。 每个用户设备根据用户配置文件选择并显示广告,但不将所选广告标识给服务提供商。 相反,用户设备以布尔向量的形式提供扰动的用户简档信息,服务提供商结合保证近似在线算法来估计看到特定广告的用户数量。 因此,服务提供商可以在不知道用户的个人资料或哪些广告被个人用户查看的情况下向广告客户收取广告的次数,并且用户可以在维护来自服务提供商的隐私的同时查看有针对性的广告。
    • 37. 发明授权
    • Variable-stride stream segmentation and multi-pattern matching
    • 可变步长分段和多模式匹配
    • US08250016B2
    • 2012-08-21
    • US12425576
    • 2009-04-17
    • Nan HuaTirunell V. LakshmanHaoyu Song
    • Nan HuaTirunell V. LakshmanHaoyu Song
    • G06F17/00
    • G06K9/62
    • A variable-stride multi-pattern matching apparatus segments patterns and input streams into variable-size blocks according to a modified winnowing algorithm. The variable-stride pattern segments are used to determine the block-symbol alphabet for a variable-stride discrete finite automaton (VS-DFA) that is used for detecting the patterns in the input streams. Applications include network-intrusion detection and protection systems, genome matching, and forensics. The modification of the winnowing algorithm includes using special hash values to determine the position of delimiters of the patterns and input streams. The delimiters mark the beginnings and ends of the segments. In various embodiments, the patterns are segmented into head, core, and tail blocks. The approach provides for memory, memory-bandwidth, and processor-cycle efficient, deterministic, high-speed, line-rate pattern matching.
    • 可变跨度多模式匹配装置根据修改的风选算法将模式和输入流分割成可变大小的块。 可变步长模式段用于确定用于检测输入流中的模式的可变步长离散有限自动机(VS-DFA)的块符号字母表。 应用包括网络入侵检测和保护系统,基因组匹配和取证。 风选算法的修改包括使用特殊哈希值来确定模式和输入流的分隔符的位置。 分隔符标记段的开头和结尾。 在各种实施例中,图案被分割为头部,芯部和尾部块。 该方法提供了存储器,存储器带宽和处理器周期效率,确定性,高速的线速率模式匹配。
    • 38. 发明授权
    • Packet processing using braided tries
    • 使用编织尝试的包处理
    • US08179898B2
    • 2012-05-15
    • US12482533
    • 2009-06-11
    • Haoyu SongMurali KodialamFang HaoTirunell V. Lakshman
    • Haoyu SongMurali KodialamFang HaoTirunell V. Lakshman
    • H04L12/28H04L12/56
    • H04L45/00H04L45/742
    • Packets are processed (e.g., routed or classified) in accordance with a braided trie, which represents the combination of two or more different original tries (e.g., representing different forwarding/classification tables). The different tries are combined by twisting the mappings for specific trie nodes to make the shapes of the different tries more similar. Each node in the braided trie contains a braiding bit for at least one original trie indicating the mapping for that trie's node. Trie braiding can significantly reduce the number of nodes used to represent the different original tries, thereby reducing memory usage and improving scalability. Braided tries can be used for such applications as virtual routers and packet classification in which different forwarding/classification tables are represented by a single braided trie stored in shared memory.
    • 数据包根据编织特技进行处理(例如,路由或分类),其代表两个或多个不同的原始尝试的组合(例如,表示不同的转发/分类表)。 通过扭转特定特里节点的映射来组合不同的尝试,使不同尝试的形状更相似。 编织特技中的每个节点包含至少一个原始特里的编织位,指示该特里节点的映射。 Trie编织可以显着减少用于表示不同原始尝试的节点数量,从而减少内存使用并提高可扩展性。 编织的尝试可以用于虚拟路由器和分组分类等应用,其中不同的转发/分类表由存储在共享存储器中的单个编织线索表示。
    • 39. 发明授权
    • Softrouter protocol disaggregation
    • Softrouter协议分解
    • US08068408B2
    • 2011-11-29
    • US11147472
    • 2005-06-08
    • Furquan Ahmed AnsariMartin HavemannTirunell V. LakshmanThyagarajan NandagopalRamachandran RamjeeThomas Y. Woo
    • Furquan Ahmed AnsariMartin HavemannTirunell V. LakshmanThyagarajan NandagopalRamachandran RamjeeThomas Y. Woo
    • G06F11/00H04J3/16
    • H04L45/64H04L45/00H04L45/52H04L45/60
    • A SoftRouter architecture deconstructs routers by separating the control entities of a router from its forwarding components, enabling dynamic binding between them. In the SoftRouter architecture, control plane functions are aggregated and implemented on a few smart servers which control forwarding elements that are multiple network hops away. A dynamic binding protocol performs network-wide control plane failovers. Network stability is improved by aggregating and remotely hosting routing protocols, such as OSPF and BGP. This results in faster convergence, lower protocol messages processed, and fewer route changes following a failure. The SoftRouter architecture includes a few smart control entities that manage a large number of forwarding elements to provide greater support for network-wide control. In the SoftRouter architecture, routing protocols operate remotely at a control element and control one or more forwarding elements by downloading the forwarding tables, etc. into the forwarding elements. Intra-domain routing and inter-domain routing are also included.
    • SoftRouter架构通过将路由器的控制实体与其转发组件分离来解构路由器,从而实现它们之间的动态绑定。 在SoftRouter架构中,控制平面功能在几个智能服务器上进行聚合和实现,这些智能服务器控制多个网络跳转的转发元素。 动态绑定协议执行网络范围的控制平面故障转移。 通过聚合和远程托管路由协议(如OSPF和BGP)来提高网络的稳定性。 这导致更快的收敛,更低的协议消息被处理,并且在故障之后更少的路由更改。 SoftRouter架构包括几个智能控制实体,它们管理大量转发元素,为网络范围的控制提供更大的支持。 在SoftRouter架构中,路由协议在控制元件上进行远程操作,并通过将转发表等下载到转发元件中来控制一个或多个转发元素。 还包括域内路由和域间路由。
    • 40. 发明授权
    • 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子滤波器。 可以检测到假阳性匹配,并使用片外基于散列的前缀表检索真正匹配的下一跳信息。