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

51. 发明申请

US20120066395A1 DYNAMIC APPLICATION PROVISIONING IN CLOUD COMPUTING ENVIRONMENTS 有权
标题翻译：云计算环境中的动态应用提供
公开(公告)号：US20120066395A1
公开(公告)日：2012-03-15
申请号：US13215089
申请日：2011-08-22
申请人： Richard Ellis , Matthew Leming , Timothy Ward
发明人： Richard Ellis , Matthew Leming , Timothy Ward
IPC分类号： G06F15/173
CPC分类号： G06F9/5072 , H04L41/0823 , H04L41/0826 , H04L41/083 , H04L41/0836 , H04L41/145
摘要： A method for dynamically provisioning a machine with applications to assist with work is a cloud computing environment is described. In one embodiment, such a method includes identifying a machine available for provisioning with at least one application. The method identifies work associated with a cloud computing environment. Responsive to identifying the work, the method determines how the machine can most optimally assist with the work. The method then dynamically provisions the machine with at least one application selected to enable the machine to most optimally assist with the work. A corresponding apparatus and computer program product are also disclosed.
摘要翻译：用于动态配置应用程序来协助工作的机器的方法是描述云计算环境。在一个实施例中，这种方法包括利用至少一个应用来识别可用于供应的机器。该方法识别与云计算环境相关联的工作。响应于识别工作，该方法决定了机器如何最有效地协助工作。该方法然后动态地为机器提供至少一个应用程序，以使机器能够最佳地协助工作。还公开了相应的装置和计算机程序产品。

52. 发明申请

US20110280129A1 System of Path Computation Element Protocol Support for Large-Scale Concurrent Path Computation 有权
标题翻译：路径计算元素协议支持大规模并行路径计算的系统
公开(公告)号：US20110280129A1
公开(公告)日：2011-11-17
申请号：US13193151
申请日：2011-07-28
申请人： Young Lee
发明人： Young Lee
IPC分类号： H04L12/56
CPC分类号： H04L45/38 , H04L41/0816 , H04L41/0826 , H04L45/021 , H04L45/04 , H04L45/28 , H04L45/502
摘要： A system for a global concurrent path computation in a communication network is disclosed. The system includes a path computation element communication protocol, wherein the protocol includes an indicator field indicating the global concurrent path computation, a global objective function field providing an overarching objective function, a global constraint field specifying at least one global constraint, a global concurrent vector field specifying at least one path computation request, and another indicator field indicating an outcome of a path computation request.
摘要翻译：公开了一种用于通信网络中的全局并发路径计算的系统。所述系统包括路径计算单元通信协议，其中所述协议包括指示全局并发路径计算的指示符字段，提供总体目标函数的全局目标函数域，指定至少一个全局约束的全局约束域，全局并发向量指定至少一个路径计算请求的字段，以及指示路径计算请求的结果的另一指示符字段。

53. 发明申请

US20110044354A1 Adaptive Packaging of Network Resources 有权
标题翻译：网络资源的自适应包装
公开(公告)号：US20110044354A1
公开(公告)日：2011-02-24
申请号：US12543367
申请日：2009-08-18
申请人： Xiaoliang Wei
发明人： Xiaoliang Wei
IPC分类号： H04J3/22
CPC分类号： H04L43/0876 , H04L41/0816 , H04L41/0826 , H04L41/0893 , H04L43/0864 , H04L47/70 , H04L67/22
摘要： In one embodiment, a method includes accessing a data store comprising a log of requests transmitted by a plurality of remote hosts, each request corresponding to one or more resources maintained by a web site; analyzing the requests and one or more attributes of the resources corresponding to the respective requests using a cost function relating to network performance, wherein a first component of the cost function is directed to a performance improvement achieved by grouping one or more of the resources for transmission to one or more remote hosts and a second component is directed to a performance inefficiency caused by grouping the one or more resources for transmission to the one or more remote hosts; and identifying one or more groupings of one or more resources that optimize the cost function for network performance.
摘要翻译：在一个实施例中，一种方法包括访问数据存储器，其包括由多个远程主机发送的请求的日志，每个请求对应于由网站维护的一个或多个资源; 使用与网络性能相关的成本函数分析与各个请求相对应的资源的请求和一个或多个属性，其中成本函数的第一分量针对通过分组用于传输的一个或多个资源而实现的性能改进到一个或多个远程主机，并且第二组件被定向到通过将一个或多个资源分组以发送到一个或多个远程主机而导致的性能低效率; 以及识别为网络性能优化成本函数的一个或多个资源的一个或多个分组。

54. 发明授权

US07646730B2 Availability aware cost modeling for optical core networks 有权
标题翻译：光核心网络可用性感知成本建模
公开(公告)号：US07646730B2
公开(公告)日：2010-01-12
申请号：US10926818
申请日：2004-08-26
申请人： Hakki C. Cankaya , Ana Lardies , Gary Ester
发明人： Hakki C. Cankaya , Ana Lardies , Gary Ester
IPC分类号： H04L12/28
CPC分类号： H04J14/0293 , H04J14/0227 , H04J14/0241 , H04J14/0283 , H04J14/0284 , H04J14/0289 , H04L41/0826 , H04L41/0836 , H04L41/12 , H04L41/145
摘要： A sequential iterative methodology is used to generate a solution space with different cost/availability values for multiple network architectures from which an optimal or near-optimal solution can be determined. A modeling module (10) provides a cost value for a network architecture under consideration and, once cost modeling is done, an availability analysis is performed for the architecture under analysis. If a relatively few connections prevent a model from acceptability, the availability analysis module (12) reveals the causing factors of the unsatisfactory availability for those few connections and suggests that the modeling perform further optimisations on those causing factors. This iterative process is repeated until an optimum or near-optimum acceptable solution is found; if no acceptable solution is found, the solutions generated in the availability analysis module are reviewed to find the best available solution.
摘要翻译：使用顺序迭代方法来为多个网络架构生成具有不同成本/可用性值的解空间，从中可以确定最优或近似最优解。建模模块（10）为所考虑的网络架构提供成本值，一旦完成成本建模，就对被分析的架构进行可用性分析。如果相对较少的连接阻止模型的可接受性，则可用性分析模块（12）揭示了导致这些少数连接的不可满足的可用性的原因，并建议建模对那些导致因素进行进一步的优化。重复该迭代过程，直到发现最佳或接近最佳可接受的解; 如果找不到可接受的解决方案，则在可用性分析模块中生成的解决方案进行审查，以找到最佳可用解决方案。

55. 发明授权

US07581207B2 Method of configuring managed entities in a communications network using configuration templates 有权
标题翻译：使用配置模板配置通信网络中的受管实体的方法
公开(公告)号：US07581207B2
公开(公告)日：2009-08-25
申请号：US10726532
申请日：2003-12-04
申请人： Ronald Scott Bolder , Chi Zhang
发明人： Ronald Scott Bolder , Chi Zhang
IPC分类号： G06F9/44 , G06F11/00
CPC分类号： H04L41/0883 , H04L41/0816 , H04L41/0826 , H04L41/0843 , H04L41/0859 , H04L41/22
摘要： The advantages are derived from a cost-reduced managed entity configuration of various communications network equipment having diverse makes, models, and software releases. Expertise of highly trained analysts is employed in a time-efficient manner to write discrete parameterized configuration script templates for maximum re-use, thereby reducing the number of scripts that they are required to maintain and deploy with each update. Script execution dependencies and version information associated with script templates enable script dependency checking, script version control, and customization of scripts for target managed entity reducing exposure to errors in performing managed entity configuration tasks. Network management personnel with little or no command line interface configuration knowledge merely select and populate parameters for scripts required to perform required configuration tasks enhancing configuration management cost-effectiveness. Faster support for new managed entities and features is provided via the configuration task specific script templates.
摘要翻译：优点源自具有不同制造，型号和软件版本的各种通信网络设备的成本降低的管理实体配置。以高效的方式采用经过高度训练的分析师的专长来编写离散参数化配置脚本模板，以最大限度地重复使用，从而减少每个更新维护和部署所需的脚本数量。与脚本模板相关联的脚本执行依赖关系和版本信息使脚本依赖性检查，脚本版本控制和目标受管实体脚本的自定义减少了执行管理实体配置任务中的错误。具有很少或没有命令行接口配置知识的网络管理人员只需选择和填充执行所需配置任务所需的脚本的参数，从而增强配置管理的成本效益。通过配置任务特定的脚本模板提供对新管理实体和功能的更快的支持。

56. 发明授权

US07568036B2 Adaptive management method with automatic scanner installation 失效
标题翻译：自动扫描仪安装的自适应管理方法
公开(公告)号：US07568036B2
公开(公告)日：2009-07-28
申请号：US11289110
申请日：2005-11-29
申请人： Salvatore D'Alo , Alessandro Donatelli , Claudio Marinelli , Alessandro Scotti
发明人： Salvatore D'Alo , Alessandro Donatelli , Claudio Marinelli , Alessandro Scotti
IPC分类号： G06F15/173
CPC分类号： H04L41/0816 , H04L41/0826 , H04L41/0856 , H04L67/125
摘要： A self-adaptive resource management method (200) is proposed. The method is based on an authority (105) that publishes multiple rules into a corresponding repository (115). Each rule defines a desired target configuration for a category of subjects (110); each category is specified by one or more attributes that are evaluated by corresponding scanners (233-239). Whenever new rules are published, a dedicated module (120) creates and publishes further rules for selectively installing the scanners that are required for evaluating the attributes included in the categories of the new rules. These further rules are defined according to an algorithm that attempts to minimize the cost involved by the installation of the scanners.
摘要翻译：提出了一种自适应资源管理方法（200）。该方法基于将多个规则发布到对应的仓库（115）中的权限（105）。每个规则定义对象类别（110）的期望目标配置; 每个类别由一个或多个由相应扫描仪（233-239）评估的属性指定。每当发布新规则时，专用模块（120）创建并发布用于选择性地安装扫描器的进一步规则，所述扫描器是评估新规则类别中所包括的属性所需的。这些进一步的规则是根据一种尝试将扫描仪安装所涉及的成本最小化的算法来定义的。

57. 发明授权

US07460526B1 System and method for establishing a carrier virtual network inverse multiplexed telecommunication connection 有权
标题翻译：用于建立载波虚拟网络反向复用电信连接的系统和方法
公开(公告)号：US07460526B1
公开(公告)日：2008-12-02
申请号：US10697396
申请日：2003-10-30
申请人： Bruce Edward Hoffman , Peter H. Distler , Durga Prasad Satapathy
发明人： Bruce Edward Hoffman , Peter H. Distler , Durga Prasad Satapathy
IPC分类号： H04L12/50 , H04J3/04
CPC分类号： H04L41/0896 , H04L12/4604 , H04L12/4641 , H04L41/0806 , H04L41/0826 , H04L41/5035 , H04L43/0852
摘要： The present invention provides a system and method for establishing an inverse multiplexed connection using layer one resources dedicated to a carrier virtual network. A plurality of links may be identified that when combined will meet the service level requirements for a connection. The plurality of links may be aggregated at their termination point. The plurality of links may be further aggregated by a carrier virtual network manager. Alternative links may be identified and aggregated if any of the plurality of links become impaired.
摘要翻译：本发明提供一种使用专用于载波虚拟网络的第一层资源建立逆多路复用连接的系统和方法。可以识别多个链路，当组合时将满足连接的服务级别要求。多个链接可以在其终止点聚合。多个链路可以由运营商虚拟网络管理器进一步聚合。如果多个链路中的任一个变得受损，则可以识别和聚合替代链路。

58. 发明申请

US20080209043A1 SERVER MIGRATION PLANNING SYSTEM AND SERVER MIGRATION PLANNING METHOD 有权
标题翻译：服务器移动规划系统和服务器迁移规划方法
公开(公告)号：US20080209043A1
公开(公告)日：2008-08-28
申请号：US12022397
申请日：2008-01-30
申请人： YASUHIRO AJIRO
发明人： YASUHIRO AJIRO
IPC分类号： G06F15/173
CPC分类号： G06F3/0647 , G06F3/0607 , G06F3/067 , H04L41/0826 , H04L41/0833 , H04L41/0889 , H04L43/0876 , H04L67/1097
摘要： A server migration planning system for planning server migration from source servers to destination servers is provided. A processor allocates the respective source servers to any ones of the destination servers, based on the resource usage of the respective source servers and resource capacity of the respective destination servers. The processor selects the source servers one-by-one in descending order of the resource usage, selects any one of the destination servers, and makes a comparison between a comparison-object usage as the resource usage of the selected source server and a remaining amount of the resource capacity of the selected destination server. If the comparison-object usage is more than the remaining amount, the processor selects another destination server and then makes the comparison again. If the comparison-object usage is not more than the remaining amount, the processor allocates the selected source server to the selected destination server.
摘要翻译：提供了一个用于规划从源服务器迁移到目标服务器的服务器迁移计划系统。处理器根据各个源服务器的资源使用情况和相应的目标服务器的资源容量，将相应的源服务器分配给任何一个目的地服务器。处理器以资源使用的降序逐个选择源服务器，选择目的地服务器中的任何一个，并且将比较对象使用情况作为所选择的源服务器的资源使用量与剩余量进行比较的所选目标服务器的资源容量。如果比较对象使用量大于剩余量，则处理器选择另一个目标服务器，然后再次进行比较。如果比较对象使用量不超过剩余量，则处理器将所选择的源服务器分配给所选择的目标服务器。

59. 发明申请

US20080186873A1 NETWORK CONFIGURATION OPTIMIZATION 有权
标题翻译：网络配置优化
公开(公告)号：US20080186873A1
公开(公告)日：2008-08-07
申请号：US11671274
申请日：2007-02-05
申请人： Nicolas Pujet , David Rodrian
发明人： Nicolas Pujet , David Rodrian
IPC分类号： H04L12/28
CPC分类号： H04L12/5692 , H04L41/0826
摘要： A method for optimizing a network configuration of network resources includes receiving service attribute data associated with network resources and the traffic demand, based at least in part on the service attribute data, determining one or more network resources for providing communication between end user devices and a carrier network, i.e., one or more metro and/or backbone networks, and determining an optimal configuration of the one or more network resources within the network, wherein the optimal configuration optimizes one or more predetermined criteria. A system for optimizing a configuration of network resources includes a computer-readable medium including service attribute data descriptive of a plurality of network resources, a preprocessing module operable to receive the one or more service attributes and determine a set of one or more resources and transmission modes between the end user devices and the carrier network, and an optimization module operable to determine an optimum configuration of the resources and transmission modes within the network.
摘要翻译：用于优化网络资源的网络配置的方法包括：至少部分地基于所述服务属性数据来接收与网络资源相关联的服务属性数据和所述业务需求，确定用于在终端用户设备之间提供通信的一个或多个网络资源运营商网络，即一个或多个城域和/或骨干网络，以及确定网络内的一个或多个网络资源的最佳配置，其中所述最佳配置优化一个或多个预定标准。一种用于优化网络资源的配置的系统包括包括描述多个网络资源的服务属性数据的计算机可读介质，可操作以接收所述一个或多个服务属性并确定一个或多个资源和传输的集合的预处理模块最终用户设备和运营商网络之间的模式，以及可用于确定网络内的资源和传输模式的最佳配置的优化模块。

60. 发明申请

US20060092936A1 Method for allocating blocks of internet protocol (IP) addresses in networks 有权
标题翻译：网络中分配互联网协议（IP）地址块的方法
公开(公告)号：US20060092936A1
公开(公告)日：2006-05-04
申请号：US11158752
申请日：2005-06-22
申请人： Hanan Luss
发明人： Hanan Luss
IPC分类号： G06F15/16
CPC分类号： H04L41/00 , H04L29/12283 , H04L29/12933 , H04L41/0826 , H04L61/2061 , H04L61/6068
摘要： Methods for allocating blocks of addresses to nodes in an IP communications network determine an optimal set of serving subnets, referred to as resources, for a single node in an IP communications network with given input demands for blocks of addresses. An optimal set of resources is determined at the node to a relaxed problem that aggregates all the demands to a single large demand and deletes the constraints that each demand must be assigned to a single resource. Each of the original demands is assigned to a single resource from among those determined by the solution to the relaxed problem. The optimal solution balances the amount of excess addresses that are not used at the resources with the fragmentation of addresses at the node to too many resources with a discontinuous range of addresses. New resources can be allocated to nodes that already have existing resources. Specifically, it is possible to evaluate the desirability of returning existing resources to a pool of addresses in order to gain more flexibility in allocating new resources to the node. The methods can also be used to allocate subnets at all nodes in a tree network by solving repeatedly single-node problems, starting at the lowest level of the tree. The resulting serving subnets at nodes of one level are demands to nodes at the next higher level.
摘要翻译：为IP通信网络中的节点分配地址块的方法确定IP通信网络中的单个节点的称为资源的最佳服务子网集合，并给出对地址块的给定输入要求。在节点处确定最佳资源集合以将所有需求聚合到单个大需求的松弛问题，并且删除每个需求必须分配给单个资源的约束。原始需求中的每一个都被分配给从解决轻松问题确定的那些资源中的单个资源。最佳解决方案平衡了资源上未使用的超出地址的数量与节点处的地址碎片到具有不连续地址范围的资源太多。可以将新资源分配给已有现有资源的节点。具体来说，可以评估将现有资源返回到地址池的可取性，以便在将新的资源分配给节点时获得更大的灵活性。该方法还可以用于通过从树的最底层开始解决重复的单节点问题来在树网络中的所有节点处分配子网。在一个级别的节点处产生的服务子网是对下一个更高级别的节点的需求。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式