scientific article; zbMATH DE number 3562235
From MaRDI portal
Publication:4134686
Cited in
(only showing first 100 items - show all)- Routing through a network with maximum reliability
- Numerical analysis of multi-server queues with deterministic service and special phase-type arrivals
- An analysis of finite capacity queues with priority scheduling and common or reserved waiting areas
- A Spectral Method for a Nonpreemptive PriorityBMAP/G/1 QUEUE
- Handling load with less stress
- On the nonoptimality of the foreground-background discipline for IMRL service times
- Queueing models for a flexible machining station. I: The diffusion approximation
- The discrete-time preemptive repeat identical priority queue
- An improved balanced job bound analysis of closed queueing networks
- Capacity planning in manufacturing networks with discrete options
- Routing Algorithmen in Datennetzen - eine vergleichende Simulationsstudie. (Routing algorithms in data networks - a comparing simulation study)
- A queueing model for a terminal system subject to breakdowns
- On the finite-source \(\vec G/M/r\) queue
- Optimizing utilization under response time constraints
- On the Gittins index in the M/G/1 queue
- An exploration of models that minimize leadtime through batching of arrived orders
- Optimal static distribution of prioritized customers to heterogeneous parallel servers
- Interdeparture times in M/G/1 queueing systems with non-preemptive priority discipline
- Deadlock-free routing in k-ary hypercube network in presence of processor failures
- Perturbation analysis of the \(\mathrm{GI}/\mathrm{M}/s\) queue
- A stochastic equilibrium model of internet pricing
- A queueing model for a non-homogeneous terminal system subject to BR992
- Performance evaluation of scheduling control of queueing networks: Fluid model heuristics
- Randomized pushing-out in the priority queueing with a finite buffer size
- Optimal adaptive control of priority assignment in queueing systems
- Distribution systems design with role dependent objectives
- \(M/G/1/MLPS\) compared to \(M/G/1/PS\)
- Continuous approximations of the machine repair system
- Refining diffusion approximations for queues
- Optimizing uniform non-Markov queueing networks
- An efficient method to determine the optimal configuration of a flexible manufacturing system
- A paradox in optimal flow control of \(M/M/n\) queues
- First-fit allocation of queues: Tight probabilistic bounds on wasted space
- Controllable Markov jump processes. II: Monitoring and optimization of TCP connections
- The paging drum queue: A uniform perspective and further results
- Analysis of expected queueing delays for decision making in production planning
- Maximum entropy analysis to the \(N\) policy M/G/1 queueing system with server breakdowns and general startup times
- On the capacity assignment problem in packet-switching computer networks
- Parallel trace-driven simulation of packet-switched multiplexer under priority scheduling policy
- Approximations for the conditional waiting times in the GI/G/c queue
- Stable strategies for processor sharing systems
- A queueing theoretic approach for performance evaluation of low-power multi-core embedded systems
- System planning and configuration problems for optimal system design
- \(M/G/1/\mathrm{MLPS}\) compared with \(M/G/1/\mathrm{PS}\) within service time distribution class IMRL
- Optimal Control of an M/G/1 Priority Queue Via N-Control
- An algorithmic analysis of the \(BMAP/MSP/1\) generalized processor-sharing queue
- Competitive routing over time
- Robust analysis in stochastic simulation: computation and performance guarantees
- Approximations for waiting time in GI/G/1 systems
- Constant time per edge is optimal on rooted tree networks
- Task assignment in multiple server farms using preemptive migration and flow control
- Priority queues with batch Poisson arrivals
- On the sojourn times for many-queue head-of-the-line processor-sharing systems with permanent customers
- The throughput performance of a prioritized LIFO service discipline
- A heavy-traffic comparison of shared and segregated buffer schemes for queues with the head-of-line processor-sharing discipline
- A discrete-time round-robin queue with Bernoulli input and general arithmetic service time distributions
- Multi-objective routing within large scale facilities using open finite queueing networks
- Rare events in queueing systems -- A survey
- The efficiency of two groups of heterogeneous stations cared for by \(r\) operatives with a priority group
- A heuristic approach for capacity expansion of packet networks
- Heavy-tailed limits for medium size jobs and comparison scheduling
- Optimal choice of threshold in two level processor sharing
- An overview for Markov decision processes in queues and networks
- Quantitative Estimates in an M2/G2/1 Priority Queue with Non-Preemptive Priority: The Method of Strong Stability
- Chaos in a simple deterministic queueing system
- Estudio bayesiano de los periodos de ocupacion y desocupacion en una cola M/M/1/∞/FIFO en equilibrio
- Queueing networks with path-dependent arrival processes
- Bayesian estimation of traffic intensity based on queue length in a multi-server \(\mathrm{M}/\mathrm{M}/s\) queue
- Eine Planungsmethode für das Vermittlungsnetz eines Datennetzes mit Paketvermittlung
- SOJOURN TIMES IN NON-HOMOGENEOUS QBD PROCESSES WITH PROCESSOR SHARING
- Simple analytical solutions for the \(\mathrm{M}^b/\mathrm{E}_k/1/m, \mathrm{E}_k/\mathrm{M}^b/1/m\), and related queues
- Stationary queuing systems with dependencies
- Diffusion approximation for a web-server system with proxy servers
- Batch sojourn time in the \(M^{[X]}/M/1\) processor sharing queue with geometric batch size
- On preemptive-repeat LIFO queues
- Energy-performance trade-off for processor sharing queues with setup delay
- Fractional compound Poisson processes with multiple internal states
- Assignment of a job load in a distributed system: A multicriteria design method
- Computing steady-state queueing-time distributions of single-server queues:GI X /M/1
- Examples of Applications of Queueing Theory in Canada
- Capacity planning in manufacturing and computer networks
- On bounds of response time performance achievable by multiclass single- server queues
- Optimization of uniform non-Markov queueing networks using resources and transition probabilities redistribution
- A general workload conservation law with applications to queueing systems
- On managing operating capacity to reduce congestion in service systems
- Queuing system with infinite buffer and stepwise inflow intensity
- Output flows in queueing networks
- Design and analysis of fault-tolerant multibus interconnection networks
- Impact of nonparametric density estimation on the approximation of the G/G/1 queue by the M/G/1 one
- A cyclic-service finite source model with round-robin scheduling
- A note on the pseudo-conservation law for a multi-queue with local priority
- Calculating the \(M/G/1\) busy-period density and LIFO waiting-time distribution by direct numerical transform inversion
- High-priority expected waiting times in the delayed accumulating priority queue with applications to health care KPIs
- Asymptotically optimal open-loop load balancing
- Queueing with priorities and standard service: stoppable and unstoppable servers
- A state dependent M/M/1 queue: A production-inventory model
- The use of relative priorities in optimizing the performance of a queueing system
- A foreground-background queueing model with speed or capacity modulation
- Pricing and distributed QoS control for elastic network traffic
- Routing and buffer allocation models for a telecommunication system with heterogeneous devices
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)