基于Erlang流量模型配置UNIX STREAMS通信缓冲区

[1988] Proceedings. Computer Networking Symposium Pub Date : 1988-04-11 DOI:10.1109/CNS.1988.5001

T. P. Lee, R. E. Barkley

{"title":"基于Erlang流量模型配置UNIX STREAMS通信缓冲区","authors":"T. P. Lee, R. E. Barkley","doi":"10.1109/CNS.1988.5001","DOIUrl":null,"url":null,"abstract":"The authors describe a STREAMS communication buffer allocation algorithm based on the blocking probability, given the total amount of communication buffer memory. Memory requests are modeled as Erlang B traffic characterized by the mean interarrival time and mean buffer holding time for each size. The objective function to be minimized is the total number of blocked requests for the given traffic subject to the memory constraint.<<ETX>>","PeriodicalId":112149,"journal":{"name":"[1988] Proceedings. Computer Networking Symposium","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Configuring UNIX STREAMS communication buffers based on an Erlang traffic model\",\"authors\":\"T. P. Lee, R. E. Barkley\",\"doi\":\"10.1109/CNS.1988.5001\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors describe a STREAMS communication buffer allocation algorithm based on the blocking probability, given the total amount of communication buffer memory. Memory requests are modeled as Erlang B traffic characterized by the mean interarrival time and mean buffer holding time for each size. The objective function to be minimized is the total number of blocked requests for the given traffic subject to the memory constraint.<<ETX>>\",\"PeriodicalId\":112149,\"journal\":{\"name\":\"[1988] Proceedings. Computer Networking Symposium\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-04-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1988] Proceedings. Computer Networking Symposium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CNS.1988.5001\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1988] Proceedings. Computer Networking Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CNS.1988.5001","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

在给定通信缓冲区内存总量的情况下，提出了一种基于阻塞概率的STREAMS通信缓冲区分配算法。内存请求建模为Erlang B流量，其特征是每个大小的平均到达间隔时间和平均缓冲区保持时间。最小化的目标函数是给定流量在内存约束下被阻塞请求的总数。

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

查看原文本刊更多论文

Configuring UNIX STREAMS communication buffers based on an Erlang traffic model

The authors describe a STREAMS communication buffer allocation algorithm based on the blocking probability, given the total amount of communication buffer memory. Memory requests are modeled as Erlang B traffic characterized by the mean interarrival time and mean buffer holding time for each size. The objective function to be minimized is the total number of blocked requests for the given traffic subject to the memory constraint.<>

求助全文

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

来源期刊

[1988] Proceedings. Computer Networking Symposium

自引率

0.00%

发文量