Defining the processes to provision a complex service, such as a network and/or communications service, can typically be a very complicated task, particularly when considering the processes to perform all possible modifications of such services. For example, activating a physical network function may take months or years; similarly, migrating a service from one platform to another may take years and in certain cases may never be satisfactorily completed. In these cases, a speed of the provisioning process is typically dependent on the speed physical network devices can be procured and installed, which may be days, weeks, or months.
Various features and advantages of the present disclosure will be apparent from the detailed description which follows, taken in conjunction with the accompanying drawings, which together illustrate, by way of example only, features of the present disclosure, and wherein:
Service providers, such as the telecommunications industry, have struggled to develop a simple and maintainable process to automate the creation and maintenance of complex services, such as communications or network services. Due to the time required to provision physical devices, effort has not been expended in accelerating the time required to configure these devices to provide an operational service; there is no need to configure the system in days if it takes months to procure and install the physical devices. The advent of network function virtualization has turned this on its head. With network function virtualization, a virtual network function may be implemented in minutes, for example by simply loading an appropriate disk image as a virtual machine.
In a comparative cases, there are two approaches for provisioning a service using network function virtualization. In a first case, whenever a provisioning request relates to the modification of a service all constituent virtual network functions may be torn down and recreated with the modification in place. In a second case, explicit processes are defined to create and delete the service and the connections between the network functions implementing the service, e.g. in a hard-coded manner. This is typically performed for every possible combination of virtual network functions.
In the first comparative case, recreating the service with the modification has a benefit of simplicity but it leads to a risk of substantial service disruption during the recreation process. This is not acceptable for services with a predefined availability requirement, such as being available 99.999% of the time. It may also lead to irrecoverable data loss for stateful service configurations and this approach would typically involve the needless destruction and recreation of virtual network functions or virtual network components that are then recreated with no modification, e.g. the modification may require only require changing a parameter on a single virtual network device.
In the second comparative case, explicitly defining the transitions between service states to implement a modification may address some of these disadvantages; however this is at the cost of high complexity and many manhours of development and testing. For example, if the number of sub-services associated with a particular service is n, then the number of transitions between different configurations of these sub-services, i.e. different service states, is n2. Hence, even simple cases with a handful of sub-services are impractical to implement. Furthermore, every additional hard-coded transition increases the risk of coding error and substantial service disruption.
Certain examples described herein provide a method for the declarative provisioning of complex services. Certain examples described herein enable a service to be provisioned through the use of “descriptors”, in particular a “service descriptor” for the service and descriptors for any entities associated with the service. These entities may be, amongst others: sub-services; physical, logical and/or virtual network functions; physical, logical and/or virtual network components; place-keeper entities; infrastructure resources such as physical computing, storage and networking resources; and networks. Descriptors are data structures that declaratively define the properties of the service and/or entity. In this description the term “provisioning” is used broadly to cover at least the creation, modification and deletion of a service, e.g. as a synonym for service fulfillment in a telecommunications context. For example, a service may be provisioned in response to a request to create, modify or delete a particular service. This may also involve requests to add, modify or delete one or more sub-services. Certain examples of an apparatus are described that receives a command to provision a service and translates the command into a sequence of actions on underlying physical, logical and virtual infrastructure. This translation is achieved by way of the service descriptors. These data structures represent the service by way of a set of parameters. The values of these parameters are assigned to generate a particular instance of the service that may be implemented on said infrastructure. To manage transitions a service descriptor data structure may reference entities such as other sub-services, for example particular virtual network functions or combinations of virtual network functions, each of these again being represented by a service descriptor.
In certain examples herein, a descriptor defines which child entities an instance of that descriptor may have. The descriptor can furthermore define how parameter values are passed from a parent entity to its child entities. This process is called decomposition. This allows parent and child entities to be quickly deployed. An instance may also, when prescribed by the descriptor, reference instances other than the parent. In these cases, the descriptor may also define parameter values to be passed between the referrer and the referenced instance. Descriptors thus provide data objects that enable meaningful system configurations and topologies to be represented, independently of concrete infrastructure configurations.
For example, parent and child entities may be defined using a tree structure to model the parent-child relationship. Use of references as described herein expand this relationship to enable entities to form relationships that may be modelled as a directed, acyclic graph.
The service engine 110 of
Having obtained a set of appropriate descriptors, e.g. for the service and any associated entities, the service controller 130 is then arranged to instantiate the obtained descriptors. If successful, instances are generated as defined by the obtained descriptors. These generated instances comprise data structures, e.g. in the form of data object instances in an object-based implementation, that encapsulate a particular state of the entity defined in the descriptor. This state is based on assigning parameter values to parameters defined in the descriptors. As part of the generation of one or more instances the service controller 130 may instruct the assignment of physical computing resources via the resource interface 160. For example, the service controller 130 may request processor and memory resources on a server computing device that may be used to implement a virtual machine on the server computing device, the virtual machine implementing one or more virtual network functions that are required to provide the service.
The command interface 120 may be an application programming interface that is arranged to receive requests from a network. For example, the request interface may be a Java® remote method invocation interface and/or a representational state transfer (REST) interface arranged to receive network requests, e.g. from dedicated networks or the Internet.
In certain cases a state transition process may be used to define a number of actions that are required to provision the service. An example state transition process is described later with reference to
The service engine 110 and its subcomponents 120 to 160 may be implemented by one or more server computer devices. For example, data stores 140, 150 may be implemented using one or more locally or remotely coupled storage devices; interfaces 120, 160 may comprise a combination of physical hardware interfaces, e.g. network interfaces, and control software arranged to process communications transmitted using a particular physical layer technology. The service controller 130 may comprise dedicated hardware, e.g. circuitry, or a combination of software and hardware, such as computer program code or computer-readable instructions stored in a non-transitory computer-readable storage medium that is available to be processed by one or more central processing units of the server computer devices. The service engine 110 and its subcomponents 120 to 160 may be embodied in a single server computer device or may form a distributed system over a plurality of server computer devices.
One or more of the request generator 220 and the graphical user interface 230 may also enable the user to select a particular service and/or sub-service to create, modify or delete, e.g. from a list of available services and/or sub-services. For example, a user 210 may be shown one or more active services and/or one or more services that are available for activation. A similar choice may be presented for sub-services. One or more active services and/or sub-services may be associated with instances present in instance data store 150. One or more services that are available for activation may be associated with service descriptor data structures present in the service descriptor data store 150.
The resource manager 240, together with the resources defined in the resource data store 250, provide entity-action building blocks based on a physical and/or virtual infrastructure 260 that may be combined in the form of a descriptor to enable the provision of a service. The service engine 110 may be seen to determine what to orchestrate when providing network function virtualization, whereas the resource manager 240 determines how to orchestrate what has been selected by the service engine 110.
In one case, the service controller 130 may also have access to the resource data store 250. The service controller 130 may use this access to select descriptors during the instantiation of a parent-child instantiation path.
The service 310 has a number of child services 320. In
A service 310 may specify the child services 320 in the service descriptor for the service. The service descriptor defines how particular entities may be associated with the service, e.g. how particular virtual network functions may be combined to provide the service. In certain cases there may be a loose coupling between the parent service descriptor and the child service descriptor. For example, a child service 320 may be represented in the parent service descriptor as sub-service of a particular type, e.g. as a category of virtual network functions such as virtual router, virtual security gateway or virtual accelerator. Entities of a particular type may have a particular “type” descriptor that defines a number of parameters that are common to all implementations of the entity. For example, a service descriptor may define possible sub-services via declarations of descriptors having the types associated with those sub-services, e.g. a virtual router type, a virtual security gateway type and a virtual accelerator type. A particular sub-service implementation, e.g. a particular sub-service descriptor, may then be associated with the sub-service type declaration during provisioning of the service, e.g. in response to a particular implementation being selected in data from a received request or based on an existing and available instance of the service or sub-service. For example, a plurality of descriptors of a particular type may be chosen from when instantiating a sub-service 320 described by a particular one of those descriptors.
The service descriptor for the parent service 310 defines a set of policies for computing and passing parameters to child services 320. In one case, an instance of a child entity may be passed as a parameter to a fellow or sibling child entity, e.g. an instance of a child service may be passed to instantiate child service. The service descriptor for the service 310 may define policies that specify the conditions under which the child services 320 are to be activated, e.g. instantiated and what number of instances to instantiate of each. A modification request is called “scale-out” if it directly or indirectly causes an increase in the number of instances of a type of child service, and a modification is called “scale-in” if it causes a decrease in the number of child services.
In the example of
For example, a “Link” type descriptor, representing a network link connecting a network interface to a network port, may have a reference in the form:
Similarly, a virtual server entity may have a declaration in the form:
As shown above, the reference may be defined by data in the descriptor data structure representing the referrer entity 360. In
Being the parent, the descriptor for the second service 365 controls, through parameter bindings, the configuration of its referenced child entity 370, and the descriptor for 370 will similarly control the configuration of 375. Hence, the referrer descriptor only needs to be concerned with the configuration of the referring side of the connection, whereas the descriptors on the referenced side only need to be concerned with describing how the services on that side of the reference should be configured.
References such as those shown in
State 410 is indicative of a non-existent state. This means that the service instance has not been created yet. To move from non-existent state 410 to a “checked” state 420 the service instance is created in the service data store, and a service descriptor and requested parameters values are recorded there and subjected to simple validity checks, but the parameters from the request are not yet processed according to the service descriptor. This may comprise a “check” action. This may comprise generating a service instance and storing this in instance data store 150. During the check action parameter values may be assigned by evaluating parameter values indicated in a received request and/or by evaluating any bound parameter values. From the checked state 420 a “design” action may be applied to the service instance to move to a “designed” state 430. During the design action, parameter values may be evaluated as defined in the service descriptor.
From a designed state 430 a service instance may be the subject of a “reserve” action. The reserve action may comprise communication via the resource interface 160 to reserve resources and to values of reserved resources to the service instance. For example, on receipt of a request to reserve particular resources to fulfill the required parameter values, resource manager 240 may select an appropriate resource from resource data store 250 and return values for the selected resource to the service controller 230 via the resource interface 160. This action may also and/or alternatively comprise an operation on one of the data stores to mark resources as reserved. If a reserve action is successful the resource values are stored as part of the service instance and the service instance moves to a “reserved” state 440. Resources reserved by service instances in the reserved state may be released by a “release” action that transitions a service instance back to the designed state 430. From a reserved state 440, a “provision” action may be applied to transition a service instance to a “provisioned” state 450. In a provisioned state 450 a service represented by a service instance has been created in an inactive state on the physical/virtual infrastructure 260. For example, parameter values have been assigned to the parameters of the service descriptor and any child and/or referenced descriptors, and physical, logical and/or virtual devices have been allotted via the resource manager 240. In one case resource manager 240 may receive at least a reference to one or more instantiate entities and use the parameter values defined therein to select appropriate physical, logical and/or virtual resources. From the provisioned state 450 the service instance may transition back to the reserved state 440 via a “de-provision” action or may be activated via an “activate” action to move to an “activated” state 460. In the activated state 460 the service is live. From an activated state 460 a service instance may transition back to the provisioned state 450 via a “de-activate” action.
As shown in
Instances may have parameter values that record a current state and a desired state, e.g. as requested. Each of the state transitions may also involve implementing a state transition process for one or more associated entities, e.g. one or more sub-services and the like. This may involve generating and/or modifying an instance generated for a sub-service based on a descriptor for the child entity.
At block 510 a descriptor for a service is accessed. This may be performed in response to receiving a provisioning request. This may comprise receiving a request to create, modify or delete a service. The service may comprise a set of one or more virtual network functions. At block 520 a reference, such as shown in
When modifying an existing service, a reference may change from a previous value to a different value, or it may be set to have no value. When deleting a service, the reference may be deleted.
The method 500 of
In one case, the method first comprises hierarchically decomposing a descriptor for a requested service to determine one or more child entities required to implement the service. In this case, following decomposition, this process may involve determining, from the descriptor, a type of child entity, and obtaining a descriptor for the determined child entity type. For example, if a service has a service descriptor with a declarative statement indicating that it may have a sub-service of the type “virtual router”, a descriptor representative of the “virtual router” type may be retrieved.
Once the above decomposition takes place, any entities that comprise a reference may be identified. This may be performed implicitly as child entities are identified. In this case, resolving the reference may comprise determining a parent-child instantiation path, e.g. to generate the right hand side of
In certain cases instantiating the obtained descriptors based on the parent-child instantiation path comprises determining whether instances exist for at least of portion of the parent-child instantiation path and using any determined pre-existing instances to instantiate the descriptors. In this case determining a parent-child instantiation path may comprise using a scoring function to determine a descriptor for a child entity that matches the determined child entity type.
To better explain the apparatus and methods described above, an example of provisioning a particular service will now be described.
The onsite service 605 shown in
The physical servers 610 associated with the onsite service 605 may change: for example they may break or be replaced—in which case a different or modified physical server descriptor may be associated with the service descriptor if the details of the physical server change. In certain cases only an instance of the descriptor may change or be modified, for example if a parameter values needs to change, but the parameter is already defined in the descriptor. For example, as shown the descriptor for a physical server 610 defines the physical NICs of the server. There may be many kinds of server, e.g. from the same or different manufacturers and as such the set of physical NICs may change according to the particular server. This means the definitions for the NICs may vary per physical server descriptor, e.g. in a simple case a parameter may be NIC number. The physical server descriptor may also define which physical NICs are used for which purposes.
The onsite service 605 further has a number of associated networks. In FIG. these comprise an out-of-band (OOB) management network 635, a WAN network 640, a LAN network 645 and a number of internal networks 650. In a simple case these may comprise a set of connected network addresses, such as one or more internet protocol ranges. When no sub-services are provisioned these network definitions may be seen as parameter place holders, e.g. defining the name of a network. When sub-services are added they may take on a presence via virtual switches on a hypervisor. The sub-services may be defined as entities with associated descriptors that are instantiated. In the examples described below instances of the network definitions 635, 640, 645, 650 may indeed be passed as parameters into entities 610, 655, 660 and 655.
In
For example, a virtual router type descriptor may define a WAN-facing network parameter and a LAN-facing network parameter. A specific implementation of that virtual router type, e.g. a descriptor for a specific virtual router, then defines which one of its child virtual NICs is WAN-facing and LAN-facing and passes the parameters on to those relevant virtual NICs. The descriptor that defines the virtual NIC may take a network as parameter—if there is no network then the virtual NIC is unconnected. If the network parameter has a value, then the NIC specifies a Link child entity. The Link child then has a reference parameter with the network port as the referenced entity and the network as a parameter. The descriptors associated with the network port entities may have an “auto-create” definition that defines how it may be instantiated to resolve the reference if an instance does not already exist, for example this portion of the definition may define a pattern for an identifier, e.g. a name, of the network port when auto-created. The network port may have multiple auto-create implementations, e.g. one required for physical ports and one required for virtual ports on a given network technology, such as the virtual Switches of the hypervisor. A service controller such as 130 may decide which one to implement based on parameter values of the referrer object, e.g. a link associated with a virtual NIC may require a virtual port.
Hence, instead of trying to explicitly determine the network graph that represents the connections between all the entity instances of a service, examples described herein use the reference and pass the network entity to allow the virtual network function to be set-up as a black-box, e.g. explicit knowledge of the desired connectivity and internal structure of the network function is not required at the level of the on-site service 605. Furthermore, automatic generation of referenced entities may generate the appropriate network port entity instances if they do not exist, so that they can be passed the network entity instances as a parameter. Comparative solutions seek to instantiate each separate entity that is associated with a service and then attempt to determine the connections between the instantiated instances, typically based on hard-coded logic; with a service comprising more than a handful of entities this simply may not be practical or robust.
Lastly,
The provisioning of services shown in
Configuring links in practice may be performed programmatically by connecting the hypervisor's representation of a physical NICs to virtual Switches represented as virtual entities in the hypervisor software. This uses configuration features supported by the hypervisor, which in turn leverages the operating system under whose control the hypervisor software executes. The operating system has drivers for the physical devices of the computer, which allows configuration of those devices to be performed programmatically.
In one case provisioning a service comprises modifying a pre-existing service including determining, from a descriptor associated with the service, whether a parameter to be modified is mutable, responsive to the parameter being mutable, modifying a value of the parameter on an instance associated with the pre-existing service while said service is active and, responsive to the parameter not being mutable, re-instantiating one or more of an instance of the service and an instance of an associated entity with the value of the parameter. In certain cases a shadow version of a service instance may be maintained in parallel with any active version. This shadow version may then be used for comparing, at the one of the transitions of
Certain examples described herein thus address the complex interconnectivity of service components. Instead of managing complex graphs, service designers can concentrate on defining, using parameter passing and references, the structure and constraints of the services to be managed. Using this structure and the defined constraints, provided in the form of a descriptor, certain examples described herein may automatically compute the low-level actions needed on the underlying infrastructure. Using descriptors as described herein allows systematic testing of service creation, modification and deletion; this in turns helps avoid coding errors that may easily occur in hand-coded transition processes. Furthermore, the time to design or on-board a service is reduced by orders of magnitude compared to comparative solutions, e.g. from months to days or hours.
By using the described examples, network interfaces (NICs) of a virtual and/or physical network function may be easily attached to a network, and the system or systems on which the network should be created, e.g. as a virtual switch, may be automatically inferred. How a NIC should be configured on any determined virtual switch may also be inferred, as this may depend on the type of NIC, e.g. whether it is physical or virtual. In comparative systems connectivity may instead be modelled as an explicit graph of NICs and networks. In practice these graphs are very difficult to define and comprehend. For example, virtual network functions may consist of a varying number of virtual machines with many NICs each and so the number of virtual machines employed by the virtual network function directly impacts the complexity of the definition of the graph. Certain examples described herein address this by using the mechanisms of passing an abstract network definition as a parameter. The referencing described herein may also further be used to automatically infer how to fetch a versioned virtual machine image from a remote inventory onto a given hypervisor when that image is referenced by a service that requires the image for its virtual machine.
Certain examples described herein may be applied to provision a new virtual network function as part of a network function virtualization. They provide a method of processing a provisioning request from the moment the request is triggered and received to the moment where all the components of the virtual network function are deployed and properly configured. Certain examples described herein address the fact that a virtual network function may contain several components, for example some being virtual, some being non-virtual and some even being other virtual network functions; wherein each component may need a different configuration of resources, such as (amongst others) disk use, processor use, memory, bandwidth, and the components may need to be connected to one another.
The service engine described herein may include a microprocessor, microcontroller, dedicated circuitry, processor module or subsystem, programmable integrated circuit, programmable gate array, or another control or computing device. It may be implemented by way of computer program code retrieved from a computer-readable storage medium The storage media include different forms of memory including semiconductor memory devices such as dynamic or static random access memories (DRAMs or SRAMs), erasable and programmable read-only memories (EPROMs), electrically erasable and programmable read-only memories (EEPROMs) and flash memories; magnetic disks such as fixed, floppy and removable disks; other magnetic media including tape; optical media such as compact disks (CDs) or digital video disks (DVDs); or other types of storage devices. In the examples described herein the term “communicatively coupled” extends to any coupling whereby one component or module makes a function call on another component or module, including cases where both modules are executed within a common execution framework.
The above examples are to be understood as illustrative. It is to be understood that any feature described in relation to any one example may be used alone, or in combination with other features described, and may also be used in combination with one or more features of any other of the examples, or any combination of any other of the examples. Furthermore, equivalents and modifications not described above may also be employed.
This application is a continuation of U.S. patent application Ser. No. 15/514,611, filed on Mar. 27, 2017, which claims priority to PCT/EP2014/070838, filed Sep. 29, 2014, the contents of which are incorporated herein by reference in their entirety.
Number | Name | Date | Kind |
---|---|---|---|
7111299 | Tran et al. | Sep 2006 | B2 |
7197502 | Feinsmith | Mar 2007 | B2 |
7814142 | Mamou et al. | Oct 2010 | B2 |
7950007 | Mohindra et al. | May 2011 | B2 |
8191043 | Mohindra et al. | May 2012 | B2 |
8245122 | Liu et al. | Aug 2012 | B2 |
8301755 | De et al. | Oct 2012 | B2 |
8321549 | Isobe et al. | Nov 2012 | B2 |
8418002 | Lazzaro | Apr 2013 | B2 |
8443085 | Jensen-Horne et al. | May 2013 | B2 |
8863137 | Keller et al. | Oct 2014 | B2 |
8880591 | Feldman et al. | Nov 2014 | B2 |
8914499 | Houlihan et al. | Dec 2014 | B2 |
8918793 | Balko | Dec 2014 | B2 |
8954418 | Faerber et al. | Feb 2015 | B2 |
9286106 | Huang | Mar 2016 | B1 |
9367374 | Kaus et al. | Jun 2016 | B2 |
9378120 | Chakraborty et al. | Jun 2016 | B2 |
9430262 | Felstaine et al. | Aug 2016 | B1 |
9594601 | Shau et al. | Mar 2017 | B2 |
9619278 | Vermeulen | Apr 2017 | B2 |
9773216 | Bain et al. | Sep 2017 | B2 |
9998562 | Peterson et al. | Jun 2018 | B1 |
10104187 | Shi et al. | Oct 2018 | B2 |
10178027 | Johnsen et al. | Jan 2019 | B2 |
10275258 | Zellermayer et al. | Apr 2019 | B2 |
10326845 | Jaeger | Jun 2019 | B1 |
10348857 | De et al. | Jul 2019 | B2 |
10419524 | Schincariol et al. | Sep 2019 | B2 |
10454771 | Ellis et al. | Oct 2019 | B2 |
10594621 | Sharma et al. | Mar 2020 | B2 |
10725982 | Scheideler et al. | Jul 2020 | B2 |
10785128 | Bawcom | Sep 2020 | B1 |
11080491 | Mihindukulasooriya et al. | Aug 2021 | B2 |
11171841 | Bruun et al. | Nov 2021 | B2 |
11281491 | Bruun et al. | Mar 2022 | B2 |
20040260602 | Nakaminami et al. | Dec 2004 | A1 |
20050086562 | Demsky et al. | Apr 2005 | A1 |
20050155042 | Kolb | Jul 2005 | A1 |
20050240354 | Mamou et al. | Oct 2005 | A1 |
20060029054 | Breh et al. | Feb 2006 | A1 |
20060256733 | Bejerano | Nov 2006 | A1 |
20060268742 | Chu et al. | Nov 2006 | A1 |
20070043803 | Whitehouse et al. | Feb 2007 | A1 |
20070294668 | Mohindra | Dec 2007 | A1 |
20080294777 | Karve et al. | Nov 2008 | A1 |
20080312986 | Braun | Dec 2008 | A1 |
20090157723 | De et al. | Jun 2009 | A1 |
20090193439 | Bernebeu-Auban et al. | Jul 2009 | A1 |
20090327216 | Brown et al. | Dec 2009 | A1 |
20100057780 | Isobe et al. | Mar 2010 | A1 |
20100058445 | Zhu | Mar 2010 | A1 |
20100333109 | Milnor | Dec 2010 | A1 |
20110046992 | Erhard | Feb 2011 | A1 |
20110145657 | Bishop et al. | Jun 2011 | A1 |
20110276444 | Toernkvist | Nov 2011 | A1 |
20110276674 | Jensen-Horne et al. | Nov 2011 | A1 |
20120016713 | Wilcock et al. | Jan 2012 | A1 |
20120089726 | Doddavula | Apr 2012 | A1 |
20120117226 | Tanaka | May 2012 | A1 |
20130036425 | Zimmermann | Feb 2013 | A1 |
20130127891 | Kim et al. | May 2013 | A1 |
20130151317 | Charfi et al. | Jun 2013 | A1 |
20130152090 | Balko | Jun 2013 | A1 |
20130198760 | Cuadra et al. | Aug 2013 | A1 |
20130217361 | Mohammed et al. | Aug 2013 | A1 |
20130290937 | Joukov et al. | Oct 2013 | A1 |
20140013315 | Genevski et al. | Jan 2014 | A1 |
20140074905 | Schincariol et al. | Mar 2014 | A1 |
20140075048 | Yuksel et al. | Mar 2014 | A1 |
20140098673 | Lee et al. | Apr 2014 | A1 |
20140172944 | Newton | Jun 2014 | A1 |
20140229945 | Barkai | Aug 2014 | A1 |
20140236843 | Bain et al. | Aug 2014 | A1 |
20140250489 | Calo et al. | Sep 2014 | A1 |
20140278662 | Reed et al. | Sep 2014 | A1 |
20140278723 | Liu | Sep 2014 | A1 |
20150006733 | Khan et al. | Jan 2015 | A1 |
20150120380 | Deshpande et al. | Apr 2015 | A1 |
20150124645 | Yadav et al. | May 2015 | A1 |
20150178107 | Gummaraju | Jun 2015 | A1 |
20150278395 | Ben et al. | Oct 2015 | A1 |
20150309780 | Ruehl et al. | Oct 2015 | A1 |
20150365322 | Shatzkamer | Dec 2015 | A1 |
20150378774 | Vermeulen | Dec 2015 | A1 |
20160080422 | Belgodere et al. | Mar 2016 | A1 |
20160094477 | Bai et al. | Mar 2016 | A1 |
20160323082 | Watanabe | Nov 2016 | A1 |
20160378450 | Fu et al. | Dec 2016 | A1 |
20170154123 | Yurchenko et al. | Jun 2017 | A1 |
20170161104 | Johnson et al. | Jun 2017 | A1 |
20170161129 | Johnson et al. | Jun 2017 | A1 |
20170207968 | Eicken et al. | Jul 2017 | A1 |
20170257432 | Fu et al. | Sep 2017 | A1 |
20170270214 | Narasimhan et al. | Sep 2017 | A1 |
20170289060 | Aftab et al. | Oct 2017 | A1 |
20170322954 | Horowitz et al. | Nov 2017 | A1 |
20170366623 | Shi et al. | Dec 2017 | A1 |
20180083828 | Cartaya et al. | Mar 2018 | A1 |
20180107186 | Brown et al. | Apr 2018 | A1 |
20180145884 | Stefanov et al. | May 2018 | A1 |
20180157472 | Chen | Jun 2018 | A1 |
20180165071 | Raghavan et al. | Jun 2018 | A1 |
20180234308 | Bruun et al. | Aug 2018 | A1 |
20180246755 | Ailamaki et al. | Aug 2018 | A1 |
20180359162 | Savov et al. | Dec 2018 | A1 |
20190058638 | Ahuja et al. | Feb 2019 | A1 |
20190068440 | Nelson | Feb 2019 | A1 |
20190155926 | Scheideler et al. | May 2019 | A1 |
20190312794 | Bruun et al. | Oct 2019 | A1 |
20200186446 | Yousaf | Jun 2020 | A1 |
20210064418 | Natarajan et al. | Mar 2021 | A1 |
Number | Date | Country |
---|---|---|
1942860 | Apr 2007 | CN |
101933000 | Dec 2010 | CN |
102138315 | Jul 2011 | CN |
103516781 | Jan 2014 | CN |
104901998 | Sep 2015 | CN |
105164660 | Dec 2015 | CN |
107209688 | Sep 2017 | CN |
107710155 | Feb 2018 | CN |
108475360 | Aug 2018 | CN |
3550433 | Oct 2019 | EP |
2007146368 | Dec 2007 | WO |
2008091663 | Jul 2008 | WO |
2011162744 | Dec 2011 | WO |
2014039888 | Mar 2014 | WO |
2015032435 | Mar 2015 | WO |
2017129248 | Aug 2017 | WO |
Entry |
---|
Bohm et al., “Processes Are Data: a Programming Model for Distributed Applications”, Web Information Systems Engineering—WISE 2009, 12 Pages. |
Casati et al., “eFlow: A Platform for Developing and Managing Composite E-Services”, Proceedings Academia/Industry Working Conference on Research Challenges, 2000, pp. 341-348. |
Cerrato, et al., “User-Specific Network Service Functions In An SDN-Enabled Network Node”, Deptment of Computer and Control Engineering. Politecnico di Torino. Torino, Italy, 2014, 2 pages. |
Clayman, et al., “The Dynamic Placement Of Virtual Network Functions”, Telecom Italia Strategy Future Centre. Via Reiss Romoli 274, 10148 Turin, Italy. IEEE 2014, 9 pages. |
European Search Report and Search Opinion Received for EP Application No. 19161859, dated Jul. 10, 2019, 9 pages. |
Fdhila Walid et al., “On Evolving Partitioned Web Service Orchestrations,” IEEE Intemationai Conference on Service-Oriented Computing and Applications, Dec. 2012, pp. 1-7. |
Ferry et al., “A Real-time Scheduling Service for Parallel Tasks”, IEEE 19th Real-Time and Embedded Technology and Applications Symposium (RTAS), Apr. 2013, 11 pages. |
Intel, “End-To-End NFV vEPC Service Orchestration Of A Virtual EPC Network Function Virtualization Use Case On Intel Architecture”, Intel Network Builders Reference Architecture Retreived on Mar. 26, 2017, 24 pages. |
International Search Report and Written Opinion received for PCT Application No. PCT/EP2014/070838, dated Jun. 15, 2015, 11 pages. |
International Search Report and Written Opinion received for PCT Application No. PCT/EP2016/051851, dated Oct. 10, 2016, 10 pages. |
Kelly et al., “Output-Valid Rollback-Recovery”, HP Labs, HPL-2010-155, 2010, pp. 1-14. |
Laurent et al., “Planning for Declarative Processes”, The 29th Annual ACM Symposium on Applied Computing, 2014, pp. 1126-1133. |
Oracle, “4 Understanding Orchestration,” Oracle (Registered) Communications Order and Service Management Concepts, 2009, pp. 1-55, Release 7.2.2, Retrieved from the Internet on Nov. 24, 2017 at URL: <docs.oracle.com/cd/E35413_01/doc.722/e35415/cpt_orchestration.htm#autoId0>. |
Xiao et al., “Process Dependencies and Process Interference Rules for Analyzing the Impact of Failure in a Service Composition Environment”, Proceedings of the 10th international conference on Business information systems, 2007, pp. 67-81. |
Yang et al., “Research on Software Architecture-based Composition of Internetware”, May 15, 2007, 3 pages. |
Heat Developers, “Heat Documentation”, Release 21.0.0.0rc2.dev1, Sep. 22, 2023, 1003 pages. |
Openstack, “Heat/AutoScaling”, available online at <https://web.archive.org/web/20190325163742/https://wiki.openstack.org/wiki/Heat/AutoScaling>, Mar. 25, 2019, 7 pages. |
Oren et al, “YAML Ain't Markup Language (YAML™) version 1.2”, available online at <https://yaml.org/spec/1.2.2/>, 2009, 65 pages. |
Number | Date | Country | |
---|---|---|---|
20220078092 A1 | Mar 2022 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 15514611 | US | |
Child | 17528480 | US |