Package jline.api.polling

Class Polling_qsys_1limitedKt

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final static DoubleArray polling_qsys_1limited(Array<MatrixCell> arvMAPs, Array<MatrixCell> svcMAPs, Array<MatrixCell> switchMAPs) Computes the exact mean waiting time solution for a polling system with open arrivals.

      • Methods inherited from class java.lang.Object

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

    • Constructor Detail

    • Method Detail

      • polling_qsys_1limited

         final static DoubleArray polling_qsys_1limited(Array<MatrixCell> arvMAPs, Array<MatrixCell> svcMAPs, Array<MatrixCell> switchMAPs)

        Computes the exact mean waiting time solution for a polling system with open arrivals. The system assumes that all queues use 1-limited service discipline. The calculation is based on the station time method by Ferguson and Aminetzah (1985) as reported by Takagi. Reference: O. J. Boxma and B. Meister, "Waiting-time approximations for cyclic-service systems with switch-over times", SIGMETRICS/PERFORMANCE '86, pp. 254-262.

        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:

        <pre> `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(); ` * </pre> *