Adaptive transaction routing in a heterogeneous database environment

Avraham Leff, Philip S. Yu, Yann-Hang Lee

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

The issue of transaction routing in a heterogeneous database environment is examined where transaction characteristics like reference locality imply that certain processing systems can be identified as being, in general, more suitable than others for a given transaction class. Routing which ignores these distinctions in an attempt to balance system load can degrade system performance. An adaptive routing strategy is considered which: (1) estimates the response time based on a steady-state analysis; (2) monitors how well actual response time conforms to the estimate; and (3) adaptively adjusts future estimates through a feedback control based on (2). It is found that the adaptive strategy greatly enhances performance robustness as compared to the results of the strategy without feedback. The feedback process used alleviates the sensitivity to accurate estimations of workload and system parameters. Various simulation studies are used to illustrate the adaptive strategy's robustness.

Original languageEnglish (US)
Title of host publicationProceedings - International Conference on Distributed Computing Systems
Editors Anon
Place of PublicationPiscataway, NJ, United States
PublisherPubl by IEEE
Pages406-413
Number of pages8
StatePublished - Jun 1989
Externally publishedYes
Event9th International Conference on Distributed Computing Systems - Newport Beach, CA, USA
Duration: Jun 5 1989Jun 9 1989

Other

Other9th International Conference on Distributed Computing Systems
CityNewport Beach, CA, USA
Period6/5/896/9/89

Fingerprint

Feedback
Feedback control
Processing

ASJC Scopus subject areas

  • Hardware and Architecture

Cite this

Leff, A., Yu, P. S., & Lee, Y-H. (1989). Adaptive transaction routing in a heterogeneous database environment. In Anon (Ed.), Proceedings - International Conference on Distributed Computing Systems (pp. 406-413). Piscataway, NJ, United States: Publ by IEEE.

Adaptive transaction routing in a heterogeneous database environment. / Leff, Avraham; Yu, Philip S.; Lee, Yann-Hang.

Proceedings - International Conference on Distributed Computing Systems. ed. / Anon. Piscataway, NJ, United States : Publ by IEEE, 1989. p. 406-413.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Leff, A, Yu, PS & Lee, Y-H 1989, Adaptive transaction routing in a heterogeneous database environment. in Anon (ed.), Proceedings - International Conference on Distributed Computing Systems. Publ by IEEE, Piscataway, NJ, United States, pp. 406-413, 9th International Conference on Distributed Computing Systems, Newport Beach, CA, USA, 6/5/89.
Leff A, Yu PS, Lee Y-H. Adaptive transaction routing in a heterogeneous database environment. In Anon, editor, Proceedings - International Conference on Distributed Computing Systems. Piscataway, NJ, United States: Publ by IEEE. 1989. p. 406-413
Leff, Avraham ; Yu, Philip S. ; Lee, Yann-Hang. / Adaptive transaction routing in a heterogeneous database environment. Proceedings - International Conference on Distributed Computing Systems. editor / Anon. Piscataway, NJ, United States : Publ by IEEE, 1989. pp. 406-413
@inproceedings{1e79627d166241788dcf38daead1d193,
title = "Adaptive transaction routing in a heterogeneous database environment",
abstract = "The issue of transaction routing in a heterogeneous database environment is examined where transaction characteristics like reference locality imply that certain processing systems can be identified as being, in general, more suitable than others for a given transaction class. Routing which ignores these distinctions in an attempt to balance system load can degrade system performance. An adaptive routing strategy is considered which: (1) estimates the response time based on a steady-state analysis; (2) monitors how well actual response time conforms to the estimate; and (3) adaptively adjusts future estimates through a feedback control based on (2). It is found that the adaptive strategy greatly enhances performance robustness as compared to the results of the strategy without feedback. The feedback process used alleviates the sensitivity to accurate estimations of workload and system parameters. Various simulation studies are used to illustrate the adaptive strategy's robustness.",
author = "Avraham Leff and Yu, {Philip S.} and Yann-Hang Lee",
year = "1989",
month = "6",
language = "English (US)",
pages = "406--413",
editor = "Anon",
booktitle = "Proceedings - International Conference on Distributed Computing Systems",
publisher = "Publ by IEEE",

}

TY - GEN

T1 - Adaptive transaction routing in a heterogeneous database environment

AU - Leff, Avraham

AU - Yu, Philip S.

AU - Lee, Yann-Hang

PY - 1989/6

Y1 - 1989/6

N2 - The issue of transaction routing in a heterogeneous database environment is examined where transaction characteristics like reference locality imply that certain processing systems can be identified as being, in general, more suitable than others for a given transaction class. Routing which ignores these distinctions in an attempt to balance system load can degrade system performance. An adaptive routing strategy is considered which: (1) estimates the response time based on a steady-state analysis; (2) monitors how well actual response time conforms to the estimate; and (3) adaptively adjusts future estimates through a feedback control based on (2). It is found that the adaptive strategy greatly enhances performance robustness as compared to the results of the strategy without feedback. The feedback process used alleviates the sensitivity to accurate estimations of workload and system parameters. Various simulation studies are used to illustrate the adaptive strategy's robustness.

AB - The issue of transaction routing in a heterogeneous database environment is examined where transaction characteristics like reference locality imply that certain processing systems can be identified as being, in general, more suitable than others for a given transaction class. Routing which ignores these distinctions in an attempt to balance system load can degrade system performance. An adaptive routing strategy is considered which: (1) estimates the response time based on a steady-state analysis; (2) monitors how well actual response time conforms to the estimate; and (3) adaptively adjusts future estimates through a feedback control based on (2). It is found that the adaptive strategy greatly enhances performance robustness as compared to the results of the strategy without feedback. The feedback process used alleviates the sensitivity to accurate estimations of workload and system parameters. Various simulation studies are used to illustrate the adaptive strategy's robustness.

UR - http://www.scopus.com/inward/record.url?scp=0024679988&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0024679988&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0024679988

SP - 406

EP - 413

BT - Proceedings - International Conference on Distributed Computing Systems

A2 - Anon, null

PB - Publ by IEEE

CY - Piscataway, NJ, United States

ER -