scientific article; zbMATH DE number 3562235
From MaRDI portal
Publication:4134686
Cited in
(only showing first 100 items - show all)- 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
- The transient solution to a class of Markovian queues
- On the Kleinrock-Nilsson problem of optimal scheduling algorithms for time-shared systems
- Decomposable score function estimators for sensitivity analysis and optimization of queueing networks
- A survey on performance analysis of warehouse carousel systems
- Bedienungstheorie: Tendenzen und neuere Entwicklungen. (Servicing theory: Tendencies and new developments)
- The \(( S - 1 , S)\) inventory model and its counterparts in queueing theory
- Combined capacity planning and concentrator location in computer communications networks
- Exclusion in a priority queue
- An analytical interpretation of the discrete approximation for the GI/GI/1 queue1
- Delay-minimizing capacity allocation in an infinite server-queueing system
- A note on comparing response times in the \(M/GI/1/FB\) and \(M/GI/1/PS\) queues
- Simultaneous determination of capacities and load in parallel \(M/M/1\) queues
- M/G/1 round robin discipline
- Server waiting times in infinite supply polling systems with preparation times
- When random-order-of-service outperforms first-come-first-served
- scientific article; zbMATH DE number 4160102 (Why is no real title available?)
- A class of high performance Maekawa-type algorithms for distributed systems under heavy demand
- Classical and Bayesian estimations of performance measures in a single server Markovian queueing system based on arrivals during service times
- To pool or not to pool: queueing design for large-scale service systems
- A cost-equation analysis of general-input general-service processor sharing system
- On the sojourn of an arbitrary customer in an \(M/M/1\) processor sharing queue
- Application des lois non paramétriques dans les systèmes d'attente et la théorie de renouvellement
- Bounds and approximation for clocked interprocessor communication
- Approximation for the mean value performance of locking algorithms for distributed database systems: A partitioned database
- Performance analysis of an ISDN switch with distributed architecture: Circuit switched calls
- Heavy traffic analysis of maximum pressure policies for stochastic processing networks with multiple bottlenecks
- Aggregate order release planning for time-varying demand
- Asymptotic analysis of the sojourn time of a batch in a M [ X ] / M /1 processor sharing queue
- A novel scheduling index rule proposal for QoE maximization in wireless networks
- Bounds on the Mean Delay in Multiclass Queueing Networks under Shortfall-Based Priority Rules
- The advantage of relative priority regimes in multi-class multi-server queueing systems with strategic customers
- Analysis of a prioritized CSMA protocol based on staggered delays
- Pseudo-cyclic policies for multi-queue single server systems
- On nodal blocking of a retransmitted packet in a computer communication network
- Exact and approximate numerical solutions to steady-state single-server queues: \(M/G/1\) -- a unified approach
- Cyclic Bernoulli polling
- A solution procedure for the file allocation problem with file availability and response time
- A multiple criteria model for the allocation of data files in a distributed information system
- Studying the queue length in a single-server queueing system with unreliable server
- RPA pathwise derivative estimation of ruin probabilities
- Achievable performance of blind policies in heavy traffic
- Control of a hybrid stochastic system
- A mathematical model to estimate average response time of parallel programs
- Heavy-traffic analysis of sojourn time under the foreground-background scheduling policy
- Allocating capacity in parallel queues to improve their resilience to deliberate attack
- Recent issues on stochastic directional convexity, and new results on the analysis of systems for communication, information, time scales and maintenance
- Routing and staffing in customer service chat systems with impatient customers
- Minimization of Packet Loss Probability in Network with Fractal Traffic
- The role of stochastic programming in communication network design
- Exact busy period distribution of a discrete queue with quadratic rates
- Waiting times of a finite-capacity multi-server model with non-preemptive priorities
- The disadvantage of the Cμ‐rule when customers are strategic
- A multiple server location-allocation model for service system design
- Partage de taches entre processeurs homogenes
- Mehrstufige-Auswahldisziplin in einem M/G/1 Processor-Sharing System mit Prioritaeten
- Calculation of predicted average packet delay and its application for flow control in data network
- Dynamic interactive stabilization of systems of flow with processor sharing
- \((N, n)\)-preemptive-priority M/G/1 queues with finite and infinite buffers
- Semi-Analytical Methods for Complex Optimization of Non-Markov Queueing Networks
- Analysis of multiclass Markovian polling systems with feedback and composite scheduling algorithms
- A closed queuing network model with single servers for multi-threaded architecture
- Vacationing server model for \(M/G/1\) queues for rebuild processing in RAID5 and threshold scheduling for readers and writers
- Fiducial intervals for the waiting time in batch and time-sharing systems
- Estimation of prioritized disciplines efficiency based on the metamodel of multi-flows queueing systems
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)