Exact numerical evaluation of the stationary joint queue-length distribution of a Markovian finite capacity network with arbitrary size and topology can be obtained numerically. Nonetheless, the main challenge to such an approach remains the dimensionality of the joint distribution, which is exponential in the number of queues. This thesis proposes an analytical approximation of the joint distribution with a dimension that is linear in the number of queues. The method decomposes the network into overlapping subnetworks. The state of each subnetwork is described aggregately, i.e.
