scientific article; zbMATH DE number 3562235
From MaRDI portal
Publication:4134686
Cited in
(only showing first 100 items - show all)- Steady state approximations of limited processor sharing queues in heavy traffic
- Heavy traffic analysis of maximum pressure policies for stochastic processing networks with multiple bottlenecks
- Distribution systems design with role dependent objectives
- Calculation of output characteristics of a priority queue through a busy period analysis
- Queuing system with infinite buffer and stepwise inflow intensity
- Approximate counting: a detailed analysis
- Direct martingale arguments for stability: The M/G/1 case
- On the Kleinrock-Nilsson problem of optimal scheduling algorithms for time-shared systems
- Bedienungstheorie: Tendenzen und neuere Entwicklungen. (Servicing theory: Tendencies and new developments)
- Output flows in queueing networks
- A methodology for multicriteria network partitioning
- Temporal stochastic convexity and concavity
- On the capacity assignment problem in packet-switching computer networks
- Processor-sharing queues: Some progress in analysis
- Approximations for waiting time in GI/G/1 systems
- Interoutput times in processor sharing queues with feedback
- An analysis of finite capacity queues with priority scheduling and common or reserved waiting areas
- A queueing-location model with expected service time dependent queueing disciplines
- A priority M/G/1 queue with application to voice/data communication
- On nodal blocking of a retransmitted packet in a computer communication network
- Analysis of a prioritized CSMA protocol based on staggered delays
- On the asymptotic network delay in a model of packet switching
- Transient solution of the virtual waiting time of a single-server queue and its applications
- A discrete-time round-robin queue with Bernoulli input and general arithmetic service time distributions
- Fiducial intervals for the waiting time in batch and time-sharing systems
- Partage de taches entre processeurs homogenes
- Mehrstufige-Auswahldisziplin in einem M/G/1 Processor-Sharing System mit Prioritaeten
- Routing through a network with maximum reliability
- Eine Planungsmethode für das Vermittlungsnetz eines Datennetzes mit Paketvermittlung
- Efficient visit frequencies for polling tables: Minimization of waiting cost
- A heavy-traffic comparison of shared and segregated buffer schemes for queues with the head-of-line processor-sharing discipline
- The M/G/1 queue with processor sharing and its relation to a feedback queue
- Priority queues with batch Poisson arrivals
- Exact and approximate numerical solutions to steady-state single-server queues: \(M/G/1\) -- a unified approach
- 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
- A cyclic-service finite source model with round-robin scheduling
- A note on the pseudo-conservation law for a multi-queue with local priority
- Performance analysis of an ISDN switch with distributed architecture: Circuit switched calls
- Bounds and approximation for clocked interprocessor communication
- A system for priority routing and capacity assignment in packet switched networks
- Approximation for the mean value performance of locking algorithms for distributed database systems: A partitioned database
- Design and analysis of fault-tolerant multibus interconnection networks
- Routing and buffer allocation models for a telecommunication system with heterogeneous devices
- A review of open queueing network models of manufacturing systems
- The transient solution to a class of Markovian queues
- Decomposable score function estimators for sensitivity analysis and optimization of queueing networks
- M/G/1 round robin discipline
- Machine allocation problems in manufacturing networks
- A state dependent M/M/1 queue: A production-inventory model
- Optimizing flow rates in a queueing network with side constraints
- On managing operating capacity to reduce congestion in service systems
- Capacity planning in manufacturing and computer networks
- A heuristic approach for capacity expansion of packet networks
- An exploration of models that minimize leadtime through batching of arrived orders
- Waiting times of a finite-capacity multi-server model with non-preemptive priorities
- On the sojourn times for many-queue head-of-the-line processor-sharing systems with permanent customers
- On asymptotic optimization of a class of nonlinear stochastic hybrid systems
- Analysis of expected queueing delays for decision making in production planning
- Using different response-time requirements to smooth time-varying demand for service
- Pseudo-cyclic policies for multi-queue single server systems
- Analytical loading models in flexible manufacturing systems
- The M/G/1 processor-sharing model: Transient behavior
- Limiting results for multiprocessor systems with breakdowns and repairs
- Rare events in queueing systems -- A survey
- Distributed algorithms for multiple entries to a critical section with priority
- Simultaneous determination of capacities and load in parallel \(M/M/1\) queues
- Nonclairvoyant scheduling
- On bounds of response time performance achievable by multiclass single- server queues
- Definitions, characterizations and structural properties of probability distributions similar to the exponential
- The efficiency of two groups of heterogeneous stations cared for by r operatives with a priority group
- Routing and capacity assignment in backbone communication networks
- \(N\) parallel queueing systems with server breakdown and repair
- Assignment of a job load in a distributed system: A multicriteria design method
- Performance bounds for the effectiveness of pooling in multi-processing systems
- A stochastic equilibrium model of internet pricing
- A note on comparing response times in the \(M/GI/1/FB\) and \(M/GI/1/PS\) queues
- RPA pathwise derivative estimation of ruin probabilities
- Allocation of tasks to specialized processors: A planning approach
- The Aumann-Shapley price mechanism for allocating congestion costs
- On preemptive-repeat LIFO queues
- An algorithmic analysis of the BMAP/MSP/1 generalized processor-sharing queue
- Queueing systems with correlated arrival flows and their applications to modeling telecommunication networks
- Asymptotically optimal open-loop load balancing
- Perturbation analysis of the \(\mathrm{GI}/\mathrm{M}/s\) queue
- Vacationing server model for M/G/1 queues for rebuild processing in RAID5 and threshold scheduling for readers and writers
- A novel scheduling index rule proposal for QoE maximization in wireless networks
- Lowest priority waiting time distribution in an accumulating priority Lévy queue
- The advantage of relative priority regimes in multi-class multi-server queueing systems with strategic customers
- Extension of the class of queueing systems with delay
- Dynamic interactive stabilization of systems of flow with processor sharing
- Analysis of multiclass Markovian polling systems with feedback and composite scheduling algorithms
- The role of stochastic programming in communication network design
- Heavy traffic analysis of open processing networks with complete resource pooling: asymptotic optimality of discrete review policies
- Maximum entropy analysis to the \(N\) policy M/G/1 queueing system with server breakdowns and general startup times
- Optimal pricing and capacity sizing for the GI/GI/1 queue
- When random-order-of-service outperforms first-come-first-served
- Energy-performance trade-off for processor sharing queues with setup delay
- A two phase service \(M/G/1\) queue with a finite number of immediate Bernoulli feedbacks
- Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling
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)