技术说明:MAP_t/Ph_t/∞排队系统与多类[MAP_t/Ph_t/∞]^K排队网络

Technical Note: The MAPt/Pht/∞ Queueing System and Multiclass [MAPt/Pht/∞]K Queueing Network

INFORMS journal on computing · 2017
被引 0
UTD 24ABS 3

中文导读

调整了已知数值方法,使其能处理更一般的MAP_t/Ph_t/∞排队系统及多类网络中的自相关到达过程,并给出协方差的封闭微分方程,适用于电信、交通等突发性到达场景。

Abstract

In this paper we demonstrate how a key adjustment to known numerically exact methods for evaluating time-dependent moments of the number of entities in the Ph t /Ph t /∞ queueing system and [Ph t /Ph t /∞] K queueing network may be implemented to capture the effect of autocorrelation that may be present in arrivals to the more general MAP t /Ph t /∞ queueing system and multiclass [MAP t /Ph t /∞] K queueing network. The MAP t is more general than the Ph t arrival process in that it allows for stationary nonrenewal point processes, as well as the time-dependent generalization of nonrenewal point processes. Modeling real-world systems with bursty arrival processes such as those in telecommunications and transportation, for example, necessitate the use of nonrenewal processes. Finally, we show that the covariance of the number of entities at different nodes and times may be described by a single closed differential equation. The online supplement is available at https://doi.org/10.1287/ijoc.2016.0736 .

排队论随机过程运筹学计算机网络