DSTP-AN: A Distributed System for Transaction Processing Based on Data Resource Migration in ATM Networks

The dynamic migration of data resources has become a strong tool for transaction processing in broadband networks such as ATM. In this paper, a distributed system that takes advantage of data resource migration for transaction processing in ATM networks has been proposed. The proposed system provides mechanisms to select the transaction processing method, to migrate data resources in a way that reduces the time delay and message traffic in locating and accessing them. The first mechanism selects one of the two transaction processing methods: the traditional method that uses two phase commit protocol and other new method based on data resource migration. The second mechanism attempts to improve performance by making each site follow a local policy for directing requests to locate and access data resources as well as migrating them through the system. For this, a new scheme that focuses on reducing the time delay and message traffic needed to access the migratory data resources is proposed. The performance of the proposed scheme has also been evaluated and compared with one of the existing schemes by a simulation study under different system parameters such as frequency of access to the data resources, frequency of data resource migrations, scale of network, etc

High performance disk array architectures.

Yeung Kai-hau, Alan.Thesis (Ph.D.)--Chinese University of Hong Kong, 1995.Includes bibliographical references.ACKNOWLEDGMENTS --- p.ivABSTRACT --- p.vChapter CHAPTER 1 --- Introduction --- p.1Chapter 1.1 --- The Information Age --- p.2Chapter 1.2 --- The Importance of Input/Output --- p.3Chapter 1.3 --- Redundant Arrays of Inexpensive Disks --- p.5Chapter 1.4 --- Outline of the Thesis --- p.7References --- p.8Chapter CHAPTER 2 --- Selective Broadcast Data Distribution Systems --- p.10Chapter 2.1 --- Introduction --- p.11Chapter 2.2 --- The Distributed Architecture --- p.12Chapter 2.3 --- Mean Block Acquisition Delay for Uniform Request Distribution --- p.16Chapter 2.4 --- Mean Block Acquisition Delay for General Request Distributions --- p.21Chapter 2.5 --- Optimal Choice of Block Sizes --- p.24Chapter 2.6 --- Chapter Summary --- p.25References --- p.26Chapter CHAPTER 3 --- Dynamic Multiple Parity Disk Arrays --- p.28Chapter 3.1 --- Introduction --- p.29Chapter 3.2 --- DMP Disk Array --- p.31Chapter 3.3 --- Average Delay --- p.37Chapter 3.4 --- Maximum Throughput --- p.47Chapter 3.5 --- Simulation with Precise Disk Model --- p.53Chapter 3.6 --- Chapter Summary --- p.58References --- p.59Appendix --- p.61Chapter CHAPTER 4 --- Dynamic Parity Logging Disk Arrays --- p.69Chapter 4.1 --- Introduction --- p.70Chapter 4.2 --- DPL Disk Array Architecture --- p.73Chapter 4.3 --- DPL Disk Array Operation --- p.79Chapter 4.4 --- Performance of DPL Disk Array --- p.83Chapter 4.5 --- Chapter Summary --- p.91References --- p.92Appendix --- p.94Chapter CHAPTER 5 --- Performance Analysis of Mirrored Disk Array --- p.101Chapter 5.1 --- Introduction --- p.102Chapter 5.2 --- Queueing Model --- p.103Chapter 5.3 --- Delay Analysis --- p.104Chapter 5.4 --- Numerical Examples and Simulation Results --- p.108References --- p.109Chapter CHAPTER 6 --- State Reduction in the Exact Analysis of Fork/Join Queues --- p.110Chapter 6.1 --- Introduction --- p.111Chapter 6.2 --- State Reduction For Closed Fork/Join Queueing Systems --- p.113Chapter 6.3 --- Extension To Open Fork/Join Queueing Systems --- p.118Chapter 6.4 --- Chapter Summary --- p.122References --- p.123Chapter CHAPTER 7 --- Conclusion and Future Research --- p.124Chapter 7.1 --- Summary --- p.125Chapter 7.2 --- Future Researches --- p.12

Distributed Database Systems in High Speed Wide-Area Networks

In a distributed database system (DDBS), the data is partitioned into smaller databases and distributed over multiple sites in a computer network. Associated with a DDBS are functions like query processing and concurrency control. Traditionally in DDBS research, the computer network has been considered a performance bottleneck and a lot of research effort has been directed towards the design of database operations that minimize the data transmission cost. With the development of high speed networks, the network transmission costs go down and new algorithms that efficiently utilize the huge bandwidth available are required. In this paper, we first identify the issues involved in developing this distributed application in a high speed environment. Then we demonstrate the inadequacy of existing database protocols in utilizing the Gigabit-per-second network. And finally, we develop a new concurrency control protocol that performs better than traditional DDBS in a high speed network. Both a..