公开(公告)号：US20140059178A1

公开(公告)日：2014-02-27

申请号：US13591107

申请日：2012-08-21

Applicant: Debojyoti DUTTA ,  Senhua HUANG ,  Raja TADIMETI ,  Subrata BANERJEE

Inventor： Debojyoti DUTTA ,  Senhua HUANG ,  Raja TADIMETI ,  Subrata BANERJEE

IPC: G06F15/16

CPC classification number: H04L41/145 ,  H04L41/0823 ,  H04L41/0883

Abstract: 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.

Abstract translation: 在一个实施例中，一种方法包括检索指定请求节点的请求图，所述请求图识别相应的所请求的云计算服务操作，以及至少一个请求边缘，其指定连接所述请求节点的请求的路径要求; 识别在表示具有物理拓扑的数据网络的物理图中识别的可行云元素之间的放置枢轴，每个可行云元素是所述请求节点之一的可用解决方案，所述放置枢轴在所述物理拓扑中具有相对于所述物理拓扑的最大深度 可行的云元素; 根据从放置枢轴的距离的增加来排序可行的云元素，以形成可行云元素候选集的有序列表; 以及从所述有序列表的至少一部分基于在所述有序列表中的所述其他候选集中的所述物理图中具有优化的适应度函数的最佳候选组来确定最佳候选集。

公开(公告)号：US08639793B2

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

申请号：US13040629

申请日：2011-03-04

Applicant: Sukhdev S. Kapur ,  Ethan M. Spiegel ,  Subrata Banerjee ,  Sumeet Singh ,  Ashok Ganesan

Inventor： Sukhdev S. Kapur ,  Ethan M. Spiegel ,  Subrata Banerjee ,  Sumeet Singh ,  Ashok Ganesan

IPC: G06F15/173

CPC classification number: G06F11/2025 ,  G06F9/5072 ,  G06F11/203

Abstract: Techniques are provided to move the services performed on one device to another device in a cloud computing system for a variety of reasons including failure, maintenance or upgrade of the device. A notification is received that services performed by an impacted device in a domain of a plurality of hierarchical domains need to be moved. A determination is made as to whether there are replacement resources available in the domain to perform the services, and if so, the replacement resources are automatically rendered to perform the services. The process continues to higher level domains that have a view into the capabilities of subordinate domains in order to determine where to move the services within the cloud computing system.

Abstract translation: 提供技术用于将一种设备上执行的服务移动到云计算系统中的其他设备，原因有多种，包括设备的故障，维护或升级。 接收到需要移动多个分层域中的受影响设备执行的服务的通知。 确定域中是否有可用的替换资源来执行服务，如果是，则替换资源被自动呈现以执行服务。 该过程继续到具有对下属域的能力的更高级别的域，以便确定在云计算系统内移动服务的位置。

公开(公告)号：US08593965B2

公开(公告)日：2013-11-26

申请号：US12903787

申请日：2010-10-13

Applicant: Arpan Rongong ,  Madhava Rao Cheethirala ,  Nagasree Ravindra ,  Pralhad Katti ,  Ranganathan Rajagopalan ,  Subrata Banerjee ,  Venkataraman Swaminathan

Inventor： Arpan Rongong ,  Madhava Rao Cheethirala ,  Nagasree Ravindra ,  Pralhad Katti ,  Ranganathan Rajagopalan ,  Subrata Banerjee ,  Venkataraman Swaminathan

IPC: H04L12/26

CPC classification number: H04L47/12 ,  H04L49/35 ,  H04L49/356 ,  H04L49/505 ,  H04L49/506 ,  H04L67/1097

Abstract: Techniques are provided for mitigating the effects of slow or no drain devices on a fabric. One or more of the described embodiments can be used alone or in combination to address problems associated with inter-switch link blocking and to address the situation where flows which are not associated with slow/no drain devices suffer the negative impacts of slow or no drain devices on a fabric.

Abstract translation: 提供了减轻织物上缓慢或无排水装置影响的技术。 所描述的实施例中的一个或多个可以单独使用或组合使用以解决与交换机间链路阻塞相关的问题，并且解决与慢/无漏极装置不相关的流受到慢或无漏极的负面影响的情况 织物上的设备。

公开(公告)号：US20130290536A1

公开(公告)日：2013-10-31

申请号：US13455828

申请日：2012-04-25

Applicant: Debojyoti Dutta ,  Subrata Banerjee

Inventor： Debojyoti Dutta ,  Subrata Banerjee

IPC: G06F15/173

CPC classification number: G06F9/5027 ,  G06F2209/502

Abstract: In one embodiment, an n-dimensional resource vector for each of a plurality of resources in a computer network is determined, each n-dimensional resource vector having n property values for a corresponding resource of the plurality of resources. Upon receiving a request for one or more resources of the plurality of resources, where the request indicates one or more desired property values, the techniques convert the desired property values of the request into an n-dimensional request vector, determine a distance between each resource vector and the request vector, and provide a response to the request, the response indicating one or more closest match resources for the request based on the distances.

Abstract translation: 在一个实施例中，确定计算机网络中的多个资源中的每一个的n维资源向量，每个n维资源向量具有用于多个资源的相应资源的n个属性值。 在接收到对于多个资源中的一个或多个资源的请求（其中请求指示一个或多个期望属性值）时，该技术将请求的期望属性值转换为n维请求向量，确定每个资源之间的距离 向量和请求向量，并且向请求提供响应，响应指示基于距离的请求的一个或多个最近匹配资源。

公开(公告)号：US20120331147A1

公开(公告)日：2012-12-27

申请号：US13167322

申请日：2011-06-23

Applicant: Debojyoti Dutta ,  Ashok Ganesan ,  Subrata Banerjee

Inventor： Debojyoti Dutta ,  Ashok Ganesan ,  Subrata Banerjee

IPC: G06F15/16

CPC classification number: G06F9/06 ,  G06F9/5088 ,  G06F2209/5022 ,  Y02D10/32

Abstract: Techniques are provided herein for defragmenting resources within a cloud computing system. The cloud computing system includes a plurality of servers deployed in a plurality of respective racks, wherein the respective racks are deployed in a pod of a data center. An element of the cloud computing system determines for each server in a given rack of servers a number of free resource slots available thereon and a number of resource slots in an idle state, and then further determines whether the number of free resource slots on a first server in the plurality of servers is greater than a predetermined threshold. When the number of free resource slots in the first server is greater than the predetermined threshold, a second server in the plurality of servers is identified with sufficient resource slots thereon to accommodate the number of resource slots in the idle state on the first server, and the resource slots in the idle state on the first server are caused to be migrated to the second server.

Abstract translation: 本文提供了在云计算系统内对资源进行碎片整理的技术。 云计算系统包括部署在多个相应机架中的多个服务器，其中各个机架部署在数据中心的机箱中。 云计算系统的一个要素为给定机架服务器中的每个服务器确定可用的多个空闲资源时隙和空闲状态下的多个资源时隙，然后进一步确定第一个空闲资源时隙的数量 多个服务器中的服务器大于预定阈值。 当第一服务器中的空闲资源时隙数量大于预定阈值时，多个服务器中的第二服务器被标识有足够的资源槽，以容纳第一服务器上处于空闲状态的资源时隙数，以及 导致第一服务器上处于空闲状态的资源槽被迁移到第二服务器。

公开(公告)号：US20120239792A1

公开(公告)日：2012-09-20

申请号：US13048645

申请日：2011-03-15

Applicant: SUBRATA BANERJEE ,  Sukhdev S. Kapur ,  Joshua Merrill ,  Ashok Ganesan ,  Debojyoti Dutta ,  Huida Dai ,  Arpan K. Ghosh

Inventor： SUBRATA BANERJEE ,  Sukhdev S. Kapur ,  Joshua Merrill ,  Ashok Ganesan ,  Debojyoti Dutta ,  Huida Dai ,  Arpan K. Ghosh

IPC: G06F15/173

CPC classification number: H04L67/1097 ,  G06F9/5072 ,  H04L41/12 ,  H04L41/145 ,  H04L41/5096

Abstract: Techniques are described for selecting an optimal data center for instantiating a first cloud service. Embodiments of the invention receive a request specifying a topology of a first cloud service to be hosted by one of a plurality of data centers which provide computing resources to host a plurality of cloud services. A suitability value is then determined for each of the data centers which measures a fitness of the data center for instantiating the first cloud service. In one embodiment, the suitability value is determined by calculating a plurality of metric values for the data center, normalizing the metric values and calculating a weighted average of the normalized values. One of the data centers is then selected for instantiating the first cloud service, based at least in part on the determined suitability values.

Abstract translation: 描述了用于选择用于实例化第一云服务的最佳数据中心的技术。 本发明的实施例接收指定要由多个数据中心之一托管的第一云服务的拓扑的请求，所述数据中心提供计算资源以托管多个云服务。 然后，对于测量用于实例化第一云服务的数据中心的适合度的每个数据中心确定适合性值。 在一个实施例中，通过计算数据中心的多个度量值来确定适用性值，归一化度量值并计算归一化值的加权平均值。 然后，至少部分地基于所确定的适用性值，选择其中一个数据中心用于实例化第一云服务。

公开(公告)号：US20120233333A1

公开(公告)日：2012-09-13

申请号：US13041744

申请日：2011-03-07

Applicant: Ashok Ganesan ,  Subrata Banerjee ,  Arpan K. Ghosh

Inventor： Ashok Ganesan ,  Subrata Banerjee ,  Arpan K. Ghosh

IPC: G06F15/16

CPC classification number: H04L67/24 ,  H04L41/5051 ,  H04L41/5096 ,  H04L65/1069

Abstract: Techniques are provided for sending from a client in a first network device a first session-initiate message to a second network device that is configured to provide network layer, data link layer, or associated convergence layer based service connection information in order for the second network device to accept or reject a network layer, data link layer, or associated convergence layer based service connection with the first network device. The first session-initiate message is based on a messaging and presence protocol. A session-accept message is received at the client in the first network device that is configured to accept the service connection and provide a network layer, data link layer, or associated convergence layer based service connection information in order for the first network device to establish the service connection with the second network device. The session-accept message is based on the messaging and presence protocol. In response to receiving the session-accept message, the service connection is established.

Abstract translation: 提供技术用于从第一网络设备中的客户端发送第一会话发起消息到被配置为提供网络层，数据链路层或关联的基于会聚层的服务连接信息的第二网络设备，以便为第二网络 接收或拒绝网络层，数据链路层或与第一网络设备相关联的基于汇聚层的服务连接的设备。 第一个会话发起消息基于消息传递和存在协议。 在第一网络设备中的客户端处接收会话接受消息，其被配置为接受服务连接并提供网络层，数据链路层或相关联的基于会聚层的服务连接信息，以使第一网络设备建立 与第二网络设备的服务连接。 会话接受消息基于消息传递和存在协议。 响应于接收会话接受消息，建立业务连接。

公开(公告)号：US20120134672A1

公开(公告)日：2012-05-31

申请号：US12954998

申请日：2010-11-29

Applicant: Subrata Banerjee

Inventor： Subrata Banerjee

IPC: H04J14/00

CPC classification number: H04L49/357 ,  H04L49/70

Abstract: Techniques are provided for a switch to assign proxy FCIDs to endpoint device so that the endpoint devices may achieve FCID mobility by retaining their originally assigned FCIDs. At a switch in a network, e.g., a Virtual Storage Area Network (VSAN), a fabric login request is received from a first endpoint device that is associated with a first FC identifier (FCID) that was previously assigned to the first endpoint device by another switch in the VSAN. The fabric login request is responded to with the first FCID. The first endpoint device is assigned a second FCID associated with a domain of the switch where the endpoint device is directly attached to, and the second FCID is used as a proxy FCID within the VSAN for the first endpoint device. A frame is received from the first endpoint device with a source FCID comprising the first FCID and a destination FCID comprising an FCID for a second endpoint device. The source FCID in the frame is overwritten with the second FCID. The frame is forwarded to the second endpoint device.

Abstract translation: 为交换机提供技术以将代理FCID分配给端点设备，使得端点设备可以通过保留其原始分配的FCID来实现FCID移动性。 在网络中的交换机（例如，虚拟存储区域网络（VSAN））处，从第一端点设备接收到与之前分配给第一终端设备的第一FC标识符（FCID）相关联的结构登录请求，该第一FC标识符 VSAN中的另一个开关。 第一个FCID响应Fabric登录请求。 为第一端点设备分配与端点设备直接连接到的交换机的域相关联的第二FCID，并且第二FCID用作第一端点设备的VSAN内的代理FCID。 从第一端点设备接收到具有包括第一FCID的源FCID和包括用于第二端点设备的FCID的目的地FCID的帧。 帧中的源FCID被第二个FCID覆盖。 帧被转发到第二终端设备。

公开(公告)号：US20110022691A1

公开(公告)日：2011-01-27

申请号：US12509415

申请日：2009-07-24

Applicant: SUBRATA BANERJEE ,  Badrinarayanan Ramaswamy ,  Harsha Bharadwaj

Inventor： SUBRATA BANERJEE ,  Badrinarayanan Ramaswamy ,  Harsha Bharadwaj

IPC: G06F15/177

CPC classification number: H04L49/10

Abstract: In an example embodiment, a new qualifier is added to members in a Fibre Channel zone to specify whether each member is a target or initiator and in another embodiment a time-range attribute is added to a zone in the zoneset. When the zoneset is applied the number of ACL entries that must be programmed is reduced from k×(k−1) entries to 2(k−1) entries for a zone with k members where k−1 members are of one type (e.g. initiators) and one of the members is of a different type (e.g., a tape device). The time-range attribute is enforced by zone server software and enhances security by, for example, limiting access to sensitive data to specified times. In another embodiment, an incremental zoneset activation protocol is implemented where a hash of a zoneset is created by a switch updating the zoneset and the hash and ID of the switch updating the zoneset are sent to all other switches in the fabric when the zoneset is propagated. The hash and switch ID are stored in persistent storage at all switches in the fabric. When a target zoneset is updated by a source switch only the incremental change is propagated to other switches in the fabric along with the hash and switch ID of the target zoneset. Each switch checks a received hash and switch ID against its stored hash and switch ID to assure that the stored local zoneset is the same as the target zoneset before applying the incremental change.

Abstract translation: 在示例实施例中，将新限定词添加到光纤通道区域中的成员以指定每个成员是目标还是发起者，并且在另一实施例中，将时间范围属性添加到区域集中的区域。 当应用区域组时，必须编程的ACL条目的数目从k×（k-1）个条目减少到具有k个成员的一个类型的k个成员的区域的2（k-1）个条目（例如 启动器），并且其中一个成员是不同类型（例如，磁带设备）。 时间范围属性由区域服务器软件实施，并通过例如将访问敏感数据限制到指定时间来增强安全性。 在另一个实施例中，实现增量区域集激活协议，其中由更新区域集合的交换机创建区域集合的散列，并且当区域组传播时，更新区域集合的交换机的ID被发送到结构中的所有其他交换机 。 散列和交换机ID存储在结构中所有交换机的持久存储器中。 当目标区域集由源交换机更新时，增量更改将传播到结构中的其他交换机以及目标区段集的散列和交换机ID。 每个交换机根据其存储的散列和交换机ID检查接收的散列和交换机ID，以确保在应用增量更改之前，存储的本地区域集与目标区段集相同。

公开(公告)号：US07769023B2

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

申请号：US11316027

申请日：2005-12-21

Applicant: Anand Parthasarathy ,  Subrata Banerjee ,  Murali Basavaiah ,  Arpakorn Boonkongchuen ,  Parthiban Munusamy

Inventor： Anand Parthasarathy ,  Subrata Banerjee ,  Murali Basavaiah ,  Arpakorn Boonkongchuen ,  Parthiban Munusamy

IPC: H04L12/28 ,  H04L12/56

CPC classification number: H04L67/2814 ,  G06F3/0607 ,  G06F3/0664 ,  G06F3/067

Abstract: Disclosed are methods and apparatus for redirecting fiber channel data that is transmitted between a first and a second node, such as a host and target, in a storage area network (SAN) to an intelligent node that facilitates implementation of a service on such redirected data. Such redirection is provided transparently with respect to the first and second nodes without significantly reconfiguring the existing infrastructure of the first and second nodes. In a specific Fiber Channel implementation, the redirection is accomplished without rewiring any of the nodes in the network fabric or reconfiguring zones or virtual storage area networks (VSANs). In general, such redirection is accomplished by rewriting the data as it traverses on a path between the first and second node towards an original destination (e.g., the first or second node) so that the data is redirected to an intelligent node. The intelligent node then facilitates implementation of a service on such redirected data and then forwards the serviced data back to its original destination. In one example, setup of this redirection function is accomplished simply by making a request to a network device (e.g., a host and/or target switch) in the first and second node's communication path, where the request identifies the first node, the second node, and the intelligent node.

Abstract translation: 公开了用于将存储区域网络（SAN）中的诸如主机和目标的第一和第二节点之间传输的光纤通道数据重定向到便于在这种重定向数据上实现服务的智能节点的方法和装置 。 这样的重定向相对于第一和第二节点透明地提供，而不显着地重新配置第一和第二节点的现有基础设施。 在特定的光纤通道实现中，重定向是在不重新布线网络结构中的任何节点或重新配置区域或虚拟存储区域网络（VSAN）的情况下实现的。 通常，通过在数据在第一和第二节点之间的路径上朝向原始目的地（例如，第一或第二节点）重写数据以使得数据被重定向到智能节点来实现这种重定向。 智能节点然后促进对这种重定向数据的服务的实现，然后将服务数据转发回其原始目的地。 在一个示例中，通过向第一和第二节点的通信路径中的网络设备（例如，主机和/或目标交换机）发出请求来简单地完成该重定向功能的设置，其中请求标识第一节点，第二节点 节点和智能节点。