Age-of-Model (AoM) Analysis

• Age-of-Model (AoM) is a metric that measures the time elapsed since a node’s last model update, mirroring the age-of-information concept.
• It uses a random-shortest-path framework with independent exponential service times to yield an exact distribution of model staleness in networked systems.
• The framework offers actionable insights by decomposing staleness into source update rates and transmission delays along critical network paths.

Searching arXiv for the cited paper and closely related age-of-information context. arXiv.search {"^^^^^^^^2query2 OR title:\2^^^^^^^^"Age Distribution in Arbitrary Preemptive Memoryless Networks\"","max_results":5,"sort_by":"relevance"} arXiv.search {"^^^^^^^^2query2 of Information\" Yates gossip network preemptive memoryless networks","max_results":^^^^2id:(Nasser et al., 2022) OR title:\2query2^^^^,"sort_by":"relevance"} Age-of-Model (AoM) is the time since the last model update that successfully arrived at a node was created. In the interpretation induced by the preemptive memoryless network framework of "Age Distribution in Arbitrary Preemptive Memoryless Networks" (&&&^^^^2query2^^^^&&&), AoM is structurally identical to Age-of-Information (AoI): AoI at a node is the time since the last information update that successfully arrived there was generated, whereas AoM at a node is the time since the last model update—such as a new model version, gradient, or checkpoint—that successfully arrived there was created. When model updates are represented as packets propagating through a single-source network with exponential service times and preemption in service, the stationary AoM process admits an exact distributional characterization. The resulting representation is stronger than a mean-staleness formula: it yields the full stationary law, tail probabilities, moments, and expectations of arbitrary age-dependent costs (&&&^^^^2query2^^^^&&&).

^^^^2id:(Nasser et al., 2022) OR title:\2^^^^. Formal definition and state variables

AoM is defined nodewise. Let PRESERVED_PLACEHOLDER_^^^^2query2^^^^ denote the creation time of the freshest model update received by node PRESERVED_PLACEHOLDER_^^^^2id:(Nasser et al., 2022) OR title:\2^^^^ up to time $t$. The age at node $v$ is then

$\Delta_v(t) = t - g_v(t).$

Under this definition, age increases linearly in time and drops whenever a fresher model update arrives. The quantity is therefore a staleness process rather than a latency process: it measures how old the currently deployed or cached model is, not how long an individual transmission took (&&&^^^^2query2^^^^&&&).

The network model is a Single-Source Network (SSN), represented by a weighted directed graph

$G=(V,E),$

with a unique source node $s\in V$ of in-degree zero, all nodes reachable from $s$, and no self-loops. In the AoM interpretation, $s$ is the model generator, such as a training service or central repository, and each node $v\in V$ is a server, data center, gateway, or edge device storing the freshest model it has received. Directed edges represent communication or processing links along which model updates propagate.

The source generates updates according to a Poisson process of rate PRESERVED_PLACEHOLDER_^^^^2id:(Nasser et al., 2022) OR title:\2query2^^^^, so inter-update times are i.i.d. exponential with mean PRESERVED_PLACEHOLDER_^^^^2id:(Nasser et al., 2022) OR title:\2id:(Nasser et al., 2022) OR title:\2^^^^. Each edge PRESERVED_PLACEHOLDER_^^^^2id:(Nasser et al., 2022) OR title:\22^^^^ has exponential service time

PRESERVED_PLACEHOLDER_^^^^2id:(Nasser et al., 2022) OR title:\2^^^^3

The memoryless property,

PRESERVED_PLACEHOLDER_^^^^2id:(Nasser et al., 2022) OR title:\2^^^^4

is central, because it permits a clean stationary characterization of age distributions. Each node has a buffer of capacity PRESERVED_PLACEHOLDER_^^^^2id:(Nasser et al., 2022) OR title:\2^^^^5, meaning that it stores only its current best update.

The forwarding discipline is LCFS with preemption in service. Each node continuously transmits the packet in its buffer along all outgoing edges. When a packet with generation time PRESERVED_PLACEHOLDER_^^^^2id:(Nasser et al., 2022) OR title:\2^^^^6 completes service on edge PRESERVED_PLACEHOLDER_^^^^2id:(Nasser et al., 2022) OR title:\2^^^^7, node PRESERVED_PLACEHOLDER_^^^^2id:(Nasser et al., 2022) OR title:\2^^^^8 compares it to the generation time PRESERVED_PLACEHOLDER_^^^^2id:(Nasser et al., 2022) OR title:\2^^^^9 of its currently stored packet. If $t$^^^^2query2^^^^, the new packet preempts the old one and replaces it; otherwise the arrival is ignored. In AoM terms, each node always pushes its current model version, and any newly received candidate is retained only if it is fresher than the model already present.

2. Random-shortest-path characterization of stationary AoM

The central result is an exact stationary distributional representation. Introduce a virtual node $t$^^^^2id:(Nasser et al., 2022) OR title:\2^^^^ and an edge $t$2 with rate $t$3, thereby encoding source update generation as an exponential edge. Define the augmented graph

$t$4

Let $t$5 independently for all $t$6. For each node $t$7, define

$t$8

and set $t$9, where $v$^^^^2query2^^^^ is the set of directed paths from $v$^^^^2id:(Nasser et al., 2022) OR title:\2^^^^ to $v$2. The stationary theorem states that

$v$3

for every node $v$4. Equivalently,

$v$5

and for $v$6,

$v$7

with $v$8 independent of all $v$9 (&&&^^^^2query2^^^^&&&).

This identifies stationary AoM with a random metric on the graph: the age at node $\Delta_v(t) = t - g_v(t).$^^^^2query2^^^^ is distributed as the length of a minimum-weight path from the virtual root $\Delta_v(t) = t - g_v(t).$^^^^2id:(Nasser et al., 2022) OR title:\2^^^^ to $\Delta_v(t) = t - g_v(t).$2, where edge weights are independent exponentials. In the AoM interpretation, the age of the model stored at a node is distributed like the time since the latest global model was created plus the fastest random propagation delay by which that model could have reached the node under preemptive forwarding.

A direct corollary is the mean formula for any destination node $\Delta_v(t) = t - g_v(t).$3: $\Delta_v(t) = t - g_v(t).$4 The mean AoM is thus decomposed into a source-refresh term $\Delta_v(t) = t - g_v(t).$5 and an expected minimum path-delay term. This suggests a natural systems interpretation: reducing model staleness can proceed either by increasing the rate at which deployable models are produced or by increasing service rates on critical propagation paths.

3. Canonical network topologies

The shortest-path representation yields explicit distributions in small or structured topologies. In a serial cascade or line network with nodes $\Delta_v(t) = t - g_v(t).$6 and edges $\Delta_v(t) = t - g_v(t).$7, the stationary age at the source is

$\Delta_v(t) = t - g_v(t).$8

while

$\Delta_v(t) = t - g_v(t).$9

and, inductively,

$G=(V,E),$^^^^2query2^^^^

Hence at the destination,

$G=(V,E),$^^^^2id:(Nasser et al., 2022) OR title:\2^^^^

with all exponentials independent. The distribution is hypoexponential, and the mean is

$G=(V,E),$2

For AoM, this corresponds to a model traversing a fixed sequence of communication or processing stages, each of which contributes an independent exponential component to stationary staleness (&&&^^^^2query2^^^^&&&).

A second canonical example is the triangle network with nodes $G=(V,E),$3, direct edge $G=(V,E),$4 of rate $G=(V,E),$5, and relay path $G=(V,E),$6 with rates $G=(V,E),$7 and $G=(V,E),$8. Then

$G=(V,E),$9

and

$s\in V$^^^^2query2^^^^

where $s\in V$^^^^2id:(Nasser et al., 2022) OR title:\2^^^^, $s\in V$2, and $s\in V$3 are independent. If $s\in V$4, the relay-path delay is hypoexponential, and combining it with the direct exponential path yields a cdf expressible as a linear combination of exponentials. The mean simplifies to

$s\in V$5

In AoM terms, the destination staleness is governed by competition between a direct push and a multihop relay route; the freshest model is whichever reaches the node first.

4. Moment-generating functions and age-dependent functionals

For arbitrary networks, the framework characterizes not only nodewise age but also the age of sets of nodes. For any nonempty subset $s\in V$6, define

$s\in V$7

The construction is extended through the joint MGF

$s\in V$8

and the marginal

$s\in V$9

These quantities satisfy base cases and a recursion derived from a Markov jump and piecewise deterministic description of the age process (&&&^^^^2query2^^^^&&&).

If $s$^^^^2query2^^^^, then $s$^^^^2id:(Nasser et al., 2022) OR title:\2^^^^, so $s$2. If $s$3 but $s$4, then $s$5, hence

$s$6

the MGF of $s$7. If $s$8, define

$s$9

Then the recursion is

$s$^^^^2query2^^^^

Because $s$^^^^2id:(Nasser et al., 2022) OR title:\2^^^^, this yields the MGF for nodewise AoM as a special case.

Once $s$2 is available, moments follow by differentiation: $s$3 More generally, for any function $s$4 integrable with respect to the distribution of $s$5,

$s$6

where $s$7 is obtained via inverse Laplace or Fourier transform of $s$8. The framework explicitly supports the average of an arbitrary function of the age. In the AoM reading, this permits exact analysis of staleness-sensitive losses, including polynomial penalties, indicator costs, or convex penalties that encode deployment risk.

Differentiating the MGF recursion at $s$9 yields the mean-age recursion

$v\in V$^^^^2query2^^^^

For $v\in V$^^^^2id:(Nasser et al., 2022) OR title:\2^^^^, this becomes a linear recursion for expected AoM at node $v\in V$2 in terms of supersets $v\in V$3, thereby converting mean staleness computation into a graph-structured dynamic program.

5. Tail probabilities, structured decompositions, and simulation

The full stationary distribution makes tail metrics accessible. For a threshold $v\in V$4, the age-violation probability is

$v\in V$5

If only upper bounds are required, the framework avoids inverse transforms by applying Chernoff bounds: $v\in V$6 and therefore

$v\in V$7

In AoM terms, $v\in V$8 is the probability that a deployed model is older than $v\in V$9, a natural reliability or service-level quantity (&&&^^^^2query2^^^^&&&).

The paper also identifies structured families of networks in which the exponential-state recursion can be simplified. For cascades of triangles, local formulas compose. Consider two triangles PRESERVED_PLACEHOLDER_^^^^2id:(Nasser et al., 2022) OR title:\2query2query2^^^^ and PRESERVED_PLACEHOLDER_^^^^2id:(Nasser et al., 2022) OR title:\2query2id:(Nasser et al., 2022) OR title:\2^^^^, where every path from source PRESERVED_PLACEHOLDER_^^^^2id:(Nasser et al., 2022) OR title:\2query22^^^^ to destination PRESERVED_PLACEHOLDER_^^^^2id:(Nasser et al., 2022) OR title:\2query2^^^^3 passes through PRESERVED_PLACEHOLDER_^^^^2id:(Nasser et al., 2022) OR title:\2query2^^^^4. First,

PRESERVED_PLACEHOLDER_^^^^2id:(Nasser et al., 2022) OR title:\2query2^^^^5

and then

PRESERVED_PLACEHOLDER_^^^^2id:(Nasser et al., 2022) OR title:\2query2^^^^6

For a cascade of PRESERVED_PLACEHOLDER_^^^^2id:(Nasser et al., 2022) OR title:\2query2^^^^7 such triangles with destination PRESERVED_PLACEHOLDER_^^^^2id:(Nasser et al., 2022) OR title:\2query2^^^^8,

PRESERVED_PLACEHOLDER_^^^^2id:(Nasser et al., 2022) OR title:\2query2^^^^9

More generally, the framework considers covers PRESERVED_PLACEHOLDER_^^^^2id:(Nasser et al., 2022) OR title:\2id:(Nasser et al., 2022) OR title:\2query2^^^^ of bounded size PRESERVED_PLACEHOLDER_^^^^2id:(Nasser et al., 2022) OR title:\2id:(Nasser et al., 2022) OR title:\2id:(Nasser et al., 2022) OR title:\2^^^^, with PRESERVED_PLACEHOLDER_^^^^2id:(Nasser et al., 2022) OR title:\2id:(Nasser et al., 2022) OR title:\22^^^^, pairwise intersections only between consecutive blocks, and edges only internal to PRESERVED_PLACEHOLDER_^^^^2id:(Nasser et al., 2022) OR title:\2id:(Nasser et al., 2022) OR title:\2^^^^3 or from PRESERVED_PLACEHOLDER_^^^^2id:(Nasser et al., 2022) OR title:\2id:(Nasser et al., 2022) OR title:\2^^^^4 to PRESERVED_PLACEHOLDER_^^^^2id:(Nasser et al., 2022) OR title:\2id:(Nasser et al., 2022) OR title:\2^^^^5. Under this condition, stage-wise propagation of joint distributions can reduce computational growth from worst-case exponential in PRESERVED_PLACEHOLDER_^^^^2id:(Nasser et al., 2022) OR title:\2id:(Nasser et al., 2022) OR title:\2^^^^6 to roughly linear in the number of stages.

The shortest-path characterization also enables direct stationary Monte Carlo estimation. For each sample PRESERVED_PLACEHOLDER_^^^^2id:(Nasser et al., 2022) OR title:\2id:(Nasser et al., 2022) OR title:\2^^^^7, one draws independent edge weights PRESERVED_PLACEHOLDER_^^^^2id:(Nasser et al., 2022) OR title:\2id:(Nasser et al., 2022) OR title:\2^^^^8 for all PRESERVED_PLACEHOLDER_^^^^2id:(Nasser et al., 2022) OR title:\2id:(Nasser et al., 2022) OR title:\2^^^^9, runs a shortest-path algorithm such as Dijkstra from PRESERVED_PLACEHOLDER_^^^^2id:(Nasser et al., 2022) OR title:\22query2^^^^, and computes

PRESERVED_PLACEHOLDER_^^^^2id:(Nasser et al., 2022) OR title:\22id:(Nasser et al., 2022) OR title:\2^^^^

The sample mean estimator is

PRESERVED_PLACEHOLDER_^^^^2id:(Nasser et al., 2022) OR title:\222^^^^

Each Dijkstra run has complexity PRESERVED_PLACEHOLDER_^^^^2id:(Nasser et al., 2022) OR title:\22^^^^3, so total complexity is PRESERVED_PLACEHOLDER_^^^^2id:(Nasser et al., 2022) OR title:\22^^^^4. Because the samples are independent draws from the stationary distribution, no warm-up period is required, and arbitrary functions PRESERVED_PLACEHOLDER_^^^^2id:(Nasser et al., 2022) OR title:\22^^^^5 can be averaged directly.

6. Applicability, limitations, and interpretive scope

The framework rests on six explicit assumptions: a single source of updates; Poisson generation with rate PRESERVED_PLACEHOLDER_^^^^2id:(Nasser et al., 2022) OR title:\22^^^^6; exponential service times PRESERVED_PLACEHOLDER_^^^^2id:(Nasser et al., 2022) OR title:\22^^^^7; preemption in service; capacity-PRESERVED_PLACEHOLDER_^^^^2id:(Nasser et al., 2022) OR title:\22^^^^8 storage at each node; and ergodicity of the age process. Within these assumptions, the AoM process is analytically tractable and its stationary distribution is exact (&&&^^^^2query2^^^^&&&).

For model-updating systems, the regime is a good fit when there is a single global model generated centrally, updates are relatively small or frequent, service times are reasonably approximated by exponential queues, and older transmissions can be preempted or ignored cheaply once fresher versions exist. The examples explicitly contemplated by the framework include online learning with continuous model generation and broadcast over large random networks, edge-model updates, and gossip-based or epidemic distribution of model parameters.

The regime is less realistic when update generation is deterministic rather than Poisson, transmission times are deterministic or heavy-tailed, preemption is impossible or too costly, or multiple independent model sources coexist. The paper points to likely extensions involving multiple-source networks, non-memoryless service times, and non-memoryless arrivals. A plausible implication is that, outside the exact memoryless setting, the random-shortest-path formulation can still function as a baseline approximation or simulation heuristic. The same interpretation suggests that phase-type approximations to service times or Poissonized update-generation schedules may sometimes recover a tractable analytic proxy.

Under its stated assumptions, AoM emerges as a distributional notion of model staleness rather than a scalar summary. The exact shortest-path representation clarifies which aspects of a networked learning or deployment system dominate freshness: the source generation rate PRESERVED_PLACEHOLDER_^^^^2id:(Nasser et al., 2022) OR title:\22^^^^9, the service rates PRESERVED_PLACEHOLDER_^^^^2id:(Nasser et al., 2022) OR title:\2max_results2query2^^^^ on critical edges, and the presence or absence of parallel routes that can carry fresher models more quickly.