Product form solution for exponential G-networks with dependent service and completion of service of killed customers

Queueing networks with negative customers (G-networks), Poisson flow of positive customers, multi-server exponential nodes, and dependent service at the different nodes are studied. Every customer arriving at the network is defined by a set of random parameters: customer route, the length of customer route, customer volume and his service time at each route stage as well. A killed positive customer is removed at the last place in the queue and quits the network just after his remaining service time will be elaborated. For such G-networks, the multidimensional stationary distribution of the network state probabilities is shown to be representable in product form. © Springer-Verlag 2006.

Авторы
Bocharov P. 1 , D'Apice C.2 , Pechinkin A. 3
Номер выпуска
3
Язык
Английский
Страницы
177-192
Статус
Опубликовано
Том
3
Год
2006
Организации
  • 1 Department of Probability Theory and Mathematical Statistics, Peoples' Friendship University of Russia, Moscow, Russian Federation
  • 2 Department of Information Engineering and Applied Mathematics, University of Salerno, Salerno, Italy
  • 3 Institute of Informatics Problem, Russian Academy of Sciences, Moscow, Russian Federation
Ключевые слова
Communication networks; Dynamic routing; Heuristics; Mutiobjective optimisation
Цитировать
Поделиться

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