Paper Info
Title
The random N-policy
Abstract
A vacation queueing system, where the server idles until a random number N of customers accumulates in a queue is investigated. Following the arrival of the N-th customer, the server serves exhaustively the queue and then a new idling period commences. The vacation queuing system is a generalization of the conventional N-policy queue with N a constant number. The steady state distribution of the queue size and the waiting time of a customer are derived in transform forms for both the FIFO and LIFO service disciplines
Year
DOI
Venue
1994
10.1109/INFCOM.1994.337572
Toronto, Ont.
Keywords
Field
DocType
queueing theory,FIFO,LIFO,idling period,queue size,random N-policy,server,service disciplines,steady state distribution,vacation queueing system,waiting time
Bulk queue,G/G/1 queue,M/M/c queue,Multilevel queue,FIFO (computing and electronics),Computer science,M/G/1 queue,M/G/k queue,Computer network,Queue management system
Conference
ISSN
Citations 
PageRank 
0743-166X
0
0.34
References 
Authors
1
1
Name
Order
Citations
PageRank
Chatschik Bisdikian121.76