Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: elastic services

Sortuj według:

Ogranicz wyniki do:

Utility optimization-based bandwidth allocation for elastic and inelastic services in peer-to-peer networks

Li Shiyong, Zhang Yue, Wang Yan, Sun Wei

International Journal of Applied Mathematics and Computer Science

2019

Vol. 29, no. 1

111--123

This paper considers reasonable bandwidth allocation for multiclass services in peer-to-peer (P2P) networks, measures the satisfaction of each peer as a customer by a utility function when acquiring one service, and develops an optimization model for bandwidth allocation with the objective of utility maximization. Elastic services with concave utilities are first considered and the exact expression of optimal bandwidth allocation for each peer is deduced. In order to obtain an optimum in distributed P2P networks, we develop a gradient-based bandwidth allocation scheme and illustrate the performance with numerical examples. Then we investigate bandwidth allocation for inelastic services with sigmoidal utilities, which is a nonconvex optimization problem. In order to solve it, we analyze provider capacity provisioning for bandwidth allocation of inelastic services and modify the update rule for prices that service customers should pay. Numerical examples are finally given to illustrate that the improved scheme can also efficiently converge to the global optimum.

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.