{"title":"轮询与载波感知碰撞检测通信系统的理论性能分析","authors":"E. Arthurs, B. Stuck","doi":"10.1145/800081.802669","DOIUrl":null,"url":null,"abstract":"A set of stations wish to transmit messages to one another over a shared link. Messages are generated either according to so called finite source or infinite source arrival statistics. The message lengths are independent identically distributed random variables. Two policies for arbitrating contention are compared: polling, and carrier sense collision detection. The maximum mean throughput rate and mean message delay is calculated as a function of model parameters.","PeriodicalId":217472,"journal":{"name":"Proceedings of the seventh symposium on Data communications","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1981-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":"{\"title\":\"A theoretical performance analysis of polling and carrier sense collision detection communication systems\",\"authors\":\"E. Arthurs, B. Stuck\",\"doi\":\"10.1145/800081.802669\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A set of stations wish to transmit messages to one another over a shared link. Messages are generated either according to so called finite source or infinite source arrival statistics. The message lengths are independent identically distributed random variables. Two policies for arbitrating contention are compared: polling, and carrier sense collision detection. The maximum mean throughput rate and mean message delay is calculated as a function of model parameters.\",\"PeriodicalId\":217472,\"journal\":{\"name\":\"Proceedings of the seventh symposium on Data communications\",\"volume\":\"27 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1981-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"19\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the seventh symposium on Data communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/800081.802669\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the seventh symposium on Data communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/800081.802669","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A theoretical performance analysis of polling and carrier sense collision detection communication systems
A set of stations wish to transmit messages to one another over a shared link. Messages are generated either according to so called finite source or infinite source arrival statistics. The message lengths are independent identically distributed random variables. Two policies for arbitrating contention are compared: polling, and carrier sense collision detection. The maximum mean throughput rate and mean message delay is calculated as a function of model parameters.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
