Robust transaction routing in distributed database systems

Authors:
Y. H. Lee;P. S. Yu;A. Leff
Affiliations:
Computer Science Department, University of Florida, Gainesville, FL;IBM T. Watson Research Center, P. 0. Box 704, Yorktown Heights, NY;Computer Science Department, University of Columbia, New York, NY
Venue:
DPDS '88 Proceedings of the first international symposium on Databases in parallel and distributed systems
Year:
2000

Citing 8
Cited 0

Optimal static load balancing in distributed computer systems

Journal of the ACM (JACM)
Adaptive load sharing in homogeneous distributed systems

IEEE Transactions on Software Engineering
On multisystem coupling through function request shipping

IEEE Transactions on Software Engineering
A comparison of receiver-initiated and sender-initiated adaptive load sharing (extended abstract)

SIGMETRICS '85 Proceedings of the 1985 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Mean-Value Analysis of Closed Multichain Queuing Networks

Journal of the ACM (JACM)
Dynamic load sharing in distributed database systems

ACM '86 Proceedings of 1986 ACM Fall joint computer conference
A model of shared DASD and multipathing

Communications of the ACM
A Hybrid Data Sharing - Data Partitioning Architecture for Transaction Processing

Proceedings of the Fourth International Conference on Data Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we examine the issue of robust transaction routing in distributed database systems. A class of dynamic routing strategies which use estimated response times to make routing decisions is studied in details. Since response time estimation and decision making depend on the assumed transaction model and parameters, it is important to examine the robustness or sensitivity to the inaccuracy in the assumptions and parameter values. Through simulations, we find that the dynamic routing strategy based strictly on response time is too aggressive in sharing loads and makes too many non-preferred system routings. It is robust with respect to change in the number of database calls per transaction, but is relatively sensitive to the distribution of database calls. Two refinements are proposed which improve system performance as well as robustness of routing decisions.