It appeared recently that user interests in a P2P system possess clustering properties that may be used to reduce significantly the amount of traffic of flooding-based search strategies. It was also observed that they possess scale-free properties that may be used for the design of efficient routing-based search strategies. In this paper, we show that the combination of these two properties make it possible to design an efficient and simple fully decentralized search strategy. Further, simulations processed on real-world traces show that other unidentified properties hidden in actual queries make our protocol even more efficient, performing searches in logarithmic expected number of steps.
- Community detection in attributed graphs.Christine Largeron2017, April 25, Room 24-25/405
- affinity index algorithm analysis antipaedo attack bipartite blog network blogs capitalisme social Cascade centrality clustering communities community detection community structure complex network complex networks complex systems compression connected graphs data mining debian degree distribution degree peeling diameter diffusion diffusion phenomena distributed measurements DynamicNetworks dynamics edge-Markovian evolving graph eDonkey ego-centered ego-centered communities email epidemiology event detection evolving graphs evolving networks exploration failure fixed points formal concepts gossip graph graph algorithm graph decompositions Graphs hierarchical clustering honeypot influence influence ranking interaction networks internal links internet Internet topology intrinsic time IP-level ip exchanges lattice leaders link prediction long term communities markovian model measurement mesure d’influence metrics Metrology mobile networks Modelling modularity multi-ego-centered communities multi-scale multipartite graph network dynamics node proximity node similarity opinion dynamics outliers p2p P2P dynamics P2P networks parametric paris paris-traceroute path-vector routing pedophile activity phone power-law radar random graph random walks reachability robustness routing routing tables scale-free security simulation simulations sir social networks spreading spreading cascades stability statistical analysis stochastic process three-state cellular automata time-varying Topology traceroute triangles twitter UDP user profiles viral marketing visualization web wifi