Peer interest-based discovery for decentralized peer-to-peer systems

The success of content distribution oriented peer-to-peer systems heavily depends on the resource discovery mechanism. In case of large-scale distributed systems, this mechanism must be scalable and robust. The paper proposes a structured solution for resource discovery in decentralized peer-to-peer systems, which is guided by peer interest in collaborating with other peers. The problem of discovering peers of interest has many applications in file sharing, in data-aware scheduling, and in optimizing the files and documents downloads. Moreover, if trust is added as another parameter to define peers of interest, the interest-based discovery is useful in trusted P2P applications. We focused on developing the overlay network to ensure a very small number of messages required to retrieve, insert or delete a file even in the case of a very large network containing millions of nodes. In the experimental validation we used Over Sim, a simulation tool for P2P systems. The experimental results highlight the good performance obtained regarding message communication and system's scalability.Peer ReviewedPostprint (published version

Sensor Data Distribution With Robustness and Reliability: Toward Distributed Components Model

In planetary surface exploration mission, sensor data distribution is required in many aspects, for example, in navigation, scheduling, planning, monitoring, diagnostics, and automation of the field tasks. The challenge is to distribute such data in the robust and reliable way so that we can minimize the errors caused by miscalculations, and misjudgments that based on the error data input in the mission. The ad-hoc wireless network on planetary surface is not constantly connected because of the nature of the rough terrain and lack of permanent establishments on the surface. There are some disconnected moments that the computation nodes will re-associate with different repeaters or access points until connections are reestablished. Such a nature requires our sensor data distribution software robust and reliable with ability to tolerant disconnected moments. This paper presents a distributed components model as a framework to accomplish such tasks. The software is written in Java and utilized the available Java Message Services schema and the Boss implementation. The results of field experimentations show that the model is very effective in completing the tasks

Software Architecture of Sensor Data Distribution In Planetary Exploration

Data from mobile and stationary sensors will be vital in planetary surface exploration. The distribution and collection of sensor data in an ad-hoc wireless network presents a challenge. Irregular terrain, mobile nodes, new associations with access points and repeaters with stronger signals as the network reconfigures to adapt to new conditions, signal fade and hardware failures can cause: a) Data errors; b) Out of sequence packets; c) Duplicate packets; and d) Drop out periods (when node is not connected). To mitigate the effects of these impairments, a robust and reliable software architecture must be implemented. This architecture must also be tolerant of communications outages. This paper describes such a robust and reliable software infrastructure that meets the challenges of a distributed ad hoc network in a difficult environment and presents the results of actual field experiments testing the principles and actual code developed

Conceptual development of resources discovery in the proposed hybrid P2P video streaming

We present the design of a hybrid Peer-to-Peer (P2P) system for video streaming. In this paper, we address the availability, accessibility and lookup service of files. We use the advantages of server-client business model to search and retrieve the information. We implement the base ontology of video domain repository so that the final result may be different and provide more results from the keyword search. To provide the dynamic standby peer, we use checksum value as an indicator to search an identical content in the Peer-to-Peer network. We hypothesize that, by using server-client searching in Peer-to-Peer application, we can reduce the latency lookup services, path length, peer load and network traffic

Providing Administrative Control and Autonomy in Structured Peer-to-Peer Overlays

self-organizing substrate for distributed applications and support powerful abstractions such as distributed hash tables (DHTs) and group communication. However, in most of these systems, lack of control over key placement and routing paths raises concerns over autonomy, administrative control and accountability of participating organizations. Additionally, structured p2p overlays tend to assume global connectivity while in reality, network address translation and firewalls limit connectivity among hosts in different organizations. In this paper, we present a general technique that ensures content/path locality and administrative autonomy for participating organizations, and provides natural support for NATs and firewalls. Instances of conventional structured overlays are configured to form a hierarchy of identifier spaces that reflects administrative boundaries and respects connectivity constraints among networks

Deploying Large-Scale Datasets on-Demand in the Cloud: Treats and Tricks on Data Distribution

Public clouds have democratised the access to analytics for virtually any institution in the world. Virtual Machines (VMs) can be provisioned on demand, and be used to crunch data after uploading into the VMs. While this task is trivial for a few tens of VMs, it becomes increasingly complex and time consuming when the scale grows to hundreds or thousands of VMs crunching tens or hundreds of TB. Moreover, the elapsed time comes at a price: the cost of provisioning VMs in the cloud and keeping them waiting to load the data. In this paper we present a big data provisioning service that incorporates hierarchical and peer-to-peer data distribution techniques to speed-up data loading into the VMs used for data processing. The system dynamically mutates the sources of the data for the VMs to speed-up data loading. We tested this solution with 1000 VMs and 100 TB of data, reducing time by at least 30 % over current state of the art techniques. This dynamic topology mechanism is tightly coupled with classic declarative machine configuration techniques (the system takes a single high-level declarative configuration file and configures both software and data loading). Together, these two techniques simplify the deployment of big data in the cloud for end users who may not be experts in infrastructure management. Index Terms—Large-scale data transfer, flash crowd, big data, BitTorrent, p2p overlay, provisioning, big data distribution I

EVALUASI DAN ANALISIS PERFORMANSI PEER TO PEER SESSION INITIATION PROTOCOL (P2PSIP) PADA LAYANAN VOICE OVER INTERNET PROTOCOL (VOIP)

Komunikasi adalah sesuatu yang sangat penting saat ini. Komunikasi berupa voice saat ini tidak hanya berupa melalui jaringan tradisional telepon biasa yaitu melalui POTS atau jaringan circuit switch tetapi sudah dapat melalui jaringan paket yang dikenal dengan VoIP (Voice Over Internet Protocol). Komunikasi VoIP dengan SIP (Session Initiation Protocol) paling sering berupa client dan server dimana client jika ingin melakukan koneksi VoIP maka harus mendaftar melalui server VoIP dan baru kemudian melakukan hubungan ke user VoIP lain yang terdaftar di server tersebut. Mengingat dari pengertian SIP sendiri adalah komunikasi peer-to-peer yang dimungkinkan untuk tidak menggunakan server. Maka model komunikasi secara peer to peer dilakukan dimana sekumpulan user VoIP SIP yang ingin melakukan komunikasi mengadakan komunikasi satu sama lain tanpa menggunakan server VoIP. Komunikasi VoIP antara user SIP satu dengan user yang lain dapat menggunakan P2PSIP (Peer-to-Peer Session Initiation Protocol). Dalam komunikasi peer-to-peer sangat erat dengan algoritma DHT (Distribution Hash Table) untuk pengaturan penyambungan dan pemisahan maupun routing client dalam sebuah jaringan peer-topeer.Hasil yang diperoleh yang paling baik dilihat dari parameter QoS (Quality of Service) layanan untuk delay, PDD, dan MOS adalah Peer-to-Peer SIP. Sedangkan untuk nilai throughput, jitter, dan packet loss adalah Client-Server SIP.Kata kunci : Peer to Peer, P2SIP, SIP, Distribution Hash Tabl

An Extension and Cooperation Mechanism for Heterogeneous Overlay Networks

Part 1: Future Heterogeneous NetworkInternational audienceIn real-world peer-to-peer applications, the scalability of data lookup is heavily affected by network artifacts. A common solution to improve scalability, robustness and security is to increase the local properties of nodes, by clustering them together. This paper presents a framework which allows for the development of distributed applications on top of interconnected overlay network. Here, message routing between overlays is accomplished by using co-located nodes, i.e. nodes belonging to more than one overlay network at the same time. These co-located nodes serve as distributed gateways, enabling the routing of requests across overlays, while keeping overlay maintenance operations local. The protocol has been evaluated via simulations and client deployment, showing that the ability, of reaching the totality of the overlays in a federated configuration can be preserved even with the simplest routing, proving the feasibility of federated overlay configurations

Securing Peer-to-Peer Overlay Networks

Overlay networks are virtual networks, which exist on top of the current Inter net architecture, and are used in support of peer-to-peer (P2P) applications. The virtualization provides overlays with the ability to create large, scalable, decentral ized networks with efficient routing. Many implementations of overlay networks have come out of academic research. Each provides a unique structure and routing configuration, aimed at increasing the overall network efficiency for a particular ap plication. However, they are all threatened by a similar set of severe vulnerabilities. I explore some of these security deficiencies of overlay network designs and pro pose a new overlay network security framework Phyllo. This framework aims to mitigate all of the targeted security problems across a majority of the current overlay implementations, while only requiring minimal design changes. In order to demonstrate the validity of Phyllo, it was implemented on top of the Pastry overlay architecture. The performance and security metrics of the network with the pro posed framework are evaluated against those of the original in order to demonstrate the feasibility of Phyllo