Providing Real-Time Response, State Recency and Temporal Consistency in Databases for Rapidly Changing Environments
Databases have been proposed as the chosen platform to develop automated control systems for environments where the state of the system changes rapidly, and actions need to be taken with timing constraints, such as stock trading, air traffic control, network management and process control. The workload in such systems consists primarily of two types: (a) updates , which report the state of the environment to the database and arrive very frequently, and (b) transactions which arrive with deadlines. In this paper we develop algorithms to install these updates rapidly enough to ensure “state recency” while allocating sufficient resources to transactions to minimize tardiness. We also require that these transactions read temporally consistent data. In summary, this paper contributes in the following three interrelated issues: 1. 1. First and foremost, we look at some interesting problems regarding amalgamating temporal and real-time databases. 2. 2. We look at simultaneous satisfaction of state recency and temporal consistency which are central issues in the class of systems considered in this paper, i.e., rapidly changing systems. 3. 3. We design algorithms that attempt to achieve equilibrium with regard to the conjoint processing of frequently arriving state updates and time constrained transactions.

title: Buffer management in real-time active database systems
abstract: Real-time active database systems (RTADB) have attracted the attention of researchers in recent times. Such systems are envisioned as control systems for environments as diverse as process control, network management and automated financial trading. Sensors distributed throughout the system report the state of the system to the database. Unacceptable state reports typically results in corrective actions being triggered with deadlines. Thus RTADB's incorporate both real-time as well as active characteristics. We study buffer management in RTADB. Buffer management is recognized as not being a well studied area in real-time systems. As a result of our work, we postulate PAPER, a new buffer management scheme that relies on two strategies: prefetching and priority based buffer replacement. We report the result of studies of the performance of PAPER, as compared to that of existing buffer management algorithms. The insights derived from this paper impact both real-time database systems as well as real-time, active database systems.

title: Buffer management in real-time active database systems
abstract: Real-time, active database systems (RTADBSs) have attracted the attention of researchers in recent times. Such systems are envisioned as control systems for environments as diverse as process control, network management and automated financial trading. Sensors distributed throughout the system report the state of the system to the database. Unacceptable state reports typically result in corrective actions being triggered with deadlines. Thus RTADBSs incorporate both real-time as well as active characteristics. In this paper we study buffer management in RTADBSs. Buffer management is recognized as not being a well studied area in real-time systems. As a result of our work, we postulate (Prefetching Anticipatorily and Priority basEd Replacement) (PAPER), a new buffer management scheme that relies on two strategies: prefetching and priority based buffer replacement. We report the result of studies of the performance of PAPER, as compared to that of existing buffer management algorithms. The insights derived from this paper impact both real-time database systems as well as RTADBSs.

title: MANDATE: MAnaging Networks Using DAtabase TEchnology
abstract: There has been a growing demand for the development of tools to manage enterprise communication networks. A management information database is the heart of a network management system-it provides the interface between all functions of the network management system and, therefore, has to provide sophisticated functionality allied with high performance. The authors introduce the design of MANDATE (MAnaging Networks using DAtabase TEchnology), a proposed database system for effectively supporting the management of large enterprise networks. The MANDATE design makes a conscious attempt to take advantage of the special characteristics of network data and transactions, and of advances in database technology, to efficiently derive some of the required management functionality.

title: Handling Sensor Data in Rapidly Changing Environments to Support Soft Real-Time Requirements
abstract: Databases have been mandated as the chosen platform to develop automated control systems for environments where the state of the system changes rapidly and actions need to be taken with timing constraints, for example, stock trading, air traffic control, network management, and process control to name a few. Input data in such systems come from sensors distributed throughout the physical environment being monitored. As the system state changes rapidly, the sensors report information fast and with high volumes. Control decisions in such systems are highly dependent on the accuracy and timeliness of such recorded sensor-reported data. In this paper we suggest ways to algorithmically maintain the accuracy and timeliness of sensor data by enforcing two properties termedrecency andtemporal consistency. Simultaneously, our algorithms also attempt to satisfyquality of service requirements on response times of queries submitted in such systems. The performance of these algorithms is validated through an extensive simulation.

title: Self-stabilizing mutual exclusion using unfair distributed scheduler
abstract: A self-stabilizing algorithm, regardless of the initial system state, converges infinite time to a set of states that satisfy a legitimacy predicate without the need for explicit exception handler of backward recovery. Mutual exclusion is fundamental in the area of distributed computing, by serializing the accesses to a common shared resource. All existing probabilistic self-stabilizing mutual exclusion algorithms designed to work under an unfair distributed scheduler suffer from the following common drawback: Once stabilized, there exists no upper bound of time between two executions of the critical section at a given node. We present the first probabilistic self-stabilizing algorithm that guarantees such a bound (O(n/sup 3/), where n is the network size) while working using an unfair distributed scheduler. As the scheduling adversary gets weaker the bound gets better. Our algorithm works in an anonymous unidirectional ring of any size and has a O(n/sup 3/) expected stabilization time.

title: Update-Efficient Data Structures for Dynamic IP Router Tables

title: Self-Stabilizing Wormhole Routing on Ring Networks
abstract: Wormhole routing is most commonly used in parallel architectures in which messages are sent in small fragments, called flits. It is a lightweight and efficient method of routing messages between parallel processors. Self-stabilization is a technique that guarantees tolerance to transient faults (e.g., memory corruption or communication hazards) for a given protocol. Self-stabilization guarantees that the network recovers to a correct behavior in a finite amount of time, without the need for human intervention. Self-stabilization also guarantees the safety property, meaning that once the network is in a legitimate state, it will remain there until another fault occurs.
This paper presents the first self-stabilizing network algorithm in the wormhole routing model, using the unidirectional ring topology. Our solution benefits from wormhole routing by providing high throughput and low latency, and from self-stabilization by ensuring automatic resilience to all possible transient failures.

title: External control in Markovian genetic regulatory networks
abstract: Probabilistic Boolean networks (PBN's) have been recently introduced as a rule-based paradigm for modeling gene regulatory networks. Such networks, which form a subclass of Markovian genetic regulatory networks, provide a convenient tool for studying interactions between different genes while allowing for uncertainty in the knowledge of these relationships. This paper deals with the issue of control in probabilistic Boolean networks. More precisely, given a general Markovian genetic regulatory network whose state transition probabilities depend on an external (control) variable, the paper develops a procedure by which one can choose the sequence of control actions that minimize a given performance index over a finite number of steps. The procedure is based on the theory of controlled Markov chains and makes use of the classical technique of dynamic programming. The choice of the finite horizon performance index is motivated by cancer treatment applications where one would ideally like to intervene only over a finite time horizon, then suspend treatment and observe the effects over some additional time before deciding if further intervention is necessary. The undiscounted finite horizon cost minimization problem considered here is the simplest one to formulate and solve, and is selected mainly for clarity of exposition, although more complicated costs could be used, provided appropriate technical conditions are satisfied.

title: Anonymous publish/subscribe in P2P networks
abstract: One of the most important issues to deal with in peer-to-peer networks is how to disseminate information. In this paper, we use a completely new approach to solving the information dissemination problem. Our approach uses the publish/subscribe paradigm. The publish/subscribe method is the most inclusive strategy to establish communication between the information providers (publishers) and the information consumers (subscribers). We give a formal definition of publish/subscribe systems. We then use the publish/subscribe communication paradigm to design deterministic protocols (topic and content-based) for peer-to-peer networks. Our protocols are designed on top of an innovative information dissemination scheme, and can cope with the anonymity and mobility of both publishers and subscribers, weak-connectivity, and polarization, which are some of the characteristics of peer-to-peer networks. Moreover, in our solutions, every node could play a role of both publisher and subscriber The algorithms are designed completely independent of the underlying routing substrates. The key advantage of our protocols is that they are scalable without additional re-organization cost. To the best of our knowledge, this is the first time the content-based subscription has been addressed in peer-to-peer networks.