Cisco Technology, Inc.

Senhua Huang

Debojyoti Dutta

Madhav V Marathe

Raghunath Nambiar

Subrata Banerjee

Ethan M Spiegel

Raja Rao Tadimeti

Subramanian Chandrasekaran

Pritesh Kothari

Jaiganesh Mathaiyan

Madhav Madhavshree

Rakesh M Pathak

Shiva Bhanujan

Bobby Nakamoto

Sid Ray

In one embodiment, a device (e.g., a sync daemon) connects to peer nodes in a communication network. Each of the peer nodes has a switch that supports a flow table and an action table. The device facilitates a connection between a switch of a first peer node and a switch of a second peer node, and maintains the flow table and the action table of each of the peer nodes, such that the flow tables and the action tables are kept in synchronization with one another across each of the peer nodes via a distributed hash table.

Controller-less peer-to-peer distributed switch

Example embodiments disclosed herein can provide for receiving a compute request for migrating an application from a source environment to a target cloud, determining a configured option of a first resource associated with the application, and determining at least one solution in the target cloud for the application. The solution is based, at least in part, on the configured option. In more specific embodiments, when the configured option indicates the first resource is splittable, a number of second instances of a solution in the target cloud is greater than a number of first instances in the source environment. In further more specific embodiments, when the configured option indicates the first resource is mergeable, a number of second instances of a solution in the target cloud is less than the number of first instances in the source environment.

Instantiating incompatible virtual compute requests in a heterogeneous cloud environment

In one embodiment, data indicative of the size of an intermediate data set generated by a first resource device is received at a computing device. The intermediate data set is associated with a virtual machine to process the intermediate data set. A virtual machine configuration is determined based on the size of the intermediate data set. A second resource device is selected to execute the virtual machine based on the virtual machine configuration and on an available bandwidth between the first and second resource devices. The virtual machine is then assigned to the second resource device to process the intermediate data set.

Allocating resources for multi-phase, distributed computing jobs

In one embodiment, a device receives information regarding a data set to be processed by a map-reduce process. The device generates a set of virtual clusters for the map-reduce process based on network bandwidths between nodes of the virtual clusters, each node of the virtual cluster corresponding to a resource device, and associates the data set with a map-reduce process task. The device then schedules the execution of the task by a node of the virtual clusters based on the network bandwidth between the node and a source node on which the data set resides.

Task scheduling using virtual clusters

In one embodiment, a method comprises creating a hierarchal chain of network services in response to instantiation within a data center of a virtualized application providing an application service, the chain having a corresponding hierarchal proxy endpoint identifier for each network service in the chain; registering the chain of network services as a logical path for reaching the application service within the data center; and routing, within the data center, a web-based service request for the application service to the chain of network services for execution by the virtualized application.

Instantiating an application flow into a chain of services in a virtual data center

In one embodiment, a service provider management device provides a plurality of redundant fabric motifs, each indicating a subgraph pattern of logical connections for network segments of a virtual data center, and receives virtual data center tenant selection of one or more of the redundant fabric motifs for particular pairs of data center segments of the virtual data center. After determining available physical data center resources that correspond to the tenant selection of one or more of the redundant fabric motifs for particular pairs of data center segments, logical connections may then be established between particular network segments for the virtual data center according to the available physical data center resources corresponding to the tenant selection of one or more of the redundant fabric motifs for particular pairs of data center segments.

Policy-driven automatic redundant fabric placement mechanism for virtual data centers

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.

Growing community of inventors

Fremont, CA, United States of America

Senhua Huang