Performance scalability of the JXTA P2P framework

Antoniu, Gabriel; Cudennec, Loïc; Jan, Mathieu; Duigou, M.

doi:10.1109/ipdps.2007.370299

Cited by 12 publications

(10 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, these evaluations consider only a small number of peers (up to 32). In [2] an experimental evaluation of the scalability of the JXTA search is presented based on using a testbed consisting of 5000 CPUs. This work focuses on measuring the time it takes for the rendezvous protocol to make the peerviews stable (all rendezvous have the same view) and the time it takes to retrieve an advertisement.…”

Section: Related Workmentioning

confidence: 99%

JXTA-Sim: Simulating the JXTA Search Algorithm

Esparza

Meier

2010

Advances in Intelligent and Soft Computing

View full text Add to dashboard Cite

JXTA is a set of platform-independent, open source peer-to-peer protocols that has become popular for building services and applications based on peer-to-peer overlays. Existing work towards evaluating one of JXTA's core protocols,the JXTA search algorithm, has mainly focused on testbed-based experiments. Although such evaluation configurations offer accurate results based on real deployments, scaling experiments to a large number of distributed hosts is difficult and often prohibitively expensive. Furthermore, repeating experiments using different configuration parameters might yield distorted results due to the uncontrolled nature of testbeds. Simulators offer an alternative to testbeds for evaluating large-scale applications in a controlled environment.This paper presents JXTA-Sim, a simulator for studying and evaluating the JXTA search algorithm. JXTA-Sim enables researchers to study the behavior of JXTA's search algorithm using different configuration parameters and ultimately, to test JXTA-based peer-to-peer applications.

show abstract

Section: Related Workmentioning

confidence: 99%

JXTA-Sim: Simulating the JXTA Search Algorithm

Esparza

Meier

2010

Advances in Intelligent and Soft Computing

View full text Add to dashboard Cite

show abstract

“…The goals of JXTA Benchmarking project is to construct a test harness which can be set up by people relatively unfamiliar with JXTA, that operates more or less automatically (scripted), which reports on network performance measures of interest to the JXTA community. Two other projects further implemented JXTA Benchmarking project to some extent, regarding performance evaluation of typical peer operations and sequences [Halepovic and Deters, 2003] and the performance of peerview and discovery protocols by large-scale, multi-site experiments [Antoniu et al, 2007] respectively.…”

Section: Evaluation Of Mobile Web Service Discoverymentioning

confidence: 99%

Mobile hosts in enterprise service integration

Srirama¹,

Jarke²

2009

IJWET

View full text Add to dashboard Cite

“…Experiments and analysis of P2P networks have been conducted over the Grid'5000 platform for the generic JXTA P2P framework [16]. In this article, the goal of the performed benchmarks is similar to our goal.…”

Section: Related Workmentioning

confidence: 99%

Analysis of Peer-to-Peer Protocols Performance for Establishing a Decentralized Desktop Grid Middleware

Abbes

Dubacq²

2009

Euro-Par 2008 Workshops - Parallel Processing

View full text Add to dashboard Cite

The Desktop Grid technology consists mainly in exploiting personal computer, geographically dispersed, to deliver massive compute power to investigate complex and demanding problems in a variety of different scientific fields. However, as resources number increases, the need for scalability and decentralization becomes more and more essential. Since such properties are exhibited by Peer-to-Peer systems, we aim at using them to create a decentralized desktop grid middleware. Nevertheless, in order to judge the efficiency of such P2P library, an experimental performance evaluation of the provided functionalities is unavoidable. Very few analysis of this kind have been reported, as most evaluations are limited to complexity analysis and to simulations. Such experimental analysis are important, especially when using P2P tools in grid computing context, when applications may have precise efficiency requirement. In this paper, we focus on three libraries: Bonjour, Avahi and Pastry, which provide generic API intended to serve as basis for specialized P2P applications. We perform a performance evaluation of the scalability and their capacity to register and browse an important number of services over 300 hosts in Grid'5000 for recent versions of Pastry, Avahi and Bonjour. We provide detailed analysis explaining the behavior of each library related to two criteria: the elapsed time for registration services and the needed time to discover services. Our aim is to choose the most adequate protocol for creating a decentralized middleware for desktop grid.

show abstract

Performance scalability of the JXTA P2P framework

Cited by 12 publications

References 17 publications

JXTA-Sim: Simulating the JXTA Search Algorithm

JXTA-Sim: Simulating the JXTA Search Algorithm

Mobile hosts in enterprise service integration

Analysis of Peer-to-Peer Protocols Performance for Establishing a Decentralized Desktop Grid Middleware

Contact Info

Product

Resources

About