Package jline.api.polling

Class Polling_qsys_1limited

java.lang.Object
jline.api.polling.Polling_qsys_1limited
public final class Polling_qsys_1limited extends Object

  • Method Details

    • polling_qsys_1limited

      public static double[] polling_qsys_1limited(MatrixCell[] arvMAPs, MatrixCell[] svcMAPs, MatrixCell[] switchMAPs)
      Computes the approximate (Boxma-Meister; exact for symmetric systems) mean waiting time solution for a polling system with open arrivals. The system assumes that all queues use 1-limited service discipline. 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 - arrival process MAPs
      svcMAPs - service process MAPs
      switchMAPs - switching times MAPs
      Returns:
      mean waiting times for each queue in the system

    • polling_qsys_1limited

      public static double[] polling_qsys_1limited(double[] lambda, double[] b, double[] b2, double[] r1, double[] delta2)
      Moment form. The formulas read only the per-queue arrival rate, the first two service moments and the switchover mean and variance, so a caller holding a law with no MAP (a Det or Uniform switchover, a general service) passes those directly instead of a MAP surrogate of the wrong variance.
      Parameters:
      lambda - per-queue Poisson arrival rate
      b - per-queue mean service time E[S]
      b2 - per-queue second service moment E[S^2]
      r1 - mean of the switchover out of each queue (Takagi's r_i)
      delta2 - variance of the switchover out of each queue
      Returns:
      mean waiting time per queue