Package jline.api.pfqn.nc

Class Pfqn_propfairKt

    • 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 Ret.pfqnNcXQ pfqn_propfair(Matrix L, Matrix N, Matrix Z) Compute the proportionally fair allocation approximationEstimate the normalizing constant using a convex optimization program that is asymptotically exact in models with single-server PS queues only.

      • Methods inherited from class java.lang.Object

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

    • Constructor Detail

    • Method Detail

      • pfqn_propfair

         final static Ret.pfqnNcXQ pfqn_propfair(Matrix L, Matrix N, Matrix Z)

        Compute the proportionally fair allocation approximation

        Estimate the normalizing constant using a convex optimization program that is asymptotically exact in models with single-server PS queues only. The underlying optimization program is convex. The script implements a heuristic to estimate the solution in the presence of delay stations.

        References: Schweitzer, P. J. (1979). Approximate analysis of multiclass closed networks of queues. In Proceedings of the International Conference on Stochastic Control and Optimization. Free Univ., Amsterdam.

        Walton, Proportional fairness and its relationship with multi-class queueing networks, 2009.

        Parameters:
        L -

        • demands at all stations

        N -

        • number of jobs for each class

        Z -

        • think time for each class

        Returns:

        normalizing constant, its logarithm, and performance metrics