Characteristics of Lost and Served Packets for Retrial Queueing System with General Renovation and Recurrent Input Flow

被引：1
|
作者：
Bogdanova, E. V. [1 ]
Zaryadov, I. S. [1 ,2 ]
Milovanova, T. A. [1 ]
Korolkova, A. V. [1 ]
Kulyabov, D. S. [1 ,3 ]
机构：
[1] RUDN Univ, Dept Appl Probabil & Informat, 6 Miklukho Maklaya Str, Moscow 117198, Russia
[2] Russian Acad Sci, Fed Res Ctr Comp Sci & Control, Inst Informat Problems, 44-2 Vavilova Str, Moscow 119333, Russia
[3] Joint Inst Nucl Res, Lab Informat Technol, Joliot Curie 6, Dubna 141980, Moscow Region, Russia
来源：
DISTRIBUTED COMPUTER AND COMMUNICATION NETWORKS (DCCN 2018) | 2018年 / 919卷
基金：
俄罗斯基础研究基金会;
关键词：
Retrial queueing system; General renovation; Recurrent input flow; Repeated service; Probability-time characteristics; Lost packet; Served packet; WAITING TIME; STATIONARY; NETWORKS; OVERLOAD; BUNKER;
D O I：
10.1007/978-3-319-99447-5_28
中图分类号：
TN [电子技术、通信技术];
学科分类号：
0809 ;
摘要：
The retrial queuing system with general renovation is under investigation. The mechanism of general renovation with retrials means that the packet at the end of its service in accordance with a given probability distribution discards a certain number of other packets from the buffer and itself stays in the system for another round of service, or simply leaves the system without any effect on it. In order to obtain some probability and time related performance characteristics the embedded Markov chain technique is applied. Under the assumption of the existence of a stationary regime, the steady-state probability distribution (for the embedded Markov chain) of the number of packets in the system is obtained, as well as some other characteristics, such as the probability of the accepted task to be served or the probability of the accepted task to be dropped from the buffer, the probability distribution of number of repeated services. Also time characteristics are given.
引用
收藏
页码：327 / 340
页数：14
相关论文
共 43 条
12345