Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Powiadomienia systemowe

Sesja wygasła!

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: recursive formula

Sortuj według:

Ogranicz wyniki do:

QoS Equalization in a W-CDMA Cell Supporting Calls of Innite or Finite Sources with Interference Cancelation

Moscholios I. D., Kallos G. A., Katsiva M. A., Vassilakis V. G., Logothetis M. D.

Journal of Telecommunications and Information Technology

2014

nr 3

63--70

In this paper, a multirate loss model for the calculation of time and call congestion probabilities in a Wideband Code Division Multiple Access (W-CDMA) cell is considered. It utilizes the Bandwidth Reservation (BR) policy and supports calls generated by an infinite or finite number of users. The BR policy achieves QoS equalization by equalizing congestion probabilities among calls of dierent service-classes. In the proposed models a multiple access interference is considered, and the notion of local blocking, user's activity and interference cancelation. Although the analysis of the proposed models reveals that the steady state probabilities do not have a product form solution, the authors show that the calculation of time and call congestion probabilities can be based on approximate but recursive formulas, whose accuracy is verified through simulation and found to be quite satisfactory.

Retry Loss Models Supporting Elastic Traffic

Moscholios I. D., Vasilakis V. G., Vardakas J. S., Logothetis M. D.

Advances in Electronics and Telecommunications

2011

Vol. 2, no. 3

8--13

We consider a single-link loss system of fixed capacity, which accommodates K service-classes of Poisson traffic with elastic bandwidth-per-call requirements. When a new call cannot be accepted in the system with its peak-bandwidth requirement, it can retry one or more times (single and multi-retry loss model, respectively) to be connected in the system with reduced bandwidth requirement and increased service time, exponentially distributed. Furthermore, if its last bandwidth requirement is still higher than the available link bandwidth, it can be accepted in the system by compressing not only the bandwidth of all inservice calls (of all service-classes) but also its last bandwidth requirement. The proposed model does not have a product form solution and therefore we propose an approximate recursive formula for the calculation of the link occupancy distribution and consequently call blocking probabilities. The accuracy of the proposed formula is verified by simulation and is found to be quite satisfactory.