Telefonaktiebolaget Lm Ericsson (publ)

Subramanian Shivashankar

Manoj Prasanna Kumar

Karthikeyan Premkumar

Jawad Mohamed Zahoor

Vincent Huang

Mona Matti

Rickard Cöster

Balaraman Ravindran

Brindha Padmanaabhan

Tony Larsson

Ankur Dauneria

Saket Gurukar

Sayan Ranu

Senthamiz Selvi Arumugam

Saradindu Kar

Vishnu Sankar

The invention is directed towards a database access coordination arrangement () in a federated database system () comprising applications (Ai, A, A) that access databases (-) under the control of a number of query handlers (-), the database access coordinating arrangement providing a group of traffic distribution units (-), each having connections to corresponding query handlers, and a traffic control unit (TCU), which traffic control unit selects traffic distribution unit for a query (Qi) from an application (Ai) based on at least one connectivity map of the connections existing between traffic distribution units, query handlers and databases and connectivity states of connections between traffic distribution units and query handlers, and schedules the query to the selected traffic distribution unit for accessing a database.

Control of a distributed data grid layer in a federated database system

The present disclosure relates to a method performed by a network node () in a communication network () comprising a plurality of communication devices (), for finding temporally connected connection patterns of the communication devices in the network. The method comprises identifying signalling between the communication devices during a predefined time duration to form a main communication graph in which the plurality of communication devices are nodes. The method also comprises partitioning the main communication graph for a time period comprised in said time duration to capture temporally connected signalling between some of the communication devices as illustrated in the main communication graph in a partitioned communication graph. The method also comprises forming at least one subgraph from the partitioned communication graph, comprising m nodes corresponding to m communication devices of said some of the communication devices. The method also comprises constructing a binary vector of the subgraph over the time period divided into a plurality of sampling periods corresponding to components in the vector such that, for each component in the vector, the component value is set to '1' if, in accordance with the subgraph, signalling occurs between at least two of the m communication devices during the sampling period corresponding to the element, and the component value is otherwise set to '0'. The method also comprises testing whether the signalling between the different m communication devices used for constructing the binary vector is temporally connected by checking that the number of consecutive '0' element(s), if any, between any two &#x201c;1&#x201d; elements is less than a predefined &#x394;T.

Analysis of connection patterns in a communication network

Query handling devices in a federated database system and related methods and computer program products for handling queries in the federated database system are disclosed. The query handling device receives database queries directed towards a group of databases from several applications and filters the queries based on common query rules such as common query syntax, investigates the queries that have passed the filtering, and sends the investigated queries to the databases. The investigation includes prioritising between at least some queries according to a query prioritisation scheme. The prioritised queries are sent according to the query prioritisation scheme.

Federated database system

A query handling arrangement is disclosed for a federated database system. The database system includes data storing applications configured to store data in corresponding databases. The query handling arrangement includes a query handling device that receives a database query from a query generating application concerning the obtaining of data from the databases, obtains usage profiles regarding allowed use of the data in the databases provided by a usage profile announcing device, investigates the usage profiles, obtains data from the databases according to the obtained usage profiles, and responds to the query with the obtained data.

Exposing data to query generating applications using usage profiles

A stream processing handling arrangement provides a number of data handling blocks, selectable for forming a work flow. The blocks comprise data processing blocks. The arrangement receives selections of data handling blocks, block parameter settings and workflow property objectives, and compares the objectives with corresponding stream processing framework capabilities. The arrangement determines a stream processing framework for the work flow, provides a number software module groups, each corresponding to a different framework and comprising software modules corresponding to the data handling blocks, and chooses a group corresponding to the determined stream processing framework. The arrangement selects, in this group, software modules corresponding to the selected blocks and constructs an application using the selected software modules.

Simplified creation of an application in a selected stream processing platform

The present invention relates to methods and devices for pre-buffering one or more content data items to be rendered at a mobile terminal. In a first aspect of the present invention, a mobile terminal () comprises a processing unit () arranged to acquire a probability with which at least one selected content data item of the one or more content data items is to be rendered at the mobile terminal, and to acquire an estimated point in time when the at least one selected content data item is to be rendered at the mobile terminal. Further, the processing unit is arranged to pre-buffer a first selected part of the at least one selected content data item in the mobile terminal such that the first selected part of the at least one selected content data item is ready for rendering at the estimated point in time, the extent of the pre-buffered first selected part being related to the probability with which the at least one selected content data item is to be rendered at the mobile terminal.

Pre-buffering of content data items to be rendered at a mobile terminal

The formulation of meta-correlation method as a graph based problem is disclosed. The meta-correlation method utilizes one or more correlation techniques, and also captures latent factors critical for the business utility in hand is described. The method also leverages a small example set to bootstrap for the target utility case. The proposed method can easily work for attribute groups of any size, not just attribute groups consisting of pairs of attributes.

Systems and methods for multi-variate attribute correlation

The present disclosure relates to a method performed by a network node configured for making automatic predictions in a telecommunication network. The method comprises obtaining a first value of a first key performance indicator (KPI) for a first network entity (NE) in the telecommunication network. The method also comprises obtaining a second value of a second KPI for a communication route between said first NE and a second NE. The method also comprises predicting, automatically and based on the obtained first and second values, that an alarm will be triggered at the second NE.

Alarm prediction in a telecommunication network

A method for propagating user preference information in a communications network, in which the user preference information may be available for a subset of users within the network. The method comprises generating individual user attribute vectors, based on user historical data and estimating user preference information. The method further comprises defining a community structure for the network and generating a stacked representation for users, the representation comprising the user attribute vector augmented with an aggregated vector of estimated user preferences of members of the user's community. The method further comprises learning a function relating the stacked representation to user preference, using the subset of users, and applying the learned function to users outside the subset.

Method and apparatus for propagating user preference information in a communications network

Methods and apparatuses are disclosed that determine network parameters to be used by a wireless terminal. Network traffic history data is acquired. Each entry of the network traffic history data relates to network parameters of traffic flows between a network node and a wireless terminal. Which number of clusters to be used for representing the network traffic history data is determined by optimizing a generic utility function representing at least one network parameter of said network parameters of traffic flows. Each entry of the acquired network traffic history data is associated with one of the number of clusters by constrained clustering of the acquired network traffic history data. The constrained clustering uses a biased distance measure. Each cluster is associated with network parameters to be used by a wireless terminal based on the network traffic history data associated with each cluster.

Determination of network parameters in mobile communication networks

A method for detecting communities in a network comprises the steps of defining an internal scoring function (IS) for a community, wherein the internal scoring function quantifies an internal quality of the community, and defining an external scoring function (ES) for a community, wherein the external scoring function quantifies an external quality of the community. A community scoring function (IE) for a community is determined, wherein the community scoring function comprises a product of the internal scoring function and the external scoring function. A network scoring function is determined, wherein the network scoring function is based on the community scoring functions of communities in the network. The network scoring function is used by a maximization algorithm, for example a greedy maximization algorithm, for detecting a community in a network.

Method and apparatus for detecting communities in a network

Embodiments of the invention disclose a method, identifier and a computer program product for identifying influential users among a group of users associated with a communication network. The disclosed method includes selecting two or more ranking models from a plurality of ranking models such that each ranking model provides scores to the users in the group based on a usage data of the users, calculating a weighing factor for each of the selected ranking models, generating an aggregate score for each user using the weighing factor and the score provided by each one of the selected model such that based on the aggregate score, the influential users among the group of users are identified.

Growing community of inventors

Chennai, India

Subramanian Shivashankar