NETWORK EXPANSION TO REMOTE SITES UTILIZING SECURE AUTONOMOUS OR REMOTELY PILOTED VEHICLE AS A REMOTE MULTI-ACCESS EDGE COMPUTER

A communication system for a remote location, which is out of range of a telecom provider, is provided. The communication system includes a remote multi-access edge computer (RMEC) proximate to the remote location and communicative with the telecom provider. The RMEC is configured to run software of the telecom provider whereby the RMEC is securely connectable with the telecom provider such that the RMEC is capable of providing cellular connectivity to a cell phone operably deployed at the remote location.

HIERARCHICAL DATA SKIPPING USING DATA SKETCHES

A computer implemented method performs data skipping in a hierarchically organized computing system. A group of processor units determines leaf node data sketches for data in leaf nodes in the hierarchically organized computing system. The leaf node data sketches summarize attributes of data in the leaf nodes. The group of processor units aggregates the leaf node data sketches at intermediate nodes in the hierarchically organized computing system to form aggregated data sketches at the intermediate nodes and retains data sketches received at the intermediate nodes from a group of child nodes to form retained data sketches. The retained data sketches are one of leaf node data sketches and the aggregated data sketches. The group of processor units searches the data using the retained data sketches and the data skipping within the hierarchically organized computing system in response to queries made to the intermediate nodes in the hierarchically organized computing system.

QUESTION-ANSWERING SYSTEM FOR AUTONOMIC MANAGEMENT

Disclosed are methods method, systems, and computer program products for automatic management of a data processing system (DPS). One embodiment of the method may comprise receiving, at a computer processor, operations data associated with a DPS; and generating, by a Question-Answer (QA) system executing on the computer processor, a Question sentence from the operations data. The method may further comprise sampling a window of the operations data, extracting a plurality of key performance indicators (KPI) from the operations data in the sampled window, and providing the plurality of KPI to the QA system.

POLYMORPHIC DYNAMIC FIREWALL

A method, computer system, and a computer program product is provided for establishing a dynamically adaptive network firewall. A firewall model is established that identifies resources that can be used and a plurality of nodes that connect to one another to form a network. A set of external rules and policies are provided to each resource. The firewall implemented using the firewall model upon receiving of incoming data and upon traffic flow. The firewall expands or contracts the network by adding or removing resources according to work that needs to be performed. The work includes both tasks to be completed and efforts that has to be taken by the firewall to ensure security by preventing unauthorized access into the network.

CONTAINER CROSS-CLUSTER CAPACITY SCALING

A method, computer program product, and computer system are provided for container cross-cluster capacity scaling. The method includes broadcasting local capacity information of capacity availability or capacity requirement for the local cluster and receiving broadcasts from each of one or more other clusters providing capacity information including capacity availability or capacity requirements. The method may map the received capacity information with the local capacity information and may determine a suitable cross-cluster capacity sharing when a capacity requirement of the local cluster maps to a capacity availability of another cluster or when a capacity availability of the local cluster maps to a capacity requirement of another cluster. The method may coordinate the deallocation of a node from the cluster having the capacity availability and reallocation of the node to the cluster having the capacity requirement.

DYNAMIC CONTENT FULFILMENT ASSOCIATED WITH REAL TIME BIDDING

An approach for creating dynamic content. The approach receives advertiser data associated with activities of one or more advertisers and receives publisher data associated with activities of one or more publishers. The approach manages the one or more DSPs activities associated with the received advertiser data and publisher data. Furthermore, the approach manages the one or more SSPs activities associated with the received advertiser data, publisher data and the one or more DSPs activities and selects one or more advertisement for one or more website. Finally, the approach manages the one or more consumer behaviors associated with the selected one or more advertisement. 1. A computer-implemented method for creating dynamic content , the method comprising:receiving advertiser data associated with activities of one or more advertisers;receiving publisher data associated with activities of one or more publishers;managing one or more digital side platform (DSP) activities associated with the received advertiser data and publisher data;managing one or more supplier side platform (SSP) activities associated with the received advertiser data, publisher data, and the one or more DSP activities;selecting one or more advertisements for one or more websites; andmanaging one or more consumer behaviors associated with the selected one or more advertisements.2. The computer-implemented method of claim 1 , further comprising:creating trackable entries associated with the one or more DSP activities and the one or more SSP activities using blockchain technology; andcreating trackable entries associated with the one or more SSP activities using blockchain technology.3. The computer-implemented method of claim 1 , wherein managing the one or more DSP activities further comprises:receiving a publisher request from a publisher regarding an advertisement;instructing the one or more DSPs to place a bid for the advertisement, wherein the one or more SSPs search for one or more suppliers; ...

Mobile network switching

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.

DYNAMIC NETWORK MANAGEMENT BASED ON USER, DEVICE, APPLICATION, AND NETWORK CHARACTERISTICS

In an approach to dynamic network management based on user, device, application, and predicted network characteristics, one or more computer processors identify one or more network interfaces. The one or more computer processors determine one or more network performance parameters and capabilities of the identified network interfaces. The one or more computer processors determine a highest ranked network connection based on the determined network performance parameters and capabilities of the identified network interfaces. The one or more computer processors generate one or more network templates based on the determined highest ranked network connection and associated network performance parameters. The one or more computer processors apply the one or more generated network templates to a plurality of entities and devices.

GENERATIVE EXPERIMENTS FOR APPLICATION DEPLOYMENT IN 5G NETWORKS

A computer implemented method determines a placement of an application being added to a network. The method includes determining a logical-physical mapping for the application. Sub-graphs in the logical-physical mapping are identified. A stored application in a catalog of applications previously used in the network is located. The stored application includes one of the sub-graphs in the logical-physical mapping. An experiment is generated, performed by a computing device running a neural network model, using the sub-graphs. The experiment includes inducing a physical node mapping for the sub-graph. A cost function associated with a placement of the application being added to the network to one or more physical nodes in the induced physical node mapping is determined.

TOPOLOGY-HOMOGENEITY FOR ENRICHING EVENT PATTERNS IN ARTIFICIAL INTELLIGENCE OPERATIONS

A method for determining a correlation of one or more events occurring in a plurality of nodes of a network includes accessing, by a computing device, address information associated with each of the plurality of nodes on the network. The computing device can further access one or more event IDs associated with one or more events occurring on the plurality of nodes. The computing device can further create an association the one or more events occurring on the plurality of nodes with related events occurring on others of the plurality of nodes, the association including the address information.

USING A LOGICAL TREE STRUCTURE TO IDENTIFY A FOUNDATION MODEL INFERENCING SERVER FOR FULFILLING AN INFERENCING REQUEST

A computer-implemented method, according to one embodiment, includes determining a plurality of downstream task models of a foundation model, and arranging the downstream task models into a logical tree structure. Each node of the logical tree structure represents a sequence of layers of an associated one of the downstream task models. In response to a determination that a request for inferencing on a target model has resulted in a cache miss occurring, the logical tree structure is used to identify an inferencing server that satisfies at least a first predetermined prerequisite for fulfilling the inferencing request. The method further includes causing the identified inferencing server to fulfill the inferencing request. A computer program product, according to one embodiment, includes a computer readable storage medium having program instructions embodied therewith. The program instructions are readable and/or executable by a computer to cause the computer to perform the foregoing method.

Dynamic network management based on user, device, application, and network characteristics

In an approach to dynamic network management based on user, device, application, and predicted network characteristics, one or more computer processors identify one or more network interfaces. The one or more computer processors determine one or more network performance parameters and capabilities of the identified network interfaces. The one or more computer processors determine a highest ranked network connection based on the determined network performance parameters and capabilities of the identified network interfaces. The one or more computer processors generate one or more network templates based on the determined highest ranked network connection and associated network performance parameters. The one or more computer processors apply the one or more generated network templates to a plurality of entities and devices.

Delayed instantiation of network slices

A computer-implemented method and a computer system establish network slices within a physical network having a plurality of network elements. The method includes receiving a request to instantiate a network slice at a network element. The method also includes determining a performance metric of the network element. The method further includes delaying instantiation of the requested network slice within the network element in response to determining that the performance metric of the network element is below a threshold. The method also includes instantiating the requested network slice within the network element in response to determining that the performance metric of the network element is at or above the threshold. Finally, the method includes deactivating the requested network slice in response to determining that the performance metric of the network element is below the threshold at a time subsequent to instantiating the requested network slice.

FOUNDATIONAL MODEL FOR NETWORK PACKET TRACES

Embodiments related to using a foundational model for network packet traces. A technique includes receiving network traffic of a network and extracting features from the network traffic, the features having a function related to communications in the network. The technique includes generating tokens from the features, each of the features corresponding to a respective one of the tokens, training a machine learning model by inputting the tokens, the machine learning model being trained to output contextual embeddings for the tokens, and using the contextual embeddings to determine an anomaly in the network traffic.

Dynamic content fulfilment associated with real time bidding

An approach for creating dynamic content. The approach receives advertiser data associated with activities of one or more advertisers and receives publisher data associated with activities of one or more publishers. The approach manages the one or more DSPs activities associated with the received advertiser data and publisher data. Furthermore, the approach manages the one or more SSPs activities associated with the received advertiser data, publisher data and the one or more DSPs activities and selects one or more advertisement for one or more website. Finally, the approach manages the one or more consumer behaviors associated with the selected one or more advertisement.

AUTONOMOUS IDENTIFICATION OF ROUGE DEVICES IN A COMMUNICATIONS NETWORK

Computer-implemented methods for autonomous identification of rouge devices in a communications network are provided. Aspects include collecting connection trace data including connection characteristics for each of a plurality of mobile devices in communication with a communications network and aggregating the connection trace data. Aspects also include determining performance characteristics for each of a plurality of groups of the plurality of mobile devices, wherein each of the plurality of groups corresponds to mobile devices having a type approval code and comparing the performance characteristics for each of the plurality of groups. Based on a determination that the performance characteristics of one of the plurality of groups deviate from the performance characteristics of a remaining set of the plurality of groups by more than a first threshold amount, aspects include designating the type approval code associated with the one of the plurality of groups as a rogue type approval code.

DYNAMIC MASSIVE MIMO END DEVICE PAIRING BASED ON PREDICTED AND REAL TIME CONNECTION STATE

A computer-implemented method for grouping devices in a massive multiple-input and multiple-output (MIMO)-based cellular network, in accordance with one embodiment, includes determining movement states of end devices in a cell of the massive MIMO-based cellular network, estimating payload requirements of the end devices, and grouping the end devices in a group based on the determined movement states and the estimated payload requirements.

FRAUD PREVENTION ASSOCIATED WITH SERVICE MANAGEMENT OF A COMPUTING PLATFORM

A method, computer system, and a computer program product managing data usage integrity is provided. In one embodiment, the method comprises receiving data connected with data usage of at least one user in a computer environment. The pricing information is then for the user relating to the data usage. The computer embodiment is segmented into a plurality of segment areas and a payment price is calculated for each segment area. An anomaly is detected by comparing the data usage and the associated pricing for each of segmented areas according to a preselected value. If an anomaly is selected, an end-to-end simulation check is performed for the computer environment to ascertain whether the payment price for the segment may be inconsistent with a resource usage affecting an end-to-end flow for the computer environment.

POWER AND ENERGY OPTIMIZATION ACROSS DISTRIBUTED CLOUD ENVIRONMENT

An approach for managing workload deployment in a distributed network, including edge computing is provided. The approach includes deploying several modules, such as, EMM (energy management module), LDM (localized deployment manager) and EDM (edge deployment manager). These modules will be constantly monitoring and managing the energy consumption at the edge nodes under their purview and communicate with other modules to develop a holistic energy management system (e.g., energy policies, energy algorithms, energy plans, etc.) to ensure the most effective energy management of workload is implemented.

OMNICHANNEL VIRTUAL ASSISTANT USING ARTIFICIAL INTELLIGENCE

Provided is a method for generating a personalized response to a user query. An omnichannel assistant receives a query from a user. The query is parsed to identify a user request. A user profile of the user is analyzed to determine one or more sources for responding to the query. The user profile includes a set of trusted sources for the user. Data for responding to the query is retrieved from the one or more sources. A channel for a response is selected based at least in part on the user profile. The response to the query is generated. The response is generated using the retrieved data, the selected channel, and the user profile. The response is then transmitted to the user. 1. A method for providing a personalized response to a user query , the method comprising:receiving, by an omnichannel assistant, a query from a user;parsing the query to identify a user request;analyzing a user profile of the user to determine one or more sources for responding to the query, wherein the user profile includes a set of trusted sources for the user;retrieving data to respond to the query from the one or more sources;selecting a channel for a response based at least in part on the user profile;generating the response to the query using the retrieved data, the selected channel, and the user profile; andtransmitting the response to the user.2. The method of claim 1 , wherein parsing the query comprises:determining an intent of the query;determining an entity associated with the query; anddetermining a tone of the query,wherein the query is parsed using natural language processing and the user profile.3. The method of claim 1 , the method further comprising generating the user profile for the user based on one or more electronic documents associated with the user.4. The method of claim 3 , wherein the one or more electronic documents include at least one chat transcript and at least one social media post for the user claim 3 , and wherein generating the user profile comprises: ...

Hierarchical data skipping using data sketches

A computer implemented method performs data skipping in a hierarchically organized computing system. A group of processor units determines leaf node data sketches for data in leaf nodes in the hierarchically organized computing system. The leaf node data sketches summarize attributes of data in the leaf nodes. The group of processor units aggregates the leaf node data sketches at intermediate nodes in the hierarchically organized computing system to form aggregated data sketches at the intermediate nodes and retains data sketches received at the intermediate nodes from a group of child nodes to form retained data sketches. The retained data sketches are one of leaf node data sketches and the aggregated data sketches. The group of processor units searches the data using the retained data sketches and the data skipping within the hierarchically organized computing system in response to queries made to the intermediate nodes in the hierarchically organized computing system.

DELAYED INSTANTIATION OF NETWORK SLICES

A computer-implemented method and a computer system establish network slices within a physical network having a plurality of network elements. The method includes receiving a request to instantiate a network slice at a network element. The method also includes determining a performance metric of the network element. The method further includes delaying instantiation of the requested network slice within the network element in response to determining that the performance metric of the network element is below a threshold. The method also includes instantiating the requested network slice within the network element in response to determining that the performance metric of the network element is at or above the threshold. Finally, the method includes deactivating the requested network slice in response to determining that the performance metric of the network element is below the threshold at a time subsequent to instantiating the requested network slice. 1. A computer-implemented method for establishing network slices within a physical network having a plurality of network elements , the method comprising:receiving a request to instantiate a network slice at a network element;determining a performance metric of the network element; andin response to determining that the performance metric of the network element is below a threshold, delaying instantiation of the requested network slice within the network element.2. The method of claim 1 , wherein the delaying instantiation of the requested network slice within the network element comprises:storing the request to instantiate a network slice in a control path table of network slices in the network element.3. The method of claim 1 , further comprising:in response to determining that the performance metric of the network element is within a margin of the threshold, storing a request to instantiate a network slice in a data path table of network slices in the network element.4. The method of claim 1 , further comprising:in ...

Dynamically generated interactive video content

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.

Generative experiments for application deployment in 5G networks

A computer implemented method determines a placement of an application being added to a network. The method includes determining a logical-physical mapping for the application. Sub-graphs in the logical-physical mapping are identified. A stored application in a catalog of applications previously used in the network is located. The stored application includes one of the sub-graphs in the logical-physical mapping. An experiment is generated, performed by a computing device running a neural network model, using the sub-graphs. The experiment includes inducing a physical node mapping for the sub-graph. A cost function associated with a placement of the application being added to the network to one or more physical nodes in the induced physical node mapping is determined.

Container cross-cluster capacity scaling

A method, computer program product, and computer system are provided for container cross-cluster capacity scaling. The method includes broadcasting local capacity information of capacity availability or capacity requirement for the local cluster and receiving broadcasts from each of one or more other clusters providing capacity information including capacity availability or capacity requirements. The method may map the received capacity information with the local capacity information and may determine a suitable cross-cluster capacity sharing when a capacity requirement of the local cluster maps to a capacity availability of another cluster or when a capacity availability of the local cluster maps to a capacity requirement of another cluster. The method may coordinate the deallocation of a node from the cluster having the capacity availability and reallocation of the node to the cluster having the capacity requirement.

Dynamic massive mimo end device pairing based on predicted and real time connection state

A computer-implemented method for grouping devices in a massive multiple-input and multiple-output (MIMO) -based cellular network includes determining movement states of end devices in a cell of the massive MIMO-based cellular network, estimating payload requirements of the end devices, and grouping the end devices in a group based on the determined movement states and the estimated payload requirements.

Generative experimente zur anwendungsbereitstellung in 5g-netzen

Ein auf einem Computer implementiertes Verfahren ermittelt eine Platzierung einer Anwendung, die zu einem Netzwerk hinzugefügt wird. Das Verfahren enthält ein Ermitteln einer logisch-physischen Zuordnung für die Anwendung. Untergraphen in der logisch-physischen Zuordnung werden erkannt. Eine gespeicherte Anwendung in einem Katalog von in dem Netzwerk zuvor verwendeten Anwendungen wird gesucht. Die gespeicherte Anwendung enthält einen der Untergraphen in der logisch-physischen Zuordnung. Mithilfe der Untergraphen wird ein Experiment erzeugt, das durch eine Datenverarbeitungseinheit durchgeführt wird, die ein Modell eines neuronalen Netzes ausführt. Das Experiment enthält ein Erzeugen einer Zuordnung von physischen Knoten für den Untergraphen. Eine einer Platzierung der Anwendung, die zu dem Netzwerk hinzugefügt wird, zugehörige Kostenfunktion bei einem oder mehreren physischen Knoten in der erzeugten Zuordnung von physischen Knoten wird ermittelt.

Generative experiments for application deployment in 5g networks

A computer implemented method determines a placement of an application being added to a network. The method includes determining a logical-physical mapping for the application. Sub-graphs in the logical-physical mapping are identified. A stored application in a catalog of applications previously used in the network is located. The stored application includes one of the sub-graphs in the logical-physical mapping. An experiment is generated, performed by a computing device running a neural network model, using the sub-graphs. The experiment includes inducing a physical node mapping for the sub-graph. A cost function associated with a placement of the application being added to the network to one or more physical nodes in the induced physical node mapping is determined.

Power and energy optimization across distributed cloud environment

An approach for managing workload deployment in a distributed network, including edge computing is provided. The approach includes deploying several modules, such as, EMM (energy management module), LDM (localized deployment manager) and EDM (edge deployment manager). These modules will be constantly monitoring and managing the energy consumption at the edge nodes under their purview and communicate with other modules to develop a holistic energy management system (e.g., energy policies, energy algorithms, energy plans, etc.) to ensure the most effective energy management of workload is implemented.

Foundational model for network packet traces

Embodiments related to using a foundational model for network packet traces. A technique includes receiving network traffic of a network and extracting features from the network traffic, the features having a function related to communications in the network. The technique includes generating tokens from the features, each of the features corresponding to a respective one of the tokens, training a machine learning model by inputting the tokens, the machine learning model being trained to output contextual embeddings for the tokens, and using the contextual embeddings to determine an anomaly in the network traffic.

Generative experiments for application deployment in 5G networks

Establishing connections between nodes based on a predetermined sequence of path knocks being performed

A computer-implemented method, according to one embodiment, includes determining whether a predetermined sequence of knocks has been performed by a requesting node to other nodes of a network along existing paths between the requesting node and the other nodes. In response to a determination that the predetermined sequence of knocks has been performed, a connection is established between the requesting node and a first of the other nodes. A computer program product, according to another embodiment, includes a computer readable storage medium having program instructions embodied therewith. The program instructions are readable and/or executable by a computer to cause the computer to perform the foregoing method. A system, according to another embodiment, includes a processor, and logic integrated with the processor, executable by the processor, or integrated with and executable by the processor. The logic is configured to perform the foregoing method.

Clipboard based search term prediction

Using a probability distribution and a search result history, a probability of selecting a specified number of relevant samples and a specified number of irrelevant samples from a set of contents is computed, each content in the set of contents comprising a content copied to a first system clipboard of a first device. Using the probability distribution, each content in the set of contents is weighted. Using the weighted set of contents, a set of predicted searches is generated. The set of predicted searches is presented for selection responsive to an indication of intent to perform a search. A selected search within the set of predicted searches is caused to be performed.

Topology-homogeneity for enriching event patterns in artificial intelligence operations

A method for determining a correlation of one or more events occurring in a plurality of nodes of a network includes accessing, by a computing device, address information associated with each of the plurality of nodes on the network. The computing device can further access one or more event IDs associated with one or more events occurring on the plurality of nodes. The computing device can further create an association the one or more events occurring on the plurality of nodes with related events occurring on others of the plurality of nodes, the association including the address information.

Generative experiments for application deployment in 5G networks

A computer implemented method determines a placement of an application being added to a network. The method includes determining a logical-physical mapping for the application. Sub-graphs in the logical-physical mapping are identified. A stored application in a catalog of applications previously used in the network is located. The stored application includes one of the sub-graphs in the logical-physical mapping. An experiment is generated, performed by a computing device running a neural network model, using the sub-graphs. The experiment includes inducing a physical node mapping for the sub-graph. A cost function associated with a placement of the application being added to the network to one or more physical nodes in the induced physical node mapping is determined.

Improving the bandwidth of classical networks using quantum networks

Embodiments are related to improving the bandwidth of classical networks using quantum networks. Sender equipment transfers quantum bits over a quantum communications network to receiver equipment, the quantum bits being used to obtain entry values in a shared dictionary. The sender equipment determines a solution for an optimization problem using the entry values, where data to be transferred over a telecommunications network is expressed by the optimization problem. The sender equipment transfers the solution over the telecommunications network to the receiver equipment, where an equivalence of the data is transferred to the receiver equipment in response to the receiver equipment using the solution, the optimization problem, and the entry values to obtain the data.

Protocol for bidirectional communication without active transmission

A first computational device with a first visual display and a second computational device with a second visual display are maintained, wherein the first computational device is configured to read information displayed on the second visual display, and wherein the second computational device is configured to read information displayed on the first visual display. Byte streams are exchanged bidirectionally between the first computational device and the second computational device via the information displayed on the first visual display and the information displayed on the second visual display, wherein active radio transmission between the first computational device and the second computational device is avoided.

Dynamic massive MIMO end device pairing based on predicted and real time connection state

A computer-implemented method for grouping devices in a massive multiple-input and multiple-output (MIMO)-based cellular network, in accordance with one embodiment, includes determining movement states of end devices in a cell of the massive MIMO-based cellular network, estimating payload requirements of the end devices, and grouping the end devices in a group based on the determined movement states and the estimated payload requirements.

Using quantum networks to distribute configurations in a distributed system

A computer-implemented method, according to one approach, includes receiving at least one set of qubits at a first client component, and using the at least one set of qubits to index a configuration dictionary to determine a first configuration. The configuration dictionary defines a plurality of different configurations. The method further includes causing the first client component to be configured according to the first configuration. A computer program product, according to another approach, includes a computer readable storage medium having program instructions embodied therewith. The program instructions are readable and/or executable by a first client component to cause the first client component to perform the foregoing method. A system, according to another approach, includes a processor, and logic integrated with the processor, executable by the processor, or integrated with and executable by the processor. The logic is configured to perform the foregoing method.