Tail asymptotics of the stationary distribution for a two-node generalized Jackson networkTail asymptotics of the stationary distribution for a two-node generalized Jackson network
Tail asymptotics of the stationary distribution for a two-node generalized Jackson networkTail asymptotics of the stationary distribution for a two-node generalized Jackson network
复制标题
两节点广义 Jackson 网络的平稳分布的尾部渐进性两节点广义 Jackson 网络的平稳分布的尾部渐进性
DOI:
10.1145/2667522.2667545
复制
发表时间:
2014
期刊:
影响因子:
--
通讯作者:
Masakiyo Miyazawa
中科院分区:
文献类型:
--
作者:
J. Mori;Y. Kajikawa;H. Kashima;and I. Sakata;Masakiyo Miyazawa
A primary interest of this paper is to find tail asymptotics of the stationary distribution of a generalized Jackson network with two nodes under phase-type setting, provided its stability holds. Here, the phase type setting is meant that the arrival processes are the so called Markov arrival processes, and the service time distributions are of phase type. We consider two types of the tail asymptotics, the tail decay rate of the marginal stationary distribution in an arbitrary direction and those for the joint stationary probabilities in the coordinate directions.There are two major reasons why those tail asymptotics are interesting particularly for the two-node generalized Jackson network. Before discussing them, we recall what is the generalized Jackson network and how it has been studied. A queueing network in which at each node customers finishing service are independently routed according to given probabilities and their service times are iid is called a generalized Jackson network when exogenous arrivals and service times at each node are independent but their distributions are general. Here, service discipline at each node is assumed to be first-come and first-served. If the exogenous arrival processes are time-homogeneous Poisson and the service times are exponentially distributed, then this network becomes the well known Jackson network. Thus, the generalized Jackson network is a natural generalization of the Jackson network. In this paper, we assume that each node has a single server.