{"title":"多媒体流量预留容量","authors":"M. Mowbray, G. Karlsson, Torsten Köhler","doi":"10.1088/0967-1846/5/1/002","DOIUrl":null,"url":null,"abstract":"We introduce a new scheduling algorithm for multimedia traffic using capacity reservation. We compare it with other algorithms in the literature. It has been implemented and its worst-case performance has been analysed. It appears to give a noticeably improved quality of service to delay-sensitive traffic.","PeriodicalId":404872,"journal":{"name":"Distributed Syst. Eng.","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"26","resultStr":"{\"title\":\"Capacity reservation for multimedia traffic\",\"authors\":\"M. Mowbray, G. Karlsson, Torsten Köhler\",\"doi\":\"10.1088/0967-1846/5/1/002\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We introduce a new scheduling algorithm for multimedia traffic using capacity reservation. We compare it with other algorithms in the literature. It has been implemented and its worst-case performance has been analysed. It appears to give a noticeably improved quality of service to delay-sensitive traffic.\",\"PeriodicalId\":404872,\"journal\":{\"name\":\"Distributed Syst. Eng.\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"26\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Distributed Syst. Eng.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1088/0967-1846/5/1/002\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Distributed Syst. Eng.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1088/0967-1846/5/1/002","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We introduce a new scheduling algorithm for multimedia traffic using capacity reservation. We compare it with other algorithms in the literature. It has been implemented and its worst-case performance has been analysed. It appears to give a noticeably improved quality of service to delay-sensitive traffic.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
