公开(公告)号：US20080256149A1

公开(公告)日：2008-10-16

申请号：US11735026

申请日：2007-04-13

申请人： Nikhil Bansal ,  Ranjita Bhagwan ,  Yoonho Park ,  Chitra Venkatramani

发明人： Nikhil Bansal ,  Ranjita Bhagwan ,  Yoonho Park ,  Chitra Venkatramani

IPC分类号： G06F17/30

CPC分类号： G06F9/5044 ,  G06F11/202

摘要： A system and method for allocating distributed processing systems includes inputting component descriptions in a distributed processing system and determining importance of each component. Capacity and failure characteristics of resource groups representing units of available processing capacity are also input. Components are assigned to a plurality of resource groups based on the capacity. Each resource group includes components where the failure characteristics permit simultaneous failures, such that in the event of such failures, an output value of the application is maximized.

摘要翻译： 用于分配分布式处理系统的系统和方法包括在分布式处理系统中输入组件描述并确定每个组件的重要性。 也输入代表可用处理能力单位的资源组的容量和故障特征。 基于容量将组件分配给多个资源组。 每个资源组包括其中故障特征允许同时故障的组件，使得在发生这种故障的情况下，应用的输出值最大化。

公开(公告)号：US08122281B2

公开(公告)日：2012-02-21

申请号：US11735026

申请日：2007-04-13

申请人： Nikhil Bansal ,  Ranjita Bhagwan ,  Yoonho Park ,  Chitra Venkatramani

发明人： Nikhil Bansal ,  Ranjita Bhagwan ,  Yoonho Park ,  Chitra Venkatramani

IPC分类号： G06F11/00

CPC分类号： G06F9/5044 ,  G06F11/202

摘要： A system and method for allocating distributed processing systems includes inputting component descriptions in a distributed processing system and determining importance of each component. Capacity and failure characteristics of resource groups representing units of available processing capacity are also input. Components are assigned to a plurality of resource groups based on the capacity. Each resource group includes components where the failure characteristics permit simultaneous failures, such that in the event of such failures, an output value of the application is maximized.

摘要翻译： 用于分配分布式处理系统的系统和方法包括在分布式处理系统中输入组件描述并确定每个组件的重要性。 也输入代表可用处理能力单位的资源组的容量和故障特征。 基于容量将组件分配给多个资源组。 每个资源组包括其中故障特征允许同时故障的组件，使得在发生这种故障的情况下，应用的输出值最大化。

公开(公告)号：US08219657B2

公开(公告)日：2012-07-10

申请号：US12138445

申请日：2008-06-13

申请人： Ranjita Bhagwan ,  Monojit Choudhury ,  Ravindran Kannan ,  Venkata N. Padmanabhan ,  Abhishek Sharma ,  Geoffrey Voelker

发明人： Ranjita Bhagwan ,  Monojit Choudhury ,  Ravindran Kannan ,  Venkata N. Padmanabhan ,  Abhishek Sharma ,  Geoffrey Voelker

IPC分类号： G06F15/173 ,  G06F15/16

CPC分类号： G06F11/3447 ,  G06F11/3409 ,  G06F11/3442 ,  G06F2201/865 ,  G06F2201/875 ,  G06F2201/88

摘要： Application service requests received by an application hosting framework are automatically differentiated and categorized, and resource usage patterns associated with the requests are predicted. Resource usage data points are successively extracted from the hosting framework. Elements of an initial resource usage pattern matrix are computed from the data points. An estimate for the number of categories of requests is computed from the initial resource usage pattern matrix, where the requests in each category have similar resource usage patterns. Elements of a resource usage signature matrix and request categorization matrix are computed from the estimate for the number of categories of requests and the initial resource usage pattern matrix.

摘要翻译： 应用程序托管框架收到的应用程序服务请求将被自动区分和分类，并且预测与请求相关联的资源使用模式。 从主机框架中连续提取资源使用数据点。 从数据点计算初始资源使用模式矩阵的元素。 从初始资源使用模式矩阵计算对请求类别数量的估计，其中每个类别中的请求具有相似的资源使用模式。 资源使用签名矩阵和请求分类矩阵的元素根据请求类别数量和初始资源使用模式矩阵的估计计算。

公开(公告)号：US20090313282A1

公开(公告)日：2009-12-17

申请号：US12138445

申请日：2008-06-13

申请人： Ranjita Bhagwan ,  Monojit Choudhury ,  Ravindran Kannan ,  Venkata N. Padmanabhan ,  Abhishek Sharma ,  Geoffrey Voelker

发明人： Ranjita Bhagwan ,  Monojit Choudhury ,  Ravindran Kannan ,  Venkata N. Padmanabhan ,  Abhishek Sharma ,  Geoffrey Voelker

IPC分类号： G06F7/00 ,  G06F17/30

CPC分类号： G06F11/3447 ,  G06F11/3409 ,  G06F11/3442 ,  G06F2201/865 ,  G06F2201/875 ,  G06F2201/88

摘要： Application service requests received by an application hosting framework are automatically differentiated and categorized, and resource usage patterns associated with the requests are predicted. Resource usage data points are successively extracted from the hosting framework. Elements of an initial resource usage pattern matrix are computed from the data points. An estimate for the number of categories of requests is computed from the initial resource usage pattern matrix, where the requests in each category have similar resource usage patterns. Elements of a resource usage signature matrix and request categorization matrix are computed from the estimate for the number of categories of requests and the initial resource usage pattern matrix.

摘要翻译： 应用程序托管框架收到的应用程序服务请求将被自动区分和分类，并且预测与请求相关联的资源使用模式。 从主机框架中连续提取资源使用数据点。 从数据点计算初始资源使用模式矩阵的元素。 从初始资源使用模式矩阵计算对请求类别数量的估计，其中每个类别中的请求具有相似的资源使用模式。 资源使用签名矩阵和请求分类矩阵的元素根据请求类别数量和初始资源使用模式矩阵的估计计算。

公开(公告)号：US20090187673A1

公开(公告)日：2009-07-23

申请号：US12016587

申请日：2008-01-18

申请人： Ramachandran Ramjee ,  Ranjita Bhagwan ,  Venkata N. Padmanabhan ,  Manveer Singh Chawla

发明人： Ramachandran Ramjee ,  Ranjita Bhagwan ,  Venkata N. Padmanabhan ,  Manveer Singh Chawla

IPC分类号： G06F15/16

CPC分类号： H04L67/2828 ,  H04L67/2876

摘要： Described is transparently compressing content for network transmission, including end-to-end compression. An end host or middlebox device sender sends compressed packets to an end host or middlebox device receiver, which decompresses the packets to recover the original packet. The sender constructs compressed packets including references to information maintained at the receiver, which the receiver uses to access the information to recreate actual original packet content. The receiver may include a dictionary corresponding to the sender, e.g., synchronized with the sender's dictionary. Alternatively, in speculative compression, the sender does not maintain a dictionary, and instead sends a fingerprint (hash value) by which the receiver looks up corresponding content in its dictionary; if not found, the receiver requests actual content. Scheduling to maintain fairness and smoothing bursts to coexist with TCP congestion control are also described, as are techniques for routing compressed data over networked end hosts and/or compression-enabled middlebox devices.

摘要翻译： 描述了透明地压缩网络传输的内容，包括端对端压缩。 终端主机或中间件设备发送方将压缩数据包发送到终端主机或中间件设备接收器，解压缩数据包以恢复原始数据包。 发送端构造压缩数据包，包括对在接收器上维护的信息的引用，接收者用于访问信息以重新创建实际的原始数据包内容。 接收机可以包括与发送者相对应的字典，例如与发送者的字典同步。 或者，在推测压缩中，发送者不维护字典，而是发送指纹（哈希值），通过该指纹，接收者在其字典中查找对应的内容; 如果没有找到，则接收器请求实际的内容。 还描述了保持公平性和平滑突发以与TCP拥塞控制共存的调度，以及用于通过网络终端主机和/或压缩启用的中间件设备路由压缩数据的技术。

公开(公告)号：US07975071B2

公开(公告)日：2011-07-05

申请号：US12016587

申请日：2008-01-18

申请人： Ramachandran Ramjee ,  Ranjita Bhagwan ,  Venkata N. Padmanabhan ,  Manveer Singh Chawla

发明人： Ramachandran Ramjee ,  Ranjita Bhagwan ,  Venkata N. Padmanabhan ,  Manveer Singh Chawla

IPC分类号： G06F15/16 ,  G06F15/177 ,  H04L12/66 ,  H04J3/24

CPC分类号： H04L67/2828 ,  H04L67/2876

摘要： Described is transparently compressing content for network transmission, including end-to-end compression. An end host or middlebox device sender sends compressed packets to an end host or middlebox device receiver, which decompresses the packets to recover the original packet. The sender constructs compressed packets including references to information maintained at the receiver, which the receiver uses to access the information to recreate actual original packet content. The receiver may include a dictionary corresponding to the sender, e.g., synchronized with the sender's dictionary. Alternatively, in speculative compression, the sender does not maintain a dictionary, and instead sends a fingerprint (hash value) by which the receiver looks up corresponding content in its dictionary; if not found, the receiver requests actual content. Scheduling to maintain fairness and smoothing bursts to coexist with TCP congestion control are also described, as are techniques for routing compressed data over networked end hosts and/or compression-enabled middlebox devices.

摘要翻译： 描述了透明地压缩网络传输的内容，包括端对端压缩。 终端主机或中间件设备发送方将压缩数据包发送到终端主机或中间件设备接收器，解压缩数据包以恢复原始数据包。 发送端构造压缩数据包，包括对在接收器上维护的信息的引用，接收者用于访问信息以重新创建实际的原始数据包内容。 接收机可以包括与发送者相对应的字典，例如与发送者的字典同步。 或者，在推测压缩中，发送者不维护字典，而是发送指纹（哈希值），通过该指纹，接收者在其字典中查找对应的内容; 如果没有找到，则接收器请求实际的内容。 还描述了保持公平性和平滑突发以与TCP拥塞控制共存的调度，以及用于通过网络终端主机和/或压缩启用的中间件设备路由压缩数据的技术。

公开(公告)号：US20110107418A1

公开(公告)日：2011-05-05

申请号：US12610309

申请日：2009-10-31

申请人： Ranjita Bhagwan ,  Tathagata Das ,  Prasad G. Naldurg

发明人： Ranjita Bhagwan ,  Tathagata Das ,  Prasad G. Naldurg

IPC分类号： G06F12/14 ,  G06N5/00 ,  G06F21/00

CPC分类号： G06F21/604

摘要： An access control anomaly detection system and method to detect potential anomalies in access control permissions and report those potential anomalies in real time to an administrator for possible action. Embodiments of the system and method input access control lists and semantic groups (or any dataset having binary matrices) to perform automated anomaly detection. This input is processed in three broad phases. First, policy statements are extracted from the access control lists. Next, object-level anomaly detection is performed using thresholds by categorizing outliers in the policies discovered in the first phase as potential anomalies. This object-level anomaly detection can yield object-level security anomalies and object-level accessibility anomalies. Group-level anomaly detection is performed in the third phase by using semantic groups and user sets extracted in first phase to find maximal overlaps using group mapping. This group-level anomaly detection can yield group-level security anomalies and group-level accessibility anomalies.

摘要翻译： 访问控制异常检测系统和方法，用于检测访问控制权限中的潜在异常，并将这些潜在的异常实时报告给管理员以进行可能的操作。 系统和方法的实施例输入访问控制列表和语义组（或具有二进制矩阵的任何数据集）来执行自动异常检测。 该输入在三个阶段进行处理。 首先，从访问控制列表中提取策略语句。 接下来，通过将在第一阶段中发现的策略中的异常值分类为潜在异常，使用阈值来执行对象级异常检测。 此对象级异常检测可能会产生对象级安全异常和对象级可访问性异常。 通过使用在第一阶段提取的语义组和用户集合，使用组映射找到最大重叠，在第三阶段执行组级异常检测。 该组级异常检测可以产生组级安全异常和组级可访问性异常。

公开(公告)号：US09753778B2

公开(公告)日：2017-09-05

申请号：US13553847

申请日：2012-07-20

申请人： Saikat Guha ,  Ranjita Bhagwan ,  Anshul Rai

发明人： Saikat Guha ,  Ranjita Bhagwan ,  Anshul Rai

IPC分类号： G06F15/173 ,  G06F9/50

CPC分类号： G06F9/5038

摘要： A resource allocation framework is described herein which allocates items (conceptualized as balls) to item-receiving slots (conceptualized as bins) in a domain-agnostic manner. A user instantiates the resource allocation framework to a particular allocation problem by generating a specification that describes the allocation problem in a declarative fashion. Among other features, the specification maps real-world entities to the balls and bins, and describes the constraints associated with the allocation problem. The specification also provides a utilization function that computes the consumption of resources for a proposed assignment of a particular ball to a particular bin. According to another aspect, the resource allocation framework uses many processing elements (e.g., GPU threads, CPU threads, etc.), operating in parallel, to attempt to find a solution to the allocation problem. In this search for a solution, the resource allocation framework operates in any combination of an explore mode and an exploit mode.

公开(公告)号：US08880933B2

公开(公告)日：2014-11-04

申请号：US13080393

申请日：2011-04-05

申请人： Ranjita Bhagwan ,  Venkata N. Padmanabhan ,  Bhavish Aggarwal ,  Lorenzo De Carli

发明人： Ranjita Bhagwan ,  Venkata N. Padmanabhan ,  Bhavish Aggarwal ,  Lorenzo De Carli

IPC分类号： G06F11/00 ,  G06N5/02 ,  H04L12/24 ,  G06F11/16 ,  G06F11/07 ,  H04L12/26

CPC分类号： G06N5/025 ,  G06F11/079 ,  G06F11/1658 ,  H04L41/0636 ,  H04L43/04

摘要： The problem signature extraction technique extracts problem signatures from trace data collected from an application. The technique condenses the manifestation of a network, software or hardware problem into a compact signature, which could then be used to identify instances of the same problem in other trace data. For a network configuration, the technique uses as input a network-level packet trace of an application's communication and extracts from it a set of features. During the training phase, each application run is manually labeled as GOOD or BAD, depending on whether the run was successful or not. The technique then employs a learning technique to build a classification tree not only to distinguish between GOOD and BAD runs but to also sub-classify the BAD runs into different classes of failures. Once a classification tree has been learned, problem signatures are extracted by walking the tree, from the root to each leaf.

摘要翻译： 问题签名提取技术从应用程序收集的跟踪数据中提取问题签名。 该技术将网络，软件或硬件问题的表现集中到紧凑签名中，然后可以将其用于识别其他跟踪数据中相同问题的实例。 对于网络配置，该技术用作输入应用程序通信的网络级数据包跟踪，并从中提取一组特征。 在培训阶段，每个应用程序运行都会手动标记为GOOD或BAD，具体取决于运行是否成功。 然后，该技术采用学习技术来构建分类树，不仅可以区分GOOD和BAD运行，而且还将BAD运行次分类到不同类别的故障中。 一旦学习了分类树，就可以通过将树从根移到每个叶来提取问题签名。

公开(公告)号：US20140025822A1

公开(公告)日：2014-01-23

申请号：US13553847

申请日：2012-07-20

申请人： Saikat Guha ,  Ranjita Bhagwan ,  Anshul Rai

发明人： Saikat Guha ,  Ranjita Bhagwan ,  Anshul Rai

IPC分类号： G06F15/173

CPC分类号： G06F9/5038

摘要： A resource allocation framework is described herein which allocates items (conceptualized as balls) to item-receiving slots (conceptualized as bins) in a domain-agnostic manner. A user instantiates the resource allocation framework to a particular allocation problem by generating a specification that describes the allocation problem in a declarative fashion. Among other features, the specification maps real-world entities to the balls and bins, and describes the constraints associated with the allocation problem. The specification also provides a utilization function that computes the consumption of resources for a proposed assignment of a particular ball to a particular bin. According to another aspect, the resource allocation framework uses many processing elements (e.g., GPU threads, CPU threads, etc.), operating in parallel, to attempt to find a solution to the allocation problem. In this search for a solution, the resource allocation framework operates in any combination of an explore mode and an exploit mode.

摘要翻译： 本文描述了一种资源分配框架，其以域不可知的方式将项目（概念化为球）分配给项目接收时隙（概念化为仓）。 用户通过生成以声明方式描述分配问题的规范来将资源分配框架实例化为特定的分配问题。 在其他功能中，规范将真实世界的实体映射到球和仓，并描述与分配问题相关的约束。 该规范还提供了利用函数，其计算用于将特定球的建议分配给特定仓的资源消耗。 根据另一方面，资源分配框架使用并行操作的许多处理元件（例如，GPU线程，CPU线程等）来尝试找到分配问题的解决方案。 在搜索解决方案中，资源分配框架以探索模式和漏洞利用模式的任意组合运行。