Performance scalability of the JXTA P2P framework
Published 1 January 2007
Gabriel Antoniu, Loïc Cudennec, Mathieu Jan, Mike Duigou
Citations22
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A detailed, large-scale, multi-site experimental evaluation of two main protocols proposed by the JXTA P2P platform, including the rendezvous protocol and the discovery protocol, using the nine clusters of the French Grid'5000 testbed are reported.
Abstract
Features of the P2P model, such as scalability and volatility tolerance, have motivated its use in distributed systems. Several generic P2P libraries have been proposed for building distributed applications. However, very few experimental evaluations of these frameworks have been conducted, especially at large scales. Such experimental analyses are important, since they can help system designers to optimize P2P protocols and better understand the benefits of the P2P model. This is particularly important when the P2P model is applied to special use cases, such as grid computing. This paper focuses on the scalability of two main protocols proposed by the JXTA P2P platform. First, we provide a detailed description of the underlying mechanisms used by JXTA to manage its overlay and propagate messages over it: the rendezvous protocol. Second, we describe the discovery protocol used to find resources inside a JXTA network. We then report a detailed, large-scale, multi-site experimental evaluation of these protocols, using the nine clusters of the French Grid'5000 testbed.
Keywords
Computer Science
Lecture notes in computer sciencePastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
7,296 Citations2001Antony Rowstron, Peter Druschel
Experimental results obtained with a prototype implementation on an emulated network of up to 100,000 nodes confirm Pastry's scalability and efficiency, its ability to self-organize and adapt to node failures, and its good network locality properties.
ACM SIGCOMM Computer Communication ReviewPlanetLab
1,027 Citations2003Brent Chun, David Culler +5 more
This paper discribes the initial implementation of PlanetLab, including the mechanisms used to impelment virtualization, and the collection of core services used to manage PlanetLab.
Handling churn in a DHT
851 Citations2004Sean Rhea, Dennis Geels +2 more
Lecture notes in computer scienceOn Death, Taxes, and the Convergence of Peer-to-Peer and Grid Computing
504 Citations2003Ian Foster, Adriana Iamnitchi
It is asserted that any society-and in the context of this article, any large-scale distributed system-must address both death (failure) and the establishment and maintenance of infrastructure (which is a major motivation for taxes, so as to justify the title!).
Analysis of the evolution of peer-to-peer systems
409 Citations2002David Liben‐Nowell, Hari Balakrishnan +1 more
It is argued that traditional performance measures based on run-time are uninformative for a continually running P2P network, and that the rate at which nodes in the network need to participate to maintain system state is a more useful metric.
Designing a DHT for low latency and high throughput
352 Citations2004Frank Dabek, Jinyang Li +4 more
New techniques that resulted from this exploration include use of latency predictions based on synthetic co-ordinates, efficient integration of lookup routing and data fetching, and a congestion control mechanism suitable for fetching data striped over large numbers of servers.
A performance vs. cost framework for evaluating DHT design tradeoffs under churn
218 Citations2005J. Li, Jeremy Stribling +3 more
PVC analysis shows that the key to efficiently using additional bandwidth is for a protocol to adjust its routing table size, and shows that routing table stabilization is wasteful and can be replaced with opportunistic learning through normal lookup traffic.
IEEE Internet ComputingToward a synergy between p2p and grids
191 Citations2003Domenico Talia, Paolo Trunfio
In spite of current practices and thoughts, the grid and P2P models share several features and have more in common than the authors perhaps generally recognize.
Grid'5000: a large scale, reconfigurable, controlable and monitorable Grid platform
154 Citations2005Franck Cappello, Frédéric Desprez +11 more
Macrocycle 2 has been shown to serve as an effective bis-metal-coordinating ligand and exhibits attractive optical properties such as a sharp Soret-like band at 566 nm and low-energy fluorescence at 1058 nm.
Improving Lookup Performance Over a Widely-Deployed DHT
149 Citations2006Daniel Stutzbach, Reza Rejaie
This paper empirically study the performance of the key DHT operation, lookup, over Kad, and empirically characterize two aspects of the accuracy of routing tables in Kad, namely completeness and freshness, and investigates how the efficiency and consistency of lookup can be improved by performing parallel lookup and maintaining multiple replicas.
Project JXTA 2.0 Super-Peer Virtual Network
123 Citations2003Bernard Traversat, Ahkil Arora +6 more
The JXTA 2.0 implementation introduces the concept of a rendezvous peer view to connect rendezvous within a peergroup, and provides better resource management (threads and queues), and implements resource usage limits to fairly allocate resource between platform services.
Project JXTA: A Loosely-Consistent DHT Rendezvous Walker
81 Citations2002Bernard Traversat, Mohamed Abdelaziz +1 more
The following paper describes a looselyconsistent DHT walker approach for searching advertisements and routing queries in the JXTA rendezvous network that combines the use of a DHT to index and locate contents, with a limited range walker to resolve inconsistency of the DHT within the dynamic rendezvousnetwork.
Scalable Computing Practice and ExperienceJuxMem: An Adaptive Supportive Platform for Data Sharing on the Grid
79 Citations2001Gabriel Antoniu, Luc Bougé +1 more
This work proposes a hierarchical architecture for storing, accessing, updating and sharing numerical data within computing grids consisting of a federation of clusters based on a peer-to-peer approach, which provides transparent access to mutable data, while enhancing data persistence in a dynamic environment.
Project JXTA-C: enabling a Web of things
53 Citations2003Bernard Traversat, M. Abdelaziz +4 more
The overall architecture and trade off made to allow the JXTA-C implementation to run on a wide range of devices including supercomputers, servers, PCs, and memory-constrained embedded devices are discussed.
P3: P2P-based middleware enabling transfer and aggregation of computational resources
52 Citations2005Kazuyuki Shudo, Yoshio Tanaka +1 more
The costs of using JXTA
49 Citations2004Emir Halepovic, Ralph Deters
A JXTA performance model is proposed and results indicate that the limiting factor for reliable throughput is the number of messages rather than size in bytes, as well as that smallJXTA messages carry an excessive overhead of control data.
Performance evaluation of JXTA communication layers
44 Citations2005Gabriel Antoniu, Philip J. Hatcher +2 more
This paper performs a performance evaluation of the three communication layers of JXTA over a fast Ethernet local-area network and provides a detailed analysis explaining the behavior of these three layers and hints showing how to efficiently use them.
Simple locality-aware co-allocation in peer-to-peer supercomputing
43 Citations2006Niels Drost, Rob V. van Nieuwpoort +1 more
E Evaluation of Zorilla on over 600 processors at six sites of the Grid5000 system shows that flood scheduling, when used in a P2P network with suitable properties, is a good alternative to centralized algorithms.
Generic application description model: toward automatic deployment of applications on computational grids
36 Citations2005Sébastien Lacour, Christian Pérez +1 more
A generic application description model which can express several specific application descriptions which allows to deploy applications based on a programming model combining several models, as parallel components encompass component-based and parallel programming models for instance.
The multi-ring topology-high-performance group communication in peer-to-peer networks
34 Citations2003Markus Junginger, Yugyung Lee
The novel multiring topology is presented, designed to meet requirements of high performance group communication in peer-to-peer networks, and improves data communication by applying several concepts: building overlay networks for each topic, a topology consisting of multiple rings, backup links and dual mode links.
JXTA performance study
34 Citations2004Emir Halepovic, Ralph Deters
The results show that the performance of the latter JXTA version has improved for secure message transfer and multicast propagation, but degraded for several other operations.
Principles and Practice of Programming in JavaP2P with JXTA-Java pipes
26 Citations2003Jean-Marc Seigneur, G. Biegel +1 more
JXTA can help teachers to teach p2p with Java and an approach for performance analysis of JXTA pipes is presented, which explains how to assess a pipe and demonstrates performance results of the JxTA-Java implementation.
OS support for P2P programming: a case for TPS
23 Citations2002S. Baehni, Patrick Eugster +1 more
It is shown that, at least for P2P applications with the Java type model, TPS provides a high-level programming support that ensures type safety and encapsulation, without hampering the decoupled nature of these applications.
HAL (Le Centre pour la Communication Scientifique Directe)JuxMem: An Adpative Supportive Platform for Data Sharing on the Grid
21 Citations2003Gabriel Antoniu, Luc Bougé +1 more
Lecture notes in computer sciencePerformance Evaluation of JXTA Rendezvous
15 Citations2004Emir Halepovic, Ralph Deters +1 more
The performance and scalability issues of the JXTA rendezvous are identified and the effects of multiple rendezvous deployment in peer groups using distributed search models are discovered.
Lecture notes in computer scienceEnabling the P2P JXTA Platform for High-Performance Networking Grid Infrastructures
14 Citations2005Gabriel Antoniu, Mathieu Jan +1 more
This paper evaluates the communication performance of the JXTA P2P platform over high-performance SANs and WANs, for both J2SE and C bindings, and analyzes solutions able to improve the performance of JxTA on such networking grid infrastructures.
Service Discovery in a Grid-based Peer-to-Peer Architecture
4 Citations2004Michele Amoretti, Massimo Bertozzi +2 more
This paper illustrates the first steps in the design and development of a service-oriented P2P architecture based on the concept of stateful Web Service, i.e. a Grid Service, a network-enabled entity that provides some capabilities.