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.
The resource locating efficiency is the core issue of P2P systems. The unstructured P2P systems adopt the flooding mechanism, which causes huge network burden. The Structured P2P systems, however, employs routing based on DHT, which results in an expensive topology maintenance. This paper will propose a semi-construct P2P model. Based on the research of the small world theory, this model combines...
A critical problem in a distributed system is the load of each of its individual components, which, if too large, threatens the availability of the whole system. A solution for system availability is decentralizing its components by using peer-to-peer networks. For such networks, we define in this work a scalable, transparent strategy for locally balancing the load of the individual peers, based on...
Many load balancing strategies have been proposed for distributed hash tables, like Pastry. These strategies assume that hash functions spread even skewed key distributions almost evenly over the ID space. They neglect the problem that many applications produce data with common keys (multi-sets) that entail hash collisions and therewith load imbalance concerning query and storage load. A second drawback...
An unweighted graph has density rho and growth rate k if the number of nodes in every ball with radius r is bounded by rhork. The communication graphs of wireless networks and peer-to-peer networks often have constant bounded density and small growth rate. In this paper, we study the trade-off between two quality measures for routing in growth-restricted graphs. The two measures we consider are the...
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.