{"title":"多接收机选择性重复ARQ中的重排序延迟和缓冲占用","authors":"N. Shacham, D. Towsley","doi":"10.1109/INFCOM.1988.12958","DOIUrl":null,"url":null,"abstract":"The authors consider an SR ARQ (selective-repeat automatic-repeat-request) protocol with the one source and multiple receivers, where each receiver acknowledges all packets and handles its resequencing buffer based only on the packets that it receives error-free. An analysis of the resequencing delay and buffer occupancy at a receiver is presented. They construct a model that allows them to derive steady-state results and that makes into consideration system parameters such as number of receivers, propagation delay, and error probabilities of packets and acknowledgements. The main results of the analysis are the distribution of the resequencing delay and the distribution of the number of packets occupying the receiver's buffer. They also derive simple expressions for the mean buffer occupancy at the limit as the packet error probability tends to one. Numerical results are provided to illustrate the effects of system parameters on the behavior of the expected resequencing delay and the expected buffer occupancy.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"42","resultStr":"{\"title\":\"Resequencing delay and buffer occupancy in selective repeat ARQ with multiple receivers\",\"authors\":\"N. Shacham, D. Towsley\",\"doi\":\"10.1109/INFCOM.1988.12958\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors consider an SR ARQ (selective-repeat automatic-repeat-request) protocol with the one source and multiple receivers, where each receiver acknowledges all packets and handles its resequencing buffer based only on the packets that it receives error-free. An analysis of the resequencing delay and buffer occupancy at a receiver is presented. They construct a model that allows them to derive steady-state results and that makes into consideration system parameters such as number of receivers, propagation delay, and error probabilities of packets and acknowledgements. The main results of the analysis are the distribution of the resequencing delay and the distribution of the number of packets occupying the receiver's buffer. They also derive simple expressions for the mean buffer occupancy at the limit as the packet error probability tends to one. Numerical results are provided to illustrate the effects of system parameters on the behavior of the expected resequencing delay and the expected buffer occupancy.<<ETX>>\",\"PeriodicalId\":436217,\"journal\":{\"name\":\"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-03-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"42\",\"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.12958\",\"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.12958","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Resequencing delay and buffer occupancy in selective repeat ARQ with multiple receivers
The authors consider an SR ARQ (selective-repeat automatic-repeat-request) protocol with the one source and multiple receivers, where each receiver acknowledges all packets and handles its resequencing buffer based only on the packets that it receives error-free. An analysis of the resequencing delay and buffer occupancy at a receiver is presented. They construct a model that allows them to derive steady-state results and that makes into consideration system parameters such as number of receivers, propagation delay, and error probabilities of packets and acknowledgements. The main results of the analysis are the distribution of the resequencing delay and the distribution of the number of packets occupying the receiver's buffer. They also derive simple expressions for the mean buffer occupancy at the limit as the packet error probability tends to one. Numerical results are provided to illustrate the effects of system parameters on the behavior of the expected resequencing delay and the expected buffer occupancy.<>