一种简单的窗口随机存取算法，具有优越的性能

IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution? Pub Date : 1988-03-27 DOI:10.1109/INFCOM.1988.13006

M. Paterakis, P. Papantoni-Kazakos

{"title":"一种简单的窗口随机存取算法，具有优越的性能","authors":"M. Paterakis, P. Papantoni-Kazakos","doi":"10.1109/INFCOM.1988.13006","DOIUrl":null,"url":null,"abstract":"A simple full-feedback-sensing window random-access algorithm is proposed and analyzed in the presence of the Poisson user model. The throughput of the algorithm is 0.43. The proposed algorithm is better than J.I. Capetanaki's dynamic algorithm (1979) with respect to its delay and resistance to channel errors. The simple operations of the algorithm, along with its regenerative properties, facilitate the computation of the output traffic interdeparture distribution. The obtained distribution is useful in the evaluation of interacting systems which adopt the algorithm for their internal transmissions.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"15 5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"106","resultStr":"{\"title\":\"A simple window random access algorithm with advantageous properties\",\"authors\":\"M. Paterakis, P. Papantoni-Kazakos\",\"doi\":\"10.1109/INFCOM.1988.13006\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A simple full-feedback-sensing window random-access algorithm is proposed and analyzed in the presence of the Poisson user model. The throughput of the algorithm is 0.43. The proposed algorithm is better than J.I. Capetanaki's dynamic algorithm (1979) with respect to its delay and resistance to channel errors. The simple operations of the algorithm, along with its regenerative properties, facilitate the computation of the output traffic interdeparture distribution. The obtained distribution is useful in the evaluation of interacting systems which adopt the algorithm for their internal transmissions.<<ETX>>\",\"PeriodicalId\":436217,\"journal\":{\"name\":\"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?\",\"volume\":\"15 5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-03-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"106\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INFCOM.1988.13006\",\"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 '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFCOM.1988.13006","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 106

摘要

在泊松用户模型下，提出并分析了一种简单的全反馈感知窗口随机访问算法。该算法的吞吐量为0.43。该算法在延迟和抗信道误差方面优于J.I. Capetanaki的动态算法(1979)。该算法操作简单，且具有再生特性，便于计算输出车流的交叉口分布。所得到的分布对于采用该算法进行内部传输的相互作用系统的评估是有用的。

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

查看原文本刊更多论文

A simple window random access algorithm with advantageous properties

A simple full-feedback-sensing window random-access algorithm is proposed and analyzed in the presence of the Poisson user model. The throughput of the algorithm is 0.43. The proposed algorithm is better than J.I. Capetanaki's dynamic algorithm (1979) with respect to its delay and resistance to channel errors. The simple operations of the algorithm, along with its regenerative properties, facilitate the computation of the output traffic interdeparture distribution. The obtained distribution is useful in the evaluation of interacting systems which adopt the algorithm for their internal transmissions.<>

求助全文

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

来源期刊

IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?

自引率

0.00%

发文量