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.
By building a P2P content distribution network (CDN), peers collaborate to distribute the content of underprovisionned Websites and to serve queries for larger audiences on behalf of the Websites. This can reveal very challenging, given the highly dynamic and autonomous participation of peers. Indeed, the P2P-CDN should adapt to increasing numbers of participants and provide robust algorithms under...
Large-scale P2P systems typically have hundreds of thousands of peers that involve frequent dynamic activities. Empirical studies have shown that participating nodes in P2P systems are not equivalent. Such heterogeneity has been taken into account in the design of P2P systems. In this paper, to achieve better scalability and improve the routing performance of REIK, we design a novel hierarchical REIK...
Resource discovery is critical to the usability and accessibility of grid computing systems. Distributed hash table (DHT) has been applied to grid systems as a distributed mechanism for providing scalable range-query and multiattribute resource discovery. Multi-DHT-based approaches depend on multiple DHT networks with each network responsible for a single attribute. Single-DHT-based approaches keep...
Distributed systems such as peer-to-peer overlays have been shown to efficiently support the processing of range queries over large numbers of participating hosts. In such systems, uneven load allocation has to be effectively tackled in order to minimize overloaded peers and optimize their performance. In this work, we detect and analyze the two basic methodologies used to achieve load-balancing:...
In service-oriented environments the service discovery mechanisms adopting a key-word based and centralised approach are not able to provide the users' requests with accurate results, nor are any longer able to scale against the increasing number of Web Services provided by service providers. Distributed, semantics-enabled infrastructures for service discovery promise to fulfill these requirements,...
In this paper, we propose a two-tiered distributed hash table (DHT) based overlay for an implementation of publish/subscribe. In this overlay, upper tier consists of stable nodes with more resources whereas lower tier contains less stable nodes with limited resources. In our design, all nodes are required to join at lower tier and nodes with better uptime and resources may dynamically migrate to upper...
Bamboo is one structured P2P overlay, that likes others (e.g. Chord, Kademlia, Pastry), organizes peers into a flat overlay network and offers distributed hash table (DHT) functionality. It is very promising for its efficient routing performance. However, one disadvantage impeding the DHT algorithm popularity is the routing information maintenance overhead; it generates considerable network traffic...
Structured peer-to-peer overlay networks provide a useful substrate for building distributed applications. They map object keys to overlay nodes and offer a primitive method to send a message to the node responsible for a key. Though they work well in homogeneous environment, there are still some challenging problems to be solved when adapting them to heterogeneous environment. This paper studies...
In this paper, we propose to extend the topology of Chord to a bidirectional graph to provide a super-peer based lookup algorithm and a scalable broadcast search support. We consider routing algorithms for a bidirectional variant of Chord network and show how the resulting structure extends the search region and provides an efficient resource lookup service at a very little additional cost.
Peer-to-Peer overlays have become a popular paradigm for building distributed systems, aiming to provide resource localization and sharing in large-scale networks. To design an overlay network, the first step is to choose an overlay topology connecting all the overlay nodes. Many proposed distributed hash table schemes for peer-to-peer network are based on some traditional calculated interconnection...
The development of peer to peer overlay networks applications has attracted an immense interest from the research community in recent years. Several challenging issues have to be resolved in order to provide accessible, efficient and scalable inter-peer communication. Achieving resilience so as to reduce the disconnection probability, is among the most demanding issues to provide a robust and omnipresent...
In this paper, we present an algorithm for an effective flooding procedure with reduced cost in a DHT based P2P network. We describe techniques of flooding and replication that exploit structural constraints to achieve low overhead and higher reliability. These techniques can help to support complex queries in mobile distributed environments with better performance.
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...
Topological worms, such as those that propagate by following links in an overlay network, have the potential to spread faster than traditional random scanning worms because they have knowledge of a subset of the overlay nodes, and choose these nodes to propagate themselves; and also because they can avoid traditional detection mechanisms. Furthermore, this worm propagation strategy is likely to become...
In recent years, peer-to-peer (P2P) networks have soared in popularity in the form of file sharing applications. With this popularity comes security implications and vulnerabilities. In this paper we introduce a secure DHT-based routing scheme that has a high resilience against common attacks in order to prevent correct message delivery in DHT-based P2P overlays and presents defenses to these attacks...
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...
P2P workflow systems meet the development trend of workflow systems. The running path optimization (the path with the minimum running time which consists of the services discovery time and the task execution time) in full-distribution(decentralized) environments has been a bottleneck restricting the performance of P2P workflow systems. Aiming at this problem, this paper proposes an innovative hybrid...
The way in which Wireless Sensor Networks (WSN) are designed requires that energy be taken as the most crucial element if WSNs are to be used in the most effective way to serve the purpose for which they have been deployed in the target region. Routing protocols are the main aids that can assist in reducing the energy consumption required by the transmission of data throughout the sensor networks...
Structured peer-to-peer (P2P) overlays typically offer either multi-hop or one-hop performance. Here we present Chameleon, which offers a variable hop performance trading hop count with bandwidth requirement. Chameleon combines opportunistic and active routing table maintenance techniques into a novel two-tier approach which allows nodes to adapt to variations in their available bandwidth. Chameleon...
Current virtual server-based load balancing schemes for DHT have been shown to be able to achieve excellent load balancing effectiveness. However, they face two important issues. They suffer from problems of incurring extremely high overheads, and inducing severe inconsistency in DHT routing state. We present two fundamental components, virtual server management and active stabilization, whose inclusion...
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.