MAP/G/1/K queue with multiple thresholds on buffer
type: Item
instance of: scholarly article
zbMATH Open document ID: 0979.60090
author: Doo Il Choi
publication date: 2001-06-14T00:00:00Z
Mathematics Subject Classification ID: 60K25
zbMATH DE Number: 1604568
zbMATH Keywords: Markovian arrival process
zbMATH Keywords: ATM networks
MaRDI profile type: Publication
Recommended article: MAP/G/1 Queue Under Workload Control and Postprocessing
Recommended article: A simple approach to the map/d/s queue
Recommended article: The transient BMAP/G/l queue
Recommended article: Q2777372
Recommended article: The \(MAP\), \(M/G_1,G_2/1\) queue with preemptive priority
Recommended article: The nonpreemptive priority MAP/G/1 queue
title: MAP/G/1/K queue with multiple thresholds on buffer
published in: Communications of the Korean Mathematical Society
review text: As the title indicates, the paper examines a single server, finite capacity queue with a Markovian arrival process (MAP), for which the service time distribution depends on the queue length at the start of service. The work is motivated by discarding schemes for ameliorating congestion in ATM networks; it generalizes previous studies by the author and others. An embedded chain at departure epochs is considered, first. Then, using the supplementary variable method, the stationary queue length distribution is obtained in terms of the MAP parameters, the service time distributions and the stationary distribution for the embedded chain.
description: scientific article; zbMATH DE number 1604568