会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 71. 发明授权
    • Probabilistic fingerprint checking for preventing data leakage
    • 用于防止数据泄漏的概率指纹检查
    • US08566373B2
    • 2013-10-22
    • US13367441
    • 2012-02-07
    • Fang HaoKrishna P. Puttaswamy NagaMurali KodialamTirunell V. Lakshman
    • Fang HaoKrishna P. Puttaswamy NagaMurali KodialamTirunell V. Lakshman
    • G06F17/30
    • G06F17/30109G06F21/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.
    • 本文介绍了数据泄漏防护功能。 数据泄漏防止能力通过使用在安全网络的边界上的数据流的在线指纹检查来防止来自安全网络的具有多个文件的文件组的数据的泄漏。 使用为文件集配置的一组数据结构来执行在线指纹检查。 文件集的数据结构是基于文件集的文件集特征信息和指示要确定文件集的数据泄漏事件的最大位数的目标检测滞后来配置的。 为配置为用于监视文件集文件的多个数据结构计算数据结构配置。 数据结构配置包括用于各个多个数据结构的多个数据结构位置和数据结构大小。
    • 72. 发明申请
    • PROBABILISTIC FINGERPRINT CHECKING FOR PREVENTING DATA LEAKAGE
    • 用于防止数据泄漏的指纹指纹检查
    • US20130204903A1
    • 2013-08-08
    • US13367441
    • 2012-02-07
    • Fang HaoKrishna P. Puttaswamy NagaMurali KodialamTirunell V. Lakshman
    • Fang HaoKrishna P. Puttaswamy NagaMurali KodialamTirunell V. Lakshman
    • G06F7/00
    • G06F17/30109G06F21/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.
    • 本文介绍了数据泄漏防护功能。 数据泄漏防止能力通过使用在安全网络的边界上的数据流的在线指纹检查来防止来自安全网络的具有多个文件的文件组的数据的泄漏。 使用为文件集配置的一组数据结构来执行在线指纹检查。 文件集的数据结构是基于文件集的文件集特征信息和指示要确定文件集的数据泄漏事件的最大位数的目标检测滞后来配置的。 为配置为用于监视文件集文件的多个数据结构计算数据结构配置。 数据结构配置包括用于各个多个数据结构的多个数据结构位置和数据结构大小。
    • 73. 发明授权
    • Advertisement scheduling in a packet-based media-delivery system
    • 基于分组的媒体传送系统中的广播调度
    • US08250600B2
    • 2012-08-21
    • US12415392
    • 2009-03-31
    • Muralidharan S. KodialamTirunell V. LakshmanSarit Mukherjee
    • Muralidharan S. KodialamTirunell V. LakshmanSarit Mukherjee
    • H04N7/10
    • H04N7/17318G06Q30/0255H04N21/25883H04N21/25891H04N21/44222H04N21/6175H04N21/6582H04N21/812
    • In one embodiment, a scheme for the display of targeted and personalized advertisements in a packet-based media-delivery system, such as an Internet Protocol Television (IPTV) service. An Internet keyword-based advertisement-bidding model is used to place the most-appropriate IPTV advertisements for viewers depending on their interests as determined through the users' Internet activities, while maximizing advertising revenue for the IPTV service provider. One method for scheduling an advertisement for rendering in one or more time slots in packet-based media programming comprises: (a) obtaining at least one keyword from one or more Internet sessions corresponding to at least one user; (b) receiving a plurality of bid amounts corresponding to a plurality of available advertisements for the one or more time slots; and (c) scheduling, based on the at least one keyword and at least one of the bid amounts, the advertisement to be rendered to the at least one user in the one or more time slots.
    • 在一个实施例中,用于在基于分组的媒体传送系统(诸如因特网协议电视(IPTV))服务中显示目标和个性化广告的方案。 基于互联网关键词的广告投标模型用于根据用户的互联网活动确定的兴趣为观众放置最适合的IPTV广告,同时最大化IPTV服务提供商的广告收入。 一种用于在基于分组的媒体编程中的一个或多个时隙中调度用于呈现广告的方法包括:(a)从与至少一个用户对应的一个或多个因特网会话中获得至少一个关键字; (b)接收与所述一个或多个时隙的多个可用广告相对应的多个出价金额; 以及(c)基于所述至少一个关键字和所述投标金额中的至少一个,在所述一个或多个时隙中对所述至少一个用户呈现的广告进行调度。
    • 77. 发明授权
    • Efficient and robust routing of potentially-variable traffic for path restoration following link failure
    • 链路故障后路径恢复的潜在可变流量的高效鲁棒路由
    • US08027245B2
    • 2011-09-27
    • US11141705
    • 2005-05-31
    • Muralidharan S. KodialamTirunell V. LakshmanSudipta Sengupta
    • Muralidharan S. KodialamTirunell V. LakshmanSudipta Sengupta
    • H04L12/26
    • H04L45/12H04L45/04H04L45/24H04L47/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)中间节点和出口点之间的容量约束 。 所述选择识别两个链路不相交路径集,每个链路不相交路径集合包括备用路径和至少一个主路径,其中在入口点和中间节点之间设置第一路径,以及在中间节点和出口点之间设置的第二路径。 为了最大化网络吞吐量,分组以两个阶段路由,首先通过以预定比例设置的第一路径,然后经由第二路径集从中间节点到最终目的地路由到中间节点。
    • 78. 发明授权
    • Efficient and robust routing of potentially-variable traffic with local restoration against link failures
    • 对链路故障进行本地恢复的潜在可变流量的高效且可靠的路由
    • US07978594B2
    • 2011-07-12
    • US11141372
    • 2005-05-31
    • Muralidharan S. KodialamTirunell V. LakshmanSudipta Sengupta
    • Muralidharan S. KodialamTirunell V. LakshmanSudipta Sengupta
    • H04L12/56
    • H04L45/12H04L45/04H04L45/24H04L47/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)中间节点和出口点之间的容量约束 。 所述选择识别两个路径结构,每个路径结构包括主路径和保护主路径上的每个链路的一个或多个链路备用绕路,其中入口点和中间节点之间的第一路径结构以及中间节点之间的第二路径结构 和出口点。 为了最大化网络吞吐量,分组以两个阶段路由,首先通过第一路径结构以预定比例,然后经由第二路径结构从中间节点到最终目的地路由到中间节点。