Package jline.api.fes

Class Fes_map_solve

java.lang.Object

jline.api.fes.Fes_map_solve

public final class Fes_map_solve
extends Object

Solves the reduced model made of a delay and a load-dependent MAP flow-equivalent server. Closes the aggregation of Section 5.2.1 of Casale, Mi, Cherkasova and Smirni, IEEE Trans. Soft. Eng. 37(5), 2011. Once a subnetwork has been replaced by the load-dependent MAP of fes_map_aggregate, the model left is a delay holding the think times and one station, which is a finite level-dependent quasi birth-death process: level k is the number of jobs held by the flow-equivalent server and N-k jobs are thinking. The chain is the same block bidiagonal pair used to measure the inter-departure times, now read as a generator rather than as a MAP, so the delay is a station whose process is scaled by the number of jobs it holds and the marked transitions are the arrivals into the flow-equivalent server. The think time may itself be a MAP, which is how Section 5.3.1 models a bounded flash crowd: burstiness in the stream of requests is carried by (Z0,Z1) and the rates scale with the population at the delay. Copyright (c) 2012-2026, Imperial College London All rights reserved.

Method Summary

Modifier and Type	Method	Description
static FesMapSolveResult	fes_map_solve(List<MatrixCell> fes, MatrixCell thinkMap, int n)

Methods inherited from class java.lang.Object

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

Method Details

fes_map_solve

public static FesMapSolveResult fes_map_solve(List<MatrixCell> fes,
 MatrixCell thinkMap,
 int n)

Parameters:

fes - flow-equivalent server, one MAP per level, from fes_map_aggregate

thinkMap - think time process (Z0,Z1); exponential for a plain think time

n - number of jobs in the closed model

Returns:

system throughput, response time, aggregate queue length and level law