Throughput in multiple service, multiple resource communication networks

Publisher Website
Google Scholar
Abstract
Communication networks that integrate multiple services using multiple resources are considered. In particular, the authors pose resource allocation problems, present a sensitivity analysis, and provide a glimpse of the possible behavior of such networks. The simplest discipline is assumed: a service request is accepted if the necessary resources are available; otherwise it is rejected. Two results are obtained. The first gives the sensitivity of throughput of service requests of type i with respect to offered traffic and service rates of type j. The second result is that the set of vectors of achievable throughput rates is a convex polyhedron given by an explicit set of linear inequalities.