-
公开(公告)号：US20130219068A1
公开(公告)日：2013-08-22
申请号：US13400579
申请日：2012-02-21
IPC分类号： G06F15/173
CPC分类号： G06F9/5061 , G06F9/5044 , G06F2209/508 , G06Q10/063
摘要： Methods of predicting datacenter performance to improve provisioning are described. In an embodiment, a resource manager element receives a request from a tenant which describes an application that the tenant wants executed by a multi-resource, multi-tenant datacenter. The request that has been received is mapped to a set of different candidate resource combinations within the datacenter, where each candidate resource combination can be used to execute the application in a manner which satisfies a high level constraint specified within the request. This mapping may, for example, be performed using a combination of benchmarking and an analytical model. In some examples, each resource combination may comprise a number of virtual machines and a bandwidth between those machines. Data relating to at least a subset (and in some examples, two or more) of the candidate resource combinations is then presented to the tenant.
摘要翻译： 描述了预测数据中心性能以改善配置的方法。 在一个实施例中，资源管理器元件接收来自租户的请求，所述请求描述了租户希望由多资源，多租户数据中心执行的应用。 已经接收到的请求被映射到数据中心内的一组不同的候选资源组合，其中每个候选资源组合可以用于以满足请求中指定的高级约束的方式来执行应用。 例如，该映射可以使用基准测试和分析模型的组合来执行。 在一些示例中，每个资源组合可以包括多个虚拟机以及这些机器之间的带宽。 然后将与候选资源组合的至少一个子集（并且在一些示例中，两个或更多个）相关的数据呈现给租户。
-
公开(公告)号：US09727383B2
公开(公告)日：2017-08-08
申请号：US13400579
申请日：2012-02-21
IPC分类号： G06F15/16 , G06F15/177 , G06F9/50 , G06Q10/06
CPC分类号： G06F9/5061 , G06F9/5044 , G06F2209/508 , G06Q10/063
摘要： Methods of predicting datacenter performance to improve provisioning are described. In an embodiment, a resource manager element receives a request from a tenant which describes an application that the tenant wants executed by a multi-resource, multi-tenant datacenter. The request that has been received is mapped to a set of different candidate resource combinations within the datacenter, where each candidate resource combination can be used to execute the application in a manner which satisfies a high level constraint specified within the request. This mapping may, for example, be performed using a combination of benchmarking and an analytical model. In some examples, each resource combination may comprise a number of virtual machines and a bandwidth between those machines. Data relating to at least a subset (and in some examples, two or more) of the candidate resource combinations is then presented to the tenant.
-
公开(公告)号：US08671407B2
公开(公告)日：2014-03-11
申请号：US13176901
申请日：2011-07-06
IPC分类号： G06F9/455
CPC分类号： G06F9/45533 , G06F9/45558 , G06F9/5077 , G06F2009/45579 , G06F2209/501 , H04L67/101 , H04L67/38
摘要： Methods of offering network performance guarantees in multi-tenant datacenters are described. In an embodiment, a request for resources received at a datacenter from a tenant comprises a number of virtual machines and a performance requirement, such as a bandwidth requirement, specified by the tenant. A network manager within the datacenter maps the request onto the datacenter topology and allocates virtual machines within the datacenter based on the available slots for virtual machines within the topology and such that the performance requirement is satisfied. Following allocation, stored residual capacity values for elements within the topology are updated according to the new allocation and this updated stored data is used in mapping subsequent requests onto the datacenter. The allocated virtual machines form part of a virtual network within the datacenter which is allocated in response to the request and two virtual network abstractions are described: virtual clusters and virtual oversubscribed clusters.
摘要翻译： 描述了在多租户数据中心中提供网络性能保证的方法。 在一个实施例中，对从租户在数据中心接收的资源的请求包括许多虚拟机和诸如由租户指定的带宽需求的性能要求。 数据中心内的网络管理器将请求映射到数据中心拓扑，并根据拓扑中的虚拟机的可用插槽为数据中心内的虚拟机分配，以满足性能要求。 在分配之后，根据新分配更新拓扑内的元素的存储剩余容量值，并且该更新的存储数据用于将后续请求映射到数据中心。 所分配的虚拟机构成数据中心内的虚拟网络的一部分，该虚拟网络是根据请求分配的，并且描述了两个虚拟网络抽象：虚拟集群和虚拟超额订阅集群。
-
公开(公告)号：US20130014101A1
公开(公告)日：2013-01-10
申请号：US13176901
申请日：2011-07-06
IPC分类号： G06F9/455
CPC分类号： G06F9/45533 , G06F9/45558 , G06F9/5077 , G06F2009/45579 , G06F2209/501 , H04L67/101 , H04L67/38
摘要： Methods of offering network performance guarantees in multi-tenant datacenters are described. In an embodiment, a request for resources received at a datacenter from a tenant comprises a number of virtual machines and a performance requirement, such as a bandwidth requirement, specified by the tenant. A network manager within the datacenter maps the request onto the datacenter topology and allocates virtual machines within the datacenter based on the available slots for virtual machines within the topology and such that the performance requirement is satisfied. Following allocation, stored residual capacity values for elements within the topology are updated according to the new allocation and this updated stored data is used in mapping subsequent requests onto the datacenter. The allocated virtual machines form part of a virtual network within the datacenter which is allocated in response to the request and two virtual network abstractions are described: virtual clusters and virtual oversubscribed clusters.
摘要翻译： 描述了在多租户数据中心中提供网络性能保证的方法。 在一个实施例中，对从租户在数据中心接收的资源的请求包括许多虚拟机和诸如由租户指定的带宽需求的性能要求。 数据中心内的网络管理器将请求映射到数据中心拓扑，并根据拓扑中的虚拟机的可用插槽为数据中心内的虚拟机分配，以满足性能要求。 在分配之后，根据新分配更新拓扑内的元素的存储剩余容量值，并且该更新的存储数据用于将后续请求映射到数据中心。 所分配的虚拟机构成数据中心内的虚拟网络的一部分，该虚拟网络是根据请求分配的，并且描述了两个虚拟网络抽象：虚拟集群和虚拟超额订阅集群。
-
公开(公告)号：US09077670B2
公开(公告)日：2015-07-07
申请号：US12969228
申请日：2010-12-15
IPC分类号： H04B7/204 , H04L12/911
CPC分类号： H04L47/28 , H04L47/805 , H04L47/826
摘要： A deadline-aware network protocol is described. In an example, data transfer at a transport layer entity of a packet-based communication network is controlled by receiving a request for network resources for a data flow from a network element and allocating network resources to the data flow. The data flow comprises a number of data packets associated with an application, and the request comprises a factor relating to a time deadline associated with the application. The network resources allocated depend on the factor relating to the time deadline. In examples, the network resource can be a bandwidth or data rate allocated to the data flow, and the factor can be a data rate sufficient to complete the data flow within the time deadline. In examples, the network resources are allocated greedily, such that requests are fully satisfied whenever possible, and the network resources are fully utilized.
摘要翻译： 描述了一个截止日期的网络协议。 在一个示例中，通过从网元接收对数据流的网络资源的请求并且将网络资源分配给数据流来控制在基于分组的通信网络的传输层实体处的数据传输。 数据流包括与应用相关联的多个数据分组，并且该请求包括与应用相关联的时间限制的因素。 分配的网络资源取决于与时间限制有关的因素。 在示例中，网络资源可以是分配给数据流的带宽或数据速率，并且该因子可以是足以在时间段内完成数据流的数据速率。 在示例中，网络资源被贪婪地分配，使得尽可能完全满足请求，并且网络资源被充分利用。
-
公开(公告)号：US20120155265A1
公开(公告)日：2012-06-21
申请号：US12969228
申请日：2010-12-15
IPC分类号： H04L12/26
CPC分类号： H04L47/28 , H04L47/805 , H04L47/826
摘要： A deadline-aware network protocol is described. In an example, data transfer at a transport layer entity of a packet-based communication network is controlled by receiving a request for network resources for a data flow from a network element and allocating network resources to the data flow. The data flow comprises a number of data packets associated with an application, and the request comprises a factor relating to a time deadline associated with the application. The network resources allocated depend on the factor relating to the time deadline. In examples, the network resource can be a bandwidth or data rate allocated to the data flow, and the factor can be a data rate sufficient to complete the data flow within the time deadline. In examples, the network resources are allocated greedily, such that requests are fully satisfied whenever possible, and the network resources are fully utilized.
摘要翻译： 描述了一个截止日期的网络协议。 在一个示例中，通过从网元接收对数据流的网络资源的请求并且将网络资源分配给数据流来控制在基于分组的通信网络的传输层实体处的数据传输。 数据流包括与应用相关联的多个数据分组，并且该请求包括与应用相关联的时间限制的因素。 分配的网络资源取决于与时间限制有关的因素。 在示例中，网络资源可以是分配给数据流的带宽或数据速率，并且该因子可以是足以在时间段内完成数据流的数据速率。 在示例中，网络资源被贪婪地分配，使得尽可能完全满足请求，并且网络资源被充分利用。
-
公开(公告)号：US20120151292A1
公开(公告)日：2012-06-14
申请号：US12967903
申请日：2010-12-14
CPC分类号： G06F9/5066
摘要： Supporting distributed key-based processes is described. In an embodiment, servers at a data center provide a key-based process for carrying out computationally expensive tasks and are connected using point to point connections in a geometric topology such as a torus. In an example, aggregation trees are built on top of the geometric topology of the data center, each aggregation tree being a sequence of servers in the data center that forms a tree structure. In an embodiment packets of data are sent from the leaves of the trees to the root and at each server along the tree the packets are aggregated using a combiner function of the key-based process. In an embodiment, if a server fails, the trees are dynamically recomputed and a recovery phase is triggered to resend any packets lost at the failed server. In some embodiments, packets are scheduled by inspecting the content of the packets.
摘要翻译： 描述支持基于分布式密钥的进程。 在一个实施例中，数据中心的服务器提供用于执行计算上昂贵的任务的基于密钥的过程，并且使用诸如环面的几何拓扑中的点对点连接。 在一个示例中，聚合树建立在数据中心的几何拓扑之上，每个聚合树是数据中心中形成树结构的一系列服务器。 在一个实施例中，使用基于密钥的过程的组合器功能，将数据包从树的树叶发送到根，并且沿树的每个服务器将数据包聚合。 在一个实施例中，如果服务器发生故障，则动态地重新计算树并且触发恢复阶段以重新发送在故障服务器处丢失的任何分组。 在一些实施例中，通过检查分组的内容来调度分组。
-
公开(公告)号：US20120158858A1
公开(公告)日：2012-06-21
申请号：US12969963
申请日：2010-12-16
IPC分类号： G06F15/16 , G06F15/173
CPC分类号： H04L51/22
摘要： Resource optimization for online services is described. In one example, objects (such as mailboxes or other data associated with an online service) are assigned to network elements (such as servers) by inferring a relationship graph from log data relating to usage of the online service. The graph has a node for each object, and connections between each pair of objects having data items in common. Each connection has a weight relating to the number of common data items. The graph is partitioned into a set of clusters, such that each cluster has nodes joined by connections with a high weight relative to the weight of connections between nodes in different clusters. The objects are then distributed to the network elements such that objects corresponding to nodes in the same cluster are located on the same network element.
摘要翻译： 描述了在线服务的资源优化。 在一个示例中，通过从与在线服务的使用相关的日志数据推断关系图，将对象（诸如邮箱或与在线服务相关联的其他数据）分配给网络元件（例如服务器）。 该图具有每个对象的节点，以及具有共同数据项的每对对象之间的连接。 每个连接具有与公共数据项的数量相关的权重。 该图被划分成一组集群，使得每个集群具有通过具有相对于不同集群中的节点之间的连接的权重的高权重的连接而连接的节点。 然后将对象分发到网络元件，使得与相同集群中的节点相对应的对象位于同一网络元件上。
-
公开(公告)号：US09015345B2
公开(公告)日：2015-04-21
申请号：US12969181
申请日：2010-12-15
申请人： Gregory O'Shea , Austin Donnelly , Antony Rowstron , Paolo Costa
发明人： Gregory O'Shea , Austin Donnelly , Antony Rowstron , Paolo Costa
CPC分类号： H04L45/122 , H04L45/26 , H04L45/72 , H04L67/1038 , H04L69/14 , H04L69/40
摘要： An application programming interface (API) supporting server and key based networking is described. In an embodiment, the API receives either a key or a server address from a service running on a server in a direct-connect topology and returns data which identifies suitable next hops for transmission of a packet of data which has a destination of the received server address or of a server address which is encoded within the received key. In another embodiment, the key also encodes information specifying alternative server addresses for use in the event that the original server is unreachable. This information may also be used to define servers for replication of the key. A further embodiment describes a method of queuing packets for transmission against multiple links, where the packet is transmitted on the first available link and at this time is removed from the queues for the other links.
摘要翻译： 描述了支持服务器和基于密钥的联网的应用程序编程接口（API）。 在一个实施例中，API从直接连接拓扑中的服务器上运行的服务接收密钥或服务器地址，并返回标识合适的下一跳的数据，用于发送具有所接收服务器的目的地的数据分组 地址或在接收到的密钥内编码的服务器地址。 在另一个实施例中，密钥还对指定替代服务器地址的信息进行编码，以在原始服务器不可达的情况下使用。 此信息也可用于定义用于密钥复制的服务器。 另一实施例描述了一种排队分组以对多个链路进行传输的方法，其中分组在第一可用链路上传输，并且此时从其他链路的队列中移除。
-
公开(公告)号：US20120158998A1
公开(公告)日：2012-06-21
申请号：US12969181
申请日：2010-12-15
申请人： Gregory O'Shea , Austin Donnelly , Antony Rowstron , Paolo Costa
发明人： Gregory O'Shea , Austin Donnelly , Antony Rowstron , Paolo Costa
IPC分类号： G06F15/16
CPC分类号： H04L45/122 , H04L45/26 , H04L45/72 , H04L67/1038 , H04L69/14 , H04L69/40
摘要： An application programming interface (API) supporting server and key based networking is described. In an embodiment, the API receives either a key or a server address from a service running on a server in a direct-connect topology and returns data which identifies suitable next hops for transmission of a packet of data which has a destination of the received server address or of a server address which is encoded within the received key. In another embodiment, the key also encodes information specifying alternative server addresses for use in the event that the original server is unreachable. This information may also be used to define servers for replication of the key. A further embodiment describes a method of queuing packets for transmission against multiple links, where the packet is transmitted on the first available link and at this time is removed from the queues for the other links.
摘要翻译： 描述了支持服务器和基于密钥的联网的应用程序编程接口（API）。 在一个实施例中，API从直接连接拓扑中的服务器上运行的服务接收密钥或服务器地址，并返回标识合适的下一跳的数据，用于发送具有所接收服务器的目的地的数据分组 地址或在接收到的密钥内编码的服务器地址。 在另一个实施例中，密钥还对指定替代服务器地址的信息进行编码，以在原始服务器不可达的情况下使用。 此信息也可用于定义用于密钥复制的服务器。 另一实施例描述了一种排队分组以对多个链路进行传输的方法，其中分组在第一可用链路上传输，并且此时从其他链路的队列中移除。
-
-
-
-
-
-
-
-
-
搜索结果
34 条记录 (耗时 0.023 秒)