{"title":"基于阈值算法的B-ISDN/ATM中VBR视频和CBR混合业务优先级统计复用","authors":"R. Izmailov, E. Ayanoglu","doi":"10.1109/INFCOM.1993.253276","DOIUrl":null,"url":null,"abstract":"The authors analyze a threshold priority access statistical multiplexing technique with a Markov modulated fluid source model for variable-bit-rate (VBR) video traffic, and an exact constant-bit-rate (CBR) model. Exact expressions for loss probabilities and delay are obtained. Based on these quality-of-service parameters, buffer size requirements of the statistical multiplexer are obtained, and the performance of a fixed threshold algorithm is compared with that of a rate-based threshold algorithm. The results provide the tradeoffs between buffer size and processing complexity for control. The exact analytical results can be used to calculate buffer size requirements.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Priority statistical multiplexing of mixed VBR video and CBR traffic in B-ISDN/ATM with a threshold algorithm\",\"authors\":\"R. Izmailov, E. Ayanoglu\",\"doi\":\"10.1109/INFCOM.1993.253276\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors analyze a threshold priority access statistical multiplexing technique with a Markov modulated fluid source model for variable-bit-rate (VBR) video traffic, and an exact constant-bit-rate (CBR) model. Exact expressions for loss probabilities and delay are obtained. Based on these quality-of-service parameters, buffer size requirements of the statistical multiplexer are obtained, and the performance of a fixed threshold algorithm is compared with that of a rate-based threshold algorithm. The results provide the tradeoffs between buffer size and processing complexity for control. The exact analytical results can be used to calculate buffer size requirements.<<ETX>>\",\"PeriodicalId\":166966,\"journal\":{\"name\":\"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-03-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INFCOM.1993.253276\",\"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 '93 The Conference on Computer Communications, Proceedings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFCOM.1993.253276","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Priority statistical multiplexing of mixed VBR video and CBR traffic in B-ISDN/ATM with a threshold algorithm
The authors analyze a threshold priority access statistical multiplexing technique with a Markov modulated fluid source model for variable-bit-rate (VBR) video traffic, and an exact constant-bit-rate (CBR) model. Exact expressions for loss probabilities and delay are obtained. Based on these quality-of-service parameters, buffer size requirements of the statistical multiplexer are obtained, and the performance of a fixed threshold algorithm is compared with that of a rate-based threshold algorithm. The results provide the tradeoffs between buffer size and processing complexity for control. The exact analytical results can be used to calculate buffer size requirements.<>
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
