P2p networks

The International Journal of peer-to-peer networking is a quarterly open access peer-reviewed journal that publishes articles that contribute new results in all areas of P2P Networks. The journal provides a platform to disseminate new ideas and new research, advance theories, and propagate best practices in the area of P2P networking. This will include works that relate to peer-to-peer systems, peer-to-peer applications, grid systems, large-scale distributed systems, and overlay networks. The journal offers a forum in which academics, consultants, and practitioners in a variety of fields can exchange ideas to further research and improve practices in all areas of P2P.

The International Journal of peer-to-peer networking is a quarterly open access peer-reviewed journal that publishes articles that contribute new results in all areas of P2P Networks. The journal provides a platform to disseminate new ideas and new research, advance theories, and propagate best practices in the area of P2P networking. This will include works that relate to peer-to-peer systems, peer-to-peer applications, grid systems, large-scale distributed systems, and overlay networks. The journal offers a forum in which academics, consultants, and practitioners in a variety of fields can exchange ideas to further research and improve practices in all areas of P2P.

NAT has been design to work with Internet client-server structure. The emerged of Peer-to-Peer (P2P) networks and applications revealed the incompatibility between P2P applications and NAT. Many methods has been developed and implemented to solve connectivity between peers behind NAT devices. Nevertheless, various NATing types can't communicate with one another. In this work, we are going to study the impact of NAT types on the start-up delay time of peers in P2P streaming systems. We will demonstrate the ability of NATing to expel peers in P2P live streaming systems. A new neighbour selecting algorithm will be proposed. This algorithm will utilize NAT-types configurations as a parameter. We have utilized NS2 simulator to show the performance of the new algorithm in increasing the connectivity, reducing the number of expelled peers and implementing of locality.

This paper concentrates on how the era of Crypto currency works and how it may have drastic effect on Indian economy. Crypto currency is not only gaining the pace but it has also entered into the small loops of Marketing, Social Media, Gaming and Professional Business. The Block chain method followed by the Crypto currency is not very prolix but it has proved to be the next generation technology already. This paper includes the detailed technology of Crypto currency and also describes the effect of the technology on Indian society especially the middle and poor level of the mass. A crypto currency is digital asset which proves to be an exchange medium. The crypto currencies tend to be implemented using technology called block chain. This technology allows transactions that use the crypto currency to occur in decentralized and distributed manner

We are experiencing a revolution in the wireless technology and mobile phone networks as they are becoming increasingly ubiquitous. On the other hand, there is another trend, gaining extreme popularity over the traditional wired Internet: Peer-to-Peer (P2P) networking. Specifically, Distributed Hash Table (DHT) based Structured P2P overlay networks are capable to facilitate information storage and retrieval among a potentially very large number of users without the use of central server components. Providing such P2P services in mobile networks will allow a user to harness the potential of P2P services while on the move. However, due to technical issues in mobile phone networks and limited resources available on the handsets, designing such a system is a challenging issue. While the research of P2P overlays in wired networks is plenty, there is a limited study on the suitability of different existing P2P overlays for mobile networks. This article investigates the performance and efficiency of a number of structured P2P overlays that use recursive approach for routing strategy: R/Kademlia, Pastry and Bamboo and finds their suitability for use on mobile networks. The simulation result shows that among the three overlays, Bamboo exhibits a marginally better performance in comparison to the others with a 98% to 99% routing efficiency and a lower bandwidth consumption in high churn environment. Hence, Bamboo protocol is a good choice to be used over Kademlia and Pastry in mobile networks.

It is well known that content distribution networks (CDN) are expensive technologies for distributing web contents. Universities and other non-profit organizations do not have enough financial means to deploy large web-servers or to use content distribution networks to improve their web access performance. A current trend is to use hybrid distribution networks content. so this article is to show the efficiency of P2P networks possessing this approach.

Cloud computing and peer-to-peer live video streaming are important research topics of Internet multimedia services. Due to the unstable wireless data transmission and peers' joining and leaving behaviors, users often suffer long waiting time and sudden interrupted downloads, thereby affecting the willingness to watch the online videos. In this paper, a cloud-assisted P2P video streaming system is proposed for providing smooth video streaming services to mobile users. Simulation results show that the proposed cloud-assisted P2P streaming system can provide smooth video streaming services to mobile users with low-cost than traditional video streaming approaches.

Distributed Hash Tables (DHTs) have been used in several applications, but most DHTs have opted to solve lookups with multiple hops, to minimize bandwidth costs while sacrificing lookup latency. This paper presents D1HT, an original DHT which has a peer-to-peer and self-organizing architecture and maximizes lookup performance with reasonable maintenance traffic, and a Quarantine mechanism to reduce overheads caused by volatile peers. We implemented both D1HT and a prominent single-hop DHT, and we performed an extensive and highly representative DHT experimental comparison, followed by complementary analytical studies. In comparison with current single-hop DHTs, our results showed that D1HT consistently had the lowest bandwidth requirements, with typical reductions of up to one order of magnitude, and that D1HT could be used even in popular Internet applications with millions of users. In addition, we ran the first latency experiments comparing DHTs to directory servers, which revealed that D1HT can achieve latencies equivalent to or better than a directory server, and confirmed its greater scalability properties. Overall, our extensive set of results allowed us to conclude that D1HT can provide a very effective solution for a broad range of environments, from large-scale corporate datacenters to widely deployed Internet applications 1,2 .

Publish/Subscribe systems have become a prevalent model for delivering data from producers (publishers) to consumers (subscribers) distributed across wide-area networks while decoupling the publishers and the subscribers from each other. In this paper we present Meghdoot, which adapts content-based publish/subscribe systems to Distributed Hash Table based P2P networks in order to provide scalable content delivery mechanisms while maintaining the decoupling between the publishers and the subscribers. Meghdoot is designed to adapt to highly skewed data sets, which is typical of real applications. The experimental results demonstrate that Meghdoot balances the load among the peers and the design scales well with increasing number of peers, subscriptions and events.

Los sistemas P2P han adquirido en los últimos años una importancia extraordinaria entre los usuarios que comparten obras protegidas por derechos de explotación en exclusiva. El Código penal ha seguido el sentido que le marca la legislación civil, y pretende proteger los derechos de explotación en exclusiva impidiendo por todos los medios el pirateo de las obras protegidas. Con la intención de castigar a quienes se enriquecen con el negocio del pirateo, la ampliación típica de la última reforma penal sería capaz, también, de criminalizar las conductas de los sujetos usuarios P2P. La doctrina y la jurisprudencia vienen considerando que, en esos entornos comunicativos, no se da el ánimo de beneficio económico, pero esta es una perspectiva coyuntural. Ante el riesgo de que se active una criminalización de las conductas de los usuarios de redes P2P, el artículo propone algunas hipótesis para evitar su punibilidad, basadas en las características especiales de estos escenarios criminológicos. Pone la atención, para ello, en las peculiaridades que se dan en estos contextos en las relaciones de causalidad, en los objetos materiales y, sobre todo, en la adecuación social de las conductas.

Nowadays, many structured P2P algorithms have been proposed frequently. Consequently, the P2P application developers need to learn different P2P API semantics. Developers will take additional efforts if they want to replace the underlying P2P networks of their P2P applications with other ones. Moreover, it is difficult for the developers to evaluate the performance of an application based on a particular underneath P2P APIs. In this research, a novel P2P framework is proposed to assist in developing P2P applications with replaceable structured P2P protocol and P2P pub/sub algorithm. We construct structured P2P functional modules, including network communication components, P2P topology maintenance and routing, network bootstrapping, as well as pluggable pub/sub services in our system. In contrast to other P2P libraries and platforms, our framework provides a more flexible and extensible development platform for establishing P2P systems.

Currently the Peer-to-Peer computing paradigm rises as an economic solution for the large scale computation problems. However due to the dynamic nature of peers it is very difficult to use this type of systems for the computations of real time applications. Strict deadline of scientific and real time
applications require predictable performance in such applications. We propose an algorithm to identify the
group of reliable peers, from the available peers on the Internet, for the processing of real time application’s tasks. The algorithm is based on joint evaluation of peer properties like peer availability, credibility, computation time and the turnaround time of the peer with respect to the task distributor peer. Here we also define a method to calculate turnaround time (distance) on task distributor peers at application level.

To improve the resource location efficiency and guarantee resource download quality of nodes in P2P systems, we propose a node Interest bias based P2P Interest domain partition mechanism, give the concept of Interest similarity as well as its computation method, and then present an adaptive P2P topology evolvement model ISPT based on interest similarity ISPT. In ISPT, by computing interest similarity of each other, nodes with similar interest bias and service trust value are connected as neighbors. Since nodes that have similar interest are more likely to share resources, ISPT improves node resource query response efficiency, and provides an incentive mechanism to encourage node offer more contribution so as to get better service. Simulation results show that ISPT improves the efficiency and security of P2P topology effectively.

... by Jacky Mallett B.Sc.(Hons.) Computer Studies. ... Jacky Mallett Submitted to the Program in Media Arts and Sciences, School of Architecture and Planning, on August 29 2000, in partial fulfillment of the requirements for the degree of Master of Science in Media Arts and Sciences ...

Commutative Replicated Data Type (CRDT) is a convergence philosophy invented as a new generation of technique that ensures consistency maintenance of replica in collaborative editors without any difficulty over Peer-to-Peer (P2P) networks. This technique has been successfully applied to different data representation types in scalable collaborative editing for linear, tree document structure and semi-structured data types but not yet on set data type ensuring Causality, Consistency and Intention (CCI) preservation criteria. In this paper, we propose a srCE approach, a novel CRDT for a set structure to facilitate the collaborative and concurrent editing of Resource Description Framework (RDF) stores in large scale by different members of virtual community. Our approach ensures CCI model and is not tied to a specific case and therefore can be applied for any document that complies to set structure. A prototype implementation using Friend of a Friend (FOAF) data sets with and without the srCE model illustrates significant improvement in scalability and performance.

In this thesis, we discuss and evaluate M2MShare, a DTN solution for mobile phones that leverages on nodes’ mobility and opportunistic contacts to enable proximity based file sharing. To this aim, we have integrated M2MShare in the Opportunistic Network Environment (ONE) simulator and tested its performance with realistic movement models in a map-based environment.
This complex city-scale testbed includes a multitude of nodes
representing real users engaged in their daily activities and movements, and allowed us to demonstrate the efficacy of M2MShare.