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

31. 发明授权

US07359384B2 Scheduling of guaranteed-bandwidth low-jitter traffic in input-buffered switches 失效
标题翻译：在输入缓冲交换机中调度保证带宽低抖动流量
公开(公告)号：US07359384B2
公开(公告)日：2008-04-15
申请号：US10348385
申请日：2003-01-21
申请人： Muralidharan S. Kodialam , Tirunell V. Lakshman , Dimitrios Stiliadis
发明人： Muralidharan S. Kodialam , Tirunell V. Lakshman , Dimitrios Stiliadis
IPC分类号： H04L12/56
CPC分类号： H04L47/521 , H04L47/28 , H04L47/50 , H04L47/56 , H04L49/254
摘要： A switch schedules guaranteed-bandwidth, low-jitter-traffic characterized by a guaranteed rate table (GRT) method. A rate matrix generated from collected provisioning information is decomposed into schedule tables by a low jitter (LJ) decomposition method. The LJ decomposition method imposes a set of constraints for the schedule tables: schedule tables are partial permutation matrices, weighted sum of the partial permutation matrices is greater than or equal to the weighted sum of the rate matrix, and each entry in the rate matrix belongs to one element of the LJ decomposition schedule matrices. An integer LJ decomposition programming problem is employed to generate the schedule tables that are scheduled for each time slot of the period of the switch. Schedule tables are selected in turn based upon selecting eligible tables having the earliest finishing time. If necessary, the rate matrix is updated prior to decomposition for a subsequent period.
摘要翻译：交换机调度保证带宽，低抖动流量，其特征在于保证速率表（GRT）方法。从收集的配置信息生成的速率矩阵通过低抖动（LJ）分解方法分解为调度表。 LJ分解方法对调度表施加一组约束：调度表是部分置换矩阵，部分置换矩阵的加权和大于或等于速率矩阵的加权和，并且速率矩阵中的每个条目都属于到LJ分解调度矩阵的一个元素。采用整数LJ分解编程问题来生成为交换周期的每个时隙调度的调度表。根据选择具有最早完成时间的合格表，依次选择计划表。如果需要，速率矩阵在分解之前在随后的时间段内被更新。

32. 发明授权

US06996065B2 Dynamic backup routing of network tunnel paths for local restoration in a packet network 有权
标题翻译：网络隧道路径的动态备份路由，用于分组网络中的本地恢复
公开(公告)号：US06996065B2
公开(公告)日：2006-02-07
申请号：US09899508
申请日：2001-07-05
申请人： Muralidharan S. Kodialam , Tirunell V. Lakshman
发明人： Muralidharan S. Kodialam , Tirunell V. Lakshman
IPC分类号： G01R31/08
CPC分类号： H04L45/28 , H04L45/12 , H04L45/123 , H04L45/22
摘要： A packet network of interconnected nodes employing dynamic backup routing of a Network Tunnel Path (NTP) allocates an active and backup path to the NTP based upon detection of a network failure. Dynamic backup routing employs local restoration to determine the allocation of, and, in operation, to switch between, a primary/active path and a secondary/backup path. Switching from the active path is based on a backup path determined with iterative shortest-path computations with link weights assigned based on the cost of using a link to backup a given link. Costs may be assigned based on single-link failure or single element (node or link) failure. Link weights are derived by assigning usage costs to links for inclusion in a backup path, and minimizing the costs with respect to a predefined criterion.
摘要翻译：采用网络隧道路径（NTP）的动态备份路由的互连节点的分组网络基于网络故障的检测，为NTP分配活动和备用路径。动态备份路由使用本地恢复来确定主/主路径和辅助/备用路径之间的切换和运行。从活动路径切换基于通过迭代最短路径计算确定的备份路径，其中链路权重基于使用链接备份给定链路的成本而分配。可以基于单链路故障或单个元件（节点或链路）故障分配成本。链路权重是通过将使用成本分配给用于包含在备份路径中的链接而导致的，并且使得相对于预定义准则最小化成本。

33. 发明授权

US09100266B2 SoftRouter protocol failovers 有权
标题翻译： SoftRouter协议故障转移
公开(公告)号：US09100266B2
公开(公告)日：2015-08-04
申请号：US11147665
申请日：2005-06-08
申请人： Furquan Ahmed Ansari , Tirunell V. Lakshman , Thyagarajan Nandagopal , Ramachandran Ramjee , Thomas Y. Woo
发明人： Furquan Ahmed Ansari , Tirunell V. Lakshman , Thyagarajan Nandagopal , Ramachandran Ramjee , Thomas Y. Woo
IPC分类号： H04L12/701 , H04L12/70
CPC分类号： H04L45/00 , H04L2012/5627
摘要： 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. There is a protocol failover mechanism for handling failovers initiated by FEs to transfer control from one CE to another CE.
摘要翻译： SoftRouter架构将控制平面功能的实现与数据包转发功能分开。在这种架构中，所有控制平面功能都在通用服务器上实现，称为可能与转发元件（FE）之间多跳的控制元件（CE）。使用CE和FE之间的动态绑定形成网元（NE）或路由器。有一个协议故障转移机制，用于处理FE发起的故障转移，将控制从一个CE传输到另一个CE。

34. 发明授权

US09014181B2 Softrouter separate control network 有权
标题翻译： Softrouter单独控制网络
公开(公告)号：US09014181B2
公开(公告)日：2015-04-21
申请号：US11147937
申请日：2005-06-08
申请人： Tirunell V. Lakshman , Krishan K. Sabnani , Thomas Y. Woo
发明人： Tirunell V. Lakshman , Krishan K. Sabnani , Thomas Y. Woo
IPC分类号： H04L12/50 , H04L12/703 , H04L12/715 , H04L12/721 , H04L12/707 , H04L12/773
CPC分类号： H04L45/28 , H04L45/04 , H04L45/123 , H04L45/22 , H04L45/60
摘要： An embodiment of the exemplary SoftRouter architecture includes two physically separate networks, a control plane network and a data plane network. The data plane network is one physical network for the data traffic, while the control plane network is another physical network for the control traffic. The topology of the data plane network is made up of interconnected forwarding elements (FEs). The topology of the control plane network is made up interconnected control elements (CEs). This physical independence of the control plane network from the data plane network provides for a secure mechanism to communicate among the CEs in the control plane network. In addition, this physical independence provides improved reliability and improved scalability, when compared to the traditional router architecture, where control plane message are in-band with the data plane.
摘要翻译：示例性SoftRouter架构的实施例包括两个物理上分离的网络，控制平面网络和数据平面网络。数据平面网络是数据流量的一个物理网络，而控制平面网络则是控制流量的另一个物理网络。数据平面网络的拓扑结构由互连转发元素（FE）组成。控制平面网络的拓扑结构由互连的控制元件（CE）组成。控制平面网络与数据平面网络的这种物理独立性为安全机制提供了在控制平面网络中的CE之间进行通信。此外，与传统路由器架构相比，这种物理独立性提供了改进的可靠性和改进的可扩展性，其中控制平面消息与数据平面内嵌。

35. 发明申请

US20140089506A1 SECURING SOFTWARE DEFINED NETWORKS VIA FLOW DEFLECTION 有权
标题翻译：通过流量偏移来保护软件定义的网络
公开(公告)号：US20140089506A1
公开(公告)日：2014-03-27
申请号：US13627003
申请日：2012-09-26
申请人： Krishna P. Puttaswamy Naga , Fang Hao , Tirunell V. Lakshman
发明人： Krishna P. Puttaswamy Naga , Fang Hao , Tirunell V. Lakshman
IPC分类号： G06F15/173
CPC分类号： H04L47/80 , H04L12/4641 , H04L45/42 , H04L45/50 , H04L45/64 , H04L45/7457 , H04L63/1458 , H04L63/20
摘要： A flow deflection capability is provided for deflecting data flows within a Software Defined Network (SDN) in order to provide security for the SDN. A flow forwarding rule is generated for a first network element of the SDN based on detection of a condition (e.g., TCAM utilization condition, CPU utilization condition, or the like) associated with the first network element. The flow forwarding rule is generated by a control element of the SDN or the first network element of the SDN. The flow forwarding rule is indicative that at least a portion of new flow requests received at the first network element are to be forwarded from the first network element to a second network element of the SDN. The flow forwarding rule may specify full flow deflection or selective flow deflection.
摘要翻译：提供流量偏转能力用于偏转软件定义网络（SDN）内的数据流，以便为SDN提供安全性。基于与第一网元相关联的条件（例如，TCAM利用条件，CPU利用条件等）的检测，为SDN的第一网元生成流转发规则。流转发规则由SDN的控制元素或SDN的第一网元生成。流转发规则指示在第一网元接收到的新流请求的至少一部分将从第一网元转发到SDN的第二网元。流量转移规则可以指定全流量偏转或选择性流量偏转。

36. 发明授权

US08194535B2 Efficient and robust routing of potentially-variable traffic in IP-over-optical networks with resiliency against router failures 有权
标题翻译：在具有针对路由器故障的弹性的IP-over-optical网络中，潜在可变流量的高效且可靠的路由
公开(公告)号：US08194535B2
公开(公告)日：2012-06-05
申请号：US11141257
申请日：2005-05-31
申请人： Muralidharan S. Kodialam , Tirunell V. Lakshman , Sudipta Sengupta
发明人： Muralidharan S. Kodialam , Tirunell V. Lakshman , Sudipta Sengupta
IPC分类号： G01R31/08
CPC分类号： H04L45/12 , H04L45/04 , H04L45/24 , H04L47/125
摘要： In one embodiment, a method for supporting recovery from failure of a node in a network of nodes interconnected by links A set of two or more intermediate nodes (excluding the failed node) between an ingress point and an egress point is selected. Next, based on available bandwidth of the network, a non-zero fraction of the service level to route from the ingress point to each intermediate node is determined. Packets are then routed in two phases by: (1) determining one or more paths from the ingress point to each intermediate node for routing the corresponding fraction of the service level, and (2) determining one or more paths from each intermediate node to the egress point for routing the corresponding fraction of the service level.
摘要翻译：在一个实施例中，选择用于支持通过链路互连的节点网络中的节点从在入口点和出口点之间的两个或多个中间节点（不包括故障节点）组成的恢复的方法。接下来，基于网络的可用带宽，确定从入口点到每个中间节点路由的服务级别的非零分数。然后，分组通过以下两个阶段路由分组：（1）确定从入口点到每个中间节点的一个或多个路径，用于路由服务级别的相应部分，以及（2）确定从每个中间节点到出口点用于路由服务级别的相应部分。

37. 发明申请

US20100266215A1 VARIABLE-STRIDE STREAM SEGMENTATION AND MULTI-PATTERN MATCHING 有权
标题翻译：可变条纹分段和多模式匹配
公开(公告)号：US20100266215A1
公开(公告)日：2010-10-21
申请号：US12425576
申请日：2009-04-17
申请人： Nan Hua , Tirunell V. Lakshman , Haoyu Song
发明人： Nan Hua , Tirunell V. Lakshman , Haoyu Song
IPC分类号： G06K9/72
CPC分类号： 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. 发明申请

US20100069074A1 WIRELESS-RESOURCE BROKER 审中-公开
标题翻译：无线资源经纪人
公开(公告)号：US20100069074A1
公开(公告)日：2010-03-18
申请号：US12209655
申请日：2008-09-12
申请人： Muralidharan S. Kodialam , Tirunell V. Lakshman
发明人： Muralidharan S. Kodialam , Tirunell V. Lakshman
IPC分类号： H04W72/00
CPC分类号： H04W28/16
摘要： In one embodiment, a wireless-resource broker employs a self-enforcing spectrum-sharing policy, e.g., the expected utility (e.g., rate) a user obtains by following the policy provided by the broker is not less than the expected utility that the user obtains by switching to some other strategy. Each user is associated with one or more transmitter-receiver pairs, e.g., a transmitter of a wireless device and a receiver of a base station in communication via a wireless channel. The broker receives, as input, user parameters characterizing one or more of the transmitters and/or receivers and resource parameters characterizing one or more available spectrum blocks. The broker solves a linear-programming problem to generate and transmit a recommended policy for one or more users. The policy for each user includes information such as the spectrum block(s) to which the user is assigned, the transmission power for the user, and the transmission rate for the user.
摘要翻译：在一个实施例中，无线资源代理使用自强制频谱共享策略，例如，用户通过遵循由代理提供的策略获得的预期效用（例如，速率）不小于用户所期望的效用通过切换到其他策略获得。每个用户与一个或多个发射机 - 接收机对相关联，例如无线设备的发射机和经由无线信道进行通信的基站的接收机。代理人接收表征一个或多个发射机和/或接收机的用户参数以及表征一个或多个可用频谱块的资源参数作为输入。经纪人解决了线性规划问题，为一个或多个用户生成和传送推荐的策略。每个用户的策略包括诸如用户所分配的频谱块，用户的发送功率和用户的传输速率等信息。

39. 发明授权

US07489638B2 Scheduling with delayed graphs for communication networks 有权
标题翻译：使用延迟图进行通讯网络的调度
公开(公告)号：US07489638B2
公开(公告)日：2009-02-10
申请号：US10820596
申请日：2004-04-08
申请人： Isaac Keslassy , Muralidharan S. Kodialam , Tirunell V. Lakshman , Dimitrios Stiliadis
发明人： Isaac Keslassy , Muralidharan S. Kodialam , Tirunell V. Lakshman , Dimitrios Stiliadis
IPC分类号： G01R31/08 , H04L12/28 , H04J15/00
CPC分类号： H04L47/10 , H04L47/50 , H04L47/52
摘要： A network of nodes interconnected by links, such as a wavelength division multiplexing (WDM) ring network, is modeled by a delayed graph in which propagation delay between nodes is accounted for. Given the delayed graph, a traffic matrix for an admissible traffic pattern is scheduled over a frame period. Scheduling of the traffic matrix formulates a set of scheduling constraints based on the delays and decomposes the traffic matrix into a set of transmission matrices. Each of the set of transmission matrices is scheduled over the frame period.
摘要翻译：通过诸如波分复用（WDM）环形网络的链路互连的节点网络由延迟图形建模，其中考虑节点之间的传播延迟。给定延迟图，在帧周期内调度用于允许的业务模式的业务矩阵。业务矩阵的调度基于延迟制定一组调度约束，并将业务矩阵分解成一组传输矩阵。在帧周期中调度传输矩阵集合中的每一个。

40. 发明授权

US07460487B2 Accelerated per-flow traffic estimation 有权
标题翻译：加速每流量流量估计
公开(公告)号：US07460487B2
公开(公告)日：2008-12-02
申请号：US10947072
申请日：2004-09-22
申请人： Fang Hao , Muralidharan S. Kodialam , Tirunell V. Lakshman
发明人： Fang Hao , Muralidharan S. Kodialam , Tirunell V. Lakshman
IPC分类号： H04L12/26
CPC分类号： H04L41/14 , H04L43/024 , H04L43/026 , H04L63/145
摘要： A method of estimating per-flow traffic in a network of nodes interconnected by links splits the incoming traffic stream to a node into a number of parallel sub-streams by flow assignment using a hash function. Since each flow in the incoming traffic stream constitutes a larger fraction of the traffic in its sub-stream, the probability of obtaining two-runs increases. The number of two-runs per flow is then employed to generate an estimate of the traffic of the flow.
摘要翻译：通过链路互连的节点网络估计每流量流量的方法通过使用散列函数的流分配将输入业务流分解成多个并行子流。由于进入业务流中的每个流量构成其子流中流量的较大部分，所以获得两次运行的概率增加。然后使用每个流的两次运行的数量来生成流量的流量的估计。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式