Abstract
A recurring theme in the design of control schemes for computer communication networks has been to identify the drift of critical quantities such as queue lengths, and then devise control strategies that close the loop. A useful tool for the performance analysis of such strategies are bounds on deviations from the expected trajectory. This talk identifies an incomplete list of such tools that have been used in a broad class of applications, for both stochastic and deterministically constrained models of load.
- A. Eryilmaz and R. Srikant. Asymptotically tight steady-state queue length bounds implied by drift conditions. Queueing Systems, 72(3-4):311--359, 2012. Google ScholarDigital Library
- D. Gamarnik. Using fluid models to prove stability of adversarial queueing networks. IEEE Trans Automatic Control, 45(4):741--746, 2000.Google ScholarCross Ref
- B. Hajek. Hitting-time and occupation-time bounds implied by drift analysis with applications. Advances in Applied probability, 14:502--525, 1982.Google ScholarCross Ref
- B. Hajek. Mean stochastic comparison of diffusions. Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete, 68(3):315--329, 1985.Google Scholar
- B. Hajek. Cooling schedules for optimal annealing. Math Operations Research, 13(2):311--329, 1988. Google ScholarDigital Library
- B. Hajek. Large bursts do not cause instability. IEEE Trans Automatic Control, 45(1):116--118, 2000.Google ScholarCross Ref
- B. Hajek. A maximal inequality for supermartingales. Elect. Commun. Probability, 19:1--10, 2014.Google Scholar
- J. Kingman. Some inequalities for the queue GI/G/1. Biometrika, 49(3/4):315--324, December 1962.Google ScholarCross Ref
- J. Kingman. A martingale inequality in the theory of queues. Cambridge Phiolos. Soc., 59:359--361, 1964.Google ScholarCross Ref
- A. L. Stolyar. On the stability of multiclass queueing networks: A relaxed sufficient condition via limiting fluid processes. Markov Processes and Related Fields, 1(4):491--512, 1995.Google Scholar
- L. Tassiulas and A. Ephremides. Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. IEEE Trans Automatic Control, 37(12):1936--1948, 1992.Google ScholarCross Ref
Index Terms
- Bounds Implied by Drift with Applications
Recommendations
Bounds Implied by Drift with Applications
SIGMETRICS '15: Proceedings of the 2015 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer SystemsA recurring theme in the design of control schemes for computer communication networks has been to identify the drift of critical quantities such as queue lengths, and then devise control strategies that close the loop. A useful tool for the performance ...
Robust Stability and $$H_{\infty }$$Hź Control of Discrete-Time Uncertain Impulsive Systems with Time-Varying Delay
This paper considers the robust stability and $$H_{\infty }$$Hź control problems for a class of discrete-time uncertain impulsive systems with time-varying delay. Sufficient conditions for the robust stability, stabilization and $$H_\infty $$Hź control ...
Simplified Drift Analysis for Proving Lower Bounds in Evolutionary Computation
Special Issue: Theory of Evolutionary ComputationDrift analysis is a powerful tool used to bound the optimization time of evolutionary algorithms (EAs). Various previous works apply a drift theorem going back to Hajek in order to show exponential lower bounds on the optimization time of EAs. However, ...
Comments