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

1. 发明申请

US20130212710A1 Data Leakage Prevention for Cloud and Enterprise Networks 有权
标题翻译：数据泄漏预防云和企业网络
公开(公告)号：US20130212710A1
公开(公告)日：2013-08-15
申请号：US13369475
申请日：2012-02-09
申请人： Krishna P. Puttaswamy Naga , Fang Hao , Muralidharan S. Kodialam , T.V. Lakshman
发明人： Krishna P. Puttaswamy Naga , Fang Hao , Muralidharan S. Kodialam , T.V. Lakshman
IPC分类号： G06F21/20
CPC分类号： H04L63/0245 , H04L9/3247 , H04L63/123
摘要： Apparatuses, methods and articles of manufacture for performing data leakage prevention are provided. Data leakage prevention may be performed by determining a signature of a transmitted document, the transmitted document being in transit to a location beyond a network boundary. The signature of the transmitted document is compared with one or more signatures of documents authorized to be transmitted beyond the network boundary. The transmitted document is prevented from being transmitted beyond the network boundary if the signature of the document does not correspond to a signature of a document authorized to be transmitted beyond the network boundary.
摘要翻译：提供了用于执行防止数据泄漏的设备，方法和制造。可以通过确定所发送的文档的签名，所发送的文档正在转移到超出网络边界的位置来执行数据泄露防止。将所发送的文档的签名与授权发送超出网络边界的文档的一个或多个签名进行比较。如果文档的签名不对应于被授权在网络边界之外被发送的文档的签名，则防止传输的文档被超出网络边界的传输。

2. 发明授权

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分解编程问题来生成为交换周期的每个时隙调度的调度表。根据选择具有最早完成时间的合格表，依次选择计划表。如果需要，速率矩阵在分解之前在随后的时间段内被更新。

3. 发明申请

US20080074238A1 Anonymous tracking using a set of wireless devices 有权
标题翻译：匿名跟踪使用一组无线设备
公开(公告)号：US20080074238A1
公开(公告)日：2008-03-27
申请号：US11824469
申请日：2007-06-29
申请人： Muralidharan S. Kodialam , Wing Cheong Lau , Thyagarajan Nandagopal
发明人： Muralidharan S. Kodialam , Wing Cheong Lau , Thyagarajan Nandagopal
IPC分类号： H04B7/00
CPC分类号： H04W24/00 , H04L41/0896 , H04L43/0882 , H04W74/08
摘要： In one embodiment, a method for estimating the number of tags in a set of tags in a system of tags and readers. The method includes, during each of a plurality of time intervals: (i) transmitting a command requesting that each tag that receives the command determine whether to transmit a reply; and (ii) receiving, in one or more timeslots of a frame corresponding to the time interval, replies from one or more tags. The method further includes providing an estimate of the number of tags in the set of one or more tags based on (i) timeslots in each of the plurality of time intervals that are zero timeslots, i.e., timeslots having no received reply, and (ii) the total number of timeslots in each frame.
摘要翻译：在一个实施例中，一种用于估计标签和读取器系统中的一组标签中的标签的数量的方法。该方法包括在多个时间间隔的每一个期间：（i）发送请求每个接收到该命令的标签的命令确定是否发送回复; 以及（ii）在与所述时间间隔对应的帧的一个或多个时隙中接收从一个或多个标签的答复。该方法还包括：基于（i）作为零时隙的多个时间间隔中的每一个中的时隙，即没有接收到的回复的时隙，提供一组或多个标签中的标签数量的估计，）每帧中的时隙总数。

4. 发明授权

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分配活动和备用路径。动态备份路由使用本地恢复来确定主/主路径和辅助/备用路径之间的切换和运行。从活动路径切换基于通过迭代最短路径计算确定的备份路径，其中链路权重基于使用链接备份给定链路的成本而分配。可以基于单链路故障或单个元件（节点或链路）故障分配成本。链路权重是通过将使用成本分配给用于包含在备份路径中的链接而导致的，并且使得相对于预定义准则最小化成本。

5. 发明授权

US06584071B1 Routing with service level guarantees between ingress-egress points in a packet network 有权
标题翻译：在分组网络中的入口到出口点之间进行业务级保证的路由
公开(公告)号：US06584071B1
公开(公告)日：2003-06-24
申请号：US09366620
申请日：1999-08-03
申请人： Muralidharan S. Kodialam , T. V. Lakshman
发明人： Muralidharan S. Kodialam , T. V. Lakshman
IPC分类号： H04L1256
CPC分类号： H04L45/50 , H04L45/02 , H04L45/10 , H04L45/12 , H04L45/122 , H04L45/124 , H04L45/302 , H04L45/308
摘要： A packet network of interconnected nodes employs a method of routing with service level guarantees to determine a path through the network for a requested label-switched path (LSP). Each of the nodes includes one or more routers that forward packets based on a forwarding table constructed from paths determined in accordance with the method of routing with service level guarantees. The method of routing with service level guarantees determines the path of the requested LSP based on the effect that routing those packets of the requested LSP may have on current and/or future demands on the capacity of network nodes for currently provisioned LSPs. Such method of routing with service level guarantees may not necessarily route packets of a requested LSP along the shortest path, or minimum number of hops, through the network. Given the packet network and LSP request, a linear programming system may be defined by a set of linear programming equations for a non-split demand case. The linear programming system is based on the network topology, the values of the ingress-egress point pair o and t and demand bd of the LSP request, and the total maxflow values of the existing ingress-egress point pair for currently provisioned LSPs. To estimate the solution for the linear programming system, a subnetwork is formed using link weights and links removed that cannot support the requested demand. Link weights are calculated based on the critical links of a pseudo-network in which increased maximum flow along existing paths between ingress-egress point pairs is maintained. A shortest path routing algorithm may then be employed to generate a path, if available, for the LSP request using the subnetwork with the calculated link weights.
摘要翻译：互连节点的分组网络采用使用服务级别保证进行路由的方法，以针对所请求的标签交换路径（LSP）确定通过网络的路径。每个节点包括一个或多个路由器，其基于由根据具有服务级别保证的路由方法确定的路径构建的转发表来转发分组。基于服务级保证路由的方法基于所请求的LSP的这些分组的路由可能对当前和/或将来对当前配置的LSP的网络节点的容量的需求的影响来确定所请求的LSP的路径。这种使用服务级别保证的路由方法可能不一定通过网络沿着最短路径或最小跳数来路由所请求的LSP的分组。给定分组网络和LSP请求，可以通过用于非分裂需求情况的一组线性规划方程来定义线性规划系统。线性规划系统基于网络拓扑，入口出口点对o和t的值以及LSP请求的需求bd以及当前配置的LSP的现有入口出口对的总最大流量值。为了估计线性规划系统的解决方案，使用不能支持请求的需求的链路权重和链路去除形成子网络。基于伪网络的关键链路来计算链路权重，其中保持了入口到出站对之间沿现有路径的最大流量增加。然后可以采用最短路径路由算法来生成使用具有计算的链路权重的子网络的LSP请求的路径（如果可用）。

6. 发明授权

US06538991B1 Constraint-based routing between ingress-egress points in a packet network 有权
标题翻译：分组网络中出入口点之间的基于约束的路由
公开(公告)号：US06538991B1
公开(公告)日：2003-03-25
申请号：US09366619
申请日：1999-08-03
申请人： Muralidharan S. Kodialam , T. V. Lakshman
发明人： Muralidharan S. Kodialam , T. V. Lakshman
IPC分类号： H04L1256
CPC分类号： H04L47/825 , H04L41/5003 , H04L41/5025 , H04L45/00 , H04L45/14 , H04L45/302 , H04L45/308 , H04L45/50 , H04L47/15 , H04L47/70 , H04L47/724 , H04L47/781 , H04L47/783 , H04L47/822 , H04L47/823 , H04L47/829
摘要： A packet network of interconnected nodes employs a constraint-based routing method to determine a path through the network for a requested label-switched path (LSP). Each of the nodes includes one or more routers that forward packets based on a forwarding table constructed from paths determined in accordance with the constraint-based routing method. The constraint-based method determines the path of the requested LSP based on the effect that routing those packets of the requested LSP may have on current and/or future demands on the capacity of network nodes for currently provisioned LSPs. Such constraint-based routing method may not necessarily route packets of a requested LSP along the shortest path, or minimum number of hops, through the network. Given the packet network and LSP request, a linear programming system is defined by a set of linear programming equations. The linear programming system is based on the network topology, the values of the ingress-egress point pair o and t and demand bd of the LSP request, and the total maxflow values of the existing ingress-egress point pair for currently provisioned LSPs. The solution is estimated for a linear programming system of either split demand, non-split demand, or batch demand implementations for routing packets of the LSP. The constraint-based routing method may solve the linear programming system using common linear programming techniques.
摘要翻译：互连节点的分组网络采用基于约束的路由方法来确定针对所请求的标签交换路径（LSP）的通过网络的路径。每个节点包括一个或多个路由器，其基于由根据基于约束的路由方法确定的路径构建的转发表来转发分组。基于约束的方法基于所请求的LSP的这些分组的路由可能对当前和/或将来对当前配置的LSP的网络节点的容量的需求的影响来确定所请求的LSP的路径。这种基于约束的路由方法可能不一定通过网络沿着最短路径或最小跳数来路由请求的LSP的分组。给定分组网络和LSP请求，线性规划系统由一组线性规划方程定义。线性规划系统基于网络拓扑，入口出口点对o和t的值以及LSP请求的需求bd以及当前配置的LSP的现有入口出口对的总最大流量值。该解决方案针对用于路由LSP的分组的分组需求，非分裂需求或批量需求实现的线性规划系统进行估计。基于约束的路由方法可以使用公共线性规划技术来解决线性规划系统。

7. 发明申请

US20130060601A1 PRIVACY-PRESERVING ADVERTISEMENT TARGETING USING RANDOMIZED PROFILE PERTURBATION 审中-公开
标题翻译：隐私保护使用随机配置文件的广告策略
公开(公告)号：US20130060601A1
公开(公告)日：2013-03-07
申请号：US13225878
申请日：2011-09-06
申请人： Muralidharan S. Kodialam , Tirunell V. Lakshman , Sarit Mukherjee
发明人： Muralidharan S. Kodialam , Tirunell V. Lakshman , Sarit Mukherjee
IPC分类号： G06Q30/00
CPC分类号： 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.
摘要翻译：用于向用户展示广告的广告的分发和调度系统，并且在不了解用户简档信息的情况下最大化服务提供商收入。每个用户设备存储用户简档，并且预先加载可能在时隙期间显示的一组广告。每个用户设备根据用户配置文件选择并显示广告，但不将所选广告标识给服务提供商。相反，用户设备以布尔向量的形式提供扰动的用户简档信息，服务提供商结合保证近似在线算法来估计看到特定广告的用户数量。因此，服务提供商可以在不知道用户的个人资料或哪些广告被个人用户查看的情况下向广告客户收取广告的次数，并且用户可以在维护来自服务提供商的隐私的同时查看有针对性的广告。

8. 发明授权

US08299900B2 Anonymous tracking using a set of wireless devices 有权
标题翻译：匿名跟踪使用一组无线设备
公开(公告)号：US08299900B2
公开(公告)日：2012-10-30
申请号：US11824469
申请日：2007-06-29
申请人： Muralidharan S. Kodialam , Wing Cheong Lau , Thyagarajan Nandagopal
发明人： Muralidharan S. Kodialam , Wing Cheong Lau , Thyagarajan Nandagopal
IPC分类号： H04Q5/22
CPC分类号： H04W24/00 , H04L41/0896 , H04L43/0882 , H04W74/08
摘要： In one embodiment, a method for estimating the number of tags in a set of tags in a system of tags and readers. The method includes, during each of a plurality of time intervals: (i) transmitting a command requesting that each tag that receives the command determine whether to transmit a reply; and (ii) receiving, in one or more timeslots of a frame corresponding to the time interval, replies from one or more tags. The method further includes providing an estimate of the number of tags in the set of one or more tags based on (i) timeslots in each of the plurality of time intervals that are zero timeslots, i.e., timeslots having no received reply, and (ii) the total number of timeslots in each frame.
摘要翻译：在一个实施例中，一种用于估计标签和读取器系统中的一组标签中的标签的数量的方法。该方法包括在多个时间间隔的每一个期间：（i）发送请求每个接收到该命令的标签的命令确定是否发送回复; 以及（ii）在与所述时间间隔对应的帧的一个或多个时隙中接收从一个或多个标签的答复。该方法还包括：基于（i）作为零时隙的多个时间间隔中的每一个中的时隙，即没有接收到的回复的时隙，提供一组或多个标签中的标签数量的估计，）每帧中的时隙总数。

9. 发明授权

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子滤波器。可以检测到假阳性匹配，并使用片外基于散列的前缀表检索真正匹配的下一跳信息。

10. 发明授权

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.
摘要翻译：一种用于在确保它们通过一个或多个预定中间节点之后将流量分组路由到其目的地的方案，从而允许所有允许的业务模式在不了解业务矩阵的情况下被处理，而不受边缘链路容量限制。在一个实施例中，接收到对于在入口点和出口点之间路由数据的服务需求的路径的请求。选择入口点和出口点之间的两个或多个中间节点的集合。基于网络的带宽，确定从入口点向中间节点集合中的每个节点发送的数据的各个分数。将数据以确定的各个分数从入口点路由到中间节点集合中的每个节点，并从中间节点集合的每个节点路由到出口点。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式