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

1. 发明申请

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）作为零时隙的多个时间间隔中的每一个中的时隙，即没有接收到的回复的时隙，提供一组或多个标签中的标签数量的估计，）每帧中的时隙总数。

2. 发明授权

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）作为零时隙的多个时间间隔中的每一个中的时隙，即没有接收到的回复的时隙，提供一组或多个标签中的标签数量的估计，）每帧中的时隙总数。

3. 发明授权

US07660315B2 Characterizing achievable flow rates in multi-hop mesh networks with orthogonal channels 有权
标题翻译：表征具有正交信道的多跳网状网络中可实现的流量
公开(公告)号：US07660315B2
公开(公告)日：2010-02-09
申请号：US11194748
申请日：2005-08-01
申请人： Muralidharan S. Kodialam , Thyagarajan Nandagopal
发明人： Muralidharan S. Kodialam , Thyagarajan Nandagopal
IPC分类号： H04L12/28 , H04L12/56
CPC分类号： H04L47/14 , H04W40/02
摘要： A method of routing data in a multi-hop network. In one embodiment, the method includes: determining that a link-flow vector representing a set of flows to be routed from a source to a destination node satisfies necessary scheduling conditions for achievability; generating a scheduling multi-graph having at least one pair of nodes with multiple edges therebetween; deriving one or more sufficient scheduling conditions for achievability of the vector; solving a linear optimization problem over the necessary scheduling conditions to obtain an upper bound on achievability of the vector; and generating, based on the scheduling multi-graph, a routing solution that is a lower bound on the achievability of the vector and has a set of routes and associated schedule for achieving the vector. At least one node v receives transmissions from a specified plurality Ω(v) of other nodes. At least one of the scheduling conditions depends on Ω(v).
摘要翻译：一种在多跳网络中路由数据的方法。在一个实施例中，该方法包括：确定表示要从源到目的地节点路由的一组流的链路流向量满足可实现性的必要调度条件; 生成具有其间具有多个边缘的至少一对节点的调度多图; 得出一个或多个足够的调度条件以实现向量的可实现性; 在必要的调度条件下解决线性优化问题，以获得向量的可实现性的上限; 并且基于调度多图生成作为向量的可实现性的下限的路由解决方案，并且具有用于实现向量的一组路由和相关调度。至少一个节点v接收来自其他节点的指定的多个Ω（v）的传输。调度条件中的至少一个取决于Omega（v）。

4. 发明授权

US07688180B2 Estimation of the cardinality of a set of wireless devices 失效
标题翻译：估计一套无线设备的基数
公开(公告)号：US07688180B2
公开(公告)日：2010-03-30
申请号：US11525339
申请日：2006-09-22
申请人： Muralidharan S. Kodialam , Thyagarajan Nandagopal
发明人： Muralidharan S. Kodialam , Thyagarajan Nandagopal
IPC分类号： H04Q5/22
CPC分类号： G06K7/10029 , H04W24/00 , H04W74/04
摘要： In one embodiment, a method for estimating the cardinality of one or more tags in a system that has the one or more tags and one or more readers. The reader issues a command requesting that the tags identify themselves. The command includes timing information defining a total number of timeslots. In response to the command, each of the one or more tags (i) selects a timeslot in which to reply to the command and (ii) issues a reply in the selected timeslot. The method includes: (a) issuing the command; (b) receiving, in one or more timeslots, replies from the one or more tags; and (c) deriving an estimate of the cardinality of the one or more tags in the system based on at least one of: (i) the number of zero slots, wherein a zero slot is a timeslot that has no tags transmitting therein, (ii) the number of singleton slots, wherein a singleton slot is a timeslot that has only one tag transmitting therein, and (iii) the number of collision slots, wherein a collision slot is a timeslot that has more than one tag transmitting therein.
摘要翻译：在一个实施例中，一种用于估计系统中具有一个或多个标签和一个或多个读取器的一个或多个标签的基数的方法。读者发出一个命令，要求标签标识自己。该命令包括定义总时隙数的定时信息。响应于该命令，一个或多个标签（i）中的每一个选择在其中回复命令的时隙，以及（ii）在所选择的时隙中发出回复。该方法包括：（a）发出命令; （b）在一个或多个时隙中接收来自一个或多个标签的答复; 以及（c）基于以下中的至少一个导出系统中的一个或多个标签的基数的估计：（i）零时隙的数量，其中零时隙是其中没有标签发送的时隙（ ii）单例时隙的数量，其中单个时隙是仅在其中发送一个标签的时隙，以及（iii）冲突时隙的数量，其中，冲突时隙是具有多于一个标签在其中发送的时隙。

5. 发明申请

US20130185229A1 APPARATUS AND METHOD FOR MANAGING STORAGE OF DATA BLOCKS 有权
标题翻译：管理数据块存储的装置和方法
公开(公告)号：US20130185229A1
公开(公告)日：2013-07-18
申请号：US13348754
申请日：2012-01-12
申请人： Krishna P. Puttaswamy Naga , Thyagarajan Nandagopal , Muralidharan S. Kodialam
发明人： Krishna P. Puttaswamy Naga , Thyagarajan Nandagopal , Muralidharan S. Kodialam
IPC分类号： G06F17/30 , G06Q30/02
CPC分类号： G06F12/123 , G06F3/0605 , G06F3/064 , G06F3/0647 , G06F3/0652 , G06F3/067 , G06F2212/622 , H04L67/1097
摘要： A data block storage management capability is presented. A cloud file system management capability manages storage of data blocks of a file system across multiple cloud storage services (e.g., including determining, for each data block to be stored, a storage location and a storage duration for the data block). A cloud file system management capability manages movement of data blocks of a file system between storage volumes of cloud storage services. A cloud file system management capability provides a probabilistic eviction scheme for evicting data blocks from storage volumes of cloud storage services in advance of storage deadlines by which the data blocks are to be removed from the storage volumes. A cloud file system management capability enables dynamic adaptation of the storage volume sizes of the storage volumes of the cloud storage services.
摘要翻译：提出了数据块存储管理能力。云文件系统管理能力跨多个云存储服务管理文件系统的数据块的存储（例如，包括确定要存储的每个数据块，数据块的存储位置和存储持续时间）。云文件系统管理功能管理云存储服务的存储卷之间的文件系统的数据块的移动。云文件系统管理能力提供了概率驱逐方案，用于在数据块从存储卷中移除的存储期限之前从云存储服务的存储卷驱逐数据块。云文件系统管理功能可以实现云存储服务的存储卷的存储卷大小的动态调整。

6. 发明授权

US08812454B2 Apparatus and method for managing storage of data blocks 有权
标题翻译：用于管理数据块存储的装置和方法
公开(公告)号：US08812454B2
公开(公告)日：2014-08-19
申请号：US13348754
申请日：2012-01-12
申请人： Krishna P. Puttaswamy Naga , Thyagarajan Nandagopal , Muralidharan S. Kodialam
发明人： Krishna P. Puttaswamy Naga , Thyagarajan Nandagopal , Muralidharan S. Kodialam
IPC分类号： G06F7/00 , G06F17/00 , G06F12/00
CPC分类号： G06F12/123 , G06F3/0605 , G06F3/064 , G06F3/0647 , G06F3/0652 , G06F3/067 , G06F2212/622 , H04L67/1097
摘要： A data block storage management capability is presented. A cloud file system management capability manages storage of data blocks of a file system across multiple cloud storage services (e.g., including determining, for each data block to be stored, a storage location and a storage duration for the data block). A cloud file system management capability manages movement of data blocks of a file system between storage volumes of cloud storage services. A cloud file system management capability provides a probabilistic eviction scheme for evicting data blocks from storage volumes of cloud storage services in advance of storage deadlines by which the data blocks are to be removed from the storage volumes. A cloud file system management capability enables dynamic adaptation of the storage volume sizes of the storage volumes of the cloud storage services.
摘要翻译：提出了数据块存储管理能力。云文件系统管理能力跨多个云存储服务管理文件系统的数据块的存储（例如，包括确定要存储的每个数据块，数据块的存储位置和存储持续时间）。云文件系统管理功能管理云存储服务的存储卷之间的文件系统的数据块的移动。云文件系统管理能力提供了概率驱逐方案，用于在数据块从存储卷中移除的存储期限之前从云存储服务的存储卷驱逐数据块。云文件系统管理功能可以实现云存储服务的存储卷的存储卷大小的动态调整。

7. 发明授权

US07920991B2 Characterizing the capacity region in multi-channel, multi-radio mesh networks 有权
标题翻译：表征多通道，多无线网状网络中的容量区域
公开(公告)号：US07920991B2
公开(公告)日：2011-04-05
申请号：US11316071
申请日：2005-12-22
申请人： Muralidharan S. Kodialam , Thyagarajan Nandagopal
发明人： Muralidharan S. Kodialam , Thyagarajan Nandagopal
IPC分类号： G06F17/10
CPC分类号： H04L41/145
摘要： A method of characterizing a capacity region in a multi-channel, multi-radio mesh network of nodes interconnected by links. The method includes: (a) modeling the network by determining one or more link-flow feasibility constraints; (b) obtaining a feasible upper-capacity bound by solving an optimization problem using the one or more link-flow feasibility constraints as necessary conditions; and (c) using an algorithm adapted to provide a feasible lower-capacity bound by (i) receiving the solution to the optimization problem as input, (ii) allocating channels to links to meet a demand vector that satisfies the one or more link-flow feasibility constraints, and (iii) scheduling flows along the allocated channels. The upper- and lower-capacity bounds define the capacity region.
摘要翻译：一种表征通过链路互连的节点的多信道，多无线网状网络中的容量区域的方法。该方法包括：（a）通过确定一个或多个链路可行性约束对网络建模; （b）使用一个或多个链路可行性约束作为必要条件来求解优化问题来获得可行的上限容限; （c）使用适于通过（i）接收所述优化问题的解决方案作为输入来提供可行的较低容量限制的算法，（ii）将信道分配给链路以满足满足所述一个或多个链路 - 流动可行性约束，以及（iii）沿着分配的信道调度流。上限和下限容限界限定义容量区。

8. 发明申请

US20080079544A1 Estimation of the cardinality of a set of wireless devices 失效
标题翻译：估计一套无线设备的基数
公开(公告)号：US20080079544A1
公开(公告)日：2008-04-03
申请号：US11525339
申请日：2006-09-22
申请人： Muralidharan S. Kodialam , Thyagarajan Nandagopal
发明人： Muralidharan S. Kodialam , Thyagarajan Nandagopal
IPC分类号： H04Q5/22
CPC分类号： G06K7/10029 , H04W24/00 , H04W74/04
摘要： In one embodiment, a method for estimating the cardinality of one or more tags in a system that has the one or more tags and one or more readers. The reader issues a command requesting that the tags identify themselves. The command includes timing information defining a total number of timeslots. In response to the command, each of the one or more tags (i) selects a timeslot in which to reply to the command and (ii) issues a reply in the selected timeslot. The method includes: (a) issuing the command; (b) receiving, in one or more timeslots, replies from the one or more tags; and (c) deriving an estimate of the cardinality of the one or more tags in the system based on at least one of: (i) the number of zero slots, wherein a zero slot is a timeslot that has no tags transmitting therein, (ii) the number of singleton slots, wherein a singleton slot is a timeslot that has only one tag transmitting therein, and (iii) the number of collision slots, wherein a collision slot is a timeslot that has more than one tag transmitting therein.
摘要翻译：在一个实施例中，一种用于估计系统中具有一个或多个标签和一个或多个读取器的一个或多个标签的基数的方法。读者发出一个命令，要求标签标识自己。该命令包括定义总时隙数的定时信息。响应于该命令，一个或多个标签（i）中的每一个选择在其中回复命令的时隙，以及（ii）在所选择的时隙中发出回复。该方法包括：（a）发出命令; （b）在一个或多个时隙中接收来自一个或多个标签的答复; 以及（c）基于以下中的至少一个导出系统中的一个或多个标签的基数的估计：（i）零时隙的数量，其中零时隙是其中没有标签发送的时隙（ ii）单例时隙的数量，其中单个时隙是仅在其中发送一个标签的时隙，以及（iii）冲突时隙的数量，其中，冲突时隙是具有多于一个标签在其中发送的时隙。

9. 发明申请

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.
摘要翻译：提供了用于执行防止数据泄漏的设备，方法和制造。可以通过确定所发送的文档的签名，所发送的文档正在转移到超出网络边界的位置来执行数据泄露防止。将所发送的文档的签名与授权发送超出网络边界的文档的一个或多个签名进行比较。如果文档的签名不对应于被授权在网络边界之外被发送的文档的签名，则防止传输的文档被超出网络边界的传输。

10. 发明授权

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

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式