The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In recent times, the study of complex network systems, for example communication networks such as the Internet, Smart Grids or Social Networks, have received significant attention. While newly emerging data sets in these domains now allow for a broad quantitative exploration and empirical validation of theoretical models towards a better understanding of complex networks, the enormous size of complex...
Counting network motifs has an important role in studying a wide range of complex networks. However, when the network size is large, as in the case of Internet Topology and WWW graphs counting the number of motifs becomes prohibitive. Devising efficient motif counting algorithms thus becomes an important goal. In this paper, we present efficient counting algorithms for 4-nodemotifs. We show how to...
The resource distribution in P2P network has an obvious scale free character. Using this inherent character to design resource search strategy is great significant for improving searching efficiency and reducing the costs. We analyze the scale free distribution character in P2P network, and propose a reliable random walk search algorithm to achieve high and reliable search efficiency through forwarding...
Resources search has become a hot research issue in peer-to-peer (P2P) systems. In most unstructured P2P systems with flooding mechanism, with exponential growth of the number of messages, serious network congestion and waste of bandwidth result in low efficiency of resources search. In this paper, we propose an unstructured P2P resources search algorithm based on small-world model, in which peers...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.