Queueing networks
Queueing networks
复制标题
DOI:
10.1007/0-387-21748-7_14
复制
发表时间:
1999
期刊:
影响因子:
--
通讯作者:
Xiuli Chao
中科院分区:
文献类型:
--
作者:
Xiuli Chao
In this chapter we continue applying the continuous-mapping approach to establish heavy-traffic stochastic-process limits for queues, giving special attention to the possibility of having unmatched jumps in the limit process. Paralleling our application of the one-dimensional reflection map to obtain heavy-traffic limits for single queues in Chapters 5, 8 and 9, we now apply the multidimensional reflection map to obtain heavy-traffic limits for queueing networks. As before, we omit some proofs. These proofs plus additional supporting material appear in Chapter 8 of the Internet Supplement.For background on queueing (or stochastic) networks, see Kelly (1979), Whittle (1986), Walrand (1988) and Serfozo (1999). For related discussions of heavytraffic limits for queueing networks, see Chen and Mandelbaum (1994a, b), Harrison (1988, 2000, 2001a, b), Chen and Yao (2001) and Kushner (2001). The literature is discussed further at the end of this chapter. The (standard) multidimensional reflection map was used with the continuous mapping theorem by Harrison and Reiman (1981a, b) and Reiman (1984a) to establish heavy-traffic limits with reflected Brownian motion limit processes for vector-valued queue-length, waiting-time and workload stochastic processes in single-class open queueing networks. Since Brownian motion and reflected Brownian motion have continuous sample paths, the topology of uniform convergence over bounded intervals could be used for those results. Variants of the M1 topologies are needed to obtain alternative stochastic-process limits with discontinuous sample paths, such as reflected Lévy processes, when the discontinuities in the sam-