A multi-layer client–server queueing network model with non-hierarchical synchronous and asynchronous messages

We analyze a multi-layered queueing network that models a client–server system where clients and servers communicate via synchronous and asynchronous messages. The servers are organized in groups such that they form a multi-layered structure. The messaging pattern is non-hierarchical, i.e., a client can send a message to a server belonging to any layer, and a server from a layer-i may issue messages to a server belonging to any higher layer, j>i. The queueing network is analyzed approximately using a decomposition algorithm. Numerical tests show that the approximation algorithm has a good accuracy.