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

1. 发明授权

US08856386B2 Cloud resource placement using placement pivot in physical topology 有权
标题翻译：在物理拓扑中使用放置枢轴的云资源放置
公开(公告)号：US08856386B2
公开(公告)日：2014-10-07
申请号：US13591107
申请日：2012-08-21
申请人： Debojyoti Dutta , Senhua Huang , Raja Tadimeti , Subrata Banerjee
发明人： Debojyoti Dutta , Senhua Huang , Raja Tadimeti , Subrata Banerjee
IPC分类号： G06F15/16
CPC分类号： H04L41/145 , H04L41/0823 , H04L41/0883
摘要： In one embodiment, a method comprises retrieving a request graph specifying request nodes identifying respective requested cloud computing service operations, and at least one request edge specifying a requested path requirements connecting the request nodes; identifying a placement pivot among feasible cloud elements identified in a physical graph representing a data network having a physical topology, each feasible cloud element an available solution for one of the request nodes, the placement pivot having a maximum depth in the physical topology relative to the feasible cloud elements; ordering the feasible cloud elements, according to increasing distance from the placement pivot to form an ordered list of candidate sets of feasible cloud elements; and determining an optimum candidate set, from at least a portion of the ordered list, based on the optimum candidate set having an optimized fitness function in the physical graph among the other candidate sets in the ordered list.
摘要翻译：在一个实施例中，一种方法包括检索指定请求节点的请求图，所述请求图识别相应的所请求的云计算服务操作，以及至少一个请求边缘，其指定连接所述请求节点的请求的路径要求; 识别在表示具有物理拓扑的数据网络的物理图中识别的可行云元素之间的放置枢轴，每个可行云元素是所述请求节点之一的可用解决方案，所述放置枢轴在所述物理拓扑中具有相对于所述物理拓扑的最大深度可行的云元素; 根据从放置枢轴的距离的增加来排序可行的云元素，以形成可行云元素候选集的有序列表; 以及从所述有序列表的至少一部分基于在所述有序列表中的所述其他候选集中的所述物理图中具有优化的适应度函数的最佳候选组来确定最佳候选集。

2. 发明申请

US20140059178A1 CLOUD RESOURCE PLACEMENT USING PLACEMENT PIVOT IN PHYSICAL TOPOLOGY 有权
标题翻译：使用放置在物理拓扑学中的云资源放置
公开(公告)号：US20140059178A1
公开(公告)日：2014-02-27
申请号：US13591107
申请日：2012-08-21
申请人： Debojyoti DUTTA , Senhua HUANG , Raja TADIMETI , Subrata BANERJEE
发明人： Debojyoti DUTTA , Senhua HUANG , Raja TADIMETI , Subrata BANERJEE
IPC分类号： G06F15/16
CPC分类号： H04L41/145 , H04L41/0823 , H04L41/0883
摘要： In one embodiment, a method comprises retrieving a request graph specifying request nodes identifying respective requested cloud computing service operations, and at least one request edge specifying a requested path requirements connecting the request nodes; identifying a placement pivot among feasible cloud elements identified in a physical graph representing a data network having a physical topology, each feasible cloud element an available solution for one of the request nodes, the placement pivot having a maximum depth in the physical topology relative to the feasible cloud elements; ordering the feasible cloud elements, according to increasing distance from the placement pivot to form an ordered list of candidate sets of feasible cloud elements; and determining an optimum candidate set, from at least a portion of the ordered list, based on the optimum candidate set having an optimized fitness function in the physical graph among the other candidate sets in the ordered list.
摘要翻译：在一个实施例中，一种方法包括检索指定请求节点的请求图，所述请求图识别相应的所请求的云计算服务操作，以及至少一个请求边缘，其指定连接所述请求节点的请求的路径要求; 识别在表示具有物理拓扑的数据网络的物理图中识别的可行云元素之间的放置枢轴，每个可行云元素是所述请求节点之一的可用解决方案，所述放置枢轴在所述物理拓扑中具有相对于所述物理拓扑的最大深度可行的云元素; 根据从放置枢轴的距离的增加来排序可行的云元素，以形成可行云元素候选集的有序列表; 以及从所述有序列表的至少一部分基于在所述有序列表中的所述其他候选集中的所述物理图中具有优化的适应度函数的最佳候选组来确定最佳候选集。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式