Cyclic networks with general blocking and starvation |
| |
Authors: | Rajendran Rajan Rajeev Agrawal |
| |
Institution: | (1) Department of Electrical and Computer Engineering, University of Wisconsin-Madison, 53706-1691 Madison, WI, USA |
| |
Abstract: | We introducegeneral starvation and consider cyclic networks withgeneral blocking and starvation (GBS). The mechanism of general blocking allows the server to process a limited number of jobs when the buffer downstream is full, and that of general starvation allows the server to perform a limited number of services in anticipation of jobs that are yet to arrive. The two main goals of this paper are to investigate how the throughput of cyclic GBS networks is affected by varying (1) the total number of jobsJ, and (2) the buffer allocationk=(k1..., km) subject to a fixed total buffer capacityK=k
1 +... + km. In particular, we obtain sufficient conditions for the throughput to be symmetric inJ and to be maximized whenJ=K/2. We also show that the equal buffer allocation is optimal under the two regimes of light or heavy usage. In order to establish these results, we obtain several intermediate structural properties of the throughput, using duality, reversibility, and concavity, which are of independent interest.Research supported in part by NSF Grant No. ECS-8919818. |
| |
Keywords: | Cyclic networks general blocking and starvation duality reversibility concavity symmetry buffer allocation |
本文献已被 SpringerLink 等数据库收录! |
|