Patent classifications
H04L41/122
Detecting deployment problems of containerized applications in a multiple-cluster environment
A request to identify a status of a containerized application that includes a plurality of resources and that has been deployed to at least some clusters of a plurality of different clusters is received. A placement rule is accessed that identifies a first set of clusters of the plurality of different clusters onto which, at a point in time of the accessing, the containerized application is expected as being deployed. Application deployment information is accessed that identifies a second set of clusters onto which the containerized application has been deployed. Based on the placement rule and the application deployment information, user interface imagery is generated that includes information that identifies a set of the plurality of resources of the containerized application and that identifies whether the first set of clusters is the same as the second set of clusters. The user interface imagery is presented on a display device.
Hybrid cloud services for enterprise fabric
This disclosure describes techniques and mechanisms for providing hybrid cloud services for enterprise fabric. The techniques include enhancing an on-demand protocol (e.g., such as LISP) and allowing simplified security and/or firewall service insertion for datacenter servers providing those services. Accordingly, the techniques described herein provide hybrid cloud services that work in disaggregated, distributed, and consistent way, while avoiding complex datacenter network devices (e.g., such running overlay on TOR), replacing and moving the functionality to on demand protocol enabled servers, which intelligently receive the required mappings as well as registers and publishes the service information to intelligently interact with the network.
Hybrid cloud services for enterprise fabric
This disclosure describes techniques and mechanisms for providing hybrid cloud services for enterprise fabric. The techniques include enhancing an on-demand protocol (e.g., such as LISP) and allowing simplified security and/or firewall service insertion for datacenter servers providing those services. Accordingly, the techniques described herein provide hybrid cloud services that work in disaggregated, distributed, and consistent way, while avoiding complex datacenter network devices (e.g., such running overlay on TOR), replacing and moving the functionality to on demand protocol enabled servers, which intelligently receive the required mappings as well as registers and publishes the service information to intelligently interact with the network.
TECHNIQUES FOR UTILIZING DIRECTED ACYCLIC GRAPHS FOR DEPLOYMENT INSTRUCTIONS
Techniques are disclosed for utilizing directed acyclic graphs for deployment instructions. A computer-implemented method can include various operations. Instructions may be executed by a computing device to perform parses of configuration data associated with a deployment. The computing device may cause a first directed acyclic graph (DAG) to be generated, the first DAG being utilized for deploying a first resource based on the parses. A second DAG may be generated for deploying execution targets based on the parses, the second DAG specifying dependencies between execution targets of the deployment. The computing device may generate a linked list data structure based on the parses and may deploy the computing system by traversal of the linked list data structure.
HISTORY MANAGEMENT APPARATUS, HISTORY MANAGEMENT METHOD, AND PROGRAM
A record management apparatus 1 for managing an order record of an order executed for a control target is provided. The record management apparatus 1 includes: an order record storage unit 12 that stores the order record in association with a plurality of time axes; an order record registration unit 11 that receives the order record and registers the order record in association with the plurality of time axes in the order record storage unit 12; and an order record acquisition unit 13 that when a retrieval request with a task type designated is received, retrieves the order record from the order record storage unit according to the task type using the plurality of time axes.
HISTORY MANAGEMENT APPARATUS, HISTORY MANAGEMENT METHOD, AND PROGRAM
A record management apparatus 1 for managing an order record of an order executed for a control target is provided. The record management apparatus 1 includes: an order record storage unit 12 that stores the order record in association with a plurality of time axes; an order record registration unit 11 that receives the order record and registers the order record in association with the plurality of time axes in the order record storage unit 12; and an order record acquisition unit 13 that when a retrieval request with a task type designated is received, retrieves the order record from the order record storage unit according to the task type using the plurality of time axes.
Network functions virtualization in ad-hoc groups
The present disclosure relates to virtualizing a network function in an ad-hoc group. The ad-hoc group comprises a plurality of mobile terminals that are configured for device-to-device communication, e.g., Proximity-Based Services (ProSe). The ProSe-enabled mobile terminals subscribe to a Network Functions Virtualization (NFV) service with an NFV management server. The NFV management server discovers the ad-hoc group that is suitable for NFV and informs an NFV application server of the ad-hoc group. The NFV application server then downloads data and configuration parameters to the ad-hoc group to offload a network function to the ad-hoc group for execution.
Network capability exposure method and device thereof
Disclosed is a network capability exposure method, which includes receiving a service request sent by a third-party device; determining a type of a network capability required according to the service request; determining a computing task matching the type of the network capability required; determining computing resources exposed by at least one physical device; obtaining a computing resource exposure result based on the computing task and the computing resources exposed by the at least one physical device; acquiring a network capability corresponding to the type of the network capability and the computing resource exposure result; and providing the network capability to the third-party device. Further, a network capability exposure device, a network capability exposure system and a non-transitory computer-readable storage medium are also disclosed.
Systems and methods for automatically packaging and deploying virtual network functions based on network interface dependencies and compatibilities
A device may receive information identifying existing virtual network functions (VNFs) associated with an existing virtual radio access network (VRAN), and may receive information identifying proposed VNFs to deploy with the existing VRAN, wherein the information identifying the proposed VNFs includes VNF descriptors indicating interface dependencies associated with the proposed VNFs. The device may generate testing configurations, for testing the proposed VNFs, based on the interface dependencies, and may determine that a set of the proposed VNFs are validated based on testing the proposed VNFs with the testing configurations. The device may derive dependency constraints for the set of the proposed VNFs based on the information identifying the existing VNFs, and may select a new VNF that satisfies the dependency constraints, based on the set of the proposed VNFs. The device may cause the new VNF to be deployed with the existing VRAN.
Entity relationship estimation apparatus, entity relationship estimation method, and recording medium
Easy and correct estimation of a relationship between entities is made possible. An entity relationship estimation apparatus that estimates a relationship between a plurality of entities each executing a process is configured to include: a window-based correlation and traffic volume estimation unit that acquires traffic data of a plurality of entities, and calculates correlation values in one or more windows of a predetermined time width of each traffic data of at least one entity pair; and a relationship type estimation unit that estimates a type of relationship between entities of the entity pair based on the correlation values of the windows of the entity pair.