Package jline.examples.java.advanced

Class PassAndSwapCyclicExample

java.lang.Object

jline.examples.java.advanced.PassAndSwapCyclicExample

public class PassAndSwapCyclicExample
extends Object

Validate the CTMC (exact) and LDES (simulation) solvers on a CLOSED CYCLIC network of two pass-and-swap (PAS / order-independent) queues against the exact product-form brute-force normalizing constant. Topology: --> Queue1 --> Queue2 --> (cyclic, R closed classes) PAS queues are order-independent, so the network is product-form. The brute force enumerates the whole ORDERED state space to obtain the normalizing constant G, hence exact per-class throughputs and mean queue lengths, which are compared against the solvers. Both stations must be valid OI queues: the TOTAL service rate mu_i(c) must depend only on the customer multiset. station 1: M/M/k OI queue, class-independent -> mu1(c) = min(n,k1)*s1 station 2: infinite-server, class-dependent -> mu2(c) = sum_j beta2[c_j] For station 2 the prefix sums depend on order, so the ordered-state enumeration is genuinely needed (it does not collapse to class counts). Class indices passed to mu(.) are 0-based (c(0) the oldest job).

Constructor Summary

Constructors

Constructor	Description
PassAndSwapCyclicExample()

Method Summary

Modifier and Type	Method	Description
static void	main(String[] args)

Methods inherited from class java.lang.Object

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

Constructor Details

PassAndSwapCyclicExample

public PassAndSwapCyclicExample()

Method Details

main

public static void main(String[] args)