东北大学学报（自然科学版）

东北大学学报（自然科学版） ›› 2013, Vol. 34 ›› Issue (11): 1537-1541.DOI: 10.12068/j.issn.1005-3026.2013.11.005

• 信息与控制 • 上一篇    下一篇

带时间和成本约束的随机流网络可靠度的计算

孙艳蕊   

  1. (东北大学理学院，辽宁沈阳110819)
  • 发布日期:2013-07-09
  • 通讯作者: 孙艳蕊
  • 作者简介:孙艳蕊(1965-)，女，河北丰南人，东北大学教授.
  • 基金资助:
    国家自然科学基金资助项目(51034002)；辽宁省自然科学基金资助项目(201202074).

Reliability Evaluation of StochasticFlow Network Under both Time and Cost Constraints

SUN Yanrui   

  1. School of Sciences， Northeastern University， Shenyang 110819， China.
  • Published:2013-07-09
  • Contact: SUN Yanrui
  • About author:-
  • Supported by:
    -

RichHTML

0

PDF (PC)

550

摘要： 给出了一种求满足传输量要求的时间和成本约束下网络的所有极小状态(下界点集)的简单方法.讨论了基于下界点集合的可靠度的容斥原理公式，直接应用容斥原理公式会有很多相互抵消的项.如果所有的数据通过k条不相交的极小路径同时传输，只需讨论r-1项和r(1

关键词: 时间约束, 成本约束, 随机流网络, 容斥原理公式, 可靠度

Abstract: A simple method was proposed to generate all minimal system states fulfilling the demand， time， and budget constraints (all lower boundary points). Inclusionexclusion formula with the lower boundary points was discussed. There are many cancelling terms in the direct expansion of the probability of a union of events， so an algorithm was proposed to determine the canceling terms. All data were supposed to be transmitted through k disjoint minimal paths simultaneously. It was pointed out that if all the pairs of canceling terms that unions of r1 terms and r terms(1<r≤k) were found out， the canceling terms of other unions in inclusionexclusion formula could be determined. The reliability formula was greatly simplified by using the proposed algorithm.

Key words: time constraint, cost constraint, stochasticflow network, inclusionexclusion formula, reliability

中图分类号: