Notify me of new papers
via Email or RSS

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.

SUGGESTED CITATION:
Scott Jordan and Pravin Varaiya, "Throughput in multiple service, multiple resource communication networks" (1991). IEEE Transactions on Communications. 39 (8), pp. 1216-1222. 10.1109/26.134011. Postprint available free at: http://repositories.cdlib.org/postprints/900

REQUIRED PUBLISHER STATEMENT:
© 1991 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.