Class PassAndSwapExample

java.lang.Object
jline.examples.java.advanced.PassAndSwapExample

public class PassAndSwapExample extends Object
Pass-and-swap (PAS) / order-independent queue examples. A PAS station is parameterized by the total service-rate function mu(c) of the ordered state vector c (a 1xN row Matrix of 0-based class indices, c(0) the oldest job) and by a swapping graph G; both are properties of the Queue. See Dorsman and Gardner (2024), "New directions in pass-and-swap queues", Queueing Systems 107:205-256. The stationary distribution is the order-independent product form and is invariant to the swapping graph. Both the CTMC solver (exact) and the LDES discrete-event simulator support PAS stations.
  • Constructor Details

    • PassAndSwapExample

      public PassAndSwapExample()
  • Method Details

    • mmkModel

      public static Network mmkModel()
      M/M/K order-independent queue model: mu(c) = min(n, K).
    • compatibilityModel

      public static Network compatibilityModel()
      Five-class, three-server compatibility model (paper Figs 1-2) with the swapping graph E = {(0,2),(0,4),(1,3),(2,3),(3,4)} (0-based). mu(c) = number of servers compatible with at least one class present in c.
    • selfloopModel

      public static Network selfloopModel()
      Three-class PAS queue whose swapping graph contains a self-loop (class 1) and an edge (2,3); one dedicated server per class so mu(c) = number of distinct classes present. Self-loops are permitted (Dorsman invalid input: '&' Gardner 2024, Sect. 2.3) and the product form remains invariant to the graph.
    • mmk

      public static NetworkAvgTable mmk()
      M/M/K order-independent queue solved by CTMC.
    • compatibility

      public static NetworkAvgTable compatibility()
      Five-class compatibility model solved by CTMC.
    • selfloop

      public static NetworkAvgTable selfloop()
      Self-loop swapping-graph model solved by CTMC.
    • main

      public static void main(String[] args)