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 characteristics of P2P networks which are open, anonymous, and loosely coupled inter-node lead to false resources, malicious evaluation, and syndicates. A related cluster based trust model for P2P networks named RCTrust is presented in this paper. Peers gather in clusters according to their interest similarity and communication history. There are two kinds of trust relationships. In RCTrust, measure...
The delay and bandwidth are the two most fundamental factors in the network. In the delay and bandwidth constrained circumstances, we present a problem of maximizing the number of nodes and then prove the problem is NP-complete. Next, we propose a comprehensive evaluation of delay and bandwidth heuristic algorithm. According to the heuristic algorithm, distributed application layer multicast algorithms...
In data-driven mesh-based P2P live streaming system, the playback buffer management affects the audiences' quality of experience (QoE) significantly. Due to the instability and heterogeneity of P2P networks, the buffer is not always ready for playback. It is not only associated with the media timestamp, but also with the data availability in its neighbors. So how to manage the buffer synchronization...
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,...
Based on the territorial continuity of IP addresses, this paper proposes an enhanced Boot-Trapping algorithm. It constructs a Patricia Tree which reflects the topology of the physical network, and collects information of the online Ultra Peers. By providing an UltraPeer physical network nearby for a LeafPeer, it can improve the proximity between the overlay network and the physical network, the aggregation...
P2P communities are online communities of entities which offer services to each other without a central administration. Community members that need a specific service have to choose the transaction partner which they believe that will provide them with a required service of the expected quality, thus, they need mechanisms to support trust decisions regarding who they will transact with. P2P reputation...
The topological properties of peer-to-peer overlay networks are critical factors that dominate the performance of these systems. Several nonconstant and constant degree interconnection networks have been used as topologies of many peer-to-peer networks. The Kautz digraph is one of these topologies that have many desirable properties. Unlike interconnection networks, peer-to-peer networks need a topology...
In a P2P-based media distribution network (PMDN), content migration is one of the key problems that affect the overall performance of a system. In the system hierarchy, the content migration problem consists of two levels of migration: provider-level migration and user-level migration. In this paper, we focus on the former, provider-level migration, where the goal is to reduce data migration cost...
Streaming services have been gaining much popularity in the Internet. The widespread adoption of broadband residential access enables individual users to use new bandwidth demanding services. Peer-to-Peer (P2P) multicasting approach using an overlay network to provide communication between peers is a valuable proposal for streaming since it provides rapid deployment at relatively low cost. Most of...
Peer to peer based live multimedia streaming systems over the Internet have been gaining popularity these days because they can be easily deployed without router based IP multicast capabilities. However, the peers frequently join and leave the system so that some peers may experience service disruptions, which degrade the overall quality and reputation of the services. In this situation, a hybrid...
In this paper we focus on building low latency resource location service over unstructured Peer-to-Peer (P2P) networks. In state-of-the-art search approaches in unstructured P2P systems ,they often evaluate efficiency by overlay hops, while two nodes logically adjacent maybe physically far away and from user's QoS, clients always want to acquire as many as objects in a short time, so we propose an...
The distributed optimal path planning (D-OPP) problem has been a bottleneck restricting the performance of Peer-to-Peer (P2P) workflow systems which have met the development trend of workflow systems and been one of the most important domains of Distributed computing. The essence of this problem is to solve the dynamical global optimization in local views without centralized mechanism. Aiming at this...
Improving latency is the key to a successful online game-playing experience. With the use of multiple servers along with a well-provisioned network it is possible to reduce the latency. Given a network of servers, game clients, and a desired delay bound, we have designed algorithms to determine the subnetwork of servers whose cardinality is minimal. We have considered the cases wherein the subnetwork...
Search in peer-to-peer networks is a challenging problem due to the absence of any centralized control & the limited information available at each node. When information is available about the overall structure of the network, use of this information can significantly improve the efficiency of decentralized search algorithms. Many peer-to-peer networks have been shown to exhibit power-law degree...
The traditional client-server architecture widely adopted on the Internet is not adequate to meet the increasing user loads and bandwidth demands in live streaming systems especially for multimedia content delivery. Peer-to-peer P2P) overlay networks provide excellent system scalability and high resource utilization, which make it an attractive solution to this problem. This paper considers a hybrid...
P2P e-commerce systems are commonly perceived as an environment offering both opportunities and threats. The existence of malicious peers could damage the correctness and availability of them. One way to minimize such threats is to use trust model to evaluate the trustworthiness of peers. This paper presents a dynamic self-adaptive trust model for p2p e-commerce system - AdaptTrust model, which involves...
Load balancing is a key component of P2P network. In this paper, we present a new load balancing scheme for Chord system, called dynamic group-based duplications scheme (DGDS). Firstly, we divide Chord ring into several continuous groups, in which light-loaded peers share the load of overloaded peers. Secondly, DGDS computes out how many duplications are required to lighten the load of overloaded...
Peer-to-peer systems are highly dynamic systems, with permanent changes in their configurations, as peers may join and leave the system with no restriction or control. This makes monitoring an important element for several applications, especially for fault management: fault detection and fault recovery. As the system may have a large number of nodes, we need a scalable algorithm, able to guarantee...
The tremendous growth of research in Peer-to-Peer (P2P) systems in recent years has initiated rising interests on how to design resilient networks for these systems. In this paper, we propose a novel query routing mechanism for improving query performance and a mobile agent based dynamic network reconfiguration mechanism for providing combined node and link failure diagnosis and restoration in unstructured...
Peer to Peer (P2P) networks are the important part of the next cohort of Internet. But in Peer networks, achieving required efficiency for any application is difficult. This is because efficiency of application evidently depends on the effective communication. For any communication process in peer network very large number of message passes needed because the message may go through a node multiple...
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.