Title :
Throughput in multiple service, multiple resource communication networks
Author :
Jordan, Scott ; Varaiya, Pravin
Author_Institution :
Dept. of Electr. Eng., California Univ., Berkeley, CA, USA
Abstract :
The performance of a telecommunication system is analyzed in terms of the ability of a set of identical resources or servers to process a stream of identical requests. The approach taken is to model this as a point process of identical requests being processed by several identical servers under a variety of disciplines. The introduction of greater intelligence in the signaling system and large communication bandwidth make possible the processing of different types of complex requests using different kinds of resources simultaneously. This situation is modeled as a point process of several request types being processed by several different kinds of servers. The simplest discipline is assumed: a request is accepted if the necessary servers are available; otherwise it is rejected. Two results are obtained. The first gives the sensitivity of throughput of 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 a achievable throughput rates is a convex polyhedron given by an explicit set of linear inequalities
Keywords :
queueing theory; telecommunication networks; telecommunication systems; communication networks; convex polyhedron; linear inequalities; multiple service multiple resource systems; point process; queueing theory; service rates; signaling; telecommunication system; throughput rates; Communication networks; Communication switching; Communication system signaling; Intelligent networks; Joining processes; Network servers; Performance analysis; Switches; Telecommunication switching; Throughput;
Conference_Titel :
Decision and Control, 1989., Proceedings of the 28th IEEE Conference on
Conference_Location :
Tampa, FL
DOI :
10.1109/CDC.1989.70110