Dynamic Transaction Routing in Distributed Database Systems

The authors investigate dynamic transaction routing strategies for locally distributed database systems in which the database is partitioned and distributed among multiple transaction-processing systems, and the incoming transactions are routed by a common front-end processor. If a transaction issues a database request referencing a nonlocal database partition, the request has to be shipped to the system owing the referenced partition for processing. Various dynamic strategies are studied. Their performance is compared with that of the optimal static strategy. A class of dynamic transaction routing strategies which take into account routing history and minimize the estimated response time of incoming transactions is proposed; they are found to provide a substantial improvement over the optimal static strategy. The robustness of the strategies is further studied through sensitivity analysis over various transaction loads, communication overheads, and database reference distributions. >

[1]  Yung-Terng Wang,et al.  Load Sharing in Distributed Systems , 1985, IEEE Transactions on Computers.

[2]  Hongjun Lu,et al.  Dynamic Task Allocation in a Distributed Database System , 1985, ICDCS.

[3]  K. Mani Chandy,et al.  Open, Closed, and Mixed Networks of Queues with Different Classes of Customers , 1975, JACM.

[4]  Yonathan Bard,et al.  A model of shared dasd and multipathing , 1980 .

[5]  Edward D. Lazowska,et al.  A Comparison of Receiver-Initiated and Sender-Initiated Adaptive Load Sharing , 1986, Perform. Evaluation.

[6]  Walter H. Kohler,et al.  Models for Dynamic Load Balancing in a Heterogeneous Multiple Processor System , 1979, IEEE Transactions on Computers.

[7]  Edward D. Lazowska,et al.  Adaptive load sharing in homogeneous distributed systems , 1986, IEEE Transactions on Software Engineering.

[8]  J. T. Robinson,et al.  On coupling multi-systems through data sharing , 1987, Proceedings of the IEEE.

[9]  K. Mani Chandy,et al.  Linearizer: a heuristic algorithm for queueing network models of computing systems , 1982, CACM.

[10]  Philip S. Yu,et al.  On Coupling Partitioned Database Systems , 1986, ICDCS.

[11]  Philip S. Yu,et al.  Analysis of multi-system function request shipping , 1986, 1986 IEEE Second International Conference on Data Engineering.

[12]  Tapani Lehtonen,et al.  On the optimality of the shortest line discipline , 1984 .

[13]  Philip S. Yu,et al.  On multisystem coupling through function request shipping , 1986, IEEE Transactions on Software Engineering.

[14]  Satish K. Tripathi,et al.  Adaptive Routing Using a Virtual Waiting Time Technique , 1982, IEEE Transactions on Software Engineering.

[15]  Anthony Ephremides,et al.  A simple dynamic routing problem , 1980 .

[16]  Stephen S. Lavenberg,et al.  Mean-Value Analysis of Closed Multichain Queuing Networks , 1980, JACM.

[17]  Harold S. Stone,et al.  Multiprocessor Scheduling with the Aid of Network Flow Algorithms , 1977, IEEE Transactions on Software Engineering.

[18]  Edward D. Lazowska,et al.  A comparison of receiver-initiated and sender-initiated adaptive load sharing (extended abstract) , 1985, SIGMETRICS 1985.

[19]  Asser N. Tantawi,et al.  Optimal static load balancing in distributed computer systems , 1985, JACM.

[20]  Harold S. Stone,et al.  Critical Load Factors in Two-Processor Distributed Systems , 1978, IEEE Transactions on Software Engineering.