Optimal design of a finite-buffer polling network with mixed service discipline and general service order sequence

1995 ◽  
Vol 142 (1) ◽  
pp. 1 ◽  
Author(s):  
L.-C. Hwang
Keyword(s):  
Optimal Design ◽  
Service Discipline ◽  
Finite Buffer ◽  
Order Sequence ◽  
General Service

scholarly journals Analysis of Queue-Length Dependent Vacations and P-Limited Service in BMAP/G/1/N Systems: Stationary Distributions and Optimal Control

2013 ◽  
Vol 2013 ◽  
pp. 1-14 ◽  
Author(s):  
A. D. Banik
Keyword(s):  
Queue Length ◽  
Minimum Cost ◽  
Arrival Process ◽  
Service Discipline ◽  
Single Server ◽  
Finite Buffer ◽  
Batch Markovian Arrival Process ◽  
Special Cases ◽  
Number Of Customers ◽  
Limited Service

We consider a finite-buffer single server queueing system with queue-length dependent vacations where arrivals occur according to a batch Markovian arrival process (BMAP). The service discipline is P-limited service, also called E-limited with limit variation (ELV) where the server serves until either the system is emptied or a randomly chosen limit of L customers has been served. Depending on the number of customers present in the system, the server will monitor his vacation times. Queue-length distributions at various epochs such as before, arrival, arbitrary and after, departure have been obtained. Several other service disciplines like Bernoulli scheduling, nonexhaustive service, and E-limited service can be treated as special cases of the P-limited service. Finally, the total expected cost function per unit time is considered to determine locally optimal values N* of N or a maximum limit L^* of L^ as the number of customers served during a service period at a minimum cost.

A sample path analysis of the delay in the M/G/C system

1996 ◽  
Vol 33 (1) ◽  
pp. 256-266 ◽  
Author(s):  
Sridhar Seshadri
Keyword(s):  
Path Analysis ◽  
Service Time ◽  
Sample Path ◽  
Service Discipline ◽  
Service Time Distribution ◽  
Sample Path Analysis ◽  
New Device ◽  
Mean Delay ◽  
The Mean ◽  
General Service

Using sample path analysis we show that under the same load the mean delay in queue in the M/G/2 system is smaller than that in the corresponding M/G/1 system, when the service time has either the DMRL or NBU property and the service discipline is FCFS. The proof technique uses a new device that equalizes the work in a two server system with that in a single sterver system. Other interesting quantities such as the average difference in work between the two servers in the GI/G/2 system and an exact alternate derivation of the mean delay in the M/M/2 system from sample path analysis are presented. For the same load, we also show that the mean delay in the M/G/C system with general service time distribution is smaller than that in the M/G/1 system when the traffic intensity is less than 1/c.

scholarly journals Complete analysis of MAP/G/1/N queue with single (multiple) vacation(s) under limited service discipline

2005 ◽  
Vol 2005 (3) ◽  
pp. 353-373 ◽  
Author(s):  
U. C. Gupta ◽  
A. D. Banik ◽  
S. S. Pathak
Keyword(s):  
Arrival Process ◽  
Complete Analysis ◽  
Model Parameters ◽  
Service Discipline ◽  
Single Server ◽  
Finite Buffer ◽  
Computer Communication ◽  
Multiple Vacation ◽  
Mean Waiting Time ◽  
Number Of Customers

We consider a finite-buffer single-server queue with Markovian arrival process (MAP) where the server serves a limited number of customers, and when the limit is reached it goes on vacation. Both single- and multiple-vacation policies are analyzed and the queue length distributions at various epochs, such as pre-arrival, arbitrary, departure, have been obtained. The effect of certain model parameters on some important performance measures, like probability of loss, mean queue lengths, mean waiting time, is discussed. The model can be applied in computer communication and networking, for example, performance analysis of token passing ring of LAN and SVC (switched virtual connection) of ATM.

A sample path analysis of the delay in the M/G/C system

1996 ◽  
Vol 33 (01) ◽  
pp. 256-266
Author(s):  
Sridhar Seshadri
Keyword(s):  
Path Analysis ◽  
Service Time ◽  
Sample Path ◽  
Service Discipline ◽  
Service Time Distribution ◽  
Sample Path Analysis ◽  
New Device ◽  
Mean Delay ◽  
The Mean ◽  
General Service

Using sample path analysis we show that under the same load the mean delay in queue in the M/G/2 system is smaller than that in the corresponding M/G/1 system, when the service time has either the DMRL or NBU property and the service discipline is FCFS. The proof technique uses a new device that equalizes the work in a two server system with that in a single sterver system. Other interesting quantities such as the average difference in work between the two servers in the GI/G/2 system and an exact alternate derivation of the mean delay in the M/M/2 system from sample path analysis are presented. For the same load, we also show that the mean delay in the M/G/C system with general service time distribution is smaller than that in the M/G/1 system when the traffic intensity is less than 1/c.

General Service Notes

1954 ◽  
Vol 99 (594) ◽  
pp. 287-291
Keyword(s):  
General Service
Sign in / Sign up

Export Citation Format

Share Document