Product-Form Queueing Networks
暂无分享,去创建一个
[1] A product form for the general stochastic matching model , 2017, Journal of Applied Probability.
[2] Rhonda Righter,et al. Product forms for FCFS queueing models with arbitrary server-job compatibilities: an overview , 2020, Queueing Systems.
[3] Gideon Weiss,et al. Directed FCFS infinite bipartite matching , 2019, Queueing Systems.
[4] Gideon Weiss,et al. Design heuristic for parallel many server systems , 2019, Eur. J. Oper. Res..
[5] Sem C. Borst,et al. Scalable Load Balancing in Networked Systems: Universality Properties and Stochastic Coupling Methods , 2017, Proceedings of the International Congress of Mathematicians (ICM 2018).
[6] B. Upadhyaya. Queues , 2019, Data Structures and Algorithms with Scala.
[7] Leslie D. Servi,et al. A Distributional Form of Little's Law , 2018 .
[8] Sem C. Borst,et al. Universality of Power-of-d Load Balancing in Many-Server Systems , 2016, Stochastic Systems.
[9] Gideon Weiss,et al. Reversibility and Further Properties of FCFS Infinite Bipartite Matching , 2018, Math. Oper. Res..
[10] David Gamarnik,et al. Join the Shortest Queue with Many Servers. The Heavy-Traffic Asymptotics , 2015, Math. Oper. Res..
[11] Gideon Weiss,et al. FCFS Parallel Service Systems and Matching Models , 2017, VALUETOOLS.
[12] Alan Scheller-Wolf,et al. Queueing with redundant requests: exact analysis , 2016, Queueing Syst. Theory Appl..
[13] J. Tsitsiklis,et al. Delay, Memory, and Messaging Tradeoffs in Distributed Service Systems , 2016, SIGMETRICS.
[14] Gideon Weiss,et al. Four proofs of Gittins’ multiarmed bandit theorem , 2016, Ann. Oper. Res..
[15] Jean Mairesse,et al. Stability of the stochastic matching model , 2014, Journal of Applied Probability.
[16] Gideon Weiss,et al. Local stability in a transient Markov chain , 2015, 1511.06094.
[17] Alexander L. Stolyar. Pull-based load distribution in large-scale heterogeneous service systems , 2015, Queueing Syst. Theory Appl..
[18] Yoni Nazarathy,et al. Stability of multi-class queueing networks with infinite virtual queues , 2014, Queueing Syst. Theory Appl..
[19] Yoni Nazarathy,et al. Non-existence of stabilizing policies for the critical push-pull network and generalizations , 2012, Oper. Res. Lett..
[20] Gideon Weiss,et al. Exact FCFS Matching Rates for Two Infinite Multitype Sequences , 2012, Oper. Res..
[21] Gideon Weiss,et al. A product form solution to a system with multi-type jobs and multi-type servers , 2012, Queueing Syst. Theory Appl..
[22] Avishai Mandelbaum,et al. Queues with Many Servers and Impatient Customers , 2012, Math. Oper. Res..
[23] Amy R. Ward. Asymptotic analysis of queueing systems with reneging: A survey of results for FIFO, single class models , 2012 .
[24] Yoni Nazarathy,et al. The asymptotic variance of departures in critically loaded queues , 2010, Advances in Applied Probability.
[25] R. Bass,et al. Review: P. Billingsley, Convergence of probability measures , 1971 .
[26] F. Baccelli,et al. Elements of Queueing Theory: Palm Martingale Calculus and Stochastic Recurrences , 2010 .
[27] J. G. Dai,et al. Customer Abandonment in Many-Server Queues , 2010, Math. Oper. Res..
[28] Ward Whitt,et al. Service-Level Differentiation in Many-Server Service Systems via Queue-Ratio Routing , 2010, Oper. Res..
[29] Yoni Nazarathy,et al. Positive Harris recurrence and diffusion scale analysis of a push pull queueing network , 2008, Perform. Evaluation.
[30] Douglas G. Down,et al. Fluid Limits for Shortest Remaining Processing Time Queues , 2009, Math. Oper. Res..
[31] Jiankui Yang. A Simple proof for the stability of global FIFO queueing networks , 2009 .
[32] Gideon Weiss,et al. Fcfs infinite bipartite matching of servers and customers , 2009, Advances in Applied Probability.
[33] Yoni Nazarathy,et al. Near optimal control of queueing networks over a finite time horizon , 2009, Ann. Oper. Res..
[34] Yoni Nazarathy,et al. A Push–Pull Network with Infinite Supply of Work , 2009, Queueing Syst. Theory Appl..
[35] Ward Whitt,et al. Queue-and-Idleness-Ratio Controls in Many-Server Service Systems , 2009, Math. Oper. Res..
[36] Aarnout Brombacher,et al. Probability... , 2009, Qual. Reliab. Eng. Int..
[37] R. Cottle. Linear Complementarity Problem , 2009, Encyclopedia of Optimization.
[38] E. Seneta. Non-negative Matrices and Markov Chains , 2008 .
[39] Gideon Weiss,et al. A simplex based algorithm to solve separated continuous linear programs , 2008, Math. Program..
[40] S. Shreve,et al. An explicit formula for the Skorokhod map on [0,a]. , 2007, 0710.2977.
[41] Peter W. Glynn,et al. Stochastic Simulation: Algorithms and Analysis , 2007 .
[42] Gideon Weiss,et al. Analysis of a simple Markovian re-entrant line with infinite supply of work under the LBFS policy , 2006, Queueing Syst. Theory Appl..
[43] Amarjit Budhiraja,et al. Diffusion approximations for controlled stochastic networks: An asymptotic bound for the value function , 2006 .
[44] Ward Whitt,et al. Fluid Models for Multiserver Queues with Abandonments , 2006, Oper. Res..
[45] Avishai Mandelbaum,et al. Call Centers with Impatient Customers: Many-Server Asymptotics of the M/M/n + G Queue , 2005, Queueing Syst. Theory Appl..
[46] Lisa Fleischer,et al. Efficient Algorithms for Separated Continuous Linear Programs: The Multicommodity Flow Problem with Holding Costs and Extensions , 2005, Math. Oper. Res..
[47] J. G. Dai,et al. Maximum Pressure Policies in Stochastic Processing Networks , 2005, Oper. Res..
[48] S. Foss,et al. AN OVERVIEW OF SOME STOCHASTIC STABILITY METHODS( Network Design, Control and Optimization) , 2004 .
[49] James R. Jackson,et al. Jobshop-Like Queueing Systems , 2004, Manag. Sci..
[50] H. C. Gromoll. Diffusion approximation for a processor sharing queue in heavy traffic , 2004, math/0405298.
[51] J. Dai,et al. Stability and instability of a two-station queueing network , 2004 .
[52] A. Stolyar. MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic , 2004 .
[53] J. Obłój. The Skorokhod embedding problem and its offspring , 2004, math/0401114.
[54] D. Gamarnik,et al. Instability in stochastic and fluid queueing networks , 2003, math/0311206.
[55] J. Harrison. A broader view of Brownian networks , 2003 .
[56] Amber L. Puha,et al. THE FLUID LIMIT OF A HEAVILY LOADED PROCESSOR SHARING QUEUE , 2002 .
[57] J. Michael Harrison,et al. Stochastic Networks and Activity Analysis , 2002 .
[58] J. Tsitsiklis,et al. Performance of Multiclass Markovian Queueing Networks Via Piecewise Linear Lyapunov Functions , 2001 .
[59] Michael Mitzenmacher,et al. The Power of Two Choices in Randomized Load Balancing , 2001, IEEE Trans. Parallel Distributed Syst..
[60] H. Kushner. Heavy Traffic Analysis of Controlled Queueing and Communication Networks , 2001 .
[61] John H. Vande Vate,et al. The Stability of Two-Station Multitype Fluid Networks , 2000, Oper. Res..
[62] J. Harrison. Correction: Brownian models of open processing networks: canonical representation of workload , 2000, math/0610352.
[63] Hong Chen,et al. Stability of Multiclass Queueing Networks Under , 1996 .
[64] Winfried K. Grassmann,et al. Matrix Analytic Methods , 2000 .
[65] H. Kushner. Numerical Methods for Stochastic Control Problems in Continuous Time , 2000 .
[66] Ronald J. Williams,et al. Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: asymptotic optimality of a threshold policy , 2001 .
[67] R. Serfozo. Introduction to Stochastic Networks , 1999 .
[68] M. Bramson. A stable queueing network with unstable fluid model , 1999 .
[69] Ijbf Ivo Adan,et al. Bounds for performance characteristics : a systematic approach via cost structures , 1998 .
[70] Hong Chen,et al. Stability of Multiclass Queueing Networks Under FIFO Service Discipline , 1997, Math. Oper. Res..
[71] Jan A. Van Mieghem,et al. Dynamic Control of Brownian Networks: State Space Collapse and Equivalent Workload Formulations , 1997 .
[72] Fengyuan Ren,et al. Scheduling " , , 1997 .
[73] J. Tsitsiklis,et al. Stability conditions for multiclass fluid queueing networks , 1996, IEEE Trans. Autom. Control..
[74] Srinivas R. Chakravarthy,et al. Matrix-Analytic Methods in Stochastic Models , 1996 .
[75] Gideon Weiss,et al. Stability and Instability of Fluid Models for Reentrant Lines , 1996, Math. Oper. Res..
[76] Sean P. Meyn,et al. Duality and linear programs for stability and performance analysis of queuing networks and scheduling policies , 1996, IEEE Trans. Autom. Control..
[77] R. L. Dobrushin,et al. Queueing system with selection of the shortest of two queues: an assymptotic approach , 1996 .
[78] G. Dai. A Fluid-limit Model Criterion for Instability of Multiclass Queueing Networks , 1996 .
[79] Hong Chen. Fluid Approximations and Stability of Multiclass Queueing Networks: Work-Conserving Disciplines , 1995 .
[80] Leandros Tassiulas,et al. Adaptive back-pressure congestion control based on local information , 1995, IEEE Trans. Autom. Control..
[81] J. Dai. On Positive Harris Recurrence of Multiclass Queueing Networks: A Unified Approach Via Fluid Limit Models , 1995 .
[82] Gideon Weiss,et al. On optimal draining of re-entrant fluid lines , 1995 .
[83] W. Whitt,et al. PIECEWISE-LINEAR DIFFUSION PROCESSES , 1995 .
[84] ModelsJim Dai,et al. Stability and Convergence of Moments for Multiclass Queueing Networks via Fluid Limit Models , 1995 .
[85] M. Bramson. Instability of FIFO Queueing Networks , 1994 .
[86] Sean P. Meyn,et al. Stability of Generalized Jackson Networks , 1994 .
[87] Robert J. Plemmons,et al. Nonnegative Matrices in the Mathematical Sciences , 1979, Classics in Applied Mathematics.
[88] D. Botvich,et al. Ergodicity of conservative communication networks , 1994 .
[89] Hong Chen,et al. Hierarchical Modeling of Stochastic Networks, Part II: Strong Approximations , 1994 .
[90] Hong Chen,et al. Hierarchical Modeling of Stochastic Networks, Part I: Fluid Models , 1994 .
[91] Whm Henk Zijm,et al. A compensation approach for two-dimensional Markov processes , 1993, Advances in Applied Probability.
[92] Richard L. Tweedie,et al. Markov Chains and Stochastic Stability , 1993, Communications and Control Engineering Series.
[93] C. Laws. Resource pooling in queueing networks with dynamic routing , 1992, Advances in Applied Probability.
[94] J. Harrison,et al. Reflected Brownian Motion in an Orthant: Numerical Methods for Steady-State Analysis , 1992 .
[95] A. A. Borovkov,et al. STOCHASTICALLY RECURSIVE SEQUENCES AND THEIR GENERALIZATIONS , 1992 .
[96] P. R. Kumar,et al. Distributed scheduling based on due dates and buffer priorities , 1991 .
[97] Hong Chen,et al. Stochastic discrete flow networks : diffusion approximations and bottlenecks , 1991 .
[98] Erol Gelenbe,et al. Product-form queueing networks with negative and positive customers , 1991, Journal of Applied Probability.
[99] Lawrence M. Wein. Brownian Networks with Discretionary Routing , 1991, Oper. Res..
[100] P. Glynn,et al. A new view of the heavy-traffic limit theorem for infinite-server queues , 1991, Advances in Applied Probability.
[101] J. Harrison,et al. Steady-State Analysis of RBM in a Rectangle: Numerical Methods and A Queueing Application , 1991 .
[102] Lawrence M. Wein,et al. Optimal Control of a Two-Station Brownian Network , 2015, Math. Oper. Res..
[103] Leandros Tassiulas,et al. Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1990, 29th IEEE Conference on Decision and Control.
[104] Lawrence M. Wein,et al. Scheduling Networks of Queues: Heavy Traffic Analysis of a Two-Station Closed Network , 1990, Oper. Res..
[105] K. Sigman. The stability of open queueing networks , 1990 .
[106] Zhang Hanqin,et al. MULTIPLE CHANNEL QUEUES IN HEAVY TRAFFIC , 1990 .
[107] Lawrence M. Wein,et al. Scheduling Networks of Queues: Heavy Traffic Analysis of a Two-Station Network with Controllable Inputs , 1990, Oper. Res..
[108] J Jaap Wessels,et al. Analysis of the asymmetric shortest queue problem , 1991, Queueing Syst. Theory Appl..
[109] Norman S. Matloff,et al. On the Value of Predictive Information in a Scheduling Problem , 1989, Perform. Evaluation.
[110] P. R. Kumar,et al. Dynamic instabilities and stabilization methods in distributed real-time scheduling of manufacturing systems , 1989, Proceedings of the 28th IEEE Conference on Decision and Control,.
[111] F. Baccelli,et al. A sample path analysis of the M/M/1 queue , 1989, Journal of Applied Probability.
[112] Onno Boxma,et al. SOJOURN TIMES IN FEEDBACK QUEUES , 1989 .
[113] Onno Boxma,et al. Sojourn times in queueing networks , 1989 .
[114] Christian M. Ernst,et al. Multi-armed Bandit Allocation Indices , 1989 .
[115] Lawrence M. Wein,et al. Scheduling semiconductor wafer fabrication , 1988 .
[116] Hong Chen,et al. Empirical Evaluation of a Queueing Network Model for Semiconductor Wafer Fabrication , 1988, Oper. Res..
[117] J. Michael Harrison,et al. Brownian Models of Queueing Networks with Heterogeneous Customer Populations , 1988 .
[118] Onno Boxma,et al. Sojourn times in feedback and processor sharing queues , 1988 .
[119] Ruth J. Williams,et al. Brownian Models of Open Queueing Networks with Homogeneous Customer Populations , 1987 .
[120] A. Lemoine. On sojourn time in Jackson networks of queues , 1987, Journal of Applied Probability.
[121] Ruth J. Williams,et al. Multidimensional Reflected Brownian Motions Having Exponential Stationary Distributions , 1987 .
[122] T. Kurtz. Approximation of Population Processes , 1987 .
[123] R. Schassberger. Two remarks on insensitive stochastic models , 1986, Advances in Applied Probability.
[124] Ward Whitt,et al. Deciding Which Queue to Join: Some Counterexamples , 1986, Oper. Res..
[125] Bruce E. Hajek,et al. Extremal Splittings of Point Processes , 1985, Math. Oper. Res..
[126] Jonathan Goodman,et al. NON-ERGODIC JACKSON NETWORK. , 1984 .
[127] Martin I. Reiman,et al. Open Queueing Networks in Heavy Traffic , 1984, Math. Oper. Res..
[128] Mark H. A. Davis. Piecewise‐Deterministic Markov Processes: A General Class of Non‐Diffusion Stochastic Models , 1984 .
[129] Tapani Lehtonen,et al. On the optimality of the shortest line discipline , 1984 .
[130] W. Henderson. Insensitivity and reversed Markov processes , 1983, Advances in Applied Probability.
[131] J. Michael Harrison,et al. Instantaneous Control of Brownian Motion , 1983, Math. Oper. Res..
[132] Ronald W. Wolff,et al. Poisson Arrivals See Time Averages , 1982, Oper. Res..
[133] W. Whitt. On the heavy-traffic limit theorem for GI/G/∞ queues , 1982, Advances in Applied Probability.
[134] J. Harrison,et al. On the distribution of m ultidimen-sional reflected Brownian motion , 1981 .
[135] Ward Whitt,et al. Heavy-Traffic Limits for Queues with Many Exponential Servers , 1981, Oper. Res..
[136] Isi Mitrani,et al. The Distribution of Queuing Network States at Input and Output Instants , 1979, JACM.
[137] Martin Reiser,et al. Mean-value analysis and convolution method for queue-dependent servers in closed queueing networks , 1981, Perform. Evaluation.
[138] Stephen S. Lavenberg,et al. Mean-Value Analysis of Closed Multichain Queuing Networks , 1980, JACM.
[139] P. Gaenssler,et al. Empirical Processes: A Survey of Results for Independent and Identically Distributed Random Variables , 1979 .
[140] K. Mani Chandy,et al. The impact of distributions and disciplines on multiple processor systems , 1979, CACM.
[141] Peter J. Denning,et al. The Operational Analysis of Queueing Network Models , 1978, CSUR.
[142] R. Weber. On the optimal assignment of customers to parallel servers , 1978, Journal of Applied Probability.
[143] A. J. Taylor,et al. Optimal control of a Brownian storage system , 1978 .
[144] Donald F. Towsley,et al. Product Form and Local Balance in Queueing Networks , 1977, JACM.
[145] G. Klimov. Time-Sharing Service Systems. I , 1975 .
[146] Hisashi Kobayashi,et al. Queuing Networks with Multiple Closed Chains: Theory and Computational Algorithms , 1975, IBM J. Res. Dev..
[147] K. Mani Chandy,et al. Open, Closed, and Mixed Networks of Queues with Different Classes of Customers , 1975, JACM.
[148] Donald Fred Towsley. Local balance models of computer systems. , 1975 .
[149] K. Mani Chandy,et al. Approximate Analysis of General Queuing Networks , 1975, IBM J. Res. Dev..
[150] D. Iglehart. Weak convergence in queueing theory , 1973, Advances in Applied Probability.
[151] F. R. Moore,et al. Computational model of a closed queuing network with exponential servers , 1972 .
[152] Peter J. Bickel,et al. Convergence Criteria for Multiparameter Stochastic Processes and Some Applications , 1971 .
[153] D. Iglehart,et al. Multiple channel queues in heavy traffic. II: sequences, networks, and batches , 1970, Advances in Applied Probability.
[154] L. Dubins. On a Theorem of Skorohod , 1968 .
[155] Linus Schrage,et al. Letter to the Editor - A Proof of the Optimality of the Shortest Remaining Processing Time Discipline , 1968, Oper. Res..
[156] W. J. Gordon,et al. Closed Queuing Systems with Exponential Servers , 1967, Oper. Res..
[157] Linus Schrage,et al. The Queue M/G/1 with the Shortest Remaining Processing Time Discipline , 1966, Oper. Res..
[158] J. L. Smith. An analysis of time-sharing computer systems using Markov models , 1966, AFIPS '66 (Spring).
[159] D. Iglehart. Limiting diffusion approximations for the many server queue and the repairman problem , 1965, Journal of Applied Probability.
[160] A. Borovkov. Some Limit Theorems in the Theory of Mass Service, II Multiple Channels Systems , 1965 .
[161] A. Borovkov. Some Limit Theorems in the Theory of Mass Service , 1964 .
[162] Charles Stone. Limit theorems for random walks, birth and death processes, and diffusion processes , 1963 .
[163] J. Kingman. On Queues in Heavy Traffic , 1962 .
[164] J. Kingman. Two Similar Queues in Parallel , 1961 .
[165] A. Skorokhod. Stochastic Equations for Diffusion Processes in a Bounded Region , 1961 .
[166] Walter L. Smith. Renewal Theory and its Ramifications , 1958 .
[167] B. A. Sevast'yanov. An Ergodic Theorem for Markov Processes and Its Application to Telephone Systems with Refusals , 1957 .
[168] F. G. Foster. On the Stochastic Matrices Associated with Certain Queuing Processes , 1953 .
[169] D. Kendall. Stochastic Processes Occurring in the Theory of Queues and their Analysis by the Method of the Imbedded Markov Chain , 1953 .
[170] A. K. Erlang. The theory of probabilities and telephone conversations , 1909 .