Throughput performance of distributed applications in switched networks in presence of end-system bottlenecks

The steady state throughput performance of distributed applications deployed in switched networks in presence of end-system bottlenecks is studied in this paper. The e ect of various limitations at an end-system is modelled as an equivalent transmission capacity limitation. A class of distributed applications is characterised by a static tra c distribution matrix that determines the communication between various components of the application. It is found that uniqueness of steady state throughputs depends only on the tra c distribution matrix and that some applications (e.g., broadcast applications) can yield nonunique values for the steady state component throughputs. For a given switch capacity, with tra c distribution that yield fair unique throughputs, the tradeo between the end-system capacity and the number of application components is brought out. With a proposed distributed rate control, it has been illustrated that it is possible to have unique solution for certain tra c distributions which is otherwise impossible. Also, by proper selection of rate control parameters, various throughput performance objectives can be realised.