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

1. 发明授权

US08943269B2 Apparatus and method for meeting performance metrics for users in file systems 有权
标题翻译：用于满足文件系统中用户的性能指标的装置和方法
公开(公告)号：US08943269B2
公开(公告)日：2015-01-27
申请号：US13446010
申请日：2012-04-13
申请人： Krishna P. Puttaswamy Naga , Murali Kodialam
发明人： Krishna P. Puttaswamy Naga , Murali Kodialam
IPC分类号： G06F12/08 , G06F11/30 , G06F12/12
CPC分类号： G06F12/0866 , G06F3/0619 , G06F3/0665 , G06F3/067 , G06F3/0689 , G06F11/3037 , G06F11/3409 , G06F11/3495 , G06F12/12 , G06F12/121 , G06F17/30135 , G06F2003/0692 , G06F2212/263 , H04L67/10 , H04L67/1097 , H04L67/2842 , H04L67/2852 , H04L67/2857
摘要： A data block storage management capability is presented. A file system includes a plurality of data blocks which are managed using a first storage service and a second storage service, where the first storage service has a lower storage cost and a higher input-output cost than the second storage service. The data blocks stored using the second storage service have associated therewith respective expected storage durations indicative of respective lengths of time for which the data blocks are to be stored using the second storage service (which may be the same or different across the ones of the data blocks stored using the second storage service). The expected storage durations of the data blocks are modified based on a comparison of an expected hit rate of the second storage service and a current hit rate of the second storage service or current hit rates of the data blocks.
摘要翻译：提出了数据块存储管理能力。文件系统包括使用第一存储服务和第二存储服务来管理的多个数据块，其中第一存储服务具有比第二存储服务更低的存储成本和更高的输入/输出成本。使用第二存储服务存储的数据块具有与其相应的预期存储持续时间，其指示将使用第二存储服务来存储数据块的相应时间长度（其可以在数据中的数据块之间相同或不同）使用第二存储服务存储的块）。基于第二存储服务的预期命中率和第二存储服务的当前命中率或数据块的当前命中率的比较来修改数据块的预期存储持续时间。

2. 发明申请

US20140067994A1 REDUCING COSTS RELATED TO USE OF NETWORKS BASED ON PRICING HETEROGENEITY 审中-公开
标题翻译：基于价格异质性降低与网络使用相关的成本
公开(公告)号：US20140067994A1
公开(公告)日：2014-03-06
申请号：US13597614
申请日：2012-08-29
申请人： Krishna P. Puttaswamy Naga , Murali Kodialam , Matteo Varvello
发明人： Krishna P. Puttaswamy Naga , Murali Kodialam , Matteo Varvello
IPC分类号： G06F15/16
CPC分类号： G06Q10/06313 , H04L41/0896 , H04L67/10 , H04L67/1095 , H04L67/1097
摘要： A capability is provided for reducing the costs of data transfers for networks using pricing heterogeneity. For data to be transferred between an application of a first network and a user device, the data may be transferred directly without using a second network or indirectly using a second network including a transfer of the data between the first network and the second network. In a network-based file system, a first network is primarily used for write requests and a second network is primarily used for read requests, and a data block is transferred from the first network to the second network based on a determination that a threshold number of read requests for the data block have been received. The determination as to when to transfer data between networks may be determined based on various costs associated with the networks.
摘要翻译：提供了一种降低使用定价异质性的网络数据传输成本的能力。对于要在第一网络和用户设备的应用之间传输的数据，可以直接传送数据而不使用第二网络，或间接地使用包括第一网络和第二网络之间的数据传输的第二网络。在基于网络的文件系统中，第一网络主要用于写入请求，并且第二网络主要用于读取请求，并且基于确定阈值数目的确定将数据块从第一网络传送到第二网络已经接收到数据块的读请求。关于何时在网络之间传送数据的确定可以基于与网络相关联的各种成本来确定。

3. 发明申请

US20140188656A1 DETERMINING COST OPTIMIZATION BASED ON CONSTRAINTS ON SKI-RENTAL PROBLEMS 审中-公开
标题翻译：基于滑坡问题的约束条件确定成本优化
公开(公告)号：US20140188656A1
公开(公告)日：2014-07-03
申请号：US13727852
申请日：2012-12-27
申请人： Krishna P. Puttaswamy Naga , Murali Kodialam , Ali Khanafer
发明人： Krishna P. Puttaswamy Naga , Murali Kodialam , Ali Khanafer
IPC分类号： G06Q30/06
CPC分类号： G06Q30/0631
摘要： A constrained ski-rental problem is defined. In the constrained ski-rental problem, a determination as to whether a first action having a first cost associated therewith or a second action having a second cost associated therewith is more cost effective is performed based on moment information associated with events related to the first action or the second action. The moment information may include a moment of the occurrences distribution of events related to the first and second actions. The moment information may include a moment of a number of occurrences of events related to the first and second actions, a moment of the inter-event times of occurrences of events related to the first and second actions, or the like. The moment information may include a first moment, a second moment, or the like.
摘要翻译：限定了滑雪租赁问题。在限制的滑雪租赁问题中，基于与第一动作相关联的事件相关联的时刻信息来执行关于具有与其相关联的第一成本的第一动作或与其相关联的具有第二成本的第二动作是否更具成本效益的确定或第二动作。时刻信息可以包括与第一和第二动作有关的事件的发生发生的时刻。时刻信息可以包括与第一和第二动作相关的事件发生次数的时刻，与第一和第二动作相关的事件的事件发生时间的时刻等。时刻信息可以包括第一时刻，第二时刻等。

4. 发明授权

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.
摘要翻译：本文介绍了数据泄漏防护功能。数据泄漏防止能力通过使用在安全网络的边界上的数据流的在线指纹检查来防止来自安全网络的具有多个文件的文件组的数据的泄漏。使用为文件集配置的一组数据结构来执行在线指纹检查。文件集的数据结构是基于文件集的文件集特征信息和指示要确定文件集的数据泄漏事件的最大位数的目标检测滞后来配置的。为配置为用于监视文件集文件的多个数据结构计算数据结构配置。数据结构配置包括用于各个多个数据结构的多个数据结构位置和数据结构大小。

5. 发明申请

US20130275669A1 APPARATUS AND METHOD FOR MEETING PERFORMANCE METRICS FOR USERS IN FILE SYSTEMS 有权
公开(公告)号：US20130275669A1
公开(公告)日：2013-10-17
申请号：US13446010
申请日：2012-04-13
申请人： Krishna P. Puttaswamy Naga , Murali Kodialam
发明人： Krishna P. Puttaswamy Naga , Murali Kodialam
IPC分类号： G06F12/00 , G06F12/08
CPC分类号： G06F12/0866 , G06F3/0619 , G06F3/0665 , G06F3/067 , G06F3/0689 , G06F11/3037 , G06F11/3409 , G06F11/3495 , G06F12/12 , G06F12/121 , G06F17/30135 , G06F2003/0692 , G06F2212/263 , H04L67/10 , H04L67/1097 , H04L67/2842 , H04L67/2852 , H04L67/2857
摘要： A data block storage management capability is presented. A file system includes a plurality of data blocks which are managed using a first storage service and a second storage service, where the first storage service has a lower storage cost and a higher input-output cost than the second storage service. The data blocks stored using the second storage service have associated therewith respective expected storage durations indicative of respective lengths of time for which the data blocks are to be stored using the second storage service (which may be the same or different across the ones of the data blocks stored using the second storage service). The expected storage durations of the data blocks are modified based on a comparison of an expected hit rate of the second storage service and a current hit rate of the second storage service or current hit rates of the data blocks.

6. 发明申请

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.
摘要翻译：本文介绍了数据泄漏防护功能。数据泄漏防止能力通过使用在安全网络的边界上的数据流的在线指纹检查来防止来自安全网络的具有多个文件的文件组的数据的泄漏。使用为文件集配置的一组数据结构来执行在线指纹检查。文件集的数据结构是基于文件集的文件集特征信息和指示要确定文件集的数据泄漏事件的最大位数的目标检测滞后来配置的。为配置为用于监视文件集文件的多个数据结构计算数据结构配置。数据结构配置包括用于各个多个数据结构的多个数据结构位置和数据结构大小。

7. 发明申请

US20110044201A1 LINE-RATE, REAL-TIME-TRAFFIC DETECTOR 有权
标题翻译：线速度，实时交通检测器
公开(公告)号：US20110044201A1
公开(公告)日：2011-02-24
申请号：US12543529
申请日：2009-08-19
申请人： Fang Hao , Murali Kodialam , T. V. Lakshman
发明人： Fang Hao , Murali Kodialam , T. V. Lakshman
IPC分类号： H04L12/26
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.
摘要翻译：线速率实时业务检测器在确定网络业务流的分组到达速率由经验导出的边界限定时的平滑度时，将网络流量流分类为实时。在一些实施例中，为了提高性能，对于在第一组分组到达时间上执行的平滑度计算应用更紧密的平滑度约束，而将更松散的平滑度约束应用于第二组分组到达时间，第二组包括和大于第一。

8. 发明申请

US20100316051A1 PACKET PROCESSING USING BRAIDED TRIES 有权
标题翻译：使用BRAIDED TRIES进行分组处理
公开(公告)号：US20100316051A1
公开(公告)日：2010-12-16
申请号：US12482533
申请日：2009-06-11
申请人： Haoyu Song , Murali Kodialam , Fang Hao , T.V. Lakshman
发明人： Haoyu Song , Murali Kodialam , Fang Hao , T.V. Lakshman
IPC分类号： H04L12/56
CPC分类号： H04L45/00 , H04L45/742
摘要： Packets are processed (e.g., routed or classified) in accordance with a braided trie, which represents the combination of two or more different original tries (e.g., representing different forwarding/classification tables). The different tries are combined by twisting the mappings for specific trie nodes to make the shapes of the different tries more similar. Each node in the braided trie contains a braiding bit for at least one original trie indicating the mapping for that trie's node. Trie braiding can significantly reduce the number of nodes used to represent the different original tries, thereby reducing memory usage and improving scalability. Braided tries can be used for such applications as virtual routers and packet classification in which different forwarding/classification tables are represented by a single braided trie stored in shared memory.
摘要翻译：数据包根据编织特技进行处理（例如，路由或分类），其代表两个或多个不同的原始尝试的组合（例如，表示不同的转发/分类表）。通过扭转特定特里节点的映射来组合不同的尝试，使不同尝试的形状更相似。编织特技中的每个节点包含至少一个原始特里的编织位，指示该特里节点的映射。 Trie编织可以显着减少用于表示不同原始尝试的节点数量，从而减少内存使用并提高可扩展性。编织的尝试可以用于虚拟路由器和分组分类等应用，其中不同的转发/分类表由存储在共享存储器中的单个编织线索表示。

9. 发明申请

US20100295659A1 IDENTIFYING RFID CATEGORIES 有权
标题翻译：识别RFID类别
公开(公告)号：US20100295659A1
公开(公告)日：2010-11-25
申请号：US12470061
申请日：2009-05-21
申请人： Murali Kodialam , Thyaga Nandagopal , Wing C. Lau
发明人： Murali Kodialam , Thyaga Nandagopal , Wing C. Lau
IPC分类号： H04Q5/22
CPC分类号： G06K7/0008 , G06K7/10059
摘要： The set T of all categories in a population of RFID tags is estimated within a specified error bound. For each of one or more frames, a reader broadcasts a probability p, a multiplicity d, a frame size M, and a seed value R to the present tags. A deterministic algorithm on each tag, and known to the reader, calculates (i) whether the tag will transmit in this frame, and, if so, (ii) in which slots the tag will transmit a single “1.” When the tags have responded, the reader calculates set T by initially assuming that all possible categories are in set T and then eliminating those categories that would have transmitted in those slots in which no tag transmitted. Alternatively, the reader initially assumes that set T is empty, and adds those categories that would have transmitted in those slots in which one or more tags did transmit.
摘要翻译：估计RFID标签中所有类别的集合T在指定的误差范围内。对于一个或多个帧中的每一个，读取器向当前标签广播概率p，多重度d，帧大小M和种子值R. 每个标签上的确定性算法，并且由读者知道，计算（i）标签是否将在该帧中传输，如果是，则（ii）标签将在哪个时隙中传送单个“1”。当标签读者通过最初假设所有可能的类别都在T中计算集合T，然后消除那些在没有标签发送的那些时隙中传送的类别。或者，读取器最初假设集合T为空，并且添加将在一个或多个标签确实发送的那些时隙中传送的那些类别。

10. 发明授权

US10374939B2 Hop constrained maximum flow with segment routing 有权
公开(公告)号：US10374939B2
公开(公告)日：2019-08-06
申请号：US15605790
申请日：2017-05-25
申请人： Fang Hao , Murali Kodialam , T. V. Lakshman
发明人： Fang Hao , Murali Kodialam , T. V. Lakshman
IPC分类号： H04L12/26 , H04L12/721 , H04L12/733
摘要： A method of determining a maximum flow on a network path using segment routing, the method including establishing a segment graph, establishing underlying dual weights on the segment graph, computing the dual weights from the segment graph, finding a minimum dual weight path not having more than a predetermined number of hops, augmenting a flow on the dual weight path, and updating the dual weights on the underlying segment graph.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式