Traffic Equations for Fluid Networks with Overflows

Abstract

Many real life queueing networks have finite buffers with overflows. To understand the behavior of such networks, we consider traffic equations that generalize the traffic equations of classic open queueing networks where some nodes are potentially overloaded. We present a novel, efficient algorithm for solving the equations for overflow networks together with a sufficient condition for existence and uniqueness of solutions. Our analysis also sharpens results of traffic equations for classic open queueing networks.