Efficient stable recursion to compute multiservice blocking probabilities

Performance Evaluation

Volumn 43, Issue 2-3, 2001, Pages 151-164

  Berezner, S A ^a   Krzesinski, A E ^b  

^a UNIVERSITY OF MELBOURNE   (Australia)

^b STELLENBOSCH UNIVERSITY   (South Africa)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BANDWIDTH; PROBABILITY; RECURSIVE FUNCTIONS;

CALL BLOCKING PROBABILITY; MULTISERVICE BROADBAND NETWORKS; STOCHASTIC KNAPSACK;

BROADBAND NETWORKS;

EID: 0035254272     PISSN: 01665316     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-5316(00)00042-0     Document Type: Article

References (6)

1. Berezner S.A., Krzesinski A.E., Taylor P.G. A product-form loss network with a form of queuing. J. Appl. Prob. 34:1997;1075-1078.
2. Kaufman J.S. Blocking in a shared resource environment. IEEE Trans. Commun. COM-29(10):1981;1474-1481.
3. F.P. Kelly, Reversibility and Stochastic Networks, Wiley, Chichester, UK, 1979.
4. A.A. Nilsson, M.J. Perry, Multirate blocking probabilities: numerically stable computations, in: V. Ramaswami, P.E. Wirth (Eds.), Proceedings of the ITC 15, Elsevier, Amsterdam, 1997, pp. 1359-1368.
5. J.W. Roberts, A service system with heterogeneous user requirements, in: G. Pujolle (Ed.), Performance of Data Communications Systems and their Applications, North-Holland, Amsterdam, 1981, pp. 423-431.
6. K.W. Ross, Multiservice Loss Models for Broadband Telecommunication Networks, Springer, Berlin, 1995.