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.
We describe the main architecture and the design principles of the service/resource discovery system (SRDS), a component of the XtreemOS operating system. XtreemOS is a Linux extension that enables management and exploitation as single platform of computational resources provided by federated virtual organizations. The SRDS provides scalable and fault-tolerant directory services supporting many of...
P2P systems can be used to form a low latency decentralized data delivery system. Structured P2P systems provide both low latency and excellent load balance with uniform query and data distributions, however, in the real application environment, requests distributions are often skewed and follow a Zipf law, some objects will become hotspots, individual nodes are easily overloaded, resulting in poor...
This paper presents an algorithm to perform the broadcasting of a packet to all the peers that are located into a convex region (Area of Interest) in a Voronoi based peer-to-peer network. The proposed algorithm is an advanced version of the compass routing algorithm, and it is able to guarantee the delivery of 100% of the packets, while minimizing the total number of packets that travel the network...
We analyze routing mechanisms of a self-organizing semantic overlay for content-based search in multimedia data. This overlay operates over any existing P2P network based on the metric space approach. In particular, we replace the previous design of routing mechanisms in metric semantic overlay (MSO) with a new adaptive query-routing algorithm. An advantage of it lies in an automatic tuning of confusability...
The increasing number of Web Services provided by several service providers demands for effective, scalable and accurate mechanisms to search and select the most appropriate service, fulfilling some user requirements. Distributed, semantics-enabled infrastructures for service discovery could satisfy these requirements, even if the promise of dynamic selection and automated integration of Web services...
In large-scale computational or P2P grids, discovery of heterogeneous resources as a working group is crucial to achieving scalable performance. This paper presents a hierarchical cycloid overlay (HCO) architecture with resource clustering and discovery algorithms for efficient and robust resource discovery in wide-area distributed grid systems. We establish program/data locality by clustering resources...
In recent years, peer-to-peer systems have gained traction in a number of important areas including; file-sharing, VoIP and scientific research vehicles such as the grid. We argue that this merely scratches the surface of the potential of peer-to-peer systems. This paper proposes a novel peer-to-peer system, GeoIGM, well suited to the highly collaborative style of tagging and development of context-aware...
P2P communication paradigm is a successful solution to the problem of resources sharing as shown by the numerous real overlay networks present on Internet. One of the issue of P2P networks is how a resource shared by a peer can be made known to the other peers or, in other words, how to advertise a resource on the network. In this paper we propose an advertising method for PROSA, a P2P architecture...
One of the most critical operations performed in a P2P system is the lookup of a resource. The main issues to be addressed by lookup algorithms are: (1) support for flexible search criteria (e.g., wildcard or multi-keyword searches), (2) effectiveness - i.e., ability to identify all the resources that match the search criteria, (3) efficiency - i.e. low overhead, (4) robustness with respect to node...
Peer-to-Peer (P2P) systems gained popularity and are responsible for a large share of today's Internet traffic. Nevertheless, their dynamic nature and the intended lack of control through central instances make their behavior unpredictable and, therefore, it is difficult to achieve a high level of Quality-of-Service for P2P traffic. Thus, peers are themselves responsible for dealing with these issues...
P2P networks facilitate people belonging to a community to share resources of interest. However, discovering resources in a large scale P2P network poses a number of challenges. Although distributed hash table (DHT) structured P2P networks have shown enhanced scalability in routing messages, they only support key based exact matches. This paper presents DIndex, a distributed indexing component that...
Range query in Peer-to-Peer networks based on Distributed Hash Table (DHT) is still an open problem. The traditional way uses order-preserving hashing functions to create value indexes that are placed and stored on the corresponding peers to support range query. The way, however, suffers from high index maintenance costs. To avoid the issue, a scalable blind search method over DHTs - recursive partition...
A broadcast mode may augment peer-to-peer overlay networks with an efficient, scalable data replication function, but may also give rise to a virtual link layer in VPN-type solutions. We introduce a generic, simple broadcasting mechanism that operates in the prefix space of distributed hash tables without signaling. This paper concentrates on the performance analysis of the prefix flooding scheme...
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...
In this paper, we present a novel file searching protocol to structure a DHT ring consisting of only ultrapeers, not all the nodes. The DHT ring in this protocol is much less sensitive to the churn rate because ultrapeers have much longer uptime compared with leaf nodes. Thus, this feature makes the protocol more scalable and efficient than the previous DHT ones in terms of costs of file search, node...
The peer-to-peer (P2P) systems have many applications due to their virtues: high scalability and low cost. The systems using super-peers (SPs), which deal with all queries, instead of ordinary-peers (OPs), run more efficiently. So how to choose SPs from all peers is a key, but also a difficult problem because of the systems' heterogeneity and dynamic. In this paper a novel mechanism for the selection...
Looking at the evolution of the Internet in recent years one can observe that massive multiuser virtual environments(MMVEs) have grown increasingly popular. Especially the idea of a rdquo3D Webrdquo as a combination of a MMVE and todaypsilas WWW provides a lot of exciting opportunities in terms of user experience and interactivity. From an infrastructural perspective, the global provision of such...
Exploiting and deploying telecommunication services on Internet Telephony are imperative for a large market share. However, the distributed nature of peer-to-peer (P2P) network makes services implementation very difficult. In order to meet the research goals of achieving P2P telecommunication services through the union of social and computer networks, we present a society-integrated testbed architecture...
In Peer-to-Peer (P2P) systems where stored objects are small, routing dominates the cost of publishing and retrieving an object. In such systems, the issue of fairly balancing the routing load among all nodes becomes critical. In this paper we address this issue for Chord-based P2P systems. We first present an analytical model to evaluate the routing fairness of Chord based on the well accepted Jain's...
Aggregation of data values plays an important role on distributed computations, in particular over peer-to-peer and sensor networks, as it can provide a summary of some global system property and direct the actions of self-adaptive distributed algorithms. Examples include using estimates of the network size to dimension distributed hash tables or estimates of the average system load to direct load-balancing...
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.