Behaviour of passage time for a queueing network model with feedback a simulation study英文文献资料.docVIP

下载本文档

1
0
约1.83万字
约 13页
2017-05-10 发布于上海
举报
版权申诉

Behaviour of passage time for a queueing network model with feedback a simulation study英文文献资料.doc

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

Behaviour of passage time for a queueing network model with feedback a simulation study英文文献资料

BEHAVIOUROFPASSAGETIMEFORAQUEUEING NETWORKMODELWITHFEEDBACK: ASIMULATIONSTUDY BIDYUT K.MEDYA Received 21June 2002 The study of the queueing system presented in this note was motivated by its possible application toamultiprogramming computer system.Thepaperconsiders aclosednetwork withtwoservice centres withfeedback. Thesteady-state behaviour ofthepassage time,the randomtimesforajobtotraverseaportionofthenetwork,isexamined throughsimulation. The model can beapplied toatwin-processor multiprogramming computer system. 2000 Mathematics Subject Classi?cation: 60K25. 1. Introduction. Inthiswork,wedealwithatwo-stationclosednetworkwhere,after servicecompletionatonecentre,acustomermaymoveeithertotheothercentreorto the tail ofthe queue atthe same centre. Feedback probabilities are speci?ed for each centre.Alsoforeachcentre,weassumeservicetimestobeindependent andexponen- tiallydistributed toensureMarkovian character. Thistypeofmodelsarisesintheoreticalcomputerscience,morespeci?callyregard- ingmultiprocessor multiprogramming environments. WecanthinkofacomputersystembasedonMparallelprocessorswhichcanhandle N statistically identical jobssimultaneously. Thejobscirculate among theprocessors completing identical partial processing. Such a system can be called an M-processor systemwithN degreeofmultiprogramming. Theprocessorsaretheservicenodesand the programs are identi?ed with the jobs. Thus we have a typical situation of closed networkwithfeedback. Theaugmentedjobstackprocesshelpstoidentifythepositionoftheprocessatany instant. We study the behaviour of passage times which are the random times for a job to traverseaportionofthenetwork. Weusethemethodofregenerativesimulationto?ndthesteady-statedistributionof passage timeandthedistribution ofthenumber oftransitions constituting apassage time. Steady-state distribution has been considered in Medya [2] along with supporting simulation studies. Yechiali [6] and Brandon and Yechiali [1] consider N-node open networ