产品表单排队网络的计算算法

Performance Pub Date : 1980-05-28 DOI:10.1145/1009375.806144

K. Chandy, C. H. Sauer

{"title":"产品表单排队网络的计算算法","authors":"K. Chandy, C. H. Sauer","doi":"10.1145/1009375.806144","DOIUrl":null,"url":null,"abstract":"In the last two decades there has been special interest in queueing networks with a product form solution. These have been widely used as models of computer systems and communication networks. Two new computational algorithms for product form networks are presented. A comprehensive treatment of these algorithms and the two important existing algorithms, convolution and mean value analysis, is given.","PeriodicalId":32394,"journal":{"name":"Performance","volume":"47 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"1980-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"57","resultStr":"{\"title\":\"Computational algorithms for product form queueing networks\",\"authors\":\"K. Chandy, C. H. Sauer\",\"doi\":\"10.1145/1009375.806144\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the last two decades there has been special interest in queueing networks with a product form solution. These have been widely used as models of computer systems and communication networks. Two new computational algorithms for product form networks are presented. A comprehensive treatment of these algorithms and the two important existing algorithms, convolution and mean value analysis, is given.\",\"PeriodicalId\":32394,\"journal\":{\"name\":\"Performance\",\"volume\":\"47 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1980-05-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"57\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Performance\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1009375.806144\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Performance","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1009375.806144","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 57

摘要

在过去的二十年里，人们对具有产品形式解决方案的排队网络产生了特别的兴趣。这些模型已被广泛用作计算机系统和通信网络的模型。提出了两种新的产品形态网络计算算法。对这些算法以及现有的两种重要算法卷积和均值分析进行了综合分析。

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

查看原文本刊更多论文

Computational algorithms for product form queueing networks

In the last two decades there has been special interest in queueing networks with a product form solution. These have been widely used as models of computer systems and communication networks. Two new computational algorithms for product form networks are presented. A comprehensive treatment of these algorithms and the two important existing algorithms, convolution and mean value analysis, is given.

求助全文

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

来源期刊

Performance

自引率

0.00%

发文量