In this paper, we first describe the challenges of provisioning Wi-Fi equipped M2M devices, which may be behind Network Address Translation (NAT). We then articulate an automatic over-the-air provisioning mechanism that includes four steps: device discovery, user account setup for device, ESSID/IP configuration, and device registration (including NAT tunnel configuration). The mechanism enables M2M service providers to manage the registered M2M devices and allows M2M users to access these M2M devices behind NAT using a unique fully qualified domain name (FQDN). Finally, we elaborate the performance analysis and technical discussions related to the automatic provisioning mechanism.

JASMIN is a functionally distributed database system running on multiple microcomputers that communicate with each other by message passing. The software modules in JASMIN can be cloned and distributed across computer boundaries. One important module is the intelligent store, a page manager that includes transaction-management facilities. It provides an optimistic, multiversioning concurrency control scheme. This scheme allows read-only transactions to run almost without conflict checking; this is important in some real-time database applications like telephone switching and routing services. The initial implementation of the intelligent store deals with centralized database only. Experiences in modifying the JASMIN intelligent store module to handle distributed databases are described. Design principles and system implementation techniques in the following areas are explored; process structure, data structures and synchronization on data structures. The process structure is aimed to provide high throughput and the data structures are designed to facilitate fast response time.>

Communications protocols are usually modeled by a pair of finite-state machines that generate the interaction between processes. Protocol verification is a procedure to validate the logical correctness of these interaction sequences and to detect potential design errors. A relational approach is proposed to represent a finite-state machine as a transition table. On this basis, the well-established theory of relational databases can be utilized to derive the global-state transitions of the system. Furthermore, logical errors of a protocol such as deadlocks, incomplete specifications and nonexecutable interactions can be formulated in terms of relational algebra. This approach has been implemented on the INGRES database system and applied to the verification of several protocols.>

Processes participating in a communications protocol are usually modeled by finite-state machines interacting each other. Protocol verification is a procedure to validate the logic correctness of these interaction sequences and detect the potential design errors. A relational approach is proposed to represent a finite-state machine as a transition relation. On this basis, relational algebra can be utilized to derive the global-state transitions of the system. Furthermore, the logic errors of the protocol such as deadlocks, incomplete specifications and nonexecutable interactions can all be formulated in terms of relational algebra. This approach has been implemented on the INGRES and DBASE-III database systems running on various machines and applied to the verification of several protocols including the CCITT X.21. Protocol verification represents a non-traditional data processing application of relational database systems.

The Jasmin database machine is being implemented as part of a research project in distributed processing and database management A primary goal of the work is to demonstrate the feasibility of a practical multiprocessor database machine suitable for large database, high transaction-rate applications Key features of Jasmin are its configurable performance, its use of off-the-shelf parts, and its ability to handle distributed databases A uniprocessor prototype of Jasmin has already been completed and the multiprocessor version is planned for later this year In this paper we describe Jasmin's architecture and discuss the performance observed in the uniprocessor prototype

Concurrency control algorithms for database systems are usually regarded as methods for synchronizing Read and Write operations. Such methods are judged to be correct if they only produce serializable executions. However, Reads and Writes are sometimes inaccurate models of the operations executed by a database system. In such cases, serializability does not capture all aspects of concurrency control executions. To capture these aspects, we describe a proof schema for analyzing concurrency control correctness. We illustrate the proof schema by presenting two new concurrency algorithms for distributed database systems.