Reactive system model for building fault-tolerant distributed applications

The development of fault-tolerant computing systems is a very difficult task. Two reasons contributed to this difficulty can be described as follows. The First is that, in normal practice, fault-tolerant computing policies and mechanisms are deeply embedded into most application programs, so that these application programs cannot cope with changes in environments, policies and mechanisms. These factors may change frequently in a distributed environment, especially in a heterogeneous environment. Therefore, in order to develop better fault-tolerant systems that can cope with constant changes in environments and user requirements, it is essential to separate the fault tolerant computing policies and mechanisms in application programs. The second is, on the other hand, a number of techniques have been proposed for the construction of reliable and fault-tolerant computing systems. Many computer systems are being developed to tolerant various hardware and software failures. However, most of these systems are to be used in specific application areas, since it is extremely difficult to develop systems that can be used in general-purpose fault-tolerant computing. The motivation of this thesis is based on these two aspects. The focus of the thesis is on developing a model based on the reactive system concepts for building better fault-tolerant computing applications. The reactive system concepts are an attractive paradigm for system design, development and maintenance because it separates policies from mechanisms. The stress of the model is to provide flexible system architecture for the general-purpose fault-tolerant application development, and the model can be applied in many specific applications. With this reactive system model, we can separate fault-tolerant computing polices and mechanisms in the applications, so that the development and maintenance of fault-tolerant computing systems can be made easier.

Building reliable distributed systems

[No Abstract]

Attributed publication and selection for web service-based distributed systems

With the emergence of cloud computing, the need for flexible and detailed publication and selection of services that expose cloud resources is greatly stressed. While dynamic attributes have improved the publication and selection of resources in distributed systems, the use of dynamic attributes is yet to be tried in Web services: a key element that makes cloud computing possible. We propose a new approach to Web service publication and selection using dynamic attributes shown in Web service WSDL documents, the most commonly accessed and used elements of Web services.

Enhancing clouds, internet-scale distributed systems, using attributed web services

This thesis presents a new framework allowing cloud services to be stateful, cloud resource state and characteristics to be published, and brokering for easy cloud resource discovery and selection to be offered. Using the framework, new technology developed significantly simplifies the discovery, selection and use of clusters on the Internet.

Building the second generation of parallel/distributed virtual reality systems

We present the RhoVeR (Rhodes Virtual Reality) system and classify it as a second generation parallel/distributed virtual reality (DVR) system. We discuss the components of the system and thereby demonstrate its support for virtual reality application development, its configurable, parallel and distributed nature, and its synthesis of first generation DVR techniques.

A generic framework for three-factor authentication : preserving security and privacy in distributed systems

As part of the security within distributed systems, various services and resources need protection from unauthorized use. Remote authentication is the most commonly used method to determine the identity of a remote client. This paper investigates a systematic approach for authenticating clients by three factors, namely password, smart card, and biometrics. A generic and secure framework is proposed to upgrade two-factor authentication to three-factor authentication. The conversion not only significantly improves the information assurance at low cost but also protects client privacy in distributed systems. In addition, our framework retains several practice-friendly properties of the underlying two-factor authentication, which we believe is of independent interest.

Special issue: Building secure parallel and distributed networks and systems

Security and privacy have been the major concern when people build parallel and distributed networks and systems. While the attack systems have become more easy-to-use, sophisticated, and powerful, interest has greatly increased in the field of building more effective, intelligent, adaptive, active and high performance defense systems which are distributed and networked. This special issue focuses on the issues of building secure parallel and distributed networks and systems.

Network management in distributed systems

Applications of localized surface plasmon resonance (LSPR) such as surface enhanced Raman scattering (SERS) devices, biosensors, and nano-optics are growing. Investigating and understanding of the parameters that affect the LSPR spectrum is important for the design and fabrication of LSPR devices. This paper studies different parameters, including geometrical structures and light attributes, which affect the LSPR spectrum properties such as plasmon wavelength and enhancement factor. The paper also proposes a number of rules that should be considered in the design and fabrication of LSPR devices.

Effect of speculative prefetching on network load in distributed systems

Previous studies in speculative prefetching focus on building and evaluating access models for the purpose of access prediction. This paper on the other hand investigates the performance of speculative prefetching. When prefetching is performed speculatively, there is bound to be an increase in the network load. Furthermore, the prefetched items must compete for space with existing cache occupants. These two factors-increased load and eviction of potentially useful cache entries-are considered in the analysis. We obtain the following conclusion: to maximise the improvement in access time, prefetch exclusively all items with access probabilities exceeding a certain threshold.