优先级队列中稳态概率的递归计算

IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies Pub Date : 1989-04-23 DOI:10.1109/INFCOM.1989.101432

I. Cidon, M. Sidi

{"title":"优先级队列中稳态概率的递归计算","authors":"I. Cidon, M. Sidi","doi":"10.1109/INFCOM.1989.101432","DOIUrl":null,"url":null,"abstract":"Recursive formulas are derived for computing the state probabilities in priority queuing systems (preemptive and nonpreemptive). The derivation is based only on the general structure of the generating function involved, and thus is similar and more general than previous methods. Also discussed are the applications of the method to other queuing systems.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Recursive computation of steady-state probabilities in priority queues\",\"authors\":\"I. Cidon, M. Sidi\",\"doi\":\"10.1109/INFCOM.1989.101432\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Recursive formulas are derived for computing the state probabilities in priority queuing systems (preemptive and nonpreemptive). The derivation is based only on the general structure of the generating function involved, and thus is similar and more general than previous methods. Also discussed are the applications of the method to other queuing systems.<<ETX>>\",\"PeriodicalId\":275763,\"journal\":{\"name\":\"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1989-04-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INFCOM.1989.101432\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFCOM.1989.101432","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 10

摘要

推导了优先级排队系统(抢占式和非抢占式)状态概率的递归计算公式。推导仅基于所涉及的生成函数的一般结构，因此与以前的方法相似且更通用。本文还讨论了该方法在其他排队系统中的应用。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Recursive computation of steady-state probabilities in priority queues

Recursive formulas are derived for computing the state probabilities in priority queuing systems (preemptive and nonpreemptive). The derivation is based only on the general structure of the generating function involved, and thus is similar and more general than previous methods. Also discussed are the applications of the method to other queuing systems.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies

自引率

0.00%

发文量