International Business Machines Corporation

Scality, S.a.

Mudit Verma

Praveen Jayachandran

Seep Goel

Dushyant K Behl

Mathews Thomas

Pooja Aggarwal

Harshit Kumar

Chander Govindarajan

Utpal Mangla

Vianney Rancurel

Giorgio Regni

Abhishek Singh

Kavya Govindarajan

Rachit Garg

Yu Gu

Padmanabha Venkatagiri Seshadri

Rama Kalyani T Akkiraju

Ravi Kothari

Vijay Mann

Balaji Viswanathan

Umamaheswari C Devi

Shripad Jayant Nadgowda

Benoit Artuso

David Pineau

Guillaume Gimenez

Jean-Marc Saffroy

Amandeep Singh

Sharath Prasad Krishna Prasad

Steven Layne Canepa

Kavya G

Sai Srinivas Gorti

Pranjal Gupta

Systems, methods and/or computer program products for dynamically generating interactive content at an edge node of an edge network. For each set of video frames received, altered frames cached by the edge network can be fetched (when available) and reused to deliver interactive content to users. Where cached content is not present or distinctly different content from previously delivered content is intended for delivery to user(s), edge node identifies hotspots within video frames to insert interactive content, defining a timing and location for insertion, selects content consistent with user insights and/or preferences as well as an interaction types and placements known to be preferred by the user requesting the video frames. The edge node uses video creation services to alter the incoming video frames into altered video frames, inserts selected content at corresponding hotspots within the video and applies the interaction types for presenting the content to the user.

Dynamically generated interactive video content

A computer-implemented method, according to one approach, includes: receiving one or more streams of system log information from one or more microservices, and comparing the received system log information to compressed templates. One or more blocks of the system log information that correspond to one or more of the compressed templates are identified. All static text is removed from the identified blocks. Moreover, runtime variables from the identified blocks are inserted into respective ones of the compressed templates. The streams of system log information are further updated by replacing the identified blocks with the compressed templates having the runtime variables therein.

Lossless compression of system log information

Methods, computer program products, and systems are presented. The method computer program products, and systems can include, for instance: iteratively examining logging data; detecting multiple faults in a computer environment in dependence on the examining of the logging data; generating for respective ones of the detected multiple faults one or more candidate remediation to provide a set of candidate remediations for the computer environment; prioritizing remediations defining the set of candidate remediations from the generating and ordering the remediations in a remediation queue according to an order of the prioritizing; and deploying remediations according to the ordering of remediations in the remediation queue.

Prioritized fault remediation

A computer-implemented method, according to one approach, includes: receiving observability data produced by a first portion of a distributed application. The observability data is evaluated and in response to determining that the observability data indicates the first portion of the distributed application is degraded, the amount of the observability data produced by the first portion of the distributed application is increased. Additionally, the amount of observability data produced by other portions of the distributed application that are correlated with the first portion of the distributed application is also increased.

Dynamically adjusting observability based on real-time performance

Methods, systems, and computer program products for service-to-service scheduling in container orchestrators are provided herein. A computer-implemented method includes reserving, by a network orchestrator, network resources requested between a plurality of services, wherein each of the services is implemented as one or more replicas running on a set of nodes of a cluster, managed by the network orchestrator, that use the network resources to serve incoming requests to the plurality services; monitoring utilization of the network resources; and scheduling, by the network orchestrator based on the monitoring, one or more new replicas of the plurality of services and the incoming requests to the plurality of services in a collaborative manner to increase at least one network performance characteristic.

Service-to-service scheduling in container orchestrators

Edge application deployment in a network is provided. The network includes a plurality of edge sites with edge computing infrastructure. Edge application deployment is performed, including deploying a pseudo application instance (pApp) of the edge application at each edge site of a first group of edge sites of the plurality of edge sites, and deploying a real application instance (rApp) of the edge application at each edge site of a second group of one or more edge sites of the plurality of edge sites. The pApp is a lightweight, application-specific instance of the rApp with less application functionality than the rApp. Further, the first group of edge sites is larger than the second group, and a user device interaction with the edge application is through a selected pApp of the first group of edge sites to an rApp of the second group.

Enhanced edge application deployment and processing in a network

Provided is a method for selecting a service provider for an application. The method includes detecting a plurality of available service providers for an application running on a computing device. The method further includes comparing service information for each of the plurality of service providers to a set of service provider selection factors for the application. The method further includes selecting a first service provider of the plurality of service providers to provide service for the application.

Mobile network switching

Methods, systems, and computer program products for multi-controller declarative fault management and coordination for microservices are provided herein. A computer-implemented method includes processing information pertaining to at least one fault impacting multiple resources within a given system, wherein respective portions of the multiple resources are managed by multiple independent controllers; determining, by each of at least a portion of the multiple independent controllers and based at least in part on the processing of the information, one or more desired resource states and one or more remediation actions; generating, based at least in part on one or more of the determined desired resource states and the determined remediation actions, a sequential ordering of the determined remediation actions to be carried out by the at least a portion of the multiple controllers; and automatically initiating execution of the determined remediation actions in accordance with the generated sequential ordering.

Multi-controller declarative fault management and coordination for microservices

An example operation may include one or more of identifying a blockchain transaction requiring peer endorsement, transmitting a request for endorsement to one or more peers assigned to a blockchain, receiving endorsement response messages from the one or more peers, wherein the endorsement response messages comprise a plurality of priorities assigned to the blockchain transaction, and forwarding the received plurality of priorities and the blockchain transaction to an ordering node for assignment to the peers.

Prioritization in a permissioned blockchain

Techniques for non-invasive diagnosis of configuration errors in distributed system are disclosed including obtaining data packets from a network that include inflows and outflows associated with a given component of the network. The number of inflows and the number of outflows for the given component of the network are determined based on the obtained data packets. An intersection point corresponding to a predetermined number of inflows and a predetermined number of outflows is obtained and a score for the given component is determined based on a relationship between the intersection point and the determined number of inflows and outflows for the given component. Whether the score for the given component is greater than a predetermined threshold is determined, and the given component is identified as having a configuration error in response to determining that the score for the given component is greater than a predetermined threshold.

Non-invasive diagnosis of configuration errors in distributed system

Methods, systems, and computer program products for leveraging shared work to enhance job performance across analytics platforms are provided herein. A computer-implemented method includes comparing one or more task characteristics of multiple tasks across multiple jobs to be executed within a given environment, wherein each of the multiple jobs comprises one or more tasks; identifying, based on said comparing, one or more of the multiple tasks that can be shared by two or more of the multiple jobs; scheduling the multiple jobs for execution within the given environment, wherein said scheduling is based on (i) the identified tasks that can be shared by two or more of the multiple jobs, and (ii) one or more performance metrics of the given environment; and allocating resources to the multiple jobs based on said scheduling.

Leveraging shared work to enhance job performance across analytics platforms

A storage system is described. The storage system includes an object store having a plurality of objects containing information. The storage system also includes a cluster of locking nodes to implement a distributed synchronization locking mechanism. The cluster of locking nodes include a proposer node and a plurality of acceptor nodes. The proposer node to broadcast to the acceptor nodes a proposed lock on at least some of the information. The acceptor nodes to vote on the proposed lock based on respective locking information kept in a local store of each acceptor node.

Locking and I/O improvements of systems built with distributed consistent database implementations within an object store

An apparatus is described including a large scale distributed storage system. The large scale distributed storage system includes an object store. The large scale distributed storage system includes a plurality of connector nodes coupled to the object store. The connector nodes are to provide access to the object store for respective users that are respectively coupled to the connector nodes. The connector nodes are to provide the following services for the respective users: a snapshot of a storage system implemented within said object store; branching from a snapshot taken of said storage system implemented within said object store; locking of information kept within said storage system implemented within said object store.

Object storage system capable of performing snapshots, branches and locking

One embodiment provides a method, including: utilizing at least one processor to execute computer code that performs the steps of: receiving a system instruction from the at least one processor to perform an operation on a data structure; collecting, using at least one worker thread from a plurality of worker threads, a process request associated with the system instruction, wherein the plurality of worker threads perform operations within a computer system; placing the collected process request at a predetermined position on a state array, wherein the predetermined position is assigned to the at least one worker thread and wherein a helper thread is dedicated to the state array to execute requests placed within the state array; and executing the process request. Other aspects are described and claimed.

Growing community of inventors

New Delhi, India

Mudit Verma