Queuing system with processor sharing and limited resources

摘要: Consideration was given to a processor-sharing system with heterogeneous customers serviced by resources of two types: the first, discrete, type necessarily consists an integer number N units (servers), and second (memory) may be discrete or continuous. The customer is defined first-type required service it. In addition need for resource, each characterized certain volume, that is, amount second-type resource total (total busy type) in limited positive value (memory space) V. volume its length (amount work it) are generally dependent. Their joint distribution also depends on type. For this system, stationary sojourning probabilities losing were determined.