| Autor: |
Moscholios, I. D., Vardakas, J. S., Logothetis, M. D., Boucouvalas, A. C. |
| Zdroj: |
2012 IEEE International Conference on Communications (ICC); 1/ 1/2012, p1281-1286, 6p |
| Abstrakt: |
In this paper, we consider a single link that supports both elastic and adaptive traffic of Batch Poisson arriving calls, under the Bandwidth Reservation (BR) policy, whereby we can achieve specific QoS per service-class. Arriving batches have a generally distributed batch size, and can be serviced either as a whole or in part (partial batch blocking discipline), depending on the available link bandwidth. Blocked calls are lost. Accepted calls of a batch can compress or expand their bandwidth; elastic calls expand or compress their service time accordingly, while adaptive calls do not alter their service time. This system does not have a Product Form Solution. For the efficient calculation of time and call congestion probabilities as well as link utilization, we derive approximate but recursive formulas. The accuracy of the model is completely satisfactory and is verified together with the model's consistency, through simulation. Comparison of the new model with existing models reveals its necessity. [ABSTRACT FROM PUBLISHER] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
