专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

51. 发明授权

US08068408B2 Softrouter protocol disaggregation 有权
标题翻译： Softrouter协议分解
公开(公告)号：US08068408B2
公开(公告)日：2011-11-29
申请号：US11147472
申请日：2005-06-08
申请人： Furquan Ahmed Ansari , Martin Havemann , Tirunell V. Lakshman , Thyagarajan Nandagopal , Ramachandran Ramjee , Thomas Y. Woo
发明人： Furquan Ahmed Ansari , Martin Havemann , Tirunell V. Lakshman , Thyagarajan Nandagopal , Ramachandran Ramjee , Thomas Y. Woo
IPC分类号： G06F11/00 , H04J3/16
CPC分类号： H04L45/64 , H04L45/00 , H04L45/52 , H04L45/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架构中，路由协议在控制元件上进行远程操作，并通过将转发表等下载到转发元件中来控制一个或多个转发元素。还包括域内路由和域间路由。

52. 发明授权

US08018940B2 Network address lookup based on bloom filters 有权
标题翻译：基于布隆过滤器的网络地址查找
公开(公告)号：US08018940B2
公开(公告)日：2011-09-13
申请号：US12190633
申请日：2008-08-13
申请人： Fang Hao , Muralidharan S. Kodialam , Tirunell V. Lakshman , Haoyu Song
发明人： Fang Hao , Muralidharan S. Kodialam , Tirunell V. Lakshman , Haoyu Song
IPC分类号： H04L12/56
CPC分类号： H04L45/00 , H04L45/745 , H04L45/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子滤波器。可以检测到假阳性匹配，并使用片外基于散列的前缀表检索真正匹配的下一跳信息。

53. 发明授权

US07957266B2 Efficient and robust routing independent of traffic pattern variability 有权
标题翻译：高效且鲁棒的路由独立于流量模式的变化
公开(公告)号：US07957266B2
公开(公告)日：2011-06-07
申请号：US11106410
申请日：2005-04-14
申请人： Muralidharan S. Kodialam , Tirunell V. Lakshman , Sudipta Sengupta
发明人： Muralidharan S. Kodialam , Tirunell V. Lakshman , Sudipta Sengupta
IPC分类号： H04L12/26
CPC分类号： H04L45/12 , H04L45/04 , H04L45/24 , H04L47/125
摘要： A scheme for routing packets of traffic to their destination after ensuring that they pass through one or more pre-determined intermediate nodes, thereby permitting all permissible traffic patterns to be handled without knowledge of the traffic matrix, subject to edge-link capacity constraints. In one embodiment, a request for a path with a service demand for routing data between the ingress point and the egress point is received. A set of two or more intermediate nodes between the ingress point and the egress point is selected. Based on a bandwidth of the network, respective fractions of the data to send from the ingress point to each node of the set of intermediate nodes are determined. The data is routed in the determined respective fractions from the ingress point to each node of the set of intermediate nodes, and routed from each node of the set of intermediate nodes to the egress point.
摘要翻译：一种用于在确保它们通过一个或多个预定中间节点之后将流量分组路由到其目的地的方案，从而允许所有允许的业务模式在不了解业务矩阵的情况下被处理，而不受边缘链路容量限制。在一个实施例中，接收到对于在入口点和出口点之间路由数据的服务需求的路径的请求。选择入口点和出口点之间的两个或多个中间节点的集合。基于网络的带宽，确定从入口点向中间节点集合中的每个节点发送的数据的各个分数。将数据以确定的各个分数从入口点路由到中间节点集合中的每个节点，并从中间节点集合的每个节点路由到出口点。

54. 发明授权

US07633867B2 Capacity allocation for networks having path length routing constraints 有权
标题翻译：具有路径长度路由约束的网络的容量分配
公开(公告)号：US07633867B2
公开(公告)日：2009-12-15
申请号：US10357557
申请日：2003-02-04
申请人： Muralidharan S. Kodialam , Tirunell V. Lakshman
发明人： Muralidharan S. Kodialam , Tirunell V. Lakshman
IPC分类号： G01R31/08
CPC分类号： H04L45/12 , H04L45/124 , H04L45/38
摘要： Capacity design of an optical network for demands of connections forms a linear programming sizing problem for a optimal routing. A dual of the linear programming sizing problem is formed and solved with an approximation algorithm. Edge lengths are initialized based on i) the inverse of the edge's capacity and ii) a scalar constant. Then, the approximation algorithm proceeds in phases to route each commodity over the edges of a graph. During each phase, the demand's flow is sent from the source to destination via multiple iterations. During each iteration, the shortest length-bounded path from the source to the destination is determined, a portion of the flow is sent, and the lengths of the edges that carry the flow are updated. The value employed to scale the network is generated after the last phase from the maximum ratio of edge flow to edge capacity.
摘要翻译：用于连接需求的光网络的容量设计形成用于优化路由的线性规划大小问题。线性规划大小问题的双重形成并用近似算法求解。边缘长度基于i）边缘容量的倒数初始化，以及ii）标量常数。然后，近似算法逐步进行，以在图的边缘上路由每个商品。在每个阶段，需求流通过多次迭代从源到目的地发送。在每个迭代期间，确定从源到目的地的最短长度有界的路径，发送流的一部分，并且更新携带流的边的长度。用于缩放网络的值是在从边缘流量到边缘容量的最大比率的最后一个阶段之后生成的。

55. 发明授权

US06341130B1 Packet classification method and apparatus employing two fields 有权
标题翻译：采用两个字段的分组分类方法和装置
公开(公告)号：US06341130B1
公开(公告)日：2002-01-22
申请号：US09146122
申请日：1998-09-02
申请人： Tirunell V. Lakshman , Dimitrios Stiliadis
发明人： Tirunell V. Lakshman , Dimitrios Stiliadis
IPC分类号： H04L1266
CPC分类号： H04L45/00 , H04L45/54 , H04L45/742 , H04L63/0263
摘要： A packet filter for a router performs generalized packet filtering allowing range matches in two dimensions, where ranges in one dimension at least one dimension is defined as a power of two. To associate a filter rule with a received packet EP, the packet filter employs a 2-dimensional interval search and memory look-up with the filter-rule table. Values of sm of filter-rule rm=(sm,dm) in one dimension are desirably ranges that are a power of two, such as prefix ranges, which are represented by a binary value having a “length” defined as the number of bits to of the prefix. The dm may be single points, ranges defined as prefix ranges, and/or ranges defined as continuous ranges. The packet filter employs preprocessing of the filter-rules based on prefix length as a power of 2 in one dimension and decomposition of overlapping segments into non-overlapping intervals in the other dimension to form the filter-rule table. A preprocessing algorithm searches in one dimension through filter rules and arranges the corresponding filter-rule rectangle segments according to prefix length. Then, in the other dimension, the overlapping filter rectangle segments are decomposed into non-overlapping intervals, and the highest priority filter-rule overlapping each non-overlapping interval is associated with that interval. A filter-rule table is then constructed with entries ordered according to prefix length and non-overlapping interval, each entry associated with a particular filter-rule. A packet classification algorithm then matches the field or other parameter information in the packet to the filter-rule table entries to identify the filter-rule rectangle associated with the filter-rule to be applied to the packet.
摘要翻译：用于路由器的分组过滤器执行广义分组过滤，允许在二维中进行范围匹配，其中一维中的至少一维的范围被定义为二的幂。为了将过滤规则与接收到的分组EP相关联，分组过滤器采用二维间隔搜索和存储器查找与过滤规则表。一维中滤波器规则rm =（sm，dm）的sm的值优选为2的幂，例如前缀范围的范围，前缀范围由具有定义为位数的“长度”的二进制值表示到前缀。 dm可以是单点，定义为前缀范围的范围，和/或定义为连续范围的范围。分组过滤器使用基于前缀长度的过滤规则的预处理作为一维中的2的幂，并且将重叠段的分解在另一维度中的非重叠间隔中以形成过滤规则表。预处理算法通过过滤规则在一维中进行搜索，并根据前缀长度排列相应的过滤规则矩形段。然后，在另一个维度上，重叠的过滤器矩形段被分解成非重叠的间隔，并且与每个非重叠间隔重叠的最高优先级过滤器规则与该间隔相关联。然后，根据前缀长度和不重叠间隔排序的条目构建过滤规则表，每个条目与特定过滤规则相关联。然后，分组分类算法将分组中的字段或其他参数信息与过滤器规则表条目匹配，以标识与要应用于分组的过滤规则相关联的过滤规则矩形。

56. 发明授权

US5537446A Smoothing delay-sensitive traffic offered to asynchronous transfer mode networks 失效
标题翻译：平滑对异步传输模式网络提供的延迟敏感流量
公开(公告)号：US5537446A
公开(公告)日：1996-07-16
申请号：US153538
申请日：1993-11-15
申请人： Tirunell V. Lakshman , Teunis J. Ott , Mohammed A. J. Tabatabai-Yazdi
发明人： Tirunell V. Lakshman , Teunis J. Ott , Mohammed A. J. Tabatabai-Yazdi
IPC分类号： H04L12/56 , H04N21/236 , H04N21/434 , H04Q11/04 , H04L7/00
CPC分类号： H04N21/434 , H04N21/236 , H04Q11/0478 , H04L2012/5616 , H04L2012/5636 , H04L2012/5649
摘要： A methodology and concomitant circuitry for smoothing delay sensitive traffic utilizes short term traffic forecasts and guarantees meeting a prespecified delay constraint. The pattern of incoming traffic is used to forecast estimates of future incoming data from the present and past incoming data. Corresponding to the estimate is a data rate for propagating stored data to produce a smoothed outgoing data rate, and the interval of time over which such a rate is used so as to satisfy the delay constraint. The estimation procedure is then re-invoked at the end to the time interval, which takes into account data arriving during the time interval, so as to determine the next succeeding data rate and a new time interval for propagating stored data.
摘要翻译：用于平滑延迟敏感业务的方法和并发电路利用短期业务量预测和保证满足预先指定的延迟约束。传入流量的模式用于预测来自当前和过去传入数据的未来传入数据的估计。与估计相对应的是用于传播存储的数据以产生平滑的输出数据速率的数据速率，以及使用这种速率以满足延迟约束的时间间隔。然后在时间间隔结束时重新调用估计过程，该时间间隔考虑了在时间间隔期间到达的数据，以便确定下一个后续数据速率和用于传播存储的数据的新的时间间隔。

57. 发明申请

US20180324082A1 WEIGHT SETTING USING INVERSE OPTIMIZATION 审中-公开
公开(公告)号：US20180324082A1
公开(公告)日：2018-11-08
申请号：US15587649
申请日：2017-05-05
申请人： Fang Hao , Murali Kodialam , Tirunell V. Lakshman
发明人： Fang Hao , Murali Kodialam , Tirunell V. Lakshman
IPC分类号： H04L12/721 , H04L12/733 , H04W40/02
CPC分类号： H04L45/123 , H04L41/0823 , H04L43/0882 , H04L43/16 , H04L45/126 , H04L45/14 , H04L45/70 , H04W40/02
摘要： The present disclosure generally discloses improvements in computer performance for supporting use of shortest path routing in a communication network. The shortest path routing capability may be configured to support setting of link weights for use in shortest path routing. The shortest path routing capability may be configured to support setting of link weights for use in shortest path routing based on inverse optimization. The shortest path routing capability may be configured to support setting of link weights for use in shortest path routing based on distance between traffic matrices (e.g., distance between a requested traffic matrix and a routed traffic matrix). The shortest path routing capability may be configured to determine, based on the distance between a requested traffic matrix and a routed traffic matrix, whether to accept or reject a set of link weights for a network.

58. 发明授权

US09906460B2 Data plane for processing function scalability 有权
公开(公告)号：US09906460B2
公开(公告)日：2018-02-27
申请号：US14985652
申请日：2015-12-31
申请人： Randeep S. Bhatia , Fang Hao , Tirunell V. Lakshman , Harish Viswanathan
发明人： Randeep S. Bhatia , Fang Hao , Tirunell V. Lakshman , Harish Viswanathan
IPC分类号： H04L12/863 , H04L12/26 , H04L12/741 , H04L12/823 , H04L12/861
CPC分类号： H04L47/626 , H04L43/16 , H04L45/64 , H04L45/745 , H04L47/25 , H04L47/30 , H04L47/32 , H04L49/9036 , H04L49/9084
摘要： The present disclosure generally discloses a data plane configured for processing function scalability. The processing functions for which scalability is supported may include charging functions, monitoring functions, security functions, or the like.

59. 发明申请

US20170324738A1 INTERNET SECURITY 审中-公开
公开(公告)号：US20170324738A1
公开(公告)日：2017-11-09
申请号：US15145460
申请日：2016-05-03
申请人： Adiseshu Hari , Tirunell V. Lakshman
发明人： Adiseshu Hari , Tirunell V. Lakshman
IPC分类号： H04L29/06 , H04L29/12 , H04L29/08
CPC分类号： H04L63/10 , H04L61/1511 , H04L61/2007 , H04L61/2061 , H04L63/06 , H04L63/08 , H04L67/02 , H04L67/104 , H04W12/10
摘要： The present disclosure generally discloses an Internet security mechanism configured to provide security for Internet resources of the Internet using an Internet blockchain. The Internet blockchain may be configured to provide security for Internet resources of the Internet by supporting various types of verification related to Internet resources of the Internet, which may include verification of Internet resource ownership, verification of Internet resource transactions, and so forth. The Internet blockchain may be configured to enable Internet participants (e.g., Internet registries, Domain Name Service (DNS) entities, Autonomous Systems (ASes), or the like) to verify Internet resource ownership of Internet resources (e.g., Internet Protocol (IP) addresses, AS numbers, IP prefixes, DNS domain names, or the like) by Internet participants, to verify Internet resource transactions (e.g., allocation of IP addresses, allocation of AS numbers, advertisements of IP prefixes, allocation of DNS domain names, or the like) attempted by Internet participants, and so forth.

60. 发明申请

US20170195245A1 DATA PLANE FOR PROCESSING FUNCTION SCALABILITY 有权
公开(公告)号：US20170195245A1
公开(公告)日：2017-07-06
申请号：US14985652
申请日：2015-12-31
申请人： Randeep Bhatia , Fang Hao , Tirunell V. Lakshman , Harish Viswanathan
发明人： Randeep Bhatia , Fang Hao , Tirunell V. Lakshman , Harish Viswanathan
IPC分类号： H04L12/863 , H04L12/741 , H04L12/26
CPC分类号： H04L47/626 , H04L43/16 , H04L45/64 , H04L45/745 , H04L47/25 , H04L47/30 , H04L47/32 , H04L49/9036 , H04L49/9084
摘要： The present disclosure generally discloses a data plane configured for processing function scalability. The processing functions for which scalability is supported may include charging functions, monitoring functions, security functions, or the like.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式