首页> 外文期刊>INFORMS journal on computing >Technical note: The MAP_t/Ph_t/∞ queueing system and multiclass [MAP_t/Ph_t/∞]~K queueing network
【24h】

Technical note: The MAP_t/Ph_t/∞ queueing system and multiclass [MAP_t/Ph_t/∞]~K queueing network

机译:技术说明:MAP_t / Ph_t /∞排队系统和多类[MAP_t / Ph_t /∞]〜K排队网络

获取原文
获取原文并翻译 | 示例
           

摘要

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.
机译:在本文中,我们演示了如何对已知的精确数值方法进行关键调整,以评估Ph_t / Ph_t /∞排队系统和[Ph_t / Ph_t /∞]〜K排队网络中实体数量的时变矩。捕获了可能会在到达更通用的MAP_t / Ph_t /∞排队系统和多类[MAP_t / Ph_t /∞]〜K排队网络时出现的自相关效应。 MAP_t比Ph_t到达过程更通用,因为它允许固定的非更新点过程以及非更新点过程的时间依赖泛化。例如,用突发到达过程(例如电信和运输中的那些)对现实世界的系统进行建模,就必须使用非更新过程。最后,我们表明,可以通过一个封闭的微分方程描述在不同节点和时间的实体数量的协方差。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号