Hitting the distributed computing sweet spot with TSpaces

Lehman, Tobin J.; Cozzi, Alex; Xiong, Yuhong; Gottschalk, Jonathan; Vasudevan, Venu; Landis, S.; Davis, Pace; Khavar, Bruce; Bowman, P. W.

doi:10.1016/s1389-1286(00)00178-x

Cited by 64 publications

(37 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…These proposals for security in the tuple space model have a very limited focus since they consider only simple attacks like invalid access or use weak cryptography mechanisms, which are not enough to ensure the security of the stored information. Other systems provide some level of faulttolerance by using the concept of transactions [35][36][37]. Table 4 compares the features provided by these tuple space approaches and the solutions proposed in this paper.…”

Section: Related Workmentioning

confidence: 99%

Providing privacy on the tuple space model

Floriano

Alchieri

Aranha

et al. 2017

J Internet Serv Appl

View full text Add to dashboard Cite

Conceptually, tuple spaces are shared memory objects that provide operations to store and retrieve ordered sets of data, called tuples. Tuples stored in a tuple space are accessed by the contents of their fields, working as an associative memory. Although there are some proposals for secure tuple spaces, accessing tuples through field contents makes these systems susceptible to attacks that could impair user and data privacy, since servers must access tuple data. In order to deal with these limitations and provide privacy in the tuple space model, this paper proposes some extensions to DEPSPACE, a tuple space system that implements dependability and security properties through a set of mechanisms that are not enough to ensure privacy. The resulting system provides privacy and, at the same time, allows tuple selection/matches similar to the traditional insecure model, i.e., it does not constraint the matching possibilities. The main problem to be addressed is that servers must select tuples based on their contents without knowing them. The proposed solution uses robust cryptographic schemes, as order-preserving encryption and homomorphic encryption, to provide this functionality without revealing the tuple contents. An analysis concerning security aspects of DEPSPACE is presented, as well as the benefits of the proposed solutions. A set of experiments, executed with an implementation of the proposed protocols, shows the feasibility of the proposed solutions and shed some light on both the behavior of the system and the costs to provide privacy in the tuple spaces model.

show abstract

Section: Related Workmentioning

confidence: 99%

Providing privacy on the tuple space model

Floriano

Alchieri

Aranha

et al. 2017

J Internet Serv Appl

View full text Add to dashboard Cite

show abstract

“…tuple spaces, or "blackboards", a concurrent access memory implementation, as originally provided by Linda [10], and now available in JavaSpaces [8] (Java/Jini), TSpaces [20] (Java), Rinda [30] (Ruby); 2. a relational database management system (RDBMS), for a query oriented approach; 3. conventional object-oriented collections, with external state represented as an opaque object (the structure being defined by the agents), directly stored in the collection; such collections can be made to operate atomically; the requirement for the environment server to augment the states with additional information can be supported using the Decorator pattern [9].…”

Section: Repositorymentioning

confidence: 99%

Environment orientation: a structured simulation approach for agent-based complex systems

Hoverd

Stepney

2014

Nat Comput

View full text Add to dashboard Cite

Complex systems are collections of independent agents interacting with each other and with their environment to produce emergent behaviour. Agent-based computer simulation is one of the main ways of studying complex systems. A naïve approach to such simulation can fare poorly, due to large communication overhead, and due to the scope for deadlock between the interacting agents sharing a computational platform.Agent interaction can instead be considered entirely from the point of view of the environment(s) within which the agents interact. Structuring a simulation using such Environment Orientation leads to a simulation that reduces communication overhead, that is effectively deadlock-free, and yet still behaves in the manner required. Additionally the Environment Orientation architecture eases the development of more sophisticated large-scale simulations, with multiple kinds of complex agents, situated in and interacting with multiple kinds of environments.We describe the Environment Orientation simulation architecture. We report on a number of experiments that demonstrate the effectiveness of the Environment Orientation approach: a simple flocking system, a flocking system with multiple sensory environments, and a flocking system in an external environment.

show abstract

“…Finally, as shown in Figure 15 the data layer can be implemented with a wide variety of mechanisms. These range from centralized memory based data structures (such as a hash map), to traditional forms of persistent storage (such as network file systems, or relational databases), or distributed storage systems (such as Linda-like tuple spaces [11] like TSpaces [29] or JavaSpaces [16])…”

Section: State Information Storagementioning

confidence: 99%