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)
- 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
- A discrete-time queueing system with changes in the vacation times
- PERFORMANCE ESTIMATION OFM/DK/1 QUEUE UNDER FAIR SOJOURN PROTOCOL IN HEAVY TRAFFIC
- Approximate counting: a detailed analysis
- Diffusion approximation to a queueing system with time-dependent arrival and service rates
- Performance bounds for the effectiveness of pooling in multi-processing systems
- Routing and capacity assignment in backbone communication networks
- A queueing-location model with expected service time dependent queueing disciplines
- Scheduling of project networks
- Bandwidth packing with priority classes
- Allocation of tasks to specialized processors: A planning approach
- AnRG-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue
- Calculation of output characteristics of a priority queue through a busy period analysis
- Solving convex optimization with side constraints in a multi-class queue by adaptive \(c\mu \) rule
- Facility location models to locate data in information networks: a literature review
- A priority M/G/1 queue with application to voice/data communication
- A survey on the continuous nonlinear resource allocation problem
- A review of open queueing network models of manufacturing systems
- Travel time analysis for general item location assignment in a rectangular warehouse
- Using different response-time requirements to smooth time-varying demand for service
- Evaluating the relative operational efficiency of large-scale computer networks: An approach via data envelopment analysis
- Control and observation for dynamical queueing networks. I
- Machine allocation problems in manufacturing networks
- Processor-sharing queues: Some progress in analysis
- Performance Evaluation of Workflows Using Continuous Petri Nets with Interval Firing Speeds
- Marginal queue length approximations for a two-layered network with correlated queues
- Bandwidth packing with queuing delay costs: Bounding and heuristic solution procedures
- Sharp and simple bounds for the Erlang delay and loss formulae
- An analysis method for variable execution time tasks based on histograms
- Joint routing and rate allocation for multiple video streams in ad-hoc wireless networks
- Tail asymptotics for processor-sharing queues
- Analysis of a discrete-time queue with general service demands and phase-type service capacities
- Optimizing flow rates in a queueing network with side constraints
- Fluid-diffusive modelling for large P2P file-sharing systems
- Distribution-free bounds on the expectation of the maximum with scheduling applications
- Direct martingale arguments for stability: The M/G/1 case
- On global near optimality of special periodic protocols for fluid polling systems with setups
- Lowest priority waiting time distribution in an accumulating priority Lévy queue
- Controlled mobility in stochastic and dynamic wireless networks
- Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling
- Two coupled processors: The reduction to a Riemann-Hilbert problem
- A survey on discriminatory processor sharing
- Strategic bidding in an accumulating priority queue: equilibrium analysis
- A system for priority routing and capacity assignment in packet switched networks
- Pricing surplus server capacity for mean waiting time sensitive customers
- Sojourn times in a processor sharing queue with multiple vacations
- Performance analysis of a \(GI-Geo-1\) buffer with a preemptive resume priority scheduling discipline
- Quantitative fairness for assessing perceived service quality in queues
- Temporal stochastic convexity and concavity
- \(N\) parallel queueing systems with server breakdown and repair
- Asymptotics of waiting time distributions in the accumulating priority queue
- Heavy traffic analysis of open processing networks with complete resource pooling: asymptotic optimality of discrete review policies
- To pool or not to pool: queueing design for large-scale service systems
- A study of additionally generated flows in systems with unlimited number of devices and recurrent servicing with the Markov summation method
- 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
- Bedienungstheorie: Tendenzen und neuere Entwicklungen. (Servicing theory: Tendencies and new developments)
- On the optimality of the earliest due date rule in stochastic scheduling and in queueing
- An algorithm for achieving proportional delay differentiation
- Delay analysis of an \(M/G/1/K\) priority queueing system with push-out scheme
- Computing transient performance measures for the \(M/M/1\) queue
- Fractional compound Poisson processes with multiple internal states
- The \(( S - 1 , S)\) inventory model and its counterparts in queueing theory
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)