Package jline.api.fes

Class Fes_map_deaggregate

java.lang.Object

jline.api.fes.Fes_map_deaggregate

public final class Fes_map_deaggregate
extends Object

Recovers the per-station metrics of an aggregated subnetwork by conditioning on the population held by the flow-equivalent server. fes_map_solve returns the distribution pk of the jobs held by the aggregate. The metrics of the stations behind it follow by conditioning, E[Y_i] = sum_k pk(k) Y_i(k), with Y_i(k) the metric of station i when the isolated subnetwork holds k jobs. This is the decomposition step of the hierarchical analysis of Chandy, Herzog and Woo, IBM J. Res. Dev. 19(1), 1975, and it is exact for a product-form subnetwork. It is an approximation whenever the burstiness that the MAP flow-equivalent server carries also matters inside the subnetwork, because the conditional solve is the product-form one; the aggregate metrics returned by fes_map_solve do not rely on it. Copyright (c) 2012-2026, Imperial College London All rights reserved.

Method Summary

Modifier and Type	Method	Description
static FesMapDeaggregateResult	fes_map_deaggregate(double[] pk, double[] L, double[] mi, boolean[] isDelay)

Methods inherited from class java.lang.Object

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

Method Details

fes_map_deaggregate

public static FesMapDeaggregateResult fes_map_deaggregate(double[] pk,
 double[] L,
 double[] mi,
 boolean[] isDelay)

Parameters:

pk - distribution of the jobs held by the aggregate, index k = P(k jobs)

L - service demands of the isolated subnetwork

mi - servers per station, infinite for a delay

isDelay - true where the station is a pure delay

Returns:

per-station queue length, utilization, throughput and residence time