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.
P2P is an essential technology to solve the gap between server's capability and growing demand of client. In P2P system, there is a natural imbalance. Thus, Load balance is one of the main research directions. Better balance performance would lead to higher bandwidth, higher resource utilization, and better network stability. Churn is a normal phenomenon in P2P network, which often brings some awful...
Delay Tolerant Networks (DTNs) are sparse mobile ad-hoc networks in which there is typically no complete path between the source and destination. Although many routing algorithms for DTNs have been proposed, prior works generally focus on optimizing delivery ratio and cost by finding the relay node with the highest delivery probability to the destination. In social networks, the connections among...
Based on the analysis of cascading behaviors for inter-domain routing system, a cascading failure model for inter-domain routing system is proposed. Model introduced a new metric named IRS between ness to define node's initial load. To simulate the fact of system, node's restart delay and BGP update lifetime are introduced. Finally, experiments are carried out on the basis of data collected publicly...
This paper investigates the best way for representing wireless sensor networks using various topologies of ZigBee. The use of coordination with such networks was investigated together with coordinator load. The investigation has been achieved via the use of different scenarios in the OPNET Modeler simulator. The simulation study investigates the use of coordination with star routing, mesh routing...
A branch of green networking research is consolidating. It aims at routing traffic with the goal of reducing the network energy consumption. It is usually referred to as Energy-Aware Routing. Previous works in this branch only focused on pure IP networks, e.g., assuming an Open Shortest Path First (OSPF) control plane, and best effort packet forwarding on the data plane. In this work, we consider...
An important problem that confronts P2P network is to efficiently search the node that stores a particular data. Chord is a distributed lookup protocol that addresses the problem. However, the chord protocol has not yet efficiently resolved the problem. In this paper an improved Chord algorithm is presented, which considers the node's actual ability, the physical location relationship, the routing...
The peer-to-peer (P2P) communication model has gained an enormous research interest in the last few years due to its promising properties (e.g., decentralization, self-organization, scalability, etc.) to build large scale distributed applications. However, the P2P systems are characterized by their dynamic behavior as peers can frequently join and leave the network. This property makes the data availability...
Many proposals have been advanced for structured P2P networks, but it is difficult for existing structured P2P networks to achieve dynamic load balancing sufficient. In this paper, we propose a new structured P2P network called Waon, which achieves dynamic load balancing among nodes. Each node in a Waon network controls the number of objects assigned to the node for load balancing of objects. In addition,...
Content-based publish/subscribe allows for highly expressive descriptions of subscriptions and thus is more appropriate for content dissemination when a finer level of granularity is necessary. However, scalability has become an issue due to the expensive matching and delivering inherent in content-based events. In this paper we propose a novel content-based publish/subscribe framework built over...
In this paper, we introduce a generic model to deal with the event matching problem of content-based publish/subscribe systems over structured P2P overlays. In this model, we claim that there are three methods (event-oriented, subscription-oriented and hybrid) to make all the matched pairs (event, subscription) meet in a system. By theoretically analyzing the inherent problem of both event-oriented...
In structured peer-to-peer (p2p) systems, distributed hash tables (DHTs) often partition the ID space into disjoint intervals with each interval assigned to the corresponding node. While nodes join and leave dynamically, one of the hard challenges posed by DHTs is load balancing across the ID space. Tries are known to be a viable data structure such that a balanced trie implies balanced intervals...
This paper presents several mechanisms for balancing the node degrees in de Bruijn-based overlay networks for peer-to-peer systems. One of these mechanisms is shown to perform almost as well as an ideal centralized mechanism, but it is based on the size of the key-spaces assigned to the nodes, and thus it may interfere with protocols aiming at balancing the load of the nodes. We therefore present...
There are many existed collaborative frameworks, e.g. Narada, Overcast, Can, which are used in various computer supported work. In this paper we deliver a collaborative application framework based on a specific P2P grid model. This framework is designed to solve the typical problems in the traditional collaborative applications, such as the bottleneck restriction of C/S architecture and the related...
The use of peer-to-peer (P2P) applications is growing Dramatically. To finish transactions successfully, rust mechanism plays an important role, which not only compact the communication traffic but also the data discovery. In this paper we address the problem of trust discovery mechanism in structured P2P network we proposed before. The main contribution of this paper is address the Zipf's law to...
Broadcast is a basic service for many network operations. It had been proposed to maintain a broadcast tree over a P2P network explicitly to support message broadcast from the root to leaves and information aggregation from leaves to the root reversely. We notice that a peer near the root of a broadcast tree has shorter message latency and a smaller possibility of message loss due to join or departure...
Structured peer-to-peer (P2P) networks are increasingly important in the design of distributed systems. However, due to their strict data placement rules, they are often prone to three main load imbalances: range, data, and execution skew. Today, many load balancing algorithms focus on range skew and assume the network data rate to be the bottleneck. In applications that focus on distributed request...
DHT-based P2P networks such as Chord, CAN, Pastry, etc can achieve exact query with characteristic of scalability, efficiency and fault-tolerate. However, in the case of complex queries such as range query or multiple-attribute query, pure DHT is not efficient since a lot of query messages must be sent. In this paper we focus our intentions on multiple-attribute query on DHT-based P2P network systems...
We present the effects of different churn models on the performance of structured peer-to-peer (P2P) networks in this paper. Specifically, Exponential distribution (ED), Pareto distribution (PD), and Weibull distribution (WD) are evaluated to provide a comparative analysis. Kademlia-based Peer-to-Peer Protocol (P2PP) is utilized as the underlying signaling protocol. Through simulations, we conclude...
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...
We consider a content sharing network of non-cooperative peers. The strategy set of each peer comprises, (i) client strategies, namely feasible request load splits to servers, and (ii) server strategies, namely scheduling disciplines on requests. First, we consider the request load splitting game for given server strategies such as First-In-First-Out or given absolute priority policies. A peer splits...
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.