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

71. 发明授权

US5951651A Packet filter system using BITMAP vector of filter rules for routing packet through network 失效
标题翻译：包过滤系统使用BITMAP向量的过滤规则，通过网络路由数据包
公开(公告)号：US5951651A
公开(公告)日：1999-09-14
申请号：US899423
申请日：1997-07-23
申请人： Tirunell V. Lakshman , Dimitrios Stiliadis
发明人： Tirunell V. Lakshman , Dimitrios Stiliadis
IPC分类号： H04L29/06 , H04J15/00 , G06F13/38
CPC分类号： H04L63/0263 , H04L29/06 , H04L45/742 , H04L69/22
摘要： A filter method for designating one of a plurality of packet filter rules contained in a router for routing a packet of information through a network, each packet characterized as having parameters, the method comprising: generating one or more partitioned sets, each partitioned set associated with a different packet parameter with each partition of a set having zero or more associated filter rules; generating a vector corresponding to each of the parameters, the vector defining structure indicating one or more potential filter rules to be applied; comparing each parameter of the received packet with each partition of a corresponding partitioned set and determining one or more potential filter rules to be applied to the packet for each parameter; and determining from each of the vectors one or more identical potential filter rules associated with each vector, one of the identical filter rules capable of being applied to the received packet, with the rule to be applied being the rule of greatest priority.
摘要翻译：一种过滤方法，用于指定包含在路由器中的多个分组过滤规则中的一个，用于通过网络路由信息分组，每个分组被表征为具有参数，所述方法包括：生成一个或多个分区集，每个分区集与不同的分组参数，其中具有零个或多个相关联的过滤规则的集合的每个分区; 生成与每个参数对应的向量，所述向量定义结构指示要应用的一个或多个潜在过滤规则; 将接收的分组的每个参数与对应的分区集的每个分区进行比较，并且确定要应用于每个参数的分组的一个或多个潜在过滤规则; 并且从每个向量确定与每个向量相关联的一个或多个相同的电势滤波器规则，能够被应用于所接收的分组的相同的过滤规则中的一个，要应用的规则是最优先的规则。

72. 发明授权

US08953432B2 Softrouter dynamic binding protocol 有权
标题翻译： Softrouter动态绑定协议
公开(公告)号：US08953432B2
公开(公告)日：2015-02-10
申请号：US11147491
申请日：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 , H04L12/721 , H04L12/751 , H04L12/707 , H04L12/703 , H04L12/773
CPC分类号： H04L45/26 , H04L45/02 , H04L45/22 , H04L45/28 , H04L45/60
摘要： A dynamic binding protocol has three tasks that run in parallel: discovery, association, and operation. During discovery, control elements (CEs) and forwarding elements (FEs) learn about immediate neighbors and CEs in a SoftRouter network that has separate control and data planes. During association, FEs associate with CEs and are configured with basic parameters, such as IP interface addresses, hostnames, and the like. During operation, failover and packet tunneling between CEs and FEs is handled.
摘要翻译：动态绑定协议具有并行运行的三个任务：发现，关联和操作。在发现期间，控制元件（CE）和转发元件（FE）可以了解具有单独控制和数据平面的SoftRouter网络中的直接邻居和CE。在关联期间，FE与CE相关联，并配置有基本参数，如IP接口地址，主机名等。在操作期间，处理CE和FE之间的故障转移和数据包隧道。

73. 发明申请

US20140294392A1 HIGH-THROUGHPUT ROUTING IN AN OPTICAL NETWORK HAVING A MESH TOPOLOGY 有权
标题翻译：具有网格拓扑的光网络中的高通路径
公开(公告)号：US20140294392A1
公开(公告)日：2014-10-02
申请号：US13852328
申请日：2013-03-28
申请人： Peter J. Winzer , Kodialam Murali , Tirunell V. Lakshman
发明人： Peter J. Winzer , Kodialam Murali , Tirunell V. Lakshman
IPC分类号： H04J14/02
CPC分类号： H04J14/0284 , H04J14/0201 , H04J14/0227 , H04J14/0257 , H04J14/0267 , H04L45/121 , H04L45/62 , H04L45/64
摘要： An optical routing scheme in which an optical network having a mesh topology is configured to route optical packets through an optical routing layout superimposable with the mesh topology, but having a star-like topology. Using this routing layout, the optical network can be configured to transport optical packets from respective ingress nodes, through the hub node located at the star center, to respective egress nodes in a manner that enables a data throughput that approaches the theoretical capacity. No special hardware is required for implementing the hub functionality, and any node of the optical network can be configured to serve as the hub node. The latter feature enables relatively straightforward optimization of the optical routing layout and transmission schedule, e.g., by changing the identity of the hub node and adjusting the transmission schedule at the ingress nodes to synchronize packet arrivals to the hub node.
摘要翻译：一种光路由方案，其中具有网状拓扑的光网络被配置为通过与网状拓扑重叠但具有星形拓扑的光路由布局路由光分组。使用该路由布局，光网络可以被配置为以使得能够接近理论容量的数据吞吐量的方式将来自相应入口节点的光分组传输到位于星中心的集线器节点到相应出口节点。实现集线器功能不需要特殊硬件，光网络的任何节点都可以配置为集线器节点。后者的特征使得可以例如通过改变集线器节点的身份并调整入口节点处的传输调度以使分组到达中心到集线器节点而使光路由布局和传输调度相对简单的优化。

74. 发明授权

US08566373B2 Probabilistic fingerprint checking for preventing data leakage 有权
标题翻译：用于防止数据泄漏的概率指纹检查
公开(公告)号：US08566373B2
公开(公告)日：2013-10-22
申请号：US13367441
申请日：2012-02-07
申请人： Fang Hao , Krishna P. Puttaswamy Naga , Murali Kodialam , Tirunell V. Lakshman
发明人： Fang Hao , Krishna P. Puttaswamy Naga , Murali Kodialam , Tirunell V. Lakshman
IPC分类号： G06F17/30
CPC分类号： G06F17/30109 , G06F21/6236
摘要： A data-leakage prevention capability is presented herein. The data-leakage prevention capability prevents leakage of data, of a file set having a plurality of files, from a secure network using online fingerprint checking of data flows at a boundary of the secure network. The online fingerprint checking is performed using a set of data structures configured for the file set. The data structures for the file set are configured based on file set characteristics information of the file set and a target detection lag indicative of a maximum number of bits within which a data leakage event for the file set is to be determined. The data structure configuration is computed for a plurality of data structures configured for use in monitoring the files of the file set. The data structure configuration includes a plurality of data structure locations and data structure sizes for the respective plurality of data structures.
摘要翻译：本文介绍了数据泄漏防护功能。数据泄漏防止能力通过使用在安全网络的边界上的数据流的在线指纹检查来防止来自安全网络的具有多个文件的文件组的数据的泄漏。使用为文件集配置的一组数据结构来执行在线指纹检查。文件集的数据结构是基于文件集的文件集特征信息和指示要确定文件集的数据泄漏事件的最大位数的目标检测滞后来配置的。为配置为用于监视文件集文件的多个数据结构计算数据结构配置。数据结构配置包括用于各个多个数据结构的多个数据结构位置和数据结构大小。

75. 发明申请

US20130204903A1 PROBABILISTIC FINGERPRINT CHECKING FOR PREVENTING DATA LEAKAGE 有权
标题翻译：用于防止数据泄漏的指纹指纹检查
公开(公告)号：US20130204903A1
公开(公告)日：2013-08-08
申请号：US13367441
申请日：2012-02-07
申请人： Fang Hao , Krishna P. Puttaswamy Naga , Murali Kodialam , Tirunell V. Lakshman
发明人： Fang Hao , Krishna P. Puttaswamy Naga , Murali Kodialam , Tirunell V. Lakshman
IPC分类号： G06F7/00
CPC分类号： G06F17/30109 , G06F21/6236
摘要： A data-leakage prevention capability is presented herein. The data-leakage prevention capability prevents leakage of data, of a file set having a plurality of files, from a secure network using online fingerprint checking of data flows at a boundary of the secure network. The online fingerprint checking is performed using a set of data structures configured for the file set. The data structures for the file set are configured based on file set characteristics information of the file set and a target detection lag indicative of a maximum number of bits within which a data leakage event for the file set is to be determined. The data structure configuration is computed for a plurality of data structures configured for use in monitoring the files of the file set. The data structure configuration includes a plurality of data structure locations and data structure sizes for the respective plurality of data structures.
摘要翻译：本文介绍了数据泄漏防护功能。数据泄漏防止能力通过使用在安全网络的边界上的数据流的在线指纹检查来防止来自安全网络的具有多个文件的文件组的数据的泄漏。使用为文件集配置的一组数据结构来执行在线指纹检查。文件集的数据结构是基于文件集的文件集特征信息和指示要确定文件集的数据泄漏事件的最大位数的目标检测滞后来配置的。为配置为用于监视文件集文件的多个数据结构计算数据结构配置。数据结构配置包括用于各个多个数据结构的多个数据结构位置和数据结构大小。

76. 发明授权

US08054760B2 Line-rate, real-time-traffic detector 有权
标题翻译：线速率，实时流量检测器
公开(公告)号：US08054760B2
公开(公告)日：2011-11-08
申请号：US12543529
申请日：2009-08-19
申请人： Fang Hao , Murali Kodialam , Tirunell V. Lakshman
发明人： Fang Hao , Murali Kodialam , Tirunell V. Lakshman
IPC分类号： G01R31/08
CPC分类号： H04L41/142 , H04L47/19 , H04L47/2416 , H04L47/2441 , H04L65/80
摘要： A line-rate, real-time-traffic detector classifies a network traffic flow as real-time when it determines the smoothness of the packet arrival rate of the network traffic flow is bounded by an empirically derived bound. In some embodiments, to improve performance, a tighter smoothness bound is applied to the smoothness calculations performed on a first set of packet arrival times, while a looser smoothness bound is applied to a second set of packet arrival times, the second set inclusive of and larger than the first.
摘要翻译：线速率实时业务检测器在确定网络业务流的分组到达速率由经验导出的边界限定时的平滑度时，将网络流量流分类为实时。在一些实施例中，为了提高性能，对于在第一组分组到达时间上执行的平滑度计算应用更紧密的平滑度约束，而将更松散的平滑度约束应用于第二组分组到达时间，第二组包括和大于第一。

77. 发明授权

US08045453B2 Methods and systems for alleviating congestion in a connection-oriented data network 有权
标题翻译：减轻面向连接数据网络拥塞的方法和系统
公开(公告)号：US08045453B2
公开(公告)日：2011-10-25
申请号：US11139692
申请日：2005-05-31
申请人： Naeem Asghar , Randeep S. Bhatia , Rakesh Chandwani , Colin Corcoran, Jr. , Fang Hao , Joseph Karwisch , Pramod V. N. Koppol , Tirunell V. Lakshman , Michael P. Siesta , Stephen M. Zlatos
发明人： Naeem Asghar , Randeep S. Bhatia , Rakesh Chandwani , Colin Corcoran, Jr. , Fang Hao , Joseph Karwisch , Pramod V. N. Koppol , Tirunell V. Lakshman , Michael P. Siesta , Stephen M. Zlatos
IPC分类号： H04L12/26
CPC分类号： H04L41/147 , H04L41/145
摘要： Congestion in connection-oriented data networks is alleviated by simulating the rerouting of circuits to uncongested parts of the network and then rerouting such circuits in a manner that causes little, or no, disruption to other parts of the network.
摘要翻译：通过模拟将电路重新路由到网络中的未占用部分，然后以对网络其他部分造成很少或没有干扰的方式重新路由这些电路，可以缓解面向连接的数据网络中的拥塞。

78. 发明授权

US08027245B2 Efficient and robust routing of potentially-variable traffic for path restoration following link failure 有权
标题翻译：链路故障后路径恢复的潜在可变流量的高效鲁棒路由
公开(公告)号：US08027245B2
公开(公告)日：2011-09-27
申请号：US11141705
申请日：2005-05-31
申请人： 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
摘要： In one embodiment, a method for supporting recovery from failure of a path in a network of nodes interconnected by links. An intermediate node between an ingress point and an egress point of the network is selected to minimize the sum of (i) a capacity constraint between the ingress point and the intermediate node and (ii) a capacity constraint between the intermediate node and the egress point. The selection identifies two link-disjoint path sets, each comprising a backup path and at least one primary path, with a first path set between the ingress point and the intermediate node, and a second path set between the intermediate node and the egress point. To maximize network throughput, packets are routed in two phases, first to the intermediate node via the first path set in predetermined proportions, and then from the intermediate node to the final destination via the second path set.
摘要翻译：在一个实施例中，一种用于支持通过链路互连的节点网络中的路径故障恢复的方法。选择网络的入口点和出口点之间的中间节点以最小化（i）入口点和中间节点之间的容量约束的和，以及（ii）中间节点和出口点之间的容量约束。所述选择识别两个链路不相交路径集，每个链路不相交路径集合包括备用路径和至少一个主路径，其中在入口点和中间节点之间设置第一路径，以及在中间节点和出口点之间设置的第二路径。为了最大化网络吞吐量，分组以两个阶段路由，首先通过以预定比例设置的第一路径，然后经由第二路径集从中间节点到最终目的地路由到中间节点。

79. 发明授权

US07978594B2 Efficient and robust routing of potentially-variable traffic with local restoration against link failures 有权
标题翻译：对链路故障进行本地恢复的潜在可变流量的高效且可靠的路由
公开(公告)号：US07978594B2
公开(公告)日：2011-07-12
申请号：US11141372
申请日：2005-05-31
申请人： Muralidharan S. Kodialam , Tirunell V. Lakshman , Sudipta Sengupta
发明人： Muralidharan S. Kodialam , Tirunell V. Lakshman , Sudipta Sengupta
IPC分类号： H04L12/56
CPC分类号： H04L45/12 , H04L45/04 , H04L45/24 , H04L47/125
摘要： In one embodiment, a method for supporting recovery from failure of a link in a network of nodes interconnected by links. An intermediate node between an ingress point and an egress point of the network is selected to minimize the sum of (i) a capacity constraint between the ingress point and the intermediate node and (ii) a capacity constraint between the intermediate node and the egress point. The selection identifies two path structures, each comprising a primary path and one or more link backup detours protecting each link on the primary path, with a first path structure between the ingress point and the intermediate node, and a second path structure between the intermediate node and the egress point. To maximize network throughput, packets are routed in two phases, first to the intermediate node via the first path structure in predetermined proportions, and then from the intermediate node to the final destination via the second path structure.
摘要翻译：在一个实施例中，一种用于支持通过链路互连的节点网络中的链路故障的恢复的方法。选择网络的入口点和出口点之间的中间节点以最小化（i）入口点和中间节点之间的容量约束的和，以及（ii）中间节点和出口点之间的容量约束。所述选择识别两个路径结构，每个路径结构包括主路径和保护主路径上的每个链路的一个或多个链路备用绕路，其中入口点和中间节点之间的第一路径结构以及中间节点之间的第二路径结构和出口点。为了最大化网络吞吐量，分组以两个阶段路由，首先通过第一路径结构以预定比例，然后经由第二路径结构从中间节点到最终目的地路由到中间节点。

80. 发明授权

US07715382B2 Softrouter 有权
标题翻译：软路人
公开(公告)号：US07715382B2
公开(公告)日：2010-05-11
申请号：US11147642
申请日：2005-06-08
申请人： Tirunell V. Lakshman , Thyagarajan Nandagopal , Ramachandran Ramjee , Krishan K. Sabnani , Thomas Y. Woo
发明人： Tirunell V. Lakshman , Thyagarajan Nandagopal , Ramachandran Ramjee , Krishan K. Sabnani , Thomas Y. Woo
IPC分类号： H04L12/56
CPC分类号： H04L45/28 , H04L45/04 , H04L45/22 , H04L45/60
摘要： The SoftRouter architecture separates the implementation of control plane functions from packet forwarding functions. In this architecture, all control plane functions are implemented on general purpose servers called the control elements (CEs) that may be multiple hops away from the forwarding elements (FEs). A network element (NE) or a router is formed using dynamic binding between the CEs and the FEs. The flexibility of the SoftRouter architecture over conventional routers with collocated and tightly integrated control and forwarding functions results in increased reliability, increased scalability, increased security, ease of adding new functionality, and decreased cost.
摘要翻译： SoftRouter架构将控制平面功能的实现与数据包转发功能分开。在这种架构中，所有控制平面功能都在通用服务器上实现，称为可能与转发元件（FE）之间多跳的控制元件（CE）。使用CE和FE之间的动态绑定形成网元（NE）或路由器。 SoftRouter架构与具有并置且紧密集成的控制和转发功能的传统路由器的灵活性相结合，可提高可靠性，增加可扩展性，增加安全性，增加新功能以及降低成本。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式