Abstract
In this paper, we 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. In this environment, if a transaction issues a database request referencing a nonlocal database partition, the request has to be shipped to the system owning the referenced partition for processing. Various dynamic strategies are studied. Their performance is compared with that of the optimal static strategy. A new class of dynamic transaction routing strategies which take into account routing history and minimize the estimated response time of incoming transactions is proposed and 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.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 1307-1318 |
| Number of pages | 12 |
| Journal | IEEE Transactions on Software Engineering |
| Volume | 14 |
| Issue number | 9 |
| DOIs | |
| State | Published - Sep 1988 |
| Externally published | Yes |
Keywords
- Distributed database systems
- load balancing
- performance analysis
- queueing models
- transaction routing strategy
ASJC Scopus subject areas
- Software