scientific article; zbMATH DE number 3562235

From MaRDI portal
Publication:4134686

zbMath0361.60082MaRDI QIDQ4134686

Leonard Kleinrock

Publication date: 1976


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items

Strong approximations for multiclass feedforward queueing networks., Distributed algorithms for multiple entries to a critical section with priority, Simultaneous determination of capacities and load in parallel \(M/M/1\) queues, Performance analysis of a \(GI-Geo-1\) buffer with a preemptive resume priority scheduling discipline, Nonclairvoyant scheduling, On bounds of response time performance achievable by multiclass single- server queues, Priority queuing in an operating system, Graceful reassignment of excessively long communications paths in networks, \((N, n)\)-preemptive-priority M/G/1 queues with finite and infinite buffers, Definitions, characterizations and structural properties of probability distributions similar to the exponential, Computing transient performance measures for the \(M/M/1\) queue, On arrival driven queueing models: Admission control, traffic policing, abandonments, and correlated arrivals, Diffusion approximation to a queueing system with time-dependent arrival and service rates, On preemptive-repeat LIFO queues, Waiting time distributions for closed \(M/M/N\) processor sharing queues, Evaluating the relative operational efficiency of large-scale computer networks: An approach via data envelopment analysis, The efficiency of two groups of heterogeneous stations cared for by \(r\) operatives with a priority group, Continuous approximations of the machine repair system, Optimal static distribution of prioritized customers to heterogeneous parallel servers, An algorithmic analysis of the \(BMAP/MSP/1\) generalized processor-sharing queue, Asymptotics of waiting time distributions in the accumulating priority queue, Routing and capacity assignment in backbone communication networks, Charging more for priority via two-part Tariff for accumulating priorities, Calculating the \(M/G/1\) busy-period density and LIFO waiting-time distribution by direct numerical transform inversion, Response time of the queue with the dropping function, Performance evaluation of scheduling control of queueing networks: Fluid model heuristics, \(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, Measure of performances of the strong stability method, Queueing systems with correlated arrival flows and their applications to modeling telecommunication networks, Analysis of transient queues with semidefinite optimization, Asymptotically optimal open-loop load balancing, A study of additionally generated flows in systems with unlimited number of devices and recurrent servicing with the Markov summation method, Non-product form equilibrium probabilities in a class of two-station closed reentrant queueing networks, 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, Multi-objective routing within large scale facilities using open finite queueing 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, A note on comparing response times in the \(M/GI/1/FB\) and \(M/GI/1/PS\) queues, Extension of the class of queueing systems with delay, Infinite markings method in queueing systems with the infinite variance of service time, 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, Dynamic interactive stabilization of systems of flow with processor sharing, The transient solution to a class of Markovian queues, Decomposable score function estimators for sensitivity analysis and optimization of queueing networks, Analysis of multiclass Markovian polling systems with feedback and composite scheduling algorithms, Analyzing sharing strategies for finite buffer memory in a router among outgoing channels, Sharp and simple bounds for the Erlang delay and loss formulae, The role of stochastic programming in communication network design, On the Gittins index in the M/G/1 queue, Heavy traffic analysis of open processing networks with complete resource pooling: asymptotic optimality of discrete review policies, Pricing surplus server capacity for mean waiting time sensitive customers, 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, Choosing the capacity of arcs with constraint on flow delay time, A two phase service \(M/G/1\) queue with a finite number of immediate Bernoulli feedbacks, Controllable Markov jump processes. II: Monitoring and optimization of TCP connections, Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling, Strategic bidding in a discrete accumulating priority queue, The \(( S - 1 , S)\) inventory model and its counterparts in queueing theory, On energy-aware \(M/G/1\)-LAS queue with batch arrivals, Fluid queues with synchronized output, M/G/1 round robin discipline, Travel time analysis for general item location assignment in a rectangular warehouse, Bandwidth packing with queuing delay costs: Bounding and heuristic solution procedures, 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, Workloads and waiting times in single-server systems with multiple customer classes, On the optimality of the earliest due date rule in stochastic scheduling and in queueing, Waiting times of a finite-capacity multi-server model with non-preemptive priorities, Stationary queuing systems with dependencies, RPA pathwise derivative estimation of ruin probabilities, On the sojourn times for many-queue head-of-the-line processor-sharing systems with permanent customers, Allocation of tasks to specialized processors: A planning approach, On asymptotic optimization of a class of nonlinear stochastic hybrid systems, The program system for design optimization of data transmission networks, 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, The Aumann-Shapley price mechanism for allocating congestion costs, 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, Uncapacitated point-to-multipoint network flow problem and its application to multicasting in telecommunication networks, Optimization of an internationally distributed air-ground airline telecommunication system, Rare events in queueing systems -- A survey, Output flows in queueing networks, A methodology for multicriteria network partitioning, Optimal choice of threshold in two level processor sharing, Heavy-tailed limits for medium size jobs and comparison scheduling, Temporal stochastic convexity and concavity, On the capacity assignment problem in packet-switching computer networks, Dependence among single stations in series and its applications in productivity improvement, Multi-server accumulating priority queues with heterogeneous servers, Handling load with less stress, A discrete-time queueing system with changes in the vacation times, Processor-sharing queues: Some progress in analysis, \(M/G/1/\mathrm{MLPS}\) compared with \(M/G/1/\mathrm{PS}\) within service time distribution class IMRL, Joint routing and rate allocation for multiple video streams in ad-hoc wireless networks, Approximations for waiting time in GI/G/1 systems, Top percentile network pricing and the economics of multi-homing, Interoutput times in processor sharing queues with feedback, An analysis of finite capacity queues with priority scheduling and common or reserved waiting areas, Marginal queue length approximations for a two-layered network with correlated queues, A modified HOL priority scheduling discipline: performance analysis, A queueing-location model with expected service time dependent queueing disciplines, A priority M/G/1 queue with application to voice/data communication, Controlled mobility in stochastic and dynamic wireless networks, Randomized pushing-out in the priority queueing with a finite buffer size, Sojourn times in a processor sharing queue with multiple vacations, Optimizing uniform non-Markov queueing networks, On nodal blocking of a retransmitted packet in a computer communication network, Analysis of a prioritized CSMA protocol based on staggered delays, A queueing theoretic approach for performance evaluation of low-power multi-core embedded systems, 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, Stabilizing performance in a single-server queue with time-varying arrival rate, A discrete-time round-robin queue with Bernoulli input and general arithmetic service time distributions, Interdeparture times in M/G/1 queueing systems with non-preemptive priority discipline, Scheduling of project networks, Deadlock-free routing in k-ary hypercube network in presence of processor failures, A queueing model for a terminal system subject to breakdowns, Fiducial intervals for the waiting time in batch and time-sharing systems, Capacity planning in manufacturing networks with discrete options, Partage de taches entre processeurs homogenes, An efficient method to determine the optimal configuration of a flexible manufacturing system, 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, Control and observation for dynamical queueing networks. I, Processor sharing: a survey of the mathematical theory, Waiting time distributions in the accumulating priority queue, Solving convex optimization with side constraints in a multi-class queue by adaptive \(c\mu \) rule, 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, An algorithm for achieving proportional delay differentiation, Task assignment in multiple server farms using preemptive migration and flow control, Delay analysis of an \(M/G/1/K\) priority queueing system with push-out scheme, 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, Batch processor sharing with hyper-exponential service time, On global near optimality of special periodic protocols for fluid polling systems with setups, Bandwidth packing with priority classes, A cyclic-service finite source model with round-robin scheduling, A note on the pseudo-conservation law for a multi-queue with local priority, Strategic bidding in an accumulating priority queue: equilibrium analysis, Facility location models to locate data in information networks: a literature review, 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, The use of relative priorities in optimizing the performance of a queueing system, Parallel trace-driven simulation of packet-switched multiplexer under priority scheduling policy, Diffusion limits of limited processor sharing queues, Relative priority policies for minimizing the cost of queueing systems with service discrimination, A closed queuing network model with single servers for multi-threaded architecture, Discrete time queueing networks with product form steady state. Availability and performance analysis in an integrated model, An improved balanced job bound analysis of closed queueing networks, Competitive routing over time, Routing Algorithmen in Datennetzen - eine vergleichende Simulationsstudie. (Routing algorithms in data networks - a comparing simulation study), Steady state approximations of limited processor sharing queues in heavy traffic, Distribution-free bounds on the expectation of the maximum with scheduling applications, First-fit allocation of queues: Tight probabilistic bounds on wasted space, Heavy traffic analysis of maximum pressure policies for stochastic processing networks with multiple bottlenecks, Queueing models for a flexible machining station. I: The diffusion approximation, On the finite-source \(\vec G/M/r\) queue, Optimizing utilization under response time constraints, On fluidization of discrete event models: Observation and control of continuous Petri nets, 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, Convexity and characterization of optimal policies in a dynamic routing problem, Optimal adaptive control of priority assignment in queueing systems, The paging drum queue: A uniform perspective and further results, Refining diffusion approximations for queues, Approximate counting: a detailed analysis, The throughput performance of a prioritized LIFO service discipline, Direct martingale arguments for stability: The M/G/1 case, On the Kleinrock-Nilsson problem of optimal scheduling algorithms for time-shared systems, 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, Expected waiting times in polling systems under priority disciplines, Bedienungstheorie: Tendenzen und neuere Entwicklungen. (Servicing theory: Tendencies and new developments), A foreground-background queueing model with speed or capacity modulation, Examples of Applications of Queueing Theory in Canada, On The Renewal Input Batch-arrival Queue Under Single And Multiple Working Vacation Policy With Application To EPON, Further results of Markovian bulk-arrival and bulk-service queues with general-state-dependent control, To Pool or Not to Pool: Queueing Design for Large-Scale Service Systems, Quantitative fairness for assessing perceived service quality in queues, High-priority expected waiting times in the delayed accumulating priority queue with applications to health care KPIs, A queueing model for a non-homogeneous terminal system subject to BR992, Price-coupled scheduling for differentiated services: Gcµversus GPS, Allocating capacity in parallel queues to improve their resilience to deliberate attack, Control of a hybrid stochastic system, Exact busy period distribution of a discrete queue with quadratic rates, Queueing with priorities and standard service: Stoppable and unstoppable servers, Simple analytical solutions for the , , and related queues, A mathematical model to estimate average response time of parallel programs, Studying the queue length in a single-server queueing system with unreliable server, Tail asymptotics for processor-sharing queues, On temporal characteristics in an exponential queueing system with negative claims and a bunker for ousted claims, Application des lois non paramétriques dans les systèmes d'attente et la théorie de renouvellement, Numerical analysis of multi-server queues with deterministic service and special phase-type arrivals, A general workload conservation law with applications to queueing systems, Routing and Staffing in Customer Service Chat Systems with Impatient Customers, APPROXIMATION OF TANDEM QUEUES VIA ISOMORPHS, Instability of LAS multiclass queueing networks, Chaos in a simple deterministic queueing system, Load sharing in soft real-time distributed systems, Analysis of a discrete-time queue with general service demands and phase-type service capacities, Combined capacity planning and concentrator location in computer communications networks, The disadvantage of the ‐rule when customers are strategic, Computing steady-state queueing-time distributions of single-server queues:GI X /M/1, Queueing networks with path-dependent arrival processes, SERVER WAITING TIMES IN INFINITE SUPPLY POLLING SYSTEMS WITH PREPARATION TIMES, Performance Evaluation of Workflows Using Continuous Petri Nets with Interval Firing Speeds, Delay-Minimizing Capacity Allocation in an Infinite Server-Queueing System, An analytical model for loss estimation in network traffic analysis systems, Bayesian estimation of traffic intensity based on queue length in a multi-server M/M/s queue, Heavy-Traffic Analysis of Sojourn Time Under the Foreground–Background Scheduling Policy, Recent sojourn time results for multilevel processor‐sharing scheduling disciplines, Invariance of the mean number of customers in priority queueing systems with a finite source, Estimation of Prioritized Disciplines Efficiency Based on the Metamodel of Multi-flows Queueing Systems, Fractional compound Poisson processes with multiple internal states, A class of high performance Maekawa-type algorithms for distributed systems under heavy demand, Constant time per edge is optimal on rooted tree networks, A survey on the continuous nonlinear resource allocation problem, Quantitative Estimates in an M2/G2/1 Priority Queue with Non-Preemptive Priority: The Method of Strong Stability, Estudio bayesiano de los periodos de ocupacion y desocupacion en una cola M/M/1/∞/FIFO en equilibrio, Exclusion in a priority queue, Analysis of a discrete-time preemptive resume priority buffer, Sojourn time in an M/M/1 processor sharing queue with permanent customers, An Overview for Markov Decision Processes in Queues and Networks, Queueing Theory in the Context of Shared Resources, Pricing and distributed QoS control for elastic network traffic, A multiple server location-allocation model for service system design, On an interdependent communication network., Variational inference for Markovian queueing networks, Batch sojourn time in the processor sharing queue with geometric batch size, Cooperation in Markovian queueing models, Optimal control of the \(N\) policy M/G/1 queueing system with server breakdowns and general startup times, SOJOURN TIMES IN NON-HOMOGENEOUS QBD PROCESSES WITH PROCESSOR SHARING, An analysis method for variable execution time tasks based on histograms, Non-stationary delay analysis of runway systems, Queueing systems with leadtime constraints: a fluid-model approach for admission and sequencing control, Optimal Control of an M/G/1 Priority Queue Via N-Control, \(M/G/1/MLPS\) compared to \(M/G/1/PS\), A Cost-Equation Analysis of General-Input General-Service Processor Sharing System, Introducing probabilities in statecharts to specify reactive systems for performance analysis, A new performance analysis model of local switching system with fuzzy control method for increasing call completion rate, Insensitive bounds for the moments of the sojourn time distribution in the \(M/G/1\) processor-sharing queue, Fluid and diffusion limits for transient sojourn times of processor sharing queues with time varying rates, A survey on discriminatory processor sharing, Aggregate order release planning for time-varying demand, Impact of Nonparametric Density Estimation on the Approximation of the G∕G∕1 Queue by the M∕G∕1 One, Minimization of Packet Loss Probability in Network with Fractal Traffic, Optimization of Pipelining and Data Processing, Semi-Analytical Methods for Complex Optimization of Non-Markov Queueing Networks, The discrete-time preemptive repeat identical priority queue, Bounds on the Mean Delay in Multiclass Queueing Networks under Shortfall-Based Priority Rules, Optimization of Uniform Non-Markov Queueing Networks Using Resources and Transition Probabilities Redistribution, Methods of Simulation Queueing Systems with Heavy Tails, PERFORMANCE ESTIMATION OFM/DK/1 QUEUE UNDER FAIR SOJOURN PROTOCOL IN HEAVY TRAFFIC, AnRG-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue, A Spectral Method for a Nonpreemptive PriorityBMAP/G/1 QUEUE, Two coupled processors: The reduction to a Riemann-Hilbert problem, Strategic joining in a single-server retrial queue with batch service, Achievable Performance of Blind Policies in Heavy Traffic, Robust Analysis in Stochastic Simulation: Computation and Performance Guarantees, Martingale methods for the semi-markov analysis of queues with blocking, On Queues with Interarrival Times Proportional to Service Times, PROPERTIES OF THE GITTINS INDEX WITH APPLICATION TO OPTIMAL SCHEDULING, Diffusion Approximation for a Web-Server System with Proxy Servers, Unnamed Item, On the nonoptimality of the foreground-background discipline for IMRL service times, Calculation of predicted average packet delay and its application for flow control in data network, Quality-related measures of unreliable machines with preventive maintenance, On the sojourn of an arbitrary customer in an M/M/1 Processor Sharing Queue, Auxiliary variables for Bayesian inference in multi-class queueing networks, A paradox in optimal flow control of \(M/M/n\) queues, Interest of boundary kernel density techniques in evaluating an approximation error of queueing systems characteristics, Batch arrival processor-sharing with application to multi-level processor-sharing scheduling, Fluid-diffusive modelling for large P2P file-sharing systems, Cyclic Bernoulli polling, An analytical interpretation of the discrete approximation for the GI/GI/1 queue1, Perfect and nearly perfect sampling of work-conserving queues