Health monitoring of automatically deployed and managed network pipelines

- ROBIN SYSTEMS, INC.

Deployment of a network service pipeline may be automated by defining workflows comprising functions of instances of elements. Workflows may be defined in a graphical user interface including menus for the selection of elements, functions, and predefined workflows. A workflow may be dynamic such that addition or modification of a function invokes a trigger that automatically populates or modifies parameters of the functions of the workflow. Elements may each have a same set of functions that may be invoked by an orchestrator to perform automated implementation of the workflow. Functions of a workflow may be implemented in batches and may retrieve executable. data from a distributed file store. A test platform with hardware and network simulation may be used to develop functions and workflows.

Skip to: Description  ·  Claims  ·  References Cited  · Patent History  ·  Patent History
Description
RELATED APPLICATIONS

This application is related to U.S. application Ser. No. 16/888,600 filed May 29, 2020, U.S. application Ser. No. 16/903,266 filed Jun. 16, 2020, U.S. application Ser. No. 16/915,878 filed Jun. 29, 2020, U.S. application Ser. No. 17/061,500 filed Oct. 1, 2020, and U.S. application Ser. No. 17/089,579 filed Nov. 4, 2020, which are incorporated herein by reference for all purposes.

BACKGROUND Field of the Invention

This invention relates to automating the deployment and management of network applications.

Background of the Invention

In order to deliver a network service to a consumer, such as on a mobile device of a consumer, there are many applications, networking configurations, and other actions that are required to implement the network service, access the data managed by the network service, and to interact with a client application that interacts with the user. In many instances, these actions must be performed at many different data centers that are distributed geographically.

It would be an advancement in the art to facilitate the development and deployment of network services.

BRIEF DESCRIPTION OF THE DRAWINGS

In order that the advantages of the invention will be readily understood, a more particular description of the invention briefly described above will be rendered by reference to specific embodiments illustrated in the appended drawings. Understanding that these drawings depict only typical embodiments of the invention and are not therefore to be considered limiting of its scope, the invention will be described and explained with additional specificity and detail through use of the accompanying drawings, in which:

FIG. 1 is a schematic block diagram of a components of a network service and an orchestration server system in accordance with an embodiment of the present invention;

FIG. 2 is a schematic block diagram of layers and external management functions of a network service in accordance with an embodiment of the present invention;

FIG. 3 is a schematic diagram of an element of a network service in accordance with an embodiment of the present invention;

FIG. 4 is a schematic block diagram of a hierarchy for orchestrating a network service in accordance with an embodiment of the present invention;

FIG. 5 is a schematic block diagram of APIs and databases for creating workflows implementing a network service in accordance with an embodiment of the present invention;

FIG. 6 is a schematic block diagram of an interface for creating workflows in accordance with an embodiment of the present invention;

FIG. 7 is a process flow diagram of a method for dynamically modifying a workflow in accordance with an embodiment of the present invention;

FIG. 8 is a process flow diagram of a method for performing health checks on an element in accordance with an embodiment of the present invention;

FIG. 9 is a process flow diagram of a method for batch processing functions for large numbers of elements in accordance with an embodiment of the present invention;

FIG. 10 is a schematic block diagram illustrating an approach for implementing file stores and log stores in accordance with an embodiment of the present invention;

FIG. 11 is a schematic block diagram of a test platform for workflows and functions in accordance with an embodiment of the present invention; and

FIG. 12 is a schematic block diagram of an example computing device suitable for implementing methods in accordance with embodiments of the invention.

DETAILED DESCRIPTION

FIG. 1 illustrates an example network environment 100 in which the systems and methods disclosed herein may be used. In particular, an orchestration server system 102 may execute on one or more server computers and implement the systems and methods disclosed herein in order to implement a network service by way of one or more radio antennas 104, such antennas 104 may be configured to communicated wireless signals according to a cellular wireless data protocol (e.g., 4G, 5G, etc.) for implementing a network service to mobile devices of users.

The radio antennas 104 may be coupled to baseband units (BBU) 106 that provides translation between radio frequency signals output and received by the antennas 104 and digital data transmitted and received by edge servers 108 coupled to the antennas 104. For example, each BBU 106 may perform this translation according to any of the cellular wireless data protocols mentioned above. The edge servers 108 may be coupled to the orchestration server system 102 either directly or by way of one or more intermediary servers.

The orchestration server system 102 may implement centralized management services used to manage the edge servers 108 and BBUs 106. For example, these may include enterprise management services 110, operations support systems (OSS) 112, and one or more management servers 114 for services implemented on the edge servers 108.

The orchestration server system 102 may implement a deployment automation module 116 that facilitates deployment of the BBUs 106, edge servers 108, services executing on the BBUs 106 and edge servers 108, and centralized management services implemented by the orchestration server system 102 or other server system 102.

For example, this may include a machine initialization module 118 that detects hardware such as the computing devices implementing BBUs 106 or edge servers 108 and initializes them to receive installation of services. For example, given a computing device configured with an IP address, the machine initialization module 118 may initialize the BIOS (basic input output system), install an operating system, configure the operating system to connect to a network and to the orchestration server system 102, and install an agent for facilitating installation of services and for performing management functions on the computing device at the instruction of the deployment automation module 116. For example, the machine initialization module 118 may use COBBLER in order to initialize the computing device.

The machine initialization module 118 may also discover computing devices on a network and generate a topology of the devices, such as in the form of a directed acyclic graph (DAG). The deployment automation module 116 may then use this DAG to select computing devices for implementing network services and in order to configure a machine to receive installation of a network service.

The deployment automation module 116 may include an application automation module 120 that automates the deployment of an application, such as a container executing an application, on a computing device. The application automation module 120 may implement methods and systems described below relating to the automated deployment and management of applications.

One example application of the systems and methods disclosed herein is a radio area network (RAN) automation module 122 that performs the automated deployment of a network service in the illustrated network environment, including instantiating, configuring, and managing services executing on the BBUs 106, edge servers 108, and orchestration server system 102 in order to implement a RAN in a one-click automated fashion.

FIG. 2 is a schematic block diagram of layers and external management functions of a network service in accordance with an embodiment of the present invention. At the base, is a physical layer 200 including hardware of a computing device. The physical layer 200 may also include basic software such as BIOS, firmware, operating system, or even a virtual machine executing on the computing device.

A clustering layer 202 resides on the physical layer 200 and includes data structures and software that enables a group of computing devices to act as a cluster. A cluster may be defined as a group of devices that are backups of one another, that provide a service with requests for that service being distributed among devices of the cluster according to a load balancing approach, that together implement a plurality of distinct applications that cooperate with one another to implement a service, or that are associated to one another for a common purpose or according to an arbitrary cluster definition of an administrator. The clustering layer 202 may be implemented by agent software executing on the physical layer 200 that coordinates with the deployment automation module 116 and other devices of a cluster to implement a cluster.

The network function/application layer 204 includes applications executing on the computing devices of a cluster that individually or together with other applications executing on other nodes of the cluster implement a network service, such as access to a database, web server, or other server-based computational function that may be provided as a service to a user or another service of a network environment 100.

A network service/application pipeline layer 206 may include a pipeline of network functions/applications 204 that communicate with one another to implement a more complex network service.

Operations of any of the layers 200-206 may be managed by method and procedures (MOPs) 208 that are independent of the services implemented by the layers and include management functions such as instantiating, upgrading, health checks, monitoring power, restarting, replacing, scaling, and shutting down of the entities implementing a layer 200-26 (also referred to as life cycle management (LCM)).

A policy engine 210 may likewise operate with respect to any of the layers 200-206 and provide logic defining actions performed with respect to some or all of the layers 200-206, such as procedures for implementing backups, handling faults at a particular layer, prioritization of individual MOPs 208, or other policies that an administrator may wish to impose on the operation of any of the layers 200-206.

For example, the policy engine 210 may have access to a topology of an application pipeline created according to the methods disclosed herein. Error messages received from elements of the pipeline may be received and aggregated in chronological order, such as using the approach described in U.S. application Ser. No. 16/561,994 filed Sep. 5, 2019, and entitled Performing Root Cause Analysis in a Multi-Role Application, which is hereby incorporated herein by reference in its entirety. Once a fault is identified, the policy engine 210 may implement an appropriate recovery policy. For example, if a computing device fails, its IP address may be released and assigned to a new computing device. The elements on the failed computing device may be instantiated on a new computing device assigned the IP address. If an element fails, a new element of the same type may be instantiated and configured to take its place. If a pod fails, a new pod may be created and configured to take its place.

Closed loop automation 212 may also be implemented with respect to some or all of the layers. Closed loop automation 212 may include the performance of tasks, verification of performance of tasks, monitoring function, automated actions performed in response to states detected during monitoring, and other actions in order to implement some or all of the layers 200-206 and maintain operation of the layers 200-206.

FIG. 3 is a schematic diagram of an element 300 of a network service in accordance with an embodiment of the present invention. Each entity that constitutes one of the layers 200-206 may be embodied as an element 300. Each element 300 may define functions and interfaces used by the deployment automation module 116 to deploy and manage an entity represented by an element 300. An element 300 may be an entity that is a combination of sub-elements 300 and defines functions and interfaces for deploying and managing the combination of sub-elements 300. Accordingly, the deployment automation module 116 may invoke these interfaces and functions in order to deploy and manage an element without requiring any modification of the deployment automation module 116 to adapt to or have data describing the entity represented by the element 300.

For example, an element 300 may define functions and interfaces 302 for discovering the element such that once the element 300 is connected by a network to the deployment automation module 116, the element 300 may be discovered and its identity, type, and other attributes may be provided to the deployment automation module 116.

The element 300 may define functions and interfaces 304 for maintaining a reference to the element 300 in an inventory of elements 300 maintained by the deployment automation module 116. This may include responding to queries from the deployment automation module 116 with responses indicating availability of the element 300, e.g. whether it is assigned and operational.

The element 300 may define functions and interfaces 306 for performing life cycle management (LCM) of the element 300. This may include functions and interfaces for instantiating, upgrading, scaling, restarting, restarting, or de-instantiating the element 300.

The element 300 may define functions and interfaces 308 for performing healing the element 300. This may include functions and interfaces for detecting faults, recovering from faults, restoring non-functioning parts of the element 300, or other actions for restoring or maintaining function of the element 300.

The element 300 may define functions and interfaces for monitoring 310 health of the element 300. This may include functions and interfaces for running diagnostic checks, performance checks, or other evaluations of the state of operation of the element 300.

The element 300 may define functions and interfaces 312 for implementing policy with respect to the element 300. This may include functions and interfaces for receiving a policy for the element 300 and evaluating the policy with respect to a current state of operation of the element 300. The functions and interfaces 312 may define the policies themselves or may be configured to receive and implement policies received from the deployment automation module 116.

FIG. 4 is a schematic block diagram of a hierarchy 400 for orchestrating a network service in accordance with an embodiment of the present invention. The deployment automation module 116 may ingest a workflow 402. The workflow defines a series of functions 404 and possibly an order of execution of the functions 404. The functions 404 may invoke executors 406 that operate with respect to an element 300. In particular, the functions 404 may be functions of instances of elements 300 included in the workflow 402. Accordingly, a workflow 402 may be define performance of functions 404 for specific elements 300 and possibly the ordering of these functions.

The elements 300 may be entities implementing a network service pipeline, radio area network (RAN), or any complex multi-application deployment and the workflow invokes the functions of these elements 300. As noted above, due to the abstraction of the elements 300, the workflow does not need to specify entity-specific functions. Instead tasks of a workflow 402 including discovery, inventory management, life cycle management, health monitoring, healing, policy implementation and other high-level functions may be invoked by invoking corresponding interfaces and functions 302-312 of the elements 300 of the workflow 402.

FIG. 5 is a schematic block diagram of a system for creating workflows implementing a network service in accordance with an embodiment of the present invention. In particular, the deployment automation module 116 may include or access some or all of the illustrated components.

The deployment automation module 116 may include application programming interfaces (APIs) 502, such as representational state transfer (REST) APIs, enabling a user to create and execute workflows 402. For example, a workflow builder 504 may define an interface enabling a user to create, select, and modify workflows 402 (see FIGS. 6 and 7). A workflow orchestrator 506 may implement the functions 404 of a workflow on the elements 300 of a workflow 402.

In many instances, the number of elements 300 and the functions 404 that are performed with respect to elements 300 is very large, on the order of 1000s or even millions. Accordingly, a batch runner 508 may set up batch processing of functions 404 for elements 300 and a batch orchestrator 510 may then execute the functions in batches as defined (see FIG. 9).

The APIs 502 may define closed loop automation 512 APIs that implement closed loop automation 212 of the deployment and management of the elements 300 of a workflow according to the interfaces 302-312 of the elements 300.

A playground 514 may provide a testbed for the creation and evaluation of elements 300, workflows 402, and functions 404 (see FIG. 11).

Functions 404 of workflows 402, either individually or as parts of batches, may be implemented by workers 516. The workers 516 may be embodied as pods, such as pods according to the KUBERNETES orchestration platform. Alternatively, workers 516 may be processes or threads of execution executing on one or more computing devices of a network environment 100. For example, the workers 516 may execute on clusters 518, a rack server 520, edge server 108, BBU 106, or some other computing device.

The amount of files required to define the functions 404 and elements 300 of a workflow 402 may be very large. Accordingly a file store 522 may be implemented, such as in the form of a database accessed by means of a function registry 524 that maps a function 404 of an element 300 (e.g. a function identifier associated with an element identifier) to a storage location in the file store 522.

In a like manner, the number of files and amount of data generated by the functions 404 and applications instantiated by a workflow 402 may be very large. Accordingly, a distributed log store 526 may be implemented as a distributed database of log store to which functions 404 and applications instantiated by a workflow 402 may write updates too, such as by means of a log plugin 528.

Other data used by the APIs 502 may be stored in a database 530 accessed by means of a database plugin 532. For example, interfaces, templates, pre-defined workflows 402, elements 300, and other data that may be used by a user to define a workflow 404.

In some embodiments, each element 300 may have a state and a corresponding finite state machine that defines transitions between states of the finite state machine in response to events occurring involving the element 300. Accordingly, the REST APIs 502 may include a finite state machine manager 506 for managing the state machine of each instance of any of the elements 300.

Other REST APIs 536 may implement other functions, such as observability of elements (OBF), rule-based access control, cluster federation, and other functions that may facilitate implementation and management of a network service pipeline.

FIG. 6 is a schematic block diagram of an interface 600 that may be provided by the workflow builder 504 to facilitate creating workflows 402 in accordance with an embodiment of the present invention. The interface 600 may include a menu 602 that enables a user to input a selection of an element 300 from a list of available elements 300. Elements 300 may include a virtual machine, a container, a database (e.g., MONGODB), an application, a router, a switch, a rack switch, relay, or any other element that may be needed to implement a network service. The interface may further include a function menu 604 that enables a user to input a selection of an element 300, e.g., the element selected using the menu 602. This may include any of the interfaces and functions 302-312 described above. For example, where a workflow 402 is to be created that instantiates a network pipeline, the functions selected from the menu 604 may be functions to instantiate the selected element. For example, an element/function (i.e., a selected function for a selected element type) 608a may define instantiating a primary manager of a cluster, element/function 608b may define instantiating a secondary manager of the cluster, element/functions 608c-608e may define instantiating one or more other nodes of the cluster. Other functions for a cluster may include acquiring licenses for software, performing network configuration of the managers and nodes of the cluster, acquiring IP addresses for the cluster and nodes of the cluster, setting up bundles (e.g., bundled applications), and setting up external backup depositories.

Each element/function 608a-608e input by a user may be represented by an icon on the graphical user interface (GUI) 600, such as shown in FIG. 6. Each element function 608a-608e may have configuration parameters such as internet protocol (IP) address, identifier, number of processing cores, amount of memory, amount of storage, etc., to be allocated to the node instantiated by the function 608a-608e. These parameters may be specified by default or may be input by a user, such as by accessing a menu permitting their input by clicking on a representation of a function 608a-608e in the interface 600.

A workflow 402 including any of the functions 404 for any of the elements 300 described herein may be created and configured in the same manner as for the example described above.

In some embodiments, predefined workflows 402 may be selected from a workflow menu 606. A user may then modify the workflow 402. For example, a workflow selected from the workflow menu 606 or created by a user may be modified to include additional element/functions 608f, 608g.

Referring to FIG. 7, in some embodiments, workflows 402 may be defined dynamically such that aspects of the modification of the workflow 402 are automated. In particular, there may be many parameters that define a particular element/function 608a-608e. The method 700 may be executed by the workflow builder 504 to automatically reconfigure a workflow 402 in response to modification thereof. A workflow 402 may be implemented dynamically in terms of its structure and its functionality as described below. In particular, a workflow 402 may be modified according to a type of an element instance, and a size of an element instance. Some of the attributes e.g., size or health, of an element instance may be determined at runtime or change during runtime such that the workflow 402 may be dynamically changed according to triggers associated with the changed attributes as described below.

The method 700 may include receiving 702 a revision to a workflow 402, such as addition of one or more other element/functions 608f, 608g. These revisions may also include modifying the parameters of one or more existing element/functions 608a-608g of a workflow 402.

The method 700 may include comparing 704 the modified workflow to the previous version of the workflow and changed or added element/functions may be identified 706 according to the comparison. For example, when the user is done making changes and saves the modified workflow or otherwise invokes step 704, this comparison may be performed.

In some embodiments each element 300 may define triggers for each function thereof. Accordingly, when an element/function is added or a parameter thereof is modified, the trigger corresponding thereto may be executed 708 by the workflow builder 504. The trigger may define functions for dynamically modifying the workflow 402 in response to the modification or addition. For example, where a modification is the addition of an element/function, the trigger may define parameters for defining the new element/function in accordance with other instances of that element function 404 already in the workflow 402. For example, for a new cluster node, these automatically populated parameters may include an identifier, IP address, and relationship to a primary or secondary node of a cluster, or other nodes of the cluster. Triggers may likewise define modifications to other parameters of an element/function or the parameters of other element/functions of a workflow 402 when one of the parameters of the element/function is changed.

In this manner, the user is relieved of the burden of configuring each element/function of a workflow 402 when it is added. This enables a small set of predefined workflows 402 to be scaled and modified according to desires of a user using simple menu interactions and drag-and-drop interactions with icons representing the element/functions of a workflow 402.

FIG. 8 is a process flow diagram of a method 800 for performing health checks on an element in accordance with an embodiment of the present invention. This may include executing the functions 310 for evaluating the health of the element 300 as described above with respect to FIG. 3. The health evaluations according to the functions 310 may be invoked by the deployment automation module 116 or by the element 300 itself following instantiation. The illustrated method 800 improves the efficiency of such health checks.

The method 800 may include instantiating 802 an element 300. The method 800 may further include scheduling 804 health checks. For example, the element 300 may itself be configured to invoke the health evaluation functions 310 at a predefined period. Alternatively, the deployment automation module 116 may schedule 804 performance of the health checks or instruct another element 300 to perform the health checks.

Following instantiation, various functions of an element 300 may be invoked, such as any of the LCM functions. In some embodiments, if a function of an element 300 is found 806 to be invoked on an instance of that element 300, that function is executed 808 and a health check is also performed 810 using the health evolution function for that instance of the element 300.

If a health check is found 812 to be due for the instance of the element 300, the method 800 may include evaluating 814 whether a health check was already performed, such as part of executing 808 another function at step 810. For example, if a health check performed with execution 808 of another function is performed within a threshold time period of a scheduled health check, the scheduled health check is suspended 816. For example, the threshold time period may be defined as a fraction of the period between scheduled health checks, e.g. from 5 to 25 percent.

If the evaluation of step 814 is negative (no health check following function execution within the threshold time period from the scheduled time), the health check is performed 818.

FIG. 9 is a process flow diagram of a method 900 for batch processing functions for large numbers of elements in accordance with an embodiment of the present invention. The method 900 may be performed by the deployment automation module (DAM) 116, such as using the workflow orchestrator (WFO) 506 batch orchestrator (BO) 510. Various other entities are involved in the method 900, including a workflow (WF) 402, the database (DB) 530, a spawning manager (SM) 906, worker 516, file store (FS) 522, and a plurality of target elements (TE) 300.

The method 900 may include receiving 910 an instruction to perform a function with respect to N elements 300. In the illustrated example, this function is upgrading, though any function ascribed herein to an element 300 may also be performed. In a typical application, N is very large, on the order of 1000s, 10,000s, or millions. The instruction 910 may be received from a user or received as part of processing a workflow 402.

The workflow orchestrator 506 receives the instruction and, in response, may calculate 912 fanout. This may include determining how many of the target elements 300 will be processed according to the function by a worker. The fanout may be static for all types of elements 300, defined for a particular type of element 300, defined for a particular function 302-312, defined for a particular function 302-312 of a particular type of element 300, or be determined based on some other criteria, which may be dynamic, such as a function of the value of N or current loading of workers 516 of the deployment automation module 116.

The batch orchestrator 510 may return 914 a worker count W that is a number of workers that are available to perform the function with respect to the N target elements 300. The work flow orchestrator 506 may then divide the N target elements 300 into shards such that each shard has approximately (e.g., +/−10) N/W elements 300 assigned to it. Each shard may include element identifiers of the target elements 300 assigned to it and may itself be assigned a shard identifier. The shards may be stored 916, such as in the database 530.

The workflow orchestrator 506 may then invoke 918 the creation of W workers. For example, a spawning module 906 may be programmed to generate workers 516 in response to receiving the instruction from step 918. Upon instantiation, the workers may each request 920 a shard from the workflow orchestrator 506, which may then return 922 a shard configuration array, e.g., an array of target element identifiers along with an identifier of the function to be performed with respect to the target elements 300 referenced by the target element identifiers.

The worker 516 may then request 924 the function, e.g. a script or executable, corresponding to the function identifier received at step 922, from the file store 522. The worker 516 then receives 926 the function and executes 928 the function on each of the target elements 300 reference in the shard configuration array received at step 922. Upon completion of execution of the function with respect to each target element 300 referenced by the shard, the worker 516 reports 930 completion to the workflow orchestrator 506. When all workers 516 complete processing of their shards, the instruction received at step 902 may be complete.

FIG. 10 is a schematic block diagram illustrating an approach 1000 for implementing file stores 522 and log stores 526 in accordance with an embodiment of the present invention. In the foregoing description, the relationship of elements 300a, 300b, 300c is described with respect to reading from file stores 1008a, 1008b, 1008c. It shall be understood that writing to log stores may be distributed in a like manner.

Each element 300a, 300b, 300c may be configured with a list of file store identifiers 1002a, 1002b, 1002c indicating a primary file store, secondary file store, and a tertiary file store. Other numbers of file stores may be used with three being an example. Each element 300a, 300b, 300c will attempt to read from the file store referenced by its primary identifier 1002a, followed by attempting to read from that referenced by the secondary identifier 1002b if not successful, followed by attempting to read from that referenced by the tertiary identifier 1002c if not successful.

The file stores 1008a may be distributed. The computing devices of a network environment 100 may be distributed in different server racks, different buildings, different cities, or even different countries. Accordingly, the functions 302-312 of the elements 300 of a workflow 402 may be stored in copes distributed on various computing devices of the network environment, each copy being one of the file stores 1008a-1008c. Each element 300a-300c may therefore be configured to request files from a primary file store closest to it, with back up file stores referenced as secondary and tertiary where the primary file store is not available

Requests to read from the file store 522 may be routed through a load balancer 1004. The load balancer 1004 may include mappings 1006 for each element 300a-300c, e.g. identifiers of the primary, secondary, and tertiary file stores 1002a-1002c. Accordingly, the load balancer 1004 may route request to read from the file store 522 according to a load balancing approach that prioritizes the primary file store of the requesting element 300a-300c as indicated in the mapping 1006 for the requesting element 300a-300c but may route to the secondary or tertiary file store, or possibly some other file store 1008a-1008c based on loading, e.g. if latency of the primary file store is high such that another file store 1008a-1008c may provide lower latency.

FIG. 11 is a schematic block diagram of a test platform 1100 for workflows and functions in accordance with an embodiment of the present invention. The test platform 1100 may include an editor 1102 that may be a word processor for inputting scripts or other computer code, a graphical user interface for assembly workflows (see FIG. 6), or other interface for creating functions, elements, workflows, or other executables. The test platform 1100 may include a tool 1104 for editing functions, a tool 1106 for editing elements, and a tool 1108 for editing workflows. Each tool 1104-1108 may include user interface elements enabling a user to create functions, elements, or workflows.

The platform 1100 may further include simulators. For example, a hardware simulator 1110 may simulate the function of a computing device, BBU, drone, or other hardware device. Accordingly, a function, element, or workflow that is defined for implementation for a hardware device may be simulated using the simulator 1110 for that hardware device. The test platform 1100 may further include a network simulator 1112 that simulates a network, e.g. network protocols, network latency, etc. Accordingly, a topology of elements 300 that are separate by a network may be tested by simulating execution on simulated hardware devices connected by a simulated network.

Once a function, element, or workflow created by a user has been created and tested, it may then be deployed by the deployment automation module 116 according to the systems and method described herein.

FIG. 12 is a block diagram illustrating an example computing device 1200. Computing device 1200 may be used to perform various procedures, such as those discussed herein.

Computing device 1200 includes one or more processor(s) 1202, one or more memory device(s) 1204, one or more interface(s) 1206, one or more mass storage device(s) 1208, one or more Input/output (I/O) device(s) 1210, and a display device 1230 all of which are coupled to a bus 1212. Processor(s) 1202 include one or more processors or controllers that execute instructions stored in memory device(s) 1204 and/or mass storage device(s) 1208. Processor(s) 1202 may also include various types of computer-readable media, such as cache memory.

Memory device(s) 1204 include various computer-readable media, such as volatile memory (e.g., random access memory (RAM) 1214) and/or nonvolatile memory (e.g., read-only memory (ROM) 1216). Memory device(s) 1204 may also include rewritable ROM, such as Flash memory.

Mass storage device(s) 1208 include various computer readable media, such as magnetic tapes, magnetic disks, optical disks, solid-state memory (e.g., Flash memory), and so forth. As shown in FIG. 12, a particular mass storage device is a hard disk drive 1224. Various drives may also be included in mass storage device(s) 1208 to enable reading from and/or writing to the various computer readable media. Mass storage device(s) 1208 include removable media 1226 and/or non-removable media.

I/O device(s) 1210 include various devices that allow data and/or other information to be input to or retrieved from computing device 1200. Example I/O device(s) 1210 include cursor control devices, keyboards, keypads, microphones, monitors or other display devices, speakers, printers, network interface cards, modems, lenses, CCDs or other image capture devices, and the like.

Display device 1230 includes any type of device capable of displaying information to one or more users of computing device 1200. Examples of display device 1230 include a monitor, display terminal, video projection device, and the like.

Interface(s) 1206 include various interfaces that allow computing device 1200 to interact with other systems, devices, or computing environments. Example interface(s) 1206 include any number of different network interfaces 1220, such as interfaces to local area networks (LANs), wide area networks (WANs), wireless networks, and the Internet. Other interface(s) include user interface 1218 and peripheral device interface 1222. The interface(s) 1206 may also include one or more peripheral interfaces such as interfaces for printers, pointing devices (mice, track pad, etc.), keyboards, and the like.

Bus 1212 allows processor(s) 1202, memory device(s) 1204, interface(s) 1206, mass storage device(s) 1208, I/O device(s) 1210, and display device 1230 to communicate with one another, as well as other devices or components coupled to bus 1212. Bus 1212 represents one or more of several types of bus structures, such as a system bus, PCI bus, IEEE 1394 bus, USB bus, and so forth.

For purposes of illustration, programs and other executable program components are shown herein as discrete blocks, although it is understood that such programs and components may reside at various times in different storage components of computing device 1200, and are executed by processor(s) 1202. Alternatively, the systems and procedures described herein can be implemented in hardware, or a combination of hardware, software, and/or firmware. For example, one or more application specific integrated circuits (ASICs) can be programmed to carry out one or more of the systems and procedures described herein.

In the above disclosure, reference has been made to the accompanying drawings, which form a part hereof, and in which is shown by way of illustration specific implementations in which the disclosure may be practiced. It is understood that other implementations may be utilized and structural changes may be made without departing from the scope of the present disclosure. References in the specification to “one embodiment,” “an embodiment,” “an example embodiment,” etc., indicate that the embodiment described may include a particular feature, structure, or characteristic, but every embodiment may not necessarily include the particular feature, structure, or characteristic. Moreover, such phrases are not necessarily referring to the same embodiment. Further, when a particular feature, structure, or characteristic is described in connection with an embodiment, it is submitted that it is within the knowledge of one skilled in the art to affect such feature, structure, or characteristic in connection with other embodiments whether or not explicitly described.

Implementations of the systems, devices, and methods disclosed herein may comprise or utilize a special purpose or general-purpose computer including computer hardware, such as, for example, one or more processors and system memory, as discussed herein. Implementations within the scope of the present disclosure may also include physical and other computer-readable media for carrying or storing computer-executable instructions and/or data structures. Such computer-readable media can be any available media that can be accessed by a general purpose or special purpose computer system. Computer-readable media that store computer-executable instructions are computer storage media (devices). Computer-readable media that carry computer-executable instructions are transmission media. Thus, by way of example, and not limitation, implementations of the disclosure can comprise at least two distinctly different kinds of computer-readable media: computer storage media (devices) and transmission media.

Computer storage media (devices) includes RAM, ROM, EEPROM, CD-ROM, solid state drives (“SSDs”) (e.g., based on RAM), Flash memory, phase-change memory (“PCM”), other types of memory, other optical disk storage, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store desired program code means in the form of computer-executable instructions or data structures and which can be accessed by a general purpose or special purpose computer.

An implementation of the devices, systems, and methods disclosed herein may communicate over a computer network. A “network” is defined as one or more data links that enable the transport of electronic data between computer systems and/or modules and/or other electronic devices. When information is transferred or provided over a network or another communications connection (either hardwired, wireless, or a combination of hardwired or wireless) to a computer, the computer properly views the connection as a transmission medium. Transmissions media can include a network and/or data links, which can be used to carry desired program code means in the form of computer-executable instructions or data structures and which can be accessed by a general purpose or special purpose computer. Combinations of the above should also be included within the scope of computer-readable media.

Computer-executable instructions comprise, for example, instructions and data which, when executed at a processor, cause a general purpose computer, special purpose computer, or special purpose processing device to perform a certain function or group of functions. The computer executable instructions may be, for example, binaries, intermediate format instructions such as assembly language, or even source code. Although the subject matter has been described in language specific to structural features and/or methodological acts, it is to be understood that the subject matter defined in the appended claims is not necessarily limited to the described features or acts described above. Rather, the described features and acts are disclosed as example forms of implementing the claims.

Those skilled in the art will appreciate that the disclosure may be practiced in network computing environments with many types of computer system configurations, including, an in-dash vehicle computer, personal computers, desktop computers, laptop computers, message processors, hand-held devices, multi-processor systems, microprocessor-based or programmable consumer electronics, network PCs, minicomputers, mainframe computers, mobile telephones, PDAs, tablets, pagers, routers, switches, various storage devices, and the like. The disclosure may also be practiced in distributed system environments where local and remote computer systems, which are linked (either by hardwired data links, wireless data links, or by a combination of hardwired and wireless data links) through a network, both perform tasks. In a distributed system environment, program modules may be located in both local and remote memory storage devices.

Further, where appropriate, functions described herein can be performed in one or more of: hardware, software, firmware, digital components, or analog components. For example, one or more application specific integrated circuits (ASICs) can be programmed to carry out one or more of the systems and procedures described herein. Certain terms are used throughout the description and claims to refer to particular system components. As one skilled in the art will appreciate, components may be referred to by different names. This document does not intend to distinguish between components that differ in name, but not function.

It should be noted that the sensor embodiments discussed above may comprise computer hardware, software, firmware, or any combination thereof to perform at least a portion of their functions. For example, a sensor may include computer code configured to be executed in one or more processors, and may include hardware logic/electrical circuitry controlled by the computer code. These example devices are provided herein purposes of illustration, and are not intended to be limiting. Embodiments of the present disclosure may be implemented in further types of devices, as would be known to persons skilled in the relevant art(s).

At least some embodiments of the disclosure have been directed to computer program products comprising such logic (e.g., in the form of software) stored on any computer useable medium. Such software, when executed in one or more data processing devices, causes a device to operate as described herein.

While various embodiments of the present disclosure have been described above, it should be understood that they have been presented by way of example only, and not limitation. It will be apparent to persons skilled in the relevant art that various changes in form and detail can be made therein without departing from the spirit and scope of the disclosure. Thus, the breadth and scope of the present disclosure should not be limited by any of the above-described exemplary embodiments, but should be defined only in accordance with the following claims and their equivalents. The foregoing description has been presented for the purposes of illustration and description. It is not intended to be exhaustive or to limit the disclosure to the precise form disclosed. Many modifications and variations are possible in light of the above teaching. Further, it should be noted that any or all of the aforementioned alternate implementations may be used in any combination desired to form additional hybrid implementations of the disclosure.

Claims

1. A method comprising:

instantiating, by a server system in a network environment, element instances of a plurality of elements according to a workflow comprising functions of the plurality of elements, each element of the plurality of elements defining a set of functions for deployment of an entity associated with the each element, the entity associated with each element of the plurality of elements being one of a virtual machine, container, database, and a network service;
managing, by the server system, the element instances according to the functions of the plurality of elements; and
invoking, by the server system, a health check of each element instance of the element instances following execution of each function of the functions of the plurality of elements.

2. The method of claim 1, wherein invoking the health check of each element instance comprises executing a health check function of the functions of the each element instance.

3. The method of claim 2, wherein the health check function of the functions of the each element instance performs any of:

a diagnostic check, a performance check, and an evaluations of a state of operation of an instance of the each element instance.

4. The method of claim 1, wherein managing, by the server system, the element instances according to the functions of the plurality of elements comprises executing functions of the element instances performing any of upgrading and repairing the element instances.

5. The method of claim 1, further comprising processing, by the server system, the functions of the workflow with respect to the network environment to instantiate a network service pipeline in the network environment including the element instances of the plurality of elements.

6. The method of claim 1, further comprising, for each element instance of the element instances:

executing a function of the each element instance following instantiation of the each element instance; and
performing the health check on the each element instance in response to executing of the function of the each element instance.

7. The method of claim 6, further comprising, for each element instance of the element instances:

scheduling periodic health checks of the each element instance at predefined intervals;
determining that a function of the each element instance was executed within a threshold time from a scheduled time of execution of a periodic health check of the periodic health checks of the each element instance; and
in response to determining that the function of the each element instance was executed within the threshold time from the scheduled time of execution of the periodic health check, suspending the periodic health check.

8. The method of claim 1, further comprising:

retrieving executable code defining the functions of the plurality of elements from a distributed file store.

9. The method of claim 1, wherein the functions of the plurality of elements include any of:

life cycle management functions;
inventory management functions;
discovery facilitating functions;
health check functions;
healing functions; and
policy implementation functions.

10. A non-transitory computer-readable medium storing executable code that, when executed by a processing device, causes the processing device to:

instantiate, in a network environment, element instances of a plurality of elements according to a workflow comprising functions of the plurality of elements, each element of the plurality of elements defining a set of functions for deployment of an entity associated with the each element, the entity associated with each element of the plurality of elements being one of a virtual machine, container, database, and a network service;
manage the element instances according to the functions of the plurality of elements; and
invoke a health check of each element instance of the element instances following execution of each function of the functions of the plurality of elements.

11. The non-transitory computer-readable medium of claim 10, wherein the executable code, when executed by the processing device, further causes the processing device to:

invoke the health check of each element instance by executing a health check function of the functions of the each element instance.

12. The non-transitory computer-readable medium of claim 11, wherein the health check function of the functions of the each element instance performs any of:

a diagnostic check, a performance check, and an evaluations of a state of operation of an instance of the each element instance.

13. The non-transitory computer-readable medium of claim 10, wherein the executable code, when executed by the processing device, further causes the processing device to:

manage the element instances according to the functions of the plurality of elements by executing functions of the element instances performing any of upgrading and repairing the element instances.

14. The non-transitory computer-readable medium of claim 10, wherein the executable code, when executed by the processing device, further causes the processing device to:

process the functions of the workflow with respect to the network environment to instantiate a network service pipeline in the network environment including the element instances of the plurality of elements.

15. The non-transitory computer-readable medium of claim 14, wherein the executable code, when executed by the processing device, further causes the processing device to, for each element instance of the element instances:

execute a function of the each element instance following instantiation of the each element instance; and
perform the health check on the each instance in response to executing of the function of the each element instance.

16. The non-transitory computer-readable medium of claim 15, wherein the executable code, when executed by the processing device, further causes the processing device to, for each element instance of the element instances:

schedule periodic health checks of the each element instance at predefined intervals;
determine that a function of the each element instance was executed within a threshold time from a scheduled time of execution of a periodic health check of the periodic health checks; and
in response to determining that the function of the each element instance was executed within the threshold time from the scheduled time of execution of the periodic health check, suspend the periodic health check.

17. The non-transitory computer-readable medium of claim 10, wherein the executable code, when executed by the processing device, further causes the processing device to:

retrieve executable code defining the functions of the plurality of elements from a distributed file store.

18. The non-transitory computer-readable medium of claim 10, wherein the functions of the plurality of elements include any of:

life cycle management functions;
inventory management functions;
discovery facilitating functions;
health check functions;
healing functions; and
policy implementation functions.

19. A method comprising:

instantiating, in a network environment, element instances of a plurality of elements according to a workflow comprising functions of the plurality of elements, each element of the plurality of elements defining a set of functions for deployment of an entity associated with the each element, the entity associated with each element of the plurality of elements being one of a virtual machine, container, database, and a network service;
performing a health check of each element instance in response to executing of a function of the set of functions of each element instance;
scheduling periodic health checks of each element instance at predefined intervals; and
when the function of each element instance was executed within a threshold time from a scheduled time of execution of a periodic health check of the periodic health checks of each element instance, suspending the periodic health check.

20. The method of claim 19, wherein:

invoking the health check of each element instance comprises executing a health check function of the functions of the each element instance; and
wherein the health check function of the functions of each element instance performs any of a diagnostic check, a performance check, and an evaluations of a state of operation of an instance of each element instance.
Referenced Cited
U.S. Patent Documents
3715573 February 1973 Vogelsberg
4310883 January 12, 1982 Clifton
5602993 February 11, 1997 Stromberg
5680513 October 21, 1997 Hyland
5796290 August 18, 1998 Takahashi
6014669 January 11, 2000 Slaughter
6052797 April 18, 2000 Ofek
6119214 September 12, 2000 Dirks
6157963 December 5, 2000 Courtright, II
6161191 December 12, 2000 Slaughter
6298478 October 2, 2001 Nally
6301707 October 9, 2001 Carroll
6311193 October 30, 2001 Sekido
6851034 February 1, 2005 Challenger
6886160 April 26, 2005 Lee
6895485 May 17, 2005 DeKoning
6957221 October 18, 2005 Hart
7096465 August 22, 2006 Dardinski
7111055 September 19, 2006 Falkner
7171659 January 30, 2007 Becker
7246351 July 17, 2007 Bloch
7305671 December 4, 2007 Davidov
7461374 December 2, 2008 Balint
7535854 May 19, 2009 Luo
7590620 September 15, 2009 Pike
7698698 April 13, 2010 Skan
7721283 May 18, 2010 Kovachka
7734859 June 8, 2010 Daniel
7738457 June 15, 2010 Nordmark
7779091 August 17, 2010 Wilkinson
7797693 September 14, 2010 Gustafson
7984485 July 19, 2011 Rao
8037471 October 11, 2011 Keller
8046450 October 25, 2011 Schloss
8060522 November 15, 2011 Birdwell
8121874 February 21, 2012 Guheen
8171141 May 1, 2012 Offer
8219821 July 10, 2012 Zimmels
8250033 August 21, 2012 De Souter
8261295 September 4, 2012 Risbood
8326883 December 4, 2012 Pizzorni
8392498 March 5, 2013 Berg
8429346 April 23, 2013 Chen
8464241 June 11, 2013 Hayton
8505003 August 6, 2013 Bowen
8527544 September 3, 2013 Colgrove
8601467 December 3, 2013 Hofhansl
8620973 December 31, 2013 Veeraswamy
8639989 January 28, 2014 Sorenson, III
8666933 March 4, 2014 Pizzorni
8745003 June 3, 2014 Patterson
8775751 July 8, 2014 Pendharkar
8782632 July 15, 2014 Chigurapati
8788634 July 22, 2014 Krig
8832324 September 9, 2014 Hodges
8886806 November 11, 2014 Tung
8909885 December 9, 2014 Corbett
8954383 February 10, 2015 Vempati
8954568 February 10, 2015 Krishnan
8966198 February 24, 2015 Harris
9009542 April 14, 2015 Marr
9116731 August 25, 2015 Tung
9134992 September 15, 2015 Wong
9146769 September 29, 2015 Shankar
9148465 September 29, 2015 Gambardella
9152337 October 6, 2015 Kono
9167028 October 20, 2015 Bansal
9280591 March 8, 2016 Kharatishvili
9330155 May 3, 2016 Bono
9336060 May 10, 2016 Nori
9342444 May 17, 2016 Minckler
9354907 May 31, 2016 Teli
9367301 June 14, 2016 Serrano
9390128 July 12, 2016 Seetala
9436693 September 6, 2016 Lockhart
9514160 December 6, 2016 Song
9521198 December 13, 2016 Agarwala
9569274 February 14, 2017 Tarta
9569480 February 14, 2017 Provencher
9590872 March 7, 2017 Jagtap
9600193 March 21, 2017 Ahrens
9613119 April 4, 2017 Aron
9619389 April 11, 2017 Roug
9635132 April 25, 2017 Lin
9667470 May 30, 2017 Prathipati
9747096 August 29, 2017 Searlee
9870366 January 16, 2018 Duan
9880933 January 30, 2018 Gupta
9892265 February 13, 2018 Tripathy
9929916 March 27, 2018 Subramanian
9998955 June 12, 2018 MacCarthaigh
10019459 July 10, 2018 Agarwala
10042628 August 7, 2018 Thompson
10061520 August 28, 2018 Zhao
10133619 November 20, 2018 Nagpal
10191778 January 29, 2019 Yang
10241774 March 26, 2019 Spivak
10282229 May 7, 2019 Wagner
10353634 July 16, 2019 Greenwood
10430434 October 1, 2019 Sun
10498608 December 3, 2019 Sethi
10560328 February 11, 2020 Mohanram
10623285 April 14, 2020 Shevade
10630598 April 21, 2020 Kowalski
10657119 May 19, 2020 Acheson
10754720 August 25, 2020 Mahindru
10761915 September 1, 2020 Mahindru
10776482 September 15, 2020 Gan
10956246 March 23, 2021 Bagde
20020141390 October 3, 2002 Fangman
20040010716 January 15, 2004 Childress
20040153703 August 5, 2004 Vigue
20040221125 November 4, 2004 Ananthanarayanan
20050065986 March 24, 2005 Bixby
20050216895 September 29, 2005 Tran
20050256948 November 17, 2005 Hu
20060025908 February 2, 2006 Rachlin
20060053357 March 9, 2006 Rajski
20060085674 April 20, 2006 Ananthamurthy
20060259686 November 16, 2006 Sonobe
20070006015 January 4, 2007 Rao
20070016786 January 18, 2007 Waltermann
20070067583 March 22, 2007 Zohar
20070165625 July 19, 2007 Eisner
20070260842 November 8, 2007 Faibish
20070277056 November 29, 2007 Varadarajan
20070288791 December 13, 2007 Allen
20080010421 January 10, 2008 Chen
20080068899 March 20, 2008 Ogihara
20080189468 August 7, 2008 Schmidt
20080235544 September 25, 2008 Lai
20080263400 October 23, 2008 Waters
20080270592 October 30, 2008 Choudhary
20080288940 November 20, 2008 Adams
20090144497 June 4, 2009 Withers
20090172335 July 2, 2009 Kulkarni
20090240809 September 24, 2009 La Frese
20090254701 October 8, 2009 Kurokawa
20090307249 December 10, 2009 Koifman
20100100251 April 22, 2010 Chao
20100153781 June 17, 2010 Hanna
20100161941 June 24, 2010 Vyshetsky
20100162233 June 24, 2010 Ku
20100211815 August 19, 2010 Mankovskii
20100274984 October 28, 2010 Inomata
20100299309 November 25, 2010 Maki
20100306495 December 2, 2010 Kumano
20100332730 December 30, 2010 Royer
20110083126 April 7, 2011 Bhakta
20110119664 May 19, 2011 Kimura
20110188506 August 4, 2011 Arribas
20110208928 August 25, 2011 Chandra
20110246420 October 6, 2011 Wang
20110276951 November 10, 2011 Jain
20120005557 January 5, 2012 Mardiks
20120066449 March 15, 2012 Colgrove
20120102369 April 26, 2012 Hiltunen
20120216052 August 23, 2012 Dunn
20120226667 September 6, 2012 Volvovski
20120240012 September 20, 2012 Weathers
20120259819 October 11, 2012 Patwardhan
20120265976 October 18, 2012 Spiers
20120303348 November 29, 2012 Lu
20120311671 December 6, 2012 Wood
20120331113 December 27, 2012 Jain
20130054552 February 28, 2013 Hawkins
20130054932 February 28, 2013 Acharya
20130080723 March 28, 2013 Sawa
20130254521 September 26, 2013 Bealkowski
20130282662 October 24, 2013 Kumarasamy
20130297802 November 7, 2013 Laribi
20130332688 December 12, 2013 Corbett
20130339659 December 19, 2013 Bybell
20130346709 December 26, 2013 Wang
20140006465 January 2, 2014 Davis
20140047263 February 13, 2014 Coatney
20140047341 February 13, 2014 Breternitz
20140047342 February 13, 2014 Breternitz
20140058871 February 27, 2014 Marr
20140059527 February 27, 2014 Gagliardi
20140059528 February 27, 2014 Gagliardi
20140108483 April 17, 2014 Tarta
20140130040 May 8, 2014 Lemanski
20140149696 May 29, 2014 Frenkel
20140195847 July 10, 2014 Webman
20140245319 August 28, 2014 Fellows
20140281449 September 18, 2014 Christopher
20140282596 September 18, 2014 Bourbonnais
20150046644 February 12, 2015 Karp
20150067031 March 5, 2015 Acharya
20150074358 March 12, 2015 Flinsbaugh
20150112951 April 23, 2015 Narayanamurthy
20150134857 May 14, 2015 Hahn
20150149605 May 28, 2015 de la Iglesia
20150186217 July 2, 2015 Eslami
20150278333 October 1, 2015 Hirose
20150317212 November 5, 2015 Lee
20150326481 November 12, 2015 Rector
20150379287 December 31, 2015 Mathur
20160011816 January 14, 2016 Aizman
20160026667 January 28, 2016 Mukherjee
20160042005 February 11, 2016 Liu
20160124775 May 5, 2016 Ashtiani
20160197995 July 7, 2016 Lu
20160239412 August 18, 2016 Wada
20160259597 September 8, 2016 Worley
20160283261 September 29, 2016 Nakatsu
20160321091 November 3, 2016 Cropper
20160357456 December 8, 2016 Iwasaki
20160357548 December 8, 2016 Stanton
20160366185 December 15, 2016 Lee
20160373327 December 22, 2016 Degioanni
20170033995 February 2, 2017 Banka
20170034023 February 2, 2017 Nickolov
20170060710 March 2, 2017 Ramani
20170060975 March 2, 2017 Akyureklier
20170139645 May 18, 2017 Byun
20170149843 May 25, 2017 Amulothu
20170168903 June 15, 2017 Dornemann
20170192889 July 6, 2017 Sato
20170214550 July 27, 2017 Kumar
20170235649 August 17, 2017 Shah
20170242617 August 24, 2017 Walsh
20170242719 August 24, 2017 Tsirkin
20170244557 August 24, 2017 Riel
20170244787 August 24, 2017 Rangasamy
20170322954 November 9, 2017 Horowitz
20170337492 November 23, 2017 Chen
20170371551 December 28, 2017 Sachdev
20180006896 January 4, 2018 MacNamara
20180024889 January 25, 2018 Verma
20180046553 February 15, 2018 Okamoto
20180082053 March 22, 2018 Brown
20180107419 April 19, 2018 Sachdev
20180113625 April 26, 2018 Sancheti
20180113770 April 26, 2018 Hasanov
20180136931 May 17, 2018 Hendrich
20180137306 May 17, 2018 Brady
20180150306 May 31, 2018 Govindaraju
20180159745 June 7, 2018 Byers
20180165170 June 14, 2018 Hegdal
20180218000 August 2, 2018 Setty
20180225140 August 9, 2018 Titus
20180225216 August 9, 2018 Filippo
20180246670 August 30, 2018 Baptist
20180246745 August 30, 2018 Aronovich
20180247064 August 30, 2018 Aronovich
20180276215 September 27, 2018 Chiba
20180285164 October 4, 2018 Hu
20180285223 October 4, 2018 McBride
20180285353 October 4, 2018 Rao
20180287883 October 4, 2018 Joshi
20180302335 October 18, 2018 Gao
20180329981 November 15, 2018 Gupte
20180364917 December 20, 2018 Ki
20180375728 December 27, 2018 Gangil
20190065061 February 28, 2019 Kim
20190065323 February 28, 2019 Dhamdhere
20190073132 March 7, 2019 Zhou
20190073372 March 7, 2019 Venkatesan
20190079928 March 14, 2019 Kumar
20190089651 March 21, 2019 Pignataro
20190102226 April 4, 2019 Caldato
20190109756 April 11, 2019 Lebdeh
20190116690 April 18, 2019 Chen
20190148932 May 16, 2019 Benesch
20190156023 May 23, 2019 Gerebe
20190163460 May 30, 2019 Kludy
20190188094 June 20, 2019 Ramamoorthi
20190190803 June 20, 2019 Joshi
20190199601 June 27, 2019 Lynar
20190213085 July 11, 2019 Alluboyina
20190215313 July 11, 2019 Doshi
20190220266 July 18, 2019 Doshi
20190220315 July 18, 2019 Vallala
20190235895 August 1, 2019 Ovesea
20190250849 August 15, 2019 Compton
20190272205 September 5, 2019 Jiang
20190278624 September 12, 2019 Bade
20190324666 October 24, 2019 Kusters
20190334727 October 31, 2019 Kaufman
20190361748 November 28, 2019 Walters
20190369273 December 5, 2019 Liu
20200019414 January 16, 2020 Byard
20200026635 January 23, 2020 Gaber
20200034193 January 30, 2020 Jayaram
20200034254 January 30, 2020 Natanzon
20200050522 February 13, 2020 Coleman
20200083909 March 12, 2020 Kusters
20200110650 April 9, 2020 Hu
20200150977 May 14, 2020 Wang
20200162330 May 21, 2020 Vadapalli
20200257519 August 13, 2020 Shen
20200356537 November 12, 2020 Sun
20200412625 December 31, 2020 Bagarolo
20210042151 February 11, 2021 Muller
20210067607 March 4, 2021 Gardner
20210126839 April 29, 2021 Rudrachar
20210157622 May 27, 2021 Ananthapur Bache
20210168034 June 3, 2021 Qian
Foreign Patent Documents
WO2017008675 January 2017 WO
Other references
  • Segment map, GOOGLE, Feb. 4, 2019.
  • Fast and Secure Append-Only storage with Infinite Capacity, Zheng, Aug. 27, 2003.
  • User Mode and Kernel Mode, MICROSOFT, Apr. 19, 2017.
  • Precise memory leak detection for java software using container profiling, XU, Jul. 2013.
  • Mogi et al., “Dynamic Parity Stripe Reorganizations for RAID5 Disk Arrays,” 1994, IEEE, pp. 17-26.
  • Syed et al., “The Container Manager Pattern”, ACM, pp. 1-9 (Year 2017).
  • Rehmann et al., “Performance of Containerized Database Management Systems”, ACM, pp. 1-6 (Year 2018).
  • Awada et al.,“ Improving Resource Efficiency of Container-instance Clusters on Clouds”, IEEE, pp. 929-934 (Year 2017).
  • Stankovski et al., “Implementing Time- Critical Functionalities with a Distributed Adaptive Container Architecture”, ACM, pp. 1-5 (Year 2016).
  • Dhakate et al., “Distributed Cloud Monitoring Using Docker as Next Generation Container Virtualization Technology” IEEE, pp. 1-5 (Year 2015).
  • Crameri et al., “Staged Deployment in Mirage, an Integrated Software Upgrade Testing and Distribution System”, ACM, pp. 221-236 (Year: 2007).
  • Cosmo et al., “Packages Upgrades in FOSS Distributions: Details and Challenges”, AC 2008).
  • Burg et al., “Atomic Upgrading of Distributed Systems”, ACM, pp. 1-5 (Year: 2008).
  • Souer et al., “Component Based Architecture forWeb Content Management: Runtime Deployable Web Manager Component Bundles”, IEEE, pp. 366-369 (Year: 2008).
  • Weingartner et al., “A distributed autonomic management framework for cloud computing orchestration.” In 2016 IEEE World Congress on Services (Year: 2016).
Patent History
Patent number: 11108638
Type: Grant
Filed: Jun 8, 2020
Date of Patent: Aug 31, 2021
Assignee: ROBIN SYSTEMS, INC. (San Jose, CA)
Inventors: Ravi Kumar Alluboyina (Santa Clara, CA), Sree Nandan Atur (Newark, CA), Kapil Upadhayay (Bangalore), Pragash Vijayaragavan (San Jose, CA)
Primary Examiner: Backhean Tiv
Application Number: 16/896,094
Classifications
Current U.S. Class: Temperature Responsive (307/651)
International Classification: H04L 12/24 (20060101);