{"title":"视频点播系统中CBR视频流的带宽分配模型与算法","authors":"O. Hadar, M. Segal","doi":"10.1109/ITCC.2001.918781","DOIUrl":null,"url":null,"abstract":"Discusses the problem of bandwidth allocation of constant bit rate (CBR) video streams to compressed video streams in a video-on-demand (VoD) system. We consider the instance of a VoD system where compressed digital video is transmitted with a CBR over a network with limited capacity. This paper has two main purposes: the first is to develop an efficient algorithm for determining the optimal bandwidth under the constraint of minimal buffer size, and the second is to make a comparison between different approaches for bandwidth allocation under the constraint of maximum bandwidth utilization. Together with his request for a specific video stream, each client in the system sends his buffer size and the maximum waiting time for his allowable delay. According to this information, the video server determines a range of transmission rates that can be used by the client without violating the client-buffer constraints (i.e. overflow or underflow). The main contribution of this paper is to suggest a method for allocating a variable network bandwidth on stream initiation in order to service as many users as possible while providing each user with the highest quality service.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Models and algorithms for bandwidth allocation of CBR video streams in a VoD system\",\"authors\":\"O. Hadar, M. Segal\",\"doi\":\"10.1109/ITCC.2001.918781\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Discusses the problem of bandwidth allocation of constant bit rate (CBR) video streams to compressed video streams in a video-on-demand (VoD) system. We consider the instance of a VoD system where compressed digital video is transmitted with a CBR over a network with limited capacity. This paper has two main purposes: the first is to develop an efficient algorithm for determining the optimal bandwidth under the constraint of minimal buffer size, and the second is to make a comparison between different approaches for bandwidth allocation under the constraint of maximum bandwidth utilization. Together with his request for a specific video stream, each client in the system sends his buffer size and the maximum waiting time for his allowable delay. According to this information, the video server determines a range of transmission rates that can be used by the client without violating the client-buffer constraints (i.e. overflow or underflow). The main contribution of this paper is to suggest a method for allocating a variable network bandwidth on stream initiation in order to service as many users as possible while providing each user with the highest quality service.\",\"PeriodicalId\":318295,\"journal\":{\"name\":\"Proceedings International Conference on Information Technology: Coding and Computing\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-04-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings International Conference on Information Technology: Coding and Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITCC.2001.918781\",\"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 International Conference on Information Technology: Coding and Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITCC.2001.918781","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Models and algorithms for bandwidth allocation of CBR video streams in a VoD system
Discusses the problem of bandwidth allocation of constant bit rate (CBR) video streams to compressed video streams in a video-on-demand (VoD) system. We consider the instance of a VoD system where compressed digital video is transmitted with a CBR over a network with limited capacity. This paper has two main purposes: the first is to develop an efficient algorithm for determining the optimal bandwidth under the constraint of minimal buffer size, and the second is to make a comparison between different approaches for bandwidth allocation under the constraint of maximum bandwidth utilization. Together with his request for a specific video stream, each client in the system sends his buffer size and the maximum waiting time for his allowable delay. According to this information, the video server determines a range of transmission rates that can be used by the client without violating the client-buffer constraints (i.e. overflow or underflow). The main contribution of this paper is to suggest a method for allocating a variable network bandwidth on stream initiation in order to service as many users as possible while providing each user with the highest quality service.