期刊文献+

分布式环境中排队网络的平均时延研究

The Average Queueing Delay in Distributed Network Environment
下载PDF
导出
摘要 在分布式环境中,对多个互联队列的排队问题进行分析,在最短的时间内让排队任务得到响应,如果通信流是泊松分布而服务时间是指数分布的,采用Jackson定理进行分析,得出精确而简单的解析法来计算排队时候的平均时延. In a distributed environment,the problem of queuing multiple interconnected queues was analyzed,making up the tasks in the shortest time response.If the traffic is Poisson distribution and business hours is exponential distribution,using Jackson theorem analysis,the authors obtain the average delay analysis method for precise and simple to calculate queuing time.
出处 《河南科学》 2013年第6期800-802,共3页 Henan Science
基金 河南省商丘市科技局重点科技攻关项目(20112017)
关键词 分布式网络 通信量的分开和合并 队列 平均时延 distributed network splitting and merging communication traffic queue average time delay
  • 相关文献

参考文献2

二级参考文献13

  • 1徐仲济.蒙特卡洛方法[M].上海:上海科学技术出版社,1985.
  • 2Glass C A, Shafransky Y M, Strusevich V A. Scheduling for parallel dedicated machines with a single server [J] Naval Research Logistics, 2000,47(4) :304 - 328.
  • 3Garey M R,Johnson D S. Computers and Intractability.. a guide to the theory of NP-Completeness [M]. San Francisco ~ Freeman, 1979.
  • 4Hall N G, Potts C N, Sriskandarajah C. Parallel machine scheduling with a common server[J]. Discrete Applied Mathematics, 2000,102(3) .. 223 - 243.
  • 5Abdekhodaee A H,Wirth A, Gan H S. Scheduling two parallel machines with a single server: the general case [J]. Computers~OperationsResearch, 2006,33(4):994 -1009.
  • 6Yip Y, Cheng C Y, Low C. Sequencing of an M machine flow shop with setup, processing and removal times separated [J] International Journal of Advanced Manufacturing Technology, 2006,30(3/4) : 286 - 296.
  • 7Cheng T C E, Kovalyov M Y. Scheduling a single server in a two-machine flow shop[J]. Computing, 2003,70(2) : 167 - 180.
  • 8Brucker P, Knust S, Wang G Q. Complexity results for flow-shop problems with a single server [J]. European Journal of Operational Research, 2005,165 (2) .. 398 - 407.
  • 9Iravani S M R, Teo C P. Asymptotically optimal schedules for single-server flow shop problems with setup costs and times [J]. Operations Research Letters, 2005, 33(4) :421 - 430.
  • 10Su L H, Lee Y Y. The two-machine flowshop no-wait scheduling problem with a single server to minimize the total completion time [J]. Computers ~ Operations Research, 2008,35(9) :2952 - 2963.

共引文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部