A vacation queue with setup and close-down times and batch Markovian arrival processes

Authors:
Zhisheng Niu;Tao Shu;Yoshitaka Takahashi
Affiliations:
Department of Electronic Engineering, Tsinghua University, Beijing 100084, China;Department of Electronic Engineering, Tsinghua University, Beijing 100084, China;School of Commerce, Waseda University, Tokyo 169-8050, Japan
Venue:
Performance Evaluation
Year:
2003

Citing 4
Cited 10

Wide-area traffic: the failure of Poisson modeling

SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
A finite-capacity queue with exhaustive vacation/close-down/setup times and Markovian arrival processes

Queueing Systems: Theory and Applications
Traffic Modeling of IP Networks Using the Batch Markovian Arrival Process

TOOLS '02 Proceedings of the 12th International Conference on Computer Performance Evaluation, Modelling Techniques and Tools
Dynamics of TCP traffic over ATM networks

IEEE Journal on Selected Areas in Communications

Efficient management of idleness in storage systems

ACM Transactions on Storage (TOS)
The MAP + MAP/PH/1/N queuing system with single and batch arrivals of customers

Automation and Remote Control
Restrained utilization of idleness for transparent scheduling of background tasks

Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
The MAP/PH/1/N queue with flows of customers as a model for traffic control in telecommunication networks

Performance Evaluation
Recursive solution of queue length distribution for Geo/G/1 queue with single server vacation and variable input rate

Computers & Mathematics with Applications
Finite buffer vacation models under E-limited with limit variation service and Markovian arrival process

Operations Research Letters
The virtual waiting time in a finite-buffer queue with a single vacation policy

ASMTA'12 Proceedings of the 19th international conference on Analytical and Stochastic Modeling Techniques and Applications
Analysis of a versatile batch-service queueing model with correlation in the arrival process

Performance Evaluation
Stationary distributions and optimal control of queues with batch Markovian arrival process under multiple adaptive vacations

Computers and Industrial Engineering
Performance analysis of an M/G/1 queueing system under Bernoulli vacation schedules with server setup and close down periods

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a finite-capacity single-server vacation queue with close-down/setup times and batch Markovian arrival process (BMAP), where both the service time, the vacation time, the setup time, and the close-down time are generally distributed. The queueing model has potential applications in SVC (switched virtual connection)-based IP-over-ATM networks and multiple protocol label switched (MPLS) networks. By applying the supplementary variable technique, we develop a unified solution to both the single-vacation and multiple-vacation models and for either the PBAS (partial batch acceptance strategy) or the WBAS (whole batch acceptance strategy) service disciplines. For both models, we obtain the queue length distribution at batch arrival epochs and that at an arbitrary time instant, the loss probability of a whole batch or an arbitrary customer in a batch, server setup rate, server utilization ratio, and the LST of the waiting time distribution. Through the numerical examples, we find that: (1) there is a trade-off between the user's quality-of-service (e.g., loss probabilities, wanting times) and the system performance (e.g., server setup rate, server utilization ratio); (2) the system performance is closely related not only to the first and second order moments of the arrival process but also the pattern (distribution) of the customer arrivals; (3) mean batch size is a much more critical factor to influence the queueing system's performance than the type of batch size distribution. These conclusions are of instructive meanings in the design of IP-over-ATM or more generally MPLS-based networks.