In this section, we present AoI calculation with the LCFS queue for the single-source \(n\) -server homogeneous network using SHS techniques. Note that to compute the average AoI, Lemma REF  requires solving \(|\mathcal {Q}|(n+1)\)  linear equations of \( \lbrace {\mathbf {v}}_{{q}}, {q} \in \mathcal {Q} \rbrace \) . To obtain explicit solutions for these equations, the complexity grows with the number of discrete states. Since the discrete state typically represents the number of idle servers in the system for homogeneous servers, \(|\mathcal {Q}|\)  should be \(n+1\) . In the following, we introduce a method inspired by [1]} to reduce the number of discrete states and efficiently describe the transitions.
