公开(公告)号：US07733906B2

公开(公告)日：2010-06-08

申请号：US11170854

申请日：2005-06-30

申请人： Anant Raman ,  Sanjay Rungta

发明人： Anant Raman ,  Sanjay Rungta

IPC分类号： H04J3/16

CPC分类号： H04L63/101 ,  H04L29/12047 ,  H04L61/15 ,  H04L63/0236 ,  H04L63/1466

摘要： A system has a local area network, and software to automatically evaluate a network layer address, a lower layer address, a network port identifier, and/or a domain name of an equipment interface that is to be connected to the network. The software is to determine whether one of these matches an expected value for the network. The software is to provide a credential for each equipment interface that is authorized to connect to the network and that has been authenticated by the software. The credential contains a lower layer address, a network layer address, a domain name, and a network port identifier. Other embodiments are also described and claimed.

摘要翻译： 系统具有局域网和用于自动评估要连接到网络的设备接口的网络层地址，较低层地址，网络端口标识符和/或域名的软件。 该软件用于确定其中一个是否匹配网络的预期值。 该软件是为被授权连接到网络并且已被该软件认证的每个设备接口提供证书。 凭证包含较低层地址，网络层地址，域名和网络端口标识符。 还描述和要求保护其他实施例。

公开(公告)号：US20070002899A1

公开(公告)日：2007-01-04

申请号：US11170854

申请日：2005-06-30

申请人： Anant Raman ,  Sanjay Rungta

发明人： Anant Raman ,  Sanjay Rungta

IPC分类号： H04J3/16

CPC分类号： H04L63/101 ,  H04L29/12047 ,  H04L61/15 ,  H04L63/0236 ,  H04L63/1466

摘要： A system has a local area network, and software to automatically evaluate a network layer address, a lower layer address, a network port identifier, and/or a domain name of an equipment interface that is to be connected to the network. The software is to determine whether one of these matches an expected value for the network. The software is to provide a credential for each equipment interface that is authorized to connect to the network and that has been authenticated by the software. The credential contains a lower layer address, a network layer address, a domain name, and a network port identifier. Other embodiments are also described and claimed.

摘要翻译： 系统具有局域网和用于自动评估要连接到网络的设备接口的网络层地址，较低层地址，网络端口标识符和/或域名的软件。 该软件用于确定其中一个是否匹配网络的预期值。 该软件是为被授权连接到网络并且已被该软件认证的每个设备接口提供证书。 凭证包含较低层地址，网络层地址，域名和网络端口标识符。 还描述和要求保护其他实施例。

公开(公告)号：US20060021030A1

公开(公告)日：2006-01-26

申请号：US10883351

申请日：2004-06-30

申请人： Anant Raman

发明人： Anant Raman

IPC分类号： G06F12/14

CPC分类号： H04L63/1433

摘要： A method and apparatus for an integrated security framework. An embodiment of a method comprises identifying network paths for a system; identifying products and platforms for the system; applying application security for the system; analyzing security status for the system; and, based at least in part on the analysis of the security status, automatically identifying changes for the network paths for the system or the products and platforms for the system.

公开(公告)号：US20180189497A1

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

申请号：US15394273

申请日：2016-12-29

申请人： Vadim Sukhomlinov ,  Anant Raman

发明人： Vadim Sukhomlinov ,  Anant Raman

IPC分类号： G06F21/57 ,  G06F9/445

CPC分类号： G06F21/577 ,  G06F8/65 ,  G06F21/50 ,  G06F21/568 ,  G06F21/604 ,  G06F2221/034

摘要： An embodiment of an electronic processing apparatus may include a database constructor to construct a dependency database of deployed components in an environment, a vulnerability tracer to trace a vulnerability against the dependency database and to determine one or more affected deployed components based on the trace, and a vulnerability resolver to retrieve environment-specific rules based on the determined one or more affected deployed components and to prioritize mitigation of the vulnerability for the one or more affected deployed components based at least in part on the retrieved environment-specific rules.

公开(公告)号：US07533186B2

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

申请号：US10883351

申请日：2004-06-30

申请人： Anant Raman

发明人： Anant Raman

IPC分类号： G06F11/00

CPC分类号： H04L63/1433

摘要： A method and apparatus for an integrated security framework. An embodiment of a method comprises identifying network paths for a system; identifying products and platforms for the system; applying application security for the system; analyzing security status for the system; and, based at least in part on the analysis of the security status, automatically identifying changes for the network paths for the system or the products and platforms for the system.

摘要翻译： 一种集成安全框架的方法和装置。 方法的实施例包括识别系统的网络路径; 识别系统的产品和平台; 对系统应用安全性; 分析系统的安全状态; 并且至少部分地基于对安全状态的分析，自动识别系统或系统的产品和平台的网络路径的改变。

公开(公告)号：US5819045A

公开(公告)日：1998-10-06

申请号：US581041

申请日：1995-12-29

申请人： Anant Raman ,  Sanjay Rungta

发明人： Anant Raman ,  Sanjay Rungta

IPC分类号： H04L12/26 ,  H04L12/56 ,  G06F13/00

CPC分类号： H04L47/10 ,  H04L12/2602 ,  H04L43/00 ,  H04L47/125 ,  H04L47/13 ,  H04L43/0888

摘要： A method for determining a networking capability index (NCI), which is representative of the load a computer applies to a computer network. The method includes selecting a group of packet sizes, measuring the capability of the computer to transmit packets of each of the selected sizes from the process application to the input/output kernel as a function of time, and determining a probability distribution for the selected packet sizes, wherein the probability distribution for a selected packet size is representative of the percentage of total traffic corresponding to the selected packet size. The method then determines the NCI by summing the product of each selected packet size times each corresponding throughput value times each corresponding probability distribution value. Also a method for load balancing a plurality of networked computers arranged in segments by determining the NCI for each of the networked computers, and selectively connecting the computers to have approximately equal combined NCI values for all segments.

摘要翻译： 一种用于确定联网能力指数（NCI）的方法，其代表计算机应用于计算机网络的负载。 该方法包括：选择一组分组大小，测量计算机根据时间从处理应用程序将每个所选大小的分组传送到输入/输出内核的能力，以及确定所选分组的概率分布 尺寸，其中所选分组大小的概率分布表示对应于所选分组大小的总业务的百分比。 然后，该方法通过将每个选择的分组大小的乘积乘以每个对应的吞吐量值乘以每个对应的概率分布值来确定NCI。 还有一种用于通过为每个联网的计算机确定NCI并且选择性地将计算机连接到具有用于所有段的近似相等的组合NCI值来负载平衡分段排列的多个网络计算机的方法。

公开(公告)号：US5255181A

公开(公告)日：1993-10-19

申请号：US532306

申请日：1990-06-01

申请人： William Chapman ,  William Capen ,  Gwo-Jer Chang ,  Christopher Handorf ,  Anant Raman ,  Ajay Sevak ,  Kolur Venkatesh

发明人： William Chapman ,  William Capen ,  Gwo-Jer Chang ,  Christopher Handorf ,  Anant Raman ,  Ajay Sevak ,  Kolur Venkatesh

IPC分类号： B65G61/00 ,  G05B19/418 ,  G06F19/00 ,  G06Q10/06 ,  G06F15/22 ,  G06F15/24 ,  G06G7/52

CPC分类号： G06Q10/06 ,  G05B19/41865 ,  G06Q10/06315 ,  G06Q10/0633 ,  Y02P90/18 ,  Y02P90/20 ,  Y02P90/26

摘要： A method for translating complex process flow networks into plans or schedules for the manufacturing of products or the performance of other organizational activities is disclosed. The method maintains a time-valued list of existing commitments to resources. Allocations of these resources are made to lots during a simulation procedure which calculates a resulting plan's timing data. The method simulates higher priority lots before it simulates lower priority lots. A simulation evaluates the process flow description to obtain the relative order of consuming and releasing resources, resource attributes and related capabilities, initial minimum timing requests, and process control rules. The simulation uses the list to determine when resources may be used without impacting prior commitments of the resources. In addition, the simulation forces the allocations to conform to the process control rules. The resulting timing data is merged into the processing plan, and resource commitments are then made to the simulated resource. When lower priority lots are simulated, commitments have already been made to higher priority lots. Thus, the lower priority lots cannot receive resource allocations which impact the higher priority lots. However, the lower priority lots may receive allocations which occur prior to contending allocations to higher priority lots.

摘要翻译： 公开了将复杂流程网络转换成用于制造产品或执行其他组织活动的计划或时间表的方法。 该方法保留了对资源的现有承诺的时间价值列表。 在计算生成计划的计时数据的模拟过程中，这些资源的分配是批量的。 该方法在模拟较低优先级批次之前模拟较高优先级的批次。 仿真评估过程流程描述，以获得消耗和释放资源，资源属性和相关功能，初始最小定时请求和过程控制规则的相对顺序。 模拟使用列表来确定何时可以使用资源，而不影响资源的先前承诺。 此外，模拟强制分配符合过程控制规则。 所得到的定时数据被合并到处理计划中，然后对模拟资源进行资源承诺。 当模拟较低优先级的地段时，已经对优先权较高的地段做出了承诺。 因此，较低优先级的批次不能接收影响较高优先权批次的资源分配。 然而，较低优先权的地块可能会在竞争分配到更高优先级地块之前发生分配。