Middleware for mobile computing: awareness vs. transparency (position summary)

Middleware solutions for wired distributed systems cannot be used in a mobile setting, as mobile applications impose new requirements that run counter to the principle of transparency on which current middleware systems have been built. We propose the use of reflection capabilities and meta-data to pave the way for a new generation of middleware platforms designed to support mobility

Towards a mobile computing middleware: a synergy of reflection and mobile code techniques

The increasing popularity of wireless devices, such as mobile phones, personal digital assistants, watches and the like. is enabling new classes of applications that present challenging problems to designers. Applications have to be aware of, and adapt to, frequent variations in the context of execution, such as fluctuating network bandwidth, decreasing batten, power, changes in location or device capabilities, and so on. In this paper, we argue that middleware solutions for wired distributed systems cannot be used in a mobile setting, as the principle of transparency that has driven their design runs counter to the new degrees of awareness imposed by mobility: We propose a synergy of reflection and code mobility as a means for middleware to give applications the desired level of flexibility to react to changes happening in the environment, including those that have not necessarily been foreseen by middleware designers. We ruse the sharing and processing of images as an application scenario to highlight the advantages of our approach

Implementing fault tolerant applications using reflective object-oriented programming

Abstract: Shows how reflection and object-oriented programming can be used to ease the implementation of classical fault tolerance mechanisms in distributed applications. When the underlying runtime system does not provide fault tolerance transparently, classical approaches to implementing fault tolerance mechanisms often imply mixing functional programming with non-functional programming (e.g. error processing mechanisms). The use of reflection improves the transparency of fault tolerance mechanisms to the programmer and more generally provides a clearer separation between functional and non-functional programming. The implementations of some classical replication techniques using a reflective approach are presented in detail and illustrated by several examples, which have been prototyped on a network of Unix workstations. Lessons learnt from our experiments are drawn and future work is discussed

FRIENDS - A flexible architecture for implementing fault tolerant and secure distributed applications

FRIENDS is a software-based architecture for implementing fault-tolerant and, to some extent, secure applications. This architecture is composed of sub-systems and libraries of metaobjects. Transparency and separation of concerns is provided not only to the application programmer but also to the programmers implementing metaobjects for fault tolerance, secure communication and distribution. Common services required for implementing metaobjects are provided by the sub-systems. Metaobjects are implemented using object-oriented techniques and can be reused and customised according to the application needs, the operational environment and its related fault assumptions. Flexibility is increased by a recursive use of metaobjects. Examples and experiments are also described

Theory of Dipole Induced Electromagnetic Transparency

A detailed theory describing linear optics of vapors comprised of interacting multi-level quantum emitters is proposed. It is shown both by direct integration of Maxwell-Bloch equations and using a simple analytical model that at large densities narrow transparency windows appear in otherwise completely opaque spectra. The existence of such windows is attributed to overlapping resonances. This effect, first introduced for three-level systems in [R. Puthumpally-Joseph, M. Sukharev, O. Atabek and E. Charron, Phys. Rev. Lett. 113, 163603 (2014)], is due to strongly enhanced dipole-dipole interactions at high emitters' densities. The presented theory extends this effect to the case of multilevel systems. The theory is applied to the D1 transitions of interacting Rb-85 atoms. It is shown that at high atomic densities, Rb-85 atoms can behave as three-level emitters exhibiting all the properties of dipole induced electromagnetic transparency. Applications including slow light and laser pulse shaping are also proposed

A metaobject architecture for fault-tolerant distributed systems : the FRIENDS approach

The FRIENDS system developed at LAAS-CNRS is a metalevel architecture providing libraries of metaobjects for fault tolerance, secure communication, and group-based distributed applications. The use of metaobjects provides a nice separation of concerns between mechanisms and applications. Metaobjects can be used transparently by applications and can be composed according to the needs of a given application, a given architecture, and its underlying properties. In FRIENDS, metaobjects are used recursively to add new properties to applications. They are designed using an object oriented design method and implemented on top of basic system services. This paper describes the FRIENDS software-based architecture, the object-oriented development of metaobjects, the experiments that we have done, and summarizes the advantages and drawbacks of a metaobject approach for building fault-tolerant system

Transparent Dynamic reconfiguration for CORBA

Distributed systems with high availability requirements have to support some form of dynamic reconfiguration. This means that they must provide the ability to be maintained or upgraded without being taken off-line. Building a distributed system that allows dynamic reconfiguration is very intrusive to the overall design of the system, and generally requires special skills from both the client and server side application developers. There is an opportunity to provide support for dynamic reconfiguration at the object middleware level of distributed systems, and create a dynamic reconfiguration transparency to application developers. We propose a Dynamic Reconfiguration Service for CORBA that allows the reconfiguration of a running system with maximum transparency for both client and server side developers. We describe the architecture, a prototype implementation, and some preliminary test result

Generalization of the Poisson kernel to the superconducting random-matrix ensembles

We calculate the distribution of the scattering matrix at the Fermi level for chaotic normal-superconducting systems for the case of arbitrary coupling of the scattering region to the scattering channels. The derivation is based on the assumption of uniformly distributed scattering matrices at ideal coupling, which holds in the absence of a gap in the quasiparticle excitation spectrum. The resulting distribution generalizes the Poisson kernel to the nonstandard symmetry classes introduced by Altland and Zirnbauer. We show that unlike the Poisson kernel, our result cannot be obtained by combining the maximum entropy principle with the analyticity-ergodicity constraint. As a simple application, we calculate the distribution of the conductance for a single-channel chaotic Andreev quantum dot in a magnetic field.Comment: 7 pages, 2 figure

Efficient Transport Protocol for Networked Haptics Applications

The performance of haptic application is highly sensitive to communication delays and losses of data. It implies several constraints in developing networked haptic applications. This paper describes a new internet protocol called Efficient Transport Protocol (ETP), which aims at developing distributed interactive applications. TCP and UDP are transport protocols commonly used in any kind of networked communication, but they are not focused on real time application. This new protocol is focused on reducing roundtrip time (RTT) and inter packet gap (IPG). ETP is, therefore, optimized for interactive applications which are based on processes that are continuously exchanging data.ETP protocol is based on a state machine that decides the best strategies for optimizing RTT and IPG. Experiments have been carried out in order to compare this new protocol and UDP