Marked point processes as limits of Markovian arrival streams
From MaRDI portal
Publication:5288014
DOI10.2307/3214845zbMath0778.60035MaRDI QIDQ5288014
Publication date: 30 August 1993
Published in: Journal of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/3214845
60K25: Queueing theory (aspects of probability theory)
60G55: Point processes (e.g., Poisson, Cox, Hawkes processes)
Related Items
Analysis and Computation of the Joint Queue Length Distribution in a FIFO Single-Server Queue with Multiple Batch Markovian Arrival Streams, On the subexponential properties in stationary single-server queues: a Palm-martingale approach, Nonidentifiability of the Two-State Markovian Arrival Process, Stochastic Bounds for Queueing Systems with Multiple On–Off Sources, Dynamic load balancing with flexible workers, Approximating Multiple Arrival Streams by Using Aggregation, The Impact of Self-Generation of Priorities on Multi-Server Queues with Finite Capacity, Risk processes analyzed as fluid queues, On Suboptimal Policies in Multiclass Tandem Models, A structural approximation method to generate the optimal auto-sleep schedule for computer systems, Resource allocation in grid computing, Passage times in fluid models with application to risk processes, Iterative approximation of \(k\)-limited polling systems, Marked Markovian arrivals in a tandem G-network with blocking, Poisson's equation for queues driven by a Markovian marked point process, Optimal repairman assignment in two symmetric maintenance models, Sojourn time distribution in a MAP/M/1 processor-sharing queue, Quasi-birth-and-death Markov processes with a tree structure and the MMAP[K/PH[K]/N/LCFS non-preemptive queue], Point processes with finite-dimensional conditional probabilities, Symmetric PH and EP distributions and their applications to the probability Hough transform, Optimal server assignment in the case of service times with monotone failure rates, A numerically efficient method for the \(MAP/D/1/K\) queue via rational approximations, On bulk-service MAP/PH\(^{L,N}\)/1/N G-queues with repeated attempts, Age process, workload process, sojourn times, and waiting times in a discrete time SM[K/PH[K]/1/FCFS queue], Workload Process, Waiting Times, and Sojourn Times in a Discrete TimeMMAP[K/SM[K]/1/FCFS Queue], Higher Order Moments and Conditional Asymptotics of the Batch Markovian Arrival Process, A quintuple law for Markov additive processes with phase-type jumps
