scientific article; zbMATH DE number 3562235
From MaRDI portal
Publication:4134686
zbMATH Open0361.60082MaRDI QIDQ4134686FDOQ4134686
Authors: Leonard Kleinrock
Publication date: 1976
Title of this publication is not available (Why is that?)
Queueing theory (aspects of probability theory) (60K25) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)
Cited In (only showing first 100 items - show all)
- Parallel trace-driven simulation of packet-switched multiplexer under priority scheduling policy
- Constant time per edge is optimal on rooted tree networks
- Perturbation analysis of the \(\mathrm{GI}/\mathrm{M}/s\) queue
- A stochastic equilibrium model of internet pricing
- Numerical analysis of multi-server queues with deterministic service and special phase-type arrivals
- A Spectral Method for a Nonpreemptive PriorityBMAP/G/1 QUEUE
- Optimal Control of an M/G/1 Priority Queue Via N-Control
- Heavy-tailed limits for medium size jobs and comparison scheduling
- Optimal choice of threshold in two level processor sharing
- Handling load with less stress
- A heavy-traffic comparison of shared and segregated buffer schemes for queues with the head-of-line processor-sharing discipline
- An algorithmic analysis of the \(BMAP/MSP/1\) generalized processor-sharing queue
- A heuristic approach for capacity expansion of packet networks
- \(M/G/1/\mathrm{MLPS}\) compared with \(M/G/1/\mathrm{PS}\) within service time distribution class IMRL
- 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
- Performance evaluation of scheduling control of queueing networks: Fluid model heuristics
- 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 efficiency of two groups of heterogeneous stations cared for by \(r\) operatives with a priority group
- First-fit allocation of queues: Tight probabilistic bounds on wasted space
- Priority queues with batch Poisson arrivals
- Controllable Markov jump processes. II: Monitoring and optimization of TCP connections
- Queueing models for a flexible machining station. I: The diffusion approximation
- Randomized pushing-out in the priority queueing with a finite buffer size
- Refining diffusion approximations for queues
- Continuous approximations of the machine repair system
- Multi-objective routing within large scale facilities using open finite queueing networks
- An analysis of finite capacity queues with priority scheduling and common or reserved waiting areas
- Optimizing uniform non-Markov queueing networks
- Maximum entropy analysis to the \(N\) policy M/G/1 queueing system with server breakdowns and general startup times
- On the Gittins index in the M/G/1 queue
- A paradox in optimal flow control of \(M/M/n\) queues
- On the sojourn times for many-queue head-of-the-line processor-sharing systems with permanent customers
- Rare events in queueing systems -- A survey
- A queueing theoretic approach for performance evaluation of low-power multi-core embedded systems
- A queueing model for a non-homogeneous terminal system subject to BR992
- Distribution systems design with role dependent objectives
- On the finite-source \(\vec G/M/r\) queue
- Optimizing utilization under response time constraints
- \(M/G/1/MLPS\) compared to \(M/G/1/PS\)
- On the nonoptimality of the foreground-background discipline for IMRL service times
- 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
- Routing through a network with maximum reliability
- Capacity planning in manufacturing networks with discrete options
- Optimal adaptive control of priority assignment in queueing systems
- Competitive routing over time
- An overview for Markov decision processes in queues and networks
- An exploration of models that minimize leadtime through batching of arrived orders
- The paging drum queue: A uniform perspective and further results
- Analysis of expected queueing delays for decision making in production planning
- The throughput performance of a prioritized LIFO service discipline
- Quantitative Estimates in an M2/G2/1 Priority Queue with Non-Preemptive Priority: The Method of Strong Stability
- Task assignment in multiple server farms using preemptive migration and flow control
- Approximations for the conditional waiting times in the GI/G/c queue
- Stable strategies for processor sharing systems
- System planning and configuration problems for optimal system design
- The discrete-time preemptive repeat identical priority queue
- An efficient method to determine the optimal configuration of a flexible manufacturing system
- Optimal static distribution of prioritized customers to heterogeneous parallel servers
- Approximations for waiting time in GI/G/1 systems
- A queueing model for a terminal system subject to breakdowns
- Cooperation in Markovian queueing models
- Processor sharing: a survey of the mathematical theory
- Batch processor sharing with hyper-exponential service time
- Queueing systems with correlated arrival flows and their applications to modeling telecommunication networks
- Diffusion limits of limited processor sharing queues
- Efficient visit frequencies for polling tables: Minimization of waiting cost
- Analysis of a discrete-time preemptive resume priority buffer
- Queueing systems with leadtime constraints: a fluid-model approach for admission and sequencing control
- Stabilizing performance in a single-server queue with time-varying arrival rate
- The M/G/1 processor-sharing model: Transient behavior
- Workloads and waiting times in single-server systems with multiple customer classes
- Top percentile network pricing and the economics of multi-homing
- Steady state approximations of limited processor sharing queues in heavy traffic
- Expected waiting times in polling systems under priority disciplines
- Analysis of transient queues with semidefinite optimization
- On an interdependent communication network.
- Nonclairvoyant scheduling
- The Aumann-Shapley price mechanism for allocating congestion costs
- Fluid and diffusion limits for transient sojourn times of processor sharing queues with time varying rates
- The \(M/G/1\) queue with processor sharing and its relation to a feedback queue
- Optimal pricing and capacity sizing for the $GI/GI/1$ queue
- On asymptotic optimization of a class of nonlinear stochastic hybrid systems
- Optimal control of the \(N\) policy M/G/1 queueing system with server breakdowns and general startup times
- Insensitive bounds for the moments of the sojourn time distribution in the \(M/G/1\) processor-sharing queue
- Discrete time queueing networks with product form steady state. Availability and performance analysis in an integrated model
- Batch arrival processor-sharing with application to multi-level processor-sharing scheduling
- On fluidization of discrete event models: Observation and control of continuous Petri nets
- A modified HOL priority scheduling discipline: performance analysis
- Dependence among single stations in series and its applications in productivity improvement
- Strong approximations for multiclass feedforward queueing networks.
- Relative priority policies for minimizing the cost of queueing systems with service discrimination
- Waiting time distributions in the accumulating priority queue
- Convexity and characterization of optimal policies in a dynamic routing problem
- A methodology for multicriteria network partitioning
- On temporal characteristics in an exponential queueing system with negative claims and a bunker for ousted claims
- Multi-server accumulating priority queues with heterogeneous servers
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)