This Article 
 Bibliographic References 
 Add to: 
Dynamic Transaction Routing in Distributed Database Systems
September 1988 (vol. 14 no. 9)
pp. 1307-1318

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] A. K. Agrawala, S. K. Tripathi, and G. Ricart, "Adaptive routing using a virtual waiting time technique,"IEEE Trans. Software Eng., vol. SE-8, no. 1, pp. 76-81, Jan. 1982
[2] Y. Bard, "A model of shared DASD and multipathing,"Commun. ACM, vol. 23, no. 10, pp. 564-572, Oct. 1980.
[3] F. Baskett, K. M. Chandy, R. R. Muntz, and F. G. Palacios, "Open, closed, and mixed networks of queues with different classes of customers,"J. ACM, vol. 22, no. 2, pp. 248-260, 1975.
[4] M. J. Carey, M. Livny, and H. Lu, "Dynamic task allocation in a distributed database system," Dep. Comput. Sci., Univ. Wisconsin-- Madison, Tech. Rep. 556, Sept. 1984.
[5] K. Chandy and D. Neuse, "Linearizer: A heuristic algorithm for queueing network models of computing systems,"Commun. ACM, vol. 25, no. 2, pp. 126-134, 1982.
[6] Y-C. Chow and W. H. Kohler, "Models for dynamic load balancing in a heterogeneous multiple processor system,"IEEE Trans. Comput., vol. C-28, no. 5, pp. 354-361, May 1979.
[7] D. W. Cornell, D. M. Dias, and P. S. Yu, "On multisystem coupling through function request shipping,"IEEE Trans. Software Eng., vol. SE-12, no. 10, pp. 1006-1017, Oct. 1986.
[8] D. L. Eager, E. D. Lazowska, and J. Zahorjan, "Adaptive load sharing in homogenous distributed systems," Technical Report 84-10-01, Dept. Comput. Sci., Univ. Washington, Tech. Rep. 84-10-01, Oct. 1984.
[9] D. L. Eager, E. D. Lazowska, and J. Zahorjan, "A comparison of receiver-initiated and sender-initiated adaptive load sharing,"Performance Evaluation Review, vol. 13, no. 2, pp. 1-3, Aug. 1984.
[10] A. Ephremides, P. Varaiya, and J. Walrand, "A simple dynamic routing problem,"IEEE Trans. Automat. Contr., vol. AC-25, no. 4, pp. 690-693, Aug. 1980.
[11] R. Nelson and D. Towsley, "Comparison of threshold scheduling policies for multiple server systems," IBM, Res. Rep. RC-11256, July 1985.
[12] L. M. Ni and K. Hwang, "Optimal load balancing in a multiple processor system with many job classes,"IEEE Trans. Software Eng., vol. SE-11, no. 5, pp. 491-496, May 1985.
[13] M. Reiser and S. Lavenberg, "Mean value analysis of closed multichain queueing networks,"J. ACM, vol. 27, no. 2, Apr. 1980.
[14] C. H. Sauer, E. A. MacNair, and J. F. Kurose, "The research queueing package version 2: Introduction and examples," IBM, Yorktown Height, NY, Res. Rep. RA-138, 1982.
[15] P. Shweitzer, "Approximate analysis of multiclass queueing networks of queues," inProc. Int. Conf. Stochastic Control and Optimization. Amsterdam, The Netherlands: North-Holland, 1979.
[16] H. S. Stone, "Multiprocessor scheduling with the aid of network flow algorithm,"IEEE Trans. Software Eng., vol. SE-3, no. 1, pp. 85- 93, Jan. 1977.
[17] H. S. Stone, "Critical load factors in two processor distributed systems,"IEEE Trans. Software Eng., vol. SE-4, no. 3, pp. 254-258, May 1978.
[18] A. N. Tantawi and D. Towsley, "Optimal static load balancing in distributed computer systems,"J. ACM, pp. 445-465, Apr. 1985.
[19] Y.-T. Wang and R. J. T. Morris, "Load sharing in distributed systems,"IEEE Trans. Comput., vol. C-34, no. 3, pp. 204-217, Mar. 1985.
[20] W. Winston, "Optimality of the shortest line Discipline,"J. Appl. Prob., vol. 14, pp. 181-189, 1977.
[21] P. S. Yu, D. W. Cornell, D. M. Dias, and A. Thomasian, "On coupling partitioned database systems," inProc. 6th Int. Conf. Distributed Computing Systems, May 1986, pp. 148-157.
[22] P. S. Yu, D. M. Dias, J. T. Robinson, B. R. Iyer, and D. W. Cornell, "On coupling multi-systems through data sharing,"Proc. IEEE, vol. 75, no. 5, pp. 573-587, May 1987.

Index Terms:
distributed database; dynamic transaction routing; multiple transaction-processing systems; common front-end processor; database request; response time; sensitivity analysis; communication overheads; database reference distributions; database theory; distributed databases; transaction processing
P.S. Yu, S. Balsamo, Y.-H. Lee, "Dynamic Transaction Routing in Distributed Database Systems," IEEE Transactions on Software Engineering, vol. 14, no. 9, pp. 1307-1318, Sept. 1988, doi:10.1109/32.6174
Usage of this product signifies your acceptance of the Terms of Use.