Package jline.api

Class POLLING

java.lang.Object

jline.api.POLLING

public class POLLING
extends Object

APIs for evaluating polling systems.

Constructor Summary

Constructors

Constructor	Description
POLLING()

Method Summary

Modifier and Type	Method	Description
static double[]	polling_qsys_1limited(MatrixCell[] arvMAPs, MatrixCell[] svcMAPs, MatrixCell[] switchMAPs)	Computes the exact mean waiting time solution for a polling system with open arrivals.
static double[]	polling_qsys_exhaustive(MatrixCell[] arvMAPs, MatrixCell[] svcMAPs, MatrixCell[] switchMAPs)	Computes the exact mean waiting time solution for a polling system with open arrivals, where all queues are served exhaustively.
static double[]	polling_qsys_gated(MatrixCell[] arvMAPs, MatrixCell[] svcMAPs, MatrixCell[] switchMAPs)	Computes the exact mean waiting time solution for a polling system with open arrivals, where all queues use gated service discipline.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

POLLING

public POLLING()

Method Details

polling_qsys_1limited

public static double[] polling_qsys_1limited(MatrixCell[] arvMAPs,
 MatrixCell[] svcMAPs,
 MatrixCell[] switchMAPs)

Computes the exact mean waiting time solution for a polling system with open arrivals. The system assumes that all queues use gated service discipline. The calculation is based on the equations provided by Takagi in ACM Computing Surveys, Vol. 20, No. 1, March 1988, eq (20).

Parameters:

arvMAPs - an array of MatrixCell objects representing the arrival process MAPs.

svcMAPs - an array of MatrixCell objects representing the service process MAPs.

switchMAPs - an array of MatrixCell objects representing the switching times MAPs.

Returns:

a double array containing the mean waiting times for each queue in the system. Example usage:

 
 MatrixCell[] A = new MatrixCell[2];
 MatrixCell[] S = new MatrixCell[2];
 MatrixCell[] C = new MatrixCell[2];
 A[0] = map_exponential(1/0.6);
 A[1] = map_exponential(1/0.2);
 S[0] = map_exponential(1.0);
 S[1] = map_exponential(1.0);
 C[0] = map_exponential(1.0);
 C[1] = map_exponential(1.0);
 double[] W = polling_qsys_1limited(A, S, C);
 new Matrix(W).print();
 
 

polling_qsys_exhaustive

public static double[] polling_qsys_exhaustive(MatrixCell[] arvMAPs,
 MatrixCell[] svcMAPs,
 MatrixCell[] switchMAPs)

Computes the exact mean waiting time solution for a polling system with open arrivals, where all queues are served exhaustively. The calculation is based on the equations provided by Takagi in ACM Computing Surveys, Vol. 20, No. 1, March 1988, eq (15).

Parameters:

arvMAPs - an array of MatrixCell objects representing the arrival process MAPs.

svcMAPs - an array of MatrixCell objects representing the service process MAPs.

switchMAPs - an array of MatrixCell objects representing the switching times MAPs.

Returns:

a double array containing the mean waiting times for each queue in the system. Example usage:

 
 MatrixCell[] A = new MatrixCell[2];
 MatrixCell[] S = new MatrixCell[2];
 MatrixCell[] C = new MatrixCell[2];
 A[0] = map_exponential(1 / 0.6);
 A[1] = map_exponential(1 / 0.2);
 S[0] = map_exponential(0.1);
 S[1] = map_exponential(1.0);
 C[0] = map_exponential(1.0);
 C[1] = map_hyperexp(1, 2, 0.9);
 double[] W = polling_qsys_exhaustive(A, S, C);
 new Matrix(W).print();
 
 

polling_qsys_gated

public static double[] polling_qsys_gated(MatrixCell[] arvMAPs,
 MatrixCell[] svcMAPs,
 MatrixCell[] switchMAPs)

Computes the exact mean waiting time solution for a polling system with open arrivals, where all queues use gated service discipline. The calculation is based on the equations provided by Takagi in ACM Computing Surveys, Vol. 20, No. 1, March 1988, eq (20).

Parameters:

arvMAPs - an array of MatrixCell objects representing the arrival process MAPs.

svcMAPs - an array of MatrixCell objects representing the service process MAPs.

switchMAPs - an array of MatrixCell objects representing the switching times MAPs.

Returns:

a double array containing the mean waiting times for each queue in the system. Example usage:

 
 MatrixCell[] A = new MatrixCell[2];
 MatrixCell[] S = new MatrixCell[2];
 MatrixCell[] C = new MatrixCell[2];
 A[0] = map_exponential(1 / 0.6);
 A[1] = map_exponential(1 / 0.2);
 S[0] = map_exponential(1.0);
 S[1] = map_exponential(1.0);
 C[0] = map_exponential(1.0);
 C[1] = map_exponential(1.0);
 double[] W = polling_qsys_gated(A, S, C);
 new Matrix(W).print();