Modeling and optimization of M/G/1-type queueing networks: an efficient sensitivity analysis approach
From MaRDI portal
Publication:1958793
DOI10.1155/2010/130319zbMath1195.90033OpenAlexW2105038260WikidataQ58652916 ScholiaQ58652916MaRDI QIDQ1958793
Baoqun Yin, Liang Tang, Jin Zhu, Hong-Sheng Xi
Publication date: 30 September 2010
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/222622
Queues and service in operations research (90B22) Deterministic network models in operations research (90B10)
Related Items (5)
Performance evaluation and dimensioning of \(GI^X/M/c/N\) systems through kernel estimation ⋮ Upper bounds on performance measures of heterogeneous \(M/M/c\) queues ⋮ Throughput maximization of queueing networks with simultaneous minimization of service rates and buffers ⋮ A fast simulation model based on Lindley's recursion for the G/G/1/K queue ⋮ Testing traffic density of a heterogeneous stochastic queueing system using SPRT
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Markov chains and stochastic stability
- Suboptimal RED feedback control for buffered TCP flow dynamics in computer network
- An improved ARED algorithm for congestion control of network transmission
- Asymptotic expansions for the sojourn time distribution in the \(M/G/1\)-PS queue
- On the Markov chain central limit theorem
- Smoothed perturbation analysis algorithms for estimating the derivatives of occupancy-related functions in serial queueing networks
- The relations among potentials, perturbation analysis, and Markov decision processes
- Perturbation realization, potentials, and sensitivity analysis of Markov processes
- Performance optimization of continuous-time Markov control processes based on performance potentials
- The Potential Structure of Sample Paths and Performance Sensitivities of Markov Systems
- Performance optimization algorithms based on potentials for semi-Markov control processes
This page was built for publication: Modeling and optimization of M/G/1-type queueing networks: an efficient sensitivity analysis approach
