Sample-path analysis of processes with imbedded point processes

DOI10.1007/BF01149190zbMath0682.60083MaRDI QIDQ1824291

Shaler jun. Stidham, Muhammad El-Taha

Publication date: 1989

Published in: Queueing Systems (Search for Journal in Brave)

zbMATH Keywords

renewal-reward theoremimbedded point processinsensitivity of the asymptotic frequency distributionsample- path characterization of the PASTA propertysample-path analysis of queues

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items

Conditional intensities and coincidence properties of stochastic processes with embedded point processes, Little laws for utility processes and waiting times in queues, Pathwise rate-stability for input-output processes, Sample-path insensitivity of symmetric queues in discrete-time, Asymptotic time averages and frequency distributions, On pathwise behavior of queues, A filtered ASTA property, On pathwise rate conservation for a class of semi-martingales, Relationships in stationary jump processes with countable state space and their applications to queues, Deterministic analysis of queueing systems with heterogeneous servers, Rate conservation principle for discrete-time queues, Little's theorem: A stochastic integral approach, Sample path analysis of level crossings for the workload process, A model of channel allocation in multichannel local networks, Filtration of ASTA: A weak convergence approach, EPSTA: The coincidence of time-stationary and customer-stationary distributions, A review of \(L=\lambda W\) and extensions, Sample-path analysis of stochastic discrete-event systems, Travel times in queueing networks and network sojourns, A note on a pathwise version of Little's formula, Note on batch arrival LCFS and related symmetric queues, Rate conservation laws: A survey, Rare events in queueing systems -- A survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Palm probabilities and stationary queues
• Continuous versions of the queuing formulas L=lambdaW and H=lambdaG
• Stationary deterministic flows: II. The Single-server queue
• A central-limit-theorem version of \(L=\lambda W\)
• Stationary random processes associated with point processes
• Stationary deterministic flows in discrete systems. I
• On regenerative processes in queueing theory
• Characteristics of queueing systems observed at events and the connection between stochastic intensity and Palm probability
• On arrivals that see time averages: a martingale approach
• On Arrivals That See Time Averages
• An Anti-PASTA Result for Markovian Systems
• The intensity conservation law for queues with randomly changed service rate
• Approximation of the queue-length distribution of an M/GI/s queue by the basic equations
• Forward Recursion for Markov Decision Processes with Skip-Free-to-the-Right Transitions, Part I: Theory and Algorithm
• ON G/G/1 QUEUES WITH LIFO-P SERVICE DISCIPLINE
• The Optimal Input Rates To A System Of Manufacturing Cells
• A generalized pollaczek-khinchine formula for the gi/gi/1/k queue and its application to approximation
• Stochastic Monotonicity of the Queue Lengths in Closed Queueing Networks
• Second-Order Properties of the Throughput of a Closed Queueing Network
• Stochastic convexity and its applications
• Monotonic and Insensitive Optimal Policies for Control of Queues with Undiscounted Costs
• An extremal property of the fifo discipline via an ordinal version of
• Extensions of the Queueing Relations L = λW and H = λG
• Some Useful Functions for Functional Limit Theorems
• Imbedded and non-imbedded stationary characteristics of queueing systems with varying service rate and point processes
• The Relation between Customer and Time Averages in Queues
• Comparing counting processes and queues
• The Optimality of Full Service Policies
• Poisson Arrivals See Time Averages
• On Markov Jump Processes Imbedded at Jump Epochs and Their Queueing-Theoretic Applications
• The System Point Method in Exponential Queues: A Level Crossing Approach
• Functional limit theorems for stochastic processes based on embedded processes
• Level Crossings in Point Processes Applied to Queues: Single-Server Case
• Some results in the probabilistic theory of asymptotic uniform distribution modulo 1
• Technical Note—A Last Word on L = λW
• The Use of Green's Functions in the Study of Bounded Random Walks with Application to Queuing Theory
• Semi-stationary processes
• On the Optimality of Single-Server Queuing Systems
• L = λW: A Discounted Analogue and a New Proof
• Regenerative processes in the theory of queues, with applications to the alternating-priority queue