Project JXTA-C: enabling a Web of things

Traversat, Bernard; Abdelaziz, Mohamed; Doolin, David M.; Duigou, M.; Hugly, Jean-Christophe; Pouyoul, Eric

doi:10.1109/hicss.2003.1174816

Cited by 40 publications

(30 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In its 2.0 version, JXTA consists of a specification of six language-and platform-independent, XML-based protocols [3] that provide basic services common to most P2P applications, such as peer group organization, resource discovery, and interpeer communication. A more detailed overview of JXTA can be found in [4]. These generic protocols require some specialization, however, in order to match specific application requirements.…”

Section: Introductionmentioning

confidence: 99%

Performance evaluation of JXTA communication layers

Antoniu

Hatcher

Jan

et al. 2005

CCGrid 2005. IEEE International Symposium on Cluster Computing and the Grid, 2005.

View full text Add to dashboard Cite

Abstract-The arrival of the P2P model has opened many new avenues for research within the field of distributed computing. This is mainly due to important practical features (such as support for volatility, high scalability). Several generic P2P libraries have been proposed for building higher-level services. In order to judge the appropriateness of using a generic P2P library for a given application type, an experimental performance evaluation of the provided functionalities is unavoidable. Very few analyses of this kind have been reported, as most evaluations are limited to complexity analyses and to simulations. Such experimental analyses are important, especially when using P2P software in a grid computing context, where applications may have precise efficiency requirements. In this paper, we focus on JXTA, which provides generic building blocks and protocols intended to serve as a basis for specialized P2P services and applications. We perform a performance evaluation of the three communication layers (endpoint, pipe and socket) over a Fast Ethernet local-area network, for recent versions of the J2SE and C bindings of JXTA. We provide a detailed analysis explaining the behavior of these three layers and we give hints showing how to efficiently use them.

show abstract

Section: Introductionmentioning

confidence: 99%

Performance evaluation of JXTA communication layers

Antoniu

Hatcher

Jan

et al. 2005

CCGrid 2005. IEEE International Symposium on Cluster Computing and the Grid, 2005.

View full text Add to dashboard Cite

show abstract

“…JXTA [22] is a project that defines a set of protocols and concepts for P2P computing, such as peer and resource discovery, peer communication and peer group management. One of the main point in which JXTA implementations differ from our proposed infrastructure is the way in which messages routing is implemented.…”

Section: Related Workmentioning

confidence: 99%

A Programmable Structured Peer-to-Peer Overlay

Portmann

Ardon²,

Sénac³

2009

Active and Programmable Networks

View full text Add to dashboard Cite

Abstract. Structured peer-to-peer (P2P) overlay are scalable, robust and selforganizing in nature, and provide a promising platform for a range of largescale distributed applications. Applications proposed to date utilize a similar key-based routing service but "re-invent the wheel" by deploying their own dedicated structured P2P overlay network. This is highly inefficient and results in a significant duplication of work in terms of development, deployment and maintenance of the overlays. To address this problem, we propose a PROgrammable STructured P2P infrastructure (PROST), which allows the dynamic and incremental deployment of multiple applications over a single structured P2P overlay. In this paper, we outline the PROST architecture and discuss the implementation of our prototype.

show abstract

“…In order to increase the availability of resources in P2P system, replication strategies have also been used in the design of peer-to-peer systems, such as, Freenet [22], JXTA [23] and Kademila [7]. Matthew Leslie et.…”

Section: Small World Overlay In Peer-to-peer Networkmentioning

confidence: 99%

Fault-tolerant peer-to-peer search on small-world networks

Liu¹,

Antonopoulos²,

Mackin³

2007

Future Generation Computer Systems

View full text Add to dashboard Cite

This paper presents small world architecture for P2P networks (SWAN) for content discovery in multi-group P2P systems. A semi-structured P2P algorithm of SWAN is utilized to create and find long-range shortcuts toward remote peer groups. In SWAN, not every peer node needs to be connected to remote groups, but every peer node can easily find which peer nodes have external connections to a specific peer group. From our analysis and simulation, SWAN has the advantages of both structured and unstructured P2P networks and can achieve good performance in both stable and dynamic environments.Keywords: Peer-to-peer; Small world; Information search IntroductionMost early Internet applications are distributed using client/server architecture that has a series of drawbacks, such as performance bottlenecks and low fault tolerance. On the contrary, peer-to-peer (P2P) architecture does not rely on centralized servers to provide access to services and offers an appealing alternative to the client/server model, especially for large-scale distributed applications. This paper presents small world architecture for P2P networks (SWAN) for resource discovery and discovery in multi-group P2P systems. A semi-structured P2P algorithm of SWAN is used to create and discover long-range shortcuts between different peer groups, which can satisfy the following requirements of design:(1) Not every peer node needs to connect to other peer groups;(2) Each peer node needs to know or can easily find which peer nodes have external connections to which peer groups; 3 (3) External links to other peer groups need to be distributed within the peer group and cannot be centralized in one or a few peer nodes.The rest of paper is organized as follows: Section 2 discusses related work. Section 3 presents the SWAN algorithms. The small-world properties of SWAN are analysed in Section 4. The performance evaluation and simulations are given in Section 5 and Section 6, respectively. We conclude the work in Section 7. Related Work Resource Discovery in Peer-to-Peer NetworksExisting P2P solutions for resource discovery can be generally classified into two categories: structured and unstructured P2P systems. Distributed hash tables (DHTs) have become the dominant methodology for resource discovery in structured P2Pnetworks [5]. The observed problem of most DHTs is that the cost of maintaining a consistent distributed index is too high in dynamic environments [6]. Some structured P2P protocols (e.g. Kademlia [7]) are beginning to seek ways to save the cost of maintaining a consistent index. In contrast, unstructured P2P systems (e.g. Gnutella) do not control data placement and are more resilient in dynamic environments, but current unstructured P2P search techniques tend to either require high search overhead or generate massive network traffic.In contrast, SWAN uses a semi-structured P2P search method combining the techniques of both structured and unstructured search methods. SWAN does not strictly rely on DHTs. It can find the requested data inside and ...

show abstract

Project JXTA-C: enabling a Web of things

Cited by 40 publications

References 1 publication

Performance evaluation of JXTA communication layers

Performance evaluation of JXTA communication layers

A Programmable Structured Peer-to-Peer Overlay

Fault-tolerant peer-to-peer search on small-world networks

Contact Info

Product

Resources

About