Loss pattern of DBMAP/DMSP/1/K queue and its application in wireless local communications

Wang, Yung-Chung; Chou, Jen-Hsiang; Wang, Shun-Yuan

doi:10.1016/j.apm.2010.10.009

Cited by 14 publications

(7 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, Samanta et al [1] carried out the analysis of the discrete-time GI/D-MSP/1 queue with finite as well as infinite buffer using a combination of the matrix-geometric method, the imbedded Markov chain, and the supplementary variable techniques. Wang et al [2] analyzed the packet loss pattern of the finite-buffer D-BM AP/D-MSP/1 queueing system using matrix-geometric approach. While the above two papers [1,2] consider the case whenever the server becomes idle at a certain point, the service phase still keeps changing during the subsequent idle period of the system.…”

Section: Introductionmentioning

confidence: 99%

“…Wang et al [2] analyzed the packet loss pattern of the finite-buffer D-BM AP/D-MSP/1 queueing system using matrix-geometric approach. While the above two papers [1,2] consider the case whenever the server becomes idle at a certain point, the service phase still keeps changing during the subsequent idle period of the system.…”

Section: Introductionmentioning

confidence: 99%

“…Traditional Markov models based on Bernoulli arrival/service process are not suited to capture the correlative and bursty feature of traffic streams in high-speed packet/cell based networks such as file downloading, VoIP and teleconferencing. The discrete-time Markovian service process (D-MSP) (see [1,2]) is independent of the arrival process and can capture the correlation that exists among successive service times. Note that the D-MSP generates real service completions only when the server is busy.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Analytic and computational analysis of the discrete-time GI/D-MSP/1 queue using roots

Samanta

Chaudhry

Pacheco

et al. 2015

Computers & Operations Research

View full text Add to dashboard Cite

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Analytic and computational analysis of the discrete-time GI/D-MSP/1 queue using roots

Samanta

Chaudhry

Pacheco

et al. 2015

Computers & Operations Research

View full text Add to dashboard Cite

“…As a result, its values are critical for the success of any application. A general communication system consists of the network interconnection [1][2][3] with notes where the packets are serviced. In order to perform parallel computations, the processors have to compute the packets along several communication lines [4].…”

Section: Introductionmentioning

confidence: 99%

A Model for Compound Poisson Process Queuing System with Batch Arrivals and Services

Saritha¹,

Mamatha²,

Reddy³

et al. 2020

JESA

View full text Add to dashboard Cite

Computing and logistics management systems have a wide area of applications with compound Poisson process Markov system with a batch servicing facility where customers arrive either independently or batches for service into the multi-server queues. The service of the customers is processed either independently or batch-wise based on the requirement of various sizes. The order of service has been found to follow First Come First Service while customers arrive according to the exponential distribution. A mathematical model is proposed to process customers by using generalized spectral expansion method. The explicit type required to service the system is measured as buffer size. For accurate assessment of performance, numerical results have been depicted in graphical form. Keywords:mean queue length, batch arrivals and batch services, QBD -M, multi-server system, compound poisson process THE STEADY-STATE ANALYSIS AND QBD -M PROCESS WITH MULTIPLE JUMPSThe multiprocessor system is modeled by generalized finite QBD -M (Quasi Birth and Death) process with multiple boundaries. Here, the parameter M refers to multiple jumps in the level dimension. A novel approach theory has been evaluated for the steady-state analysis of the system. Unlike

show abstract

“…The analysis of correlated nature of arrival and/or service processes in queueing systems has been studied over the past few decades due to its wide applications in many fields such as in transportation, manufacturing, computercommunication networks, telecommunication systems and other related areas. In this connection, readers are referred to Wang et al [37], Turck et al [36] and Zhao et al [41], who have addressed the bursty and correlated nature of traffics arising in IEEE 802.16m WiMAX protocol and MPEG-4 video transmission over wireless networks. In recent years, discrete-time queueing models are often used to model complex computer and multimedia communication systems than that of continuoustime systems as multiple state changes can occur from one time-unit to the next.…”

mentioning

confidence: 99%

Analysis of $GI^{[X]}/D$-$MSP/1/\infty$ queue using $RG$-factorization

Samanta¹,

Nandi²

2021

Journal of Industrial &Amp; Management Optimization

View full text Add to dashboard Cite

This paper analyzes an infinite-buffer single-server queueing system wherein customers arrive in batches of random size according to a discretetime renewal process. The customers are served one at a time under discretetime Markovian service process. Based on the censoring technique, the UL-type RG-factorization for the Toeplitz type block-structured Markov chain is used to obtain the prearrival epoch probabilities. The random epoch probabilities are obtained with the help of classical principle based on Markov renewal theory. The system-length distributions at outside observer's, intermediate and post-departure epochs are obtained by making relations among various time epochs. The analysis of waiting-time distribution measured in slots of an arbitrary customer in an arrival batch has also been investigated. In order to unify the results of both discrete-time and its continuous-time counterpart, we give a brief demonstration to get the continuous-time results from those of the discrete-time ones. A variety of numerical results are provided to illustrate the effect of model parameters on the performance measures.

show abstract

Loss pattern of DBMAP/DMSP/1/K queue and its application in wireless local communications

Cited by 14 publications

References 9 publications

Analytic and computational analysis of the discrete-time GI/D-MSP/1 queue using roots

Analytic and computational analysis of the discrete-time GI/D-MSP/1 queue using roots

A Model for Compound Poisson Process Queuing System with Batch Arrivals and Services

Analysis of $GI^{[X]}/D$-$MSP/1/\infty$ queue using $RG$-factorization

Contact Info

Product

Resources

About