Improving ICE Service Selection in a P2P System using the Gradient Topology

GS

A Robust Algorithm for the Membership Management of Super-peer Overlay

Abstract. Peer-to-Peer technologies have been widely applied for multimedia applications. The super-peer based approach provides an efficient way to run applications by exploring nodes' heterogeneity. In P2P live video streaming, even though the number of stable nodes is small, they have significant impact on the performance of the network. Thus, we present a super-peer-based overlay design, where stable nodes are assigned as super-peers that organize client nodes. A gossip-based super-peer selection algorithm (GSPS) is proposed to identify the stable nodes to be chosen as super-peers and to manage the client nodes (namely the membership management). The basic idea of the GSPS is: first, a set of super-peer candidates for a node is built based on the gossip, then the role of this node is identified and the corresponding operations are executed. Simulation results show that the GSPS is efficient in managing the super-peer overlay and robust to the failure of super-peers. Keywords: Peer-to-Peer, super-peer, gossip, robustness. Introduction The peer-to-peer (P2P) paradigm provides an effective approach to construct largescale systems with high robustness, mainly due to their inherent decentralization and redundant structures In these research studies, Random walk and Graph theory are utilized for the construction of the overlay. For the management of the overlay, the diameter, and the degree are two important qualities to consider. The super-peer-based overlay (such as Gnutell

Probabilistic Proximity-aware Resource Location in Peer-to-Peer Networks Using Resource Replication

Nowadays, content distribution has received remarkable attention in distributed computing researches and its applications typically allow personal computers, called peers, to cooperate with each other in order to accomplish distributed operations such as query search and acquiring digital contents. In a very large network, it is impossible to perform a query request by visiting all peers. There are some works that try to find the location of resources probabilistically (i.e. non-deterministically). They all have used inefficient protocols for finding the probable location of peers who manage the resources. This paper presents a more efficient protocol that is proximity-aware in the sense that it is able to cache and replicate the popular queries proportional to distance latency. The protocol dictates that the farther the resources are located from the origin of a query, the more should be the probability of their replication in the caches of intermediate peers. We have validated the proposed distributed caching scheme by running it on a simulated peer-to-peer network using the well-known Gnutella system parameters. The simulation results show that the proximity-aware distributed caching can improve the efficiency of peer-to-peer resource location services in terms of the probability of finding objects, overall miss rate of the system, fraction of involved peers in the search process, and the amount of system load

Defining Routing Policies in Peer-to-Peer Overlay Networks

This master’s thesis involves the definition and development of a policy-based routing scheme for peer-to-peer overlay networks. Many peer-to-peer networks are in existence today and each has various methods for discovering new peers, searching for content, and overcoming connectivity problems. The addition of efficient policy-based routing enhances the ability of peers within overlay networks to make appropriate routing decisions. Policy-based routing provides a means for peers to define the types of network traffic they are willing to route and the conditions under which they will route it. The motivations for these policies are many and are described in upcoming sections. In order to express and enforce policies, a simple policy definition language was developed. This language is sufficient for owners of overlay nodes to choose to route traffic based on their own requirements and gives node owners a means to express these requirements, such that other nodes within the overlay network can learn them. A mechanism is presented that allows these policies to be stored either in a distributed hash table or on a set of directory servers. The effectiveness of policy-based routing was tested using a simulated network. The affect of these routing policies, in terms of both additional network traffic and requirements for client software, was also assessed. Finally, a comparison was made between storing policy information in a distributed hash table, versus on a set of directory servers

A lightweight distributed super peer election algorithm for unstructured dynamic P2P systems

Dissertação apresentada na Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para obtenção do grau de Mestre em Engenharia Electrotécnica e de ComputadoresNowadays with the current growth of information exchange, and the increasing mobility of devices, it becomes essential to use technology to monitor this development. For that P2P networks are used, the exchange of information between agencies is facilitated, these now being applied in mobile networks, including MANETs, where they have special features such as the fact that they are semi-centralized, where it takes peers more ability to make a greater role in the network. But those peer with more capacity, which are used in the optimization of various parameters of these systems, such as optimization\to research, are difficult to identify due to the fact that the network does not have a fixed topology, be constantly changing, (we like to go online and offline, to change position, etc.) and not to allow the exchange of large messages. To this end, this thesis proposes a distributed election algorithm of us greater capacity among several possible goals, enhance research in the network. This includes distinguishing characteristics, such as election without global knowledge network, minimal exchange of messages, distributed decision made without dependence on us and the possibility of influencing the election outcome as the special needs of the network