7662147
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.
16977816
Handling Sensor Data in Rapidly Changing Environments to Support Soft Real-Time Requirements
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.
2213436
MANDATE: MAnaging Networks Using DAtabase TEchnology
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. >
32186098
Buffer management in real-time active database systems
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.
14845392
Internet-Scale Storage Systems under Churn -- A Study of the Steady-State using Markov Models
Content storage in a distributed collaborative environment uses redundancy for better resilience and thus provides good availability and durability. In a peer-to-peer environment, where peers continuously leave and rejoin the network, various lazy strategies can be employed to maintain a minimal redundancy of stored content in the system. Existing static resilience analyses fail to capture in detail the system's behavior over time, particularly the probability mass function of the actual available redundancy, since it ignores the crucial interplay between churn and maintenance operations, and looks only at the average system property. We perform a Markovian time-evolution analysis of the system specified by probability mass function of each possible system state, and establish that given a fixed rate of churn and a specific maintenance strategy, the system operates in a corresponding steady-state (dynamic equilibrium). Understanding the behavior of the system under such a dynamic equilibrium is a fundamental ingredient to precisely evaluate analytically the system's performance and availability as well as to determine the required operational maintenance cost. We also propose a new randomized variant of a lazy-maintenance scheme which has significant performance benefits in comparison to the existing deterministic procrastination based maintenance. We demonstrate the use of our analysis methodology in comparing performance of maintenance schemes using the examples of the new maintenance scheme we propose and the erstwhile best known existing lazy maintenance scheme. The comparative study shows that our randomized lazy maintenance strategy has substantially better resilience at same maintenance cost
1427545
Self-stabilizing mutual exclusion using unfair distributed scheduler
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.
38254762
Update-Efficient Data Structures for Dynamic IP Router Tables
9624059
Publish/subscribe scheme for mobile networks
The information dissemination in mobile networks is an important but complex and challenging problem. Designing suitable communication primitives for these systems is critical. One of these primitives is the publish/subscribe paradigm. The publish/subscribe is a strategy to establish communication between the information providers (publishers) and information consumers (subscribers) in a distributed system. Our work focuses on an appropriate distributed infrastructure suitable for a scalable implementation of a publish/subscribe system. We present a formal model which is adapted for the peer-based particular subscription criteria of publish/subscribe systems. Moreover, we propose a general deterministic information diffusion scheme for mobile systems. The three main features of our communication scheme are the following: First, our scheme is well-adapted to scalable systems without compromising any subscription criteria or network reorganization. Second, we maintain the anonymity of the distributed system --- in order to maintain the network structure, we need only local information. Third, our solution is fully decentralized and modular, thus making it appropriate for practical implementations.
159680
A proxy-based approach for dynamic content acceleration on the WWW
Various dynamic content caching approaches have been proposed to address the performance and scalability problems faced by many Web sites that utilize dynamic content generation applications. Proxy-based caching approaches store content at various locations outside the site infrastructure and can improve Web site performance by reducing content generation delays, firewall processing delays, and bandwidth requirements. However, existing proxy-based caching approaches either: (a) cache at the page level, which does not guarantee that correct pages are served and provides very limited reusability, or (b) cache at the fragment level, which requires the use of pre-defined page layouts. To address these issues, several back end caching approaches have been proposed, including query result caching and fragment level caching. While back end approaches guarantee the correctness of results and offer the advantages of fine-grained caching, they neither address firewall delays nor reduce bandwidth requirements. The authors present an approach and an implementation of a dynamic proxy caching technique which combines the benefits of both proxy-based and back end caching approaches, yet does not suffer from their above-mentioned limitations.