We investigate the performance of a status monitoring system, in which a sensor sends random status updates over a network to a remote monitor. Specifically, we analyze the status age metric, which characterizes how old the information at the monitor is from the last received status update. The system on which we focus is a single queue with 2 servers (specifically, an M/M/2). In a dynamic network, different status packets may take different routes to the monitor, which allows for the possibility of packets arriving out of order. In the case of the status monitoring system, only the latest status is useful. Studying a system with 2 servers allows for the possibility of packets to arrive out-of-order while still having to queue. We present the exact approach to computing the analytical status age, and we provide an approximation that matches very closely with the simulated age. We also compare with the M/M/∞ and M/M/1, and we demonstrate the tradeoff between status age and network resource consumption.