...
首页> 外文期刊>Mathematics of operations research >Workload interpretation for Brownian models of stochastic processing networks
【24h】

Workload interpretation for Brownian models of stochastic processing networks

机译:随机处理网络布朗模型的工作量解释

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

摘要

Brownian networks are a class of stochastic system models that can arise as heavy traffic approximations for stochastic processing networks. In earlier work we developed the "equivalent workload formulation" of a generalized Brownian network: denoting by Z(t) the state vector of the generalized Brownian network at time t, one has a lower dimensional state descriptor W(t) = MZ(t) in the equivalent workload formulation, where M is an arbitrary basis matrix for a linear space a that is orthogonal to the space of so-called "reversible displacements." Here we use the special structure of a stochastic processing network to develop a more extensive interpretation of the equivalent workload formulation associated with its Brownian network approximation. In particular, we (i) characterize and interpret the notion of a reversible displacement, and (ii) show how the basis matrix M can be constructed from the basic optimal solutions of a certain dual linear program. The latter provides a mechanism for reducing the choices for M from an infinite set to a finite one (when the workload dimension exceeds one). We illustrate our results for an example of a closed stochastic processing network.
机译:布朗网络是一类随机系统模型,可以作为随机处理网络的大量流量近似值出现。在较早的工作中,我们开发了广义布朗网络的“等效工作量公式”:用Z(t)表示时间t处广义布朗网络的状态向量,其中一个维数较低的状态描述符W(t)= MZ(t在等效工作量公式中,其中M是与所谓的“可逆位移”的空间正交的线性空间a的任意基础矩阵。在这里,我们使用随机处理网络的特殊结构来开发与其布朗网络近似相关的等效工作量公式的更广泛的解释。特别地,我们(i)表征和解释可逆位移的概念,并且(ii)显示如何从某个对偶线性程序的基本最优解中构造基本矩阵M。后者提供了一种机制,用于将M的选择从一个无限集减少到一个有限集(当工作量维超过1个时)。我们以一个封闭的随机处理网络为例来说明我们的结果。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号