Recursive computation for a multi-rate model with elastic traffic and minimum rate guarantees

The main objective of the present paper is to develop an effective algorithm to calculate the performance measures for best-effort traffic transmitting over a multi-service network. We define the single link as a multi-rate loss model with elastic traffic. Elastic flows are assumed to share link capacity in an egalitarian processor sharing (EPS) manner. To ensure flows' minimum transmission rate minimum rate guarantees are introduced. We apply state space partitioning for the number of ongoing elastic flows and maximum of their rate guarantees to obtain a recursive formula, which is the analogue of the well-known Kaufman-Roberts formula for a multi-rate system with streaming unicast traffic. In the paper, we define properties of the state space subsets and corresponding unnormalized probabilities, which are used for the recursive formula derivation. We propose a method to calculate the main model performance measures, i. e. blocking probabilities and mean transfer time. ©2010 IEEE.

Авторы
Язык
Английский
Страницы
1065-1072
Статус
Опубликовано
Номер
5676509
Год
2010
Организации
  • 1 Telecommunication Systems Department, Peoples' Friendship University of Russia, Moscow, Russian Federation
Ключевые слова
Blocking probability; Elastic traffic; Mean flow duration; Processor sharing; Recursive algorithm
Дата создания
19.10.2018
Дата изменения
19.10.2018
Постоянная ссылка
https://repository.rudn.ru/ru/records/article/record/2653/
Поделиться

Другие записи

RUSSIA

Статья
Filippov V.M., Tkach G.F.
International Encyclopedia of Education. Elsevier Ltd. 2010. С. 750-757