Layered queueing networks (lqn)

Algorithms over the layered structure itself, as opposed to the per-layer networks the LN solver builds from it. More...

Collaboration diagram for Layered queueing networks (lqn):

Files
file	include/line/api/lqn/lqn_boxbounds.h
	Majumdar-Woodside robust box bounds on the throughput of a layered network.
file	include/line/api/lqn/lqn_export_nlp.h
	A layered queueing network as ONE nonlinear program: linear constraints over the flows, the service-time composition and the closures, plus a nonlinear objective that is the sum of squares of the QD-AMVA congestion and Little laws (Casale, Perez and Wang, PERFORMANCE 2015).
file	include/line/api/lqn/lqn_mol.h
	Method of Layers on the SRVN decomposition of a layered queueing network whose entries carry no activity graph.
file	include/line/api/lqn/lqn_ph.h
	Phase-type composition of an LQN activity graph, the machinery behind SolverLN method 'srvn.ph'.
file	include/line/api/lqn/lqn_ref_routes.h
	Synchronous call DAG carrying reference-task customers into a layer.
file	include/line/api/lqn/lsn_max_multiplicity.h
	Maximum sustainable multiplicity (concurrency level) of every element of a layered software network.

Detailed Description

Algorithms over the layered structure itself, as opposed to the per-layer networks the LN solver builds from it.