Importance Sampling for Weighted-Serve-the-Longest-Queue

References

• Alanyali M., Hajek B. On large deviations of Markov processes with discontinuous statistics. Ann. Appl. Probab. (1998) 8:45–66Crossref, Google Scholar
• Bertsimas D., Paschalidis I. Asymptotic buffer overflow probabilities in multiclass multiplexers: An optimal control approach. IEEE Trans. Automatic Control (1998) 43:315–335Crossref, Google Scholar
• Dupuis P., Ellis R. S. The large deviation principle for a general class of queueing systems. Trans. Amer. Math. Soc. (1996) 347:2689–2751Google Scholar
• Dupuis P., Ellis R. S.A Weak Convergence Approach to the Theory of Large Deviations (1997) (John Wiley & Sons, New York) Crossref, Google Scholar
• Dupuis P., Wang H. Subsolutions of an Isaacs equation and efficient schemes for importance sampling. Math. Oper. Res. (2007) 32:1–35Link, Google Scholar
• Dupuis P., Leder K., Wang H. Large deviations of the weighted-serve-the-longest-queue policy. Progress in Probability (2008) 60(Birkhäuser, Basel, Switzerland) 229–256Google Scholar
• Dupuis P., Sezer A., Wang H. Dynamic importance sampling for queueing networks. Ann. Appl. Probab. (2007) 17(4):1306–1346Crossref, Google Scholar
• Foley R., McDonald D. Join the shortest queue: Stability and exact asymptotics. Ann. Appl. Probab. (2001) 11:569–607Crossref, Google Scholar
• Ignatiouk-Robert I. Large deviations for processes with discontinuous statistics. Ann. Probab. (2005) 33:1479–1508Crossref, Google Scholar
• Puhalskii A., Vladimirov A. A large deviation principle for join the shortest queue. Math. Oper. Res. (2007) 32:700–710Link, Google Scholar
• Ramanan K., Stolyar S. Largest weighted delay first scheduling: Large deviations and optimality. Ann. Appl. Probab. (2001) 11:1–49Crossref, Google Scholar
• Shwartz A., Weiss A.Large Deviations for Performance Analysis: Queues, Communication and Computing (1995) (Chapman and Hall, New York) Google Scholar
• Ying L., Srikant R., Eryilmaz A., Dullerud G. E. A large deviation analysis of scheduling in wireless networks. IEEE Trans. Inform. Theory (2006) 52(11):5088–5098Crossref, Google Scholar