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.
Most networks will evolve with time instead of keeping unchanged in reality. Therefore, we proposed the incremental label propagation (ILP) algorithm to detect community structures in complex networks in realtime. ILP algorithm will only take the local changed vertexes into consideration. The computation time is greatly decreased, while vertex (edge) is changed. The algorithm will definitely converge...
With emerging Internet-scale open content and resource sharing, social networks, and complex cyber-physical systems, trust issues become prominent. In this paper, we propose a trust vector based scheme (VectorTrust) for aggregation of distributed trust scores. Leveraging a Bellman-Ford based algorithm for fast trust score aggregation, VectorTrust features localized and distributed concurrent communication...
We propose a new mechanism for generating networks with a wide variety of degree distributions. The idea is a modification of the well-studied preferential attachment scheme in which the degree of each node is used to determine its evolving connectivity. Modifications to this base protocol to include features other than connectivity have been considered in building the network. However, schemes based...
The efficiency of traffic routing on complex networks can be reflected by the network capacity. In this paper, a new routing strategy is proposed based local dynamic information for enhancing the efficiency of traffic on scale-free networks. The strategy is governed by a single parameter. Simulation results show that maximizing the network capacity can generate an optimal parameter value. The detailed...
In peer to peer networks, the overlay topology connecting peers is an important component in addition to peer and data organization and search. In fact, topological characteristics have an important impact on the efficiency of search on such networks. In this paper, we address this issue for Chord based P2P systems. Based on the Barabasi Albert (BA) model, we propose to extend the topology of Chord...
In this paper we study the video streaming bandwidth of peer-to-peer streaming networks where the underlying topology is a complex network. We focus on the maximal streaming rate and how it depends on the type of network. We consider networks such as small world networks, scale free networks, locally connected networks and random networks. The experimental results indicate that a more connected graph...
Delay Tolerant Networks (DTN) are networks of self-organizing wireless nodes, where end-to-end connectivity is intermittent. In these networks, forwarding decisions are made using locally collected knowledge about node behavior (e.g., past contacts between nodes) to predict which nodes are likely to deliver a content or bring it closer to the destination. One promising way of predicting future contact...
Searching in complex networks is different from random and regular networks for existing long range connections and hub nodes. So the research on structure and characters of networks will improve the search speed and lower the load of nodes. Though getting the shortest paths is the best choice, in a real network, it is impossible for a node to get global information. For example, there is not a node...
Massive Multiuser Virtual Environments have recently grown popular, and commercial virtual online worlds like Second Life or World of Warcraft attract a lot of attention. In this context, for the research on distributed systems, especially the idea of a 3D Web as a global scale virtual environment is very interesting, since it poses severe technical challenges to the underlying infrastructure. It...
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...
Current information networks acting as the fundamental infrastructure of our society, possess the economic-social characteristics, so, in formulating new definitions and computational models for the networked environment, it is imperative to take economic and incentive considerations into account. The paperpsilas contribution is twofold: first, to characterize the economic implication of some proposed...
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.