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.
This paper presents our approach to use social network information in P2P networks in order to efficiently retrieve relevant information by exploiting existing trust relations of the social network links. The novelty of our work is to demonstrate that only a subset of the whole social network is adequate to build an efficient and reliable service. We use our P2P network, which is an adaptation of...
Using peer-to-peer overlays to notify users whenever a new update occurs is a promising approach to support Web based publish subscribe systems like really simple syndication (RSS). Such a peer-to-peer approach can scale well by reducing load at the source and also guarantee timeliness of notifications. Several such overlay based approaches have been proposed in recent years. However, malicious peers...
Online Social Networks like Facebook, MySpace, Xing, etc. have become extremely popular. Yet they have some limitations that we want to overcome for a next generation of social networks: privacy concerns and requirements of Internet connectivity, both of which are due to web-based applications on a central site whose owner has access to all data. To overcome these limitations, we envision a paradigm...
Peer-to-peer index structures distributed and managed over the planet, commonly known as structured overlays (e.g., distributed hash tables), are posed to play the role of a fundamental building block for internet-scale distributed applications and information systems. One of the biggest impediment in realizing index distributed at intra-planetary scales is to be able to merge distinct indices that...
In this paper, we propose and prove correct a distributed stabilizing implementation of an overlay, called DR-tree, optimized for efficient selective dissemination of information. DR-tree copes with nodes dynamicity (frequent joins and leaves) and memory and counter program corruptions, that is, the processes can connect/disconnect at any time, and their memories and programs can be corrupted. The...
We propose a new genre of overlay network for disseminating information from popular but resource constrained sources. We call this communication primitive as latency gradated overlay, where information consumers self- organize themselves according to their individual resource constraints and the latency they are willing to tolerate in receiving the information from the source. Such a communication...
Query-load (forwarding and answering) balancing in structured overlays is one of the most critical and least studied problems. It has been assumed that caching heuristics can take care of it. We expose that caching, while necessary, is not in itself sufficient. We then provide simple and effective load-aware variants of the standard greedy routing used in overlays, exploiting routing redundancy originally...
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.