Performance Analysis of Queueing Networks via Robust Optimization

References

• Andrews M., Awerbuch B., Fernandez A., Leighton T., Liu Z., Kleinberg J. Universal-stability results and performance bounds for greedy contention-resolution protocols. J. ACM (2001) 48(1):39–69Crossref, Google Scholar
• Ben-Tal A., Nemirovski A. Robust convex optimization. Math. Oper. Res. (1998) 23(4):769–805Link, Google Scholar
• Ben-Tal A., Nemirovski A. Robust solutions of uncertain linear programs. Oper. Res. Lett. (1999) 25(1):1–13Crossref, Google Scholar
• Bertsimas D., Niño-Mora J. Optimization of multiclass queueing networks with changeover times via the achievable region approach: Part II, the multi-station case. Math. Oper. Res. (1999) 24(2):331–361Link, Google Scholar
• Bertsimas D., Sim M. Robust discrete optimization and network flows. Math. Programming Ser. B (2003) 98(1–3):49–71Crossref, Google Scholar
• Bertsimas D., Sim M. The price of robustness. Oper. Res. (2004) 52(1):35–53Link, Google Scholar
• Bertsimas D., Gamarnik D., Tsitsiklis J. Stability conditions for multiclass fluid queueing networks. IEEE Trans. Automat. Control (1996) 41:1618–1631Crossref, Google Scholar
• Bertsimas D., Gamarnik D., Tsitsiklis J. Performance of multiclass Markovian queueing networks via piecewise linear Lyapunov functions. Ann. Appl. Prob. (2001) 11(4):1384–1428Crossref, Google Scholar
• Bertsimas D., Paschalidis I., Tsitsiklis J. Optimization of multiclass queueing networks: Polyhedral and nonlinear characterization of achievable performance. Ann. Appl. Probab. (1994) 4(1):43–75Crossref, Google Scholar
• Borodin A., Kleinberg J., Raghavan P., Sudan M., Williamson D. Adversarial queueing theory. J. ACM (2001) 48:13–38Crossref, Google Scholar
• Chen H., Yao D.Fundamentals of Queueing Networks: Performance, Asymptotics and Optimization (2001) (Springer-Verlag, New York) Crossref, Google Scholar
• Chung K. L.A Course in Probability Theory (2001) 3rd ed.(Academic Press, San Diego) Google Scholar
• Cruz R. A calculus for network delay, part I: Network elements in isolation. IEEE Trans. Inform. Theory (1991a) 37(1):114–131Crossref, Google Scholar
• Cruz R. A calculus for network delay, part II: Network analysis. IEEE Trans. Inform. Theory (1991b) 37(1):132–141Crossref, Google Scholar
• Dai J. G. On the positive Harris recurrence for multiclass queueing networks: A unified approach via fluid models. Ann. Appl. Probab. (1995) 5(1):49–77Crossref, Google Scholar
• Dai J. G., Kurtz T. G. A multiclass station with Markovian feedback in heavy traffic. Math. Oper. Res. (1995) 20(3):721–742Link, Google Scholar
• Dai J. G., Meyn S. P. Stability and convergence of moments for multiclass queueing networks via fluid limit models. IEEE Trans. Automatic Control (1995) 40:1889–1904Crossref, Google Scholar
• Gallager G., Parekh A. A generalized processor sharing approach to flow control in integrated services networks: The single node case. IEEE/ACM Trans. Networking (1993) 1(3):344–357Crossref, Google Scholar
• Gallager G., Parekh A. A generalized processor sharing approach to flow control in integrated services networks: The multiple node case. IEEE/ACM Trans. Networking (1994) 2(2):137–150Crossref, Google Scholar
• Gamarnik D. Using fluid models to prove stability of adversarial queueing networks. IEEE Trans. Automatic Control (2000) 45(4):741–746Crossref, Google Scholar
• Gamarnik D. Stability of adaptive and nonadaptive packet routing policies in adversarial queueing networks. SIAM J. Comput. (2003) 32(2):371–385Crossref, Google Scholar
• Gamarnik D., Zeevi A. Validity of heavy traffic steady-state approximations in open queueing networks. Ann. Appl. Probab. (2006) 16(1):56–90Crossref, Google Scholar
• Ganesh A., O'Connell N., Wischik D.Big Queues (2004) 1838(Springer-Verlag, Berlin) Lecture Notes in MathematicsCrossref, Google Scholar
• Stability of networks and protocols in the adversarial queueing model for packet routingProc. 10th ACM-SIAM Sympos. Discrete Algorithms(Society for Industrial and Applied Mathematics, Philadelphia) Google Scholar
• Harrison J. M.Brownian Motion and Stochastic Flow Systems (1990) (Krieger Publishing Company, Malabar, FL) Google Scholar
• Harrison J. M. Stochastic networks and activity analysis. Ann. Appl. Probab. (2000) 10:75–103Crossref, Google Scholar
• Jin H., Ou J., Kumar P. R. The throughput of irreducible closed Markovian queueing networks: Functional bounds, asymptotic loss, efficiency, and the Harrison-Wein conjectures. Math. Oper. Res. (1997) 22(4):886–920Link, Google Scholar
• Kleinrock L.Queueing Systems (1975) (John Wiley & Sons, New York) Google Scholar
• Kumar S., Kumar P. R. Performance bounds for queueing networks and scheduling policies. IEEE Trans. Automatic Control (1994) 39(8):1600–1611Crossref, Google Scholar
• Latouche G., Ramaswami V.Introduction to Matrix Analytic Methods in Stochastic Modeling (1987) (Society for Industrial and Applied Mathematics, Philadelphia) Google Scholar
• Meyn S. P., Tweedie R. L.Markov Chains and Stochastic Stability (1993) (Springer-Verlag, London) Crossref, Google Scholar
• Morrison J., Kumar P. R. New linear program performance bounds for queueing networks. J. Optim. Theory Appl. (1999) 100(3):575–597Crossref, Google Scholar
• Reiman M. I. Open queueing networks in heavy traffic. Math. Oper. Res. (1984) 9(3):441–458Link, Google Scholar
• Shwartz A., Weiss A.Large Deviations for Performance Analysis (1995) (Chapman and Hall, London) Google Scholar
• Sigman K. The stability of open queueing networks. Stochastic Processes Their Appl. (1990) 35(1):11–25Crossref, Google Scholar
• Soyster A. L. Convex programming with set-inclusive constraints and applications to inexact linear programming. Oper. Res. (1973) 21(5):1154–1157Link, Google Scholar
• Turner J. New directions in communications, or which way to the information age? IEEE Commun. Mag. (1986) 24:8–15Crossref, Google Scholar
• Whitt W.Stochastic-Process Limits (2002) (Springer, London) Crossref, Google Scholar