Search for: [Description = "In this paper we consider a link, characterized by specific capacity, that services multi\-rate random or quasirandom traffic. Random traffic is generated by an infinite number of traffic sources, while quasi\-random traffic is generated by a finite population of traffic sources. The link is modeled as a multi\-rate loss system. Handover and new calls are distinguished. New calls compete for the available bandwidth under a threshold call admission policy. In that policy, a new call of a particular service\-class is not allowed to enter the system if the in\-service handover and new calls of the same service\-class plus the new call, exceed a predefined threshold \(which can be different for each service\-class\). On the other hand, handover calls compete for the available bandwidth based on the complete sharing policy. We show that the steady state probabilities in the proposed models have a product form solution \(PFS\). The PFS leads to a convolution algorithm for accurate calculation of congestion probabilities and link utilization"]

Number of results: 1