视频点播系统中CBR视频流的带宽分配模型与算法

O. Hadar, M. Segal
{"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}
引用次数: 2

摘要

讨论了视频点播(VoD)系统中恒比特率(CBR)视频流到压缩视频流的带宽分配问题。我们考虑一个VoD系统的实例,其中压缩的数字视频通过有限容量的网络通过CBR传输。本文主要有两个目的:一是研究在最小缓冲区大小约束下确定最优带宽的有效算法;二是比较在最大带宽利用率约束下不同的带宽分配方法。连同他对特定视频流的请求,系统中的每个客户端发送他的缓冲区大小和他允许的延迟的最大等待时间。根据这些信息,视频服务器确定客户端可以使用的传输速率范围,而不会违反客户端缓冲区约束(即溢出或下溢)。本文的主要贡献是提出了一种在流启动时分配可变网络带宽的方法,以便在为每个用户提供最高质量服务的同时为尽可能多的用户提供服务。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信