scientific article; zbMATH DE number 3562235
From MaRDI portal
Publication:4134686
Cited in
(only showing first 100 items - show all)- Heavy traffic analysis of open processing networks with complete resource pooling: asymptotic optimality of discrete review policies
- Stationary queuing systems with dependencies
- The use of relative priorities in optimizing the performance of a queueing system
- Processor sharing: a survey of the mathematical theory
- Cooperation in Markovian queueing models
- Batch processor sharing with hyper-exponential service time
- Waiting times of a finite-capacity multi-server model with non-preemptive priorities
- Application des lois non paramétriques dans les systèmes d'attente et la théorie de renouvellement
- A cost-equation analysis of general-input general-service processor sharing system
- Queueing systems with correlated arrival flows and their applications to modeling telecommunication networks
- An analytical model for loss estimation in network traffic analysis systems
- Optimization of Pipelining and Data Processing
- Parallel trace-driven simulation of packet-switched multiplexer under priority scheduling policy
- A novel scheduling index rule proposal for QoE maximization in wireless networks
- The advantage of relative priority regimes in multi-class multi-server queueing systems with strategic customers
- Bayesian estimation of traffic intensity based on queue length in a multi-server \(\mathrm{M}/\mathrm{M}/s\) queue
- Diffusion approximation for a web-server system with proxy servers
- Efficient visit frequencies for polling tables: Minimization of waiting cost
- Diffusion limits of limited processor sharing queues
- Queueing theory in the context of shared resources
- Assignment of a job load in a distributed system: A multicriteria design method
- Properties of the Gittins index with application to optimal scheduling
- A general workload conservation law with applications to queueing systems
- Analysis of a discrete-time preemptive resume priority buffer
- A stochastic equilibrium model of internet pricing
- Estudio bayesiano de los periodos de ocupacion y desocupacion en una cola M/M/1/∞/FIFO en equilibrio
- Stabilizing performance in a single-server queue with time-varying arrival rate
- Perturbation analysis of the \(\mathrm{GI}/\mathrm{M}/s\) queue
- Chaos in a simple deterministic queueing system
- Auxiliary variables for Bayesian inference in multi-class queueing networks
- Constant time per edge is optimal on rooted tree networks
- Queueing systems with leadtime constraints: a fluid-model approach for admission and sequencing control
- The M/G/1 processor-sharing model: Transient behavior
- Queueing with priorities and standard service: stoppable and unstoppable servers
- Allocating capacity in parallel queues to improve their resilience to deliberate attack
- Eine Planungsmethode für das Vermittlungsnetz eines Datennetzes mit Paketvermittlung
- Price-coupled scheduling for differentiated services: Gcµversus GPS
- Impact of nonparametric density estimation on the approximation of the G/G/1 queue by the M/G/1 one
- Numerical analysis of multi-server queues with deterministic service and special phase-type arrivals
- A closed queuing network model with single servers for multi-threaded architecture
- Cyclic Bernoulli polling
- Heavy-tailed limits for medium size jobs and comparison scheduling
- Optimal choice of threshold in two level processor sharing
- A Spectral Method for a Nonpreemptive PriorityBMAP/G/1 QUEUE
- Optimal Control of an M/G/1 Priority Queue Via N-Control
- Handling load with less stress
- Interest of boundary kernel density techniques in evaluating an approximation error of queueing systems characteristics
- A survey on performance analysis of warehouse carousel systems
- Workloads and waiting times in single-server systems with multiple customer classes
- M/G/1 round robin discipline
- Optimization of an internationally distributed air-ground airline telecommunication system
- Uncapacitated point-to-multipoint network flow problem and its application to multicasting in telecommunication networks
- Estimation of prioritized disciplines efficiency based on the metamodel of multi-flows queueing systems
- Simple analytical solutions for the \(\mathrm{M}^b/\mathrm{E}_k/1/m, \mathrm{E}_k/\mathrm{M}^b/1/m\), and related queues
- Top percentile network pricing and the economics of multi-homing
- A heavy-traffic comparison of shared and segregated buffer schemes for queues with the head-of-line processor-sharing discipline
- Studying the queue length in a single-server queueing system with unreliable server
- Steady state approximations of limited processor sharing queues in heavy traffic
- Extension of the class of queueing systems with delay
- Pricing and distributed QoS control for elastic network traffic
- Recent issues on stochastic directional convexity, and new results on the analysis of systems for communication, information, time scales and maintenance
- An algorithmic analysis of the \(BMAP/MSP/1\) generalized processor-sharing queue
- Expected waiting times in polling systems under priority disciplines
- A state dependent M/M/1 queue: A production-inventory model
- Interoutput times in processor sharing queues with feedback
- Analysis of transient queues with semidefinite optimization
- A heuristic approach for capacity expansion of packet networks
- SOJOURN TIMES IN NON-HOMOGENEOUS QBD PROCESSES WITH PROCESSOR SHARING
- APPROXIMATION OF TANDEM QUEUES VIA ISOMORPHS
- RPA pathwise derivative estimation of ruin probabilities
- \(M/G/1/\mathrm{MLPS}\) compared with \(M/G/1/\mathrm{PS}\) within service time distribution class IMRL
- Queueing networks with path-dependent arrival processes
- Capacity planning in manufacturing and computer networks
- Nonclairvoyant scheduling
- Graceful reassignment of excessively long communications paths in networks
- On an interdependent communication network.
- Robust analysis in stochastic simulation: computation and performance guarantees
- On the capacity assignment problem in packet-switching computer networks
- A discrete-time round-robin queue with Bernoulli input and general arithmetic service time distributions
- Design and analysis of fault-tolerant multibus interconnection networks
- The Aumann-Shapley price mechanism for allocating congestion costs
- Performance evaluation of scheduling control of queueing networks: Fluid model heuristics
- On arrival driven queueing models: Admission control, traffic policing, abandonments, and correlated arrivals
- Waiting time distributions for closed \(M/M/N\) processor sharing queues
- Routing and staffing in customer service chat systems with impatient customers
- Delay-minimizing capacity allocation in an infinite server-queueing system
- Fluid and diffusion limits for transient sojourn times of processor sharing queues with time varying rates
- An improved balanced job bound analysis of closed queueing networks
- Routing Algorithmen in Datennetzen - eine vergleichende Simulationsstudie. (Routing algorithms in data networks - a comparing simulation study)
- The M/G/1 queue with processor sharing and its relation to a feedback queue
- A note on comparing response times in the \(M/GI/1/FB\) and \(M/GI/1/PS\) queues
- Perfect and nearly perfect sampling of work-conserving queues
- The role of stochastic programming in communication network design
- Dynamic interactive stabilization of systems of flow with processor sharing
- Analysis of multiclass Markovian polling systems with feedback and composite scheduling algorithms
- Optimal pricing and capacity sizing for the $GI/GI/1$ queue
- The efficiency of two groups of heterogeneous stations cared for by r operatives with a priority group
- On asymptotic optimization of a class of nonlinear stochastic hybrid systems
- Strategic joining in a single-server retrial queue with batch service
- Quality-related measures of unreliable machines with preventive maintenance
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4134686)