The filter-placement problem and its application to minimizing information multiplicity

Abstract

In many information networks, data items -such as updates in social networks, news flowing through interconnected RSS feeds and blogs, measurements in sensor networks, route updates in ad-hoc networks -propagate in an uncoordinated manner: nodes often relay information they receive to neighbors, independent of whether or not these neighbors received the same information from other sources. This uncoordinated data dissemination may result in significant, yet unnecessary communication and processing overheads, ultimately reducing the utility of information networks. To alleviate the negative impacts of this information multiplicity phenomenon, we propose that a subset of nodes (selected at key positions in the network) carry out additional information filtering functionality. Thus, nodes are responsible for the removal (or significant reduction) of the redundant data items relayed through them. We refer to such nodes as filters. We formally define the Filter Placement problem as a combinatorial optimization problem, and study its computational complexity for different types of graphs. We also present polynomial-time approximation algorithms and scalable heuristics for the problem. Our experimental results, which we obtained through extensive simulations on synthetic and real-world information flow networks, suggest that in many settings a relatively small number of filters is fairly effective in removing a large fraction of redundant information.

Combinatorial trace method for network immunization

“…Non-monotonic strategies are given in [10]. Some other problems related to graph immunization include the influence maximization [21], the filter placement [11] and the critical node detection problem (CNDP) [5,20,35]. In the influence maximization problem, the goal is to find a subset of nodes whose activation will lead to the maximal spread of information across the graph.…”

Minimize Social Network Rumors Based on Rumor Path Tree

“…We perform a Depth-First Search (DFS) algorithm by ζ steps based on the period of rumor propagation, and form the nodes involved in the algorithm into a set S. Based on S, we perform an Acyclic algorithm [23] on it to find the Directed Acyclic Graph (DAG). It is also for us to build the RP T structure in the next step.…”

Spectral Methods for Immunization of Large Networks

“…Graph vulnerability is defined as measure of how much a graph is likely to be affected by a virus attack. As in (Tong 2012), the largest eigenvalue is selected as a measure of graph vulnerability, in (Chen 2016) In filter placement (Erdös 2012), those nodes are identified which are cause of maximum information multiplicity. Moreover some reverse engineering techniques are also used for similar problems.…”

“…Undirected, unweighted graphs are considered and nodes are selected by an approximation scheme using the eigenvector corresponding to largest eigenvalue which cause the maximum drop. In filter placement (Erdös 2012), those nodes are identified which are cause of maximum information multiplicity. Moreover some reverse engineering techniques are also used for similar problems.…”