Full-Sharing Optimal Scheduling for VOD Service on Broadband Cable Networks

Thumbnail Image

View/Download File

Persistent link to this item

View Statistics

Journal Title

Journal ISSN

Volume Title


Full-Sharing Optimal Scheduling for VOD Service on Broadband Cable Networks

Published Date






Cable Access Networks (CANs) have become one of the most important forms of broadband services, which significantly improve the bandwidth to home and spur many multimedia applications to real life. %into reality. However, providing efficient Video-On-Demand (VOD) service on CANs isstill a challenging issue due to the lack of effective approaches to exploit the unique characteristics of CANs. Previous streaming approaches were intended for general network settings and do not consider these unique characteristics. In this study, we address the schedulingissue in the VOD service over CANs by fully utilizing the characteristics of CANs, such as subchannel sharing and potential large buffer space at CAN clients. We propose an optimal full-sharing scheduling approach that minimizes the bandwidth consumption of streaming sessions. Through analysis and simulation, we have shown that our approach has remarkable advantages in minimizing the bandwidth consumption of VOD service on CANs, compared with the previous approaches. As a result, our approach can satisfy more simultaneous VOD sessions on a fixed-capacity channel.Furthermore, we design two adaptation algorithms which not only keep bandwidth consumption minimal but also significantly reduce the mean service delay to 30% or less of the mean service delay without adaptation.



Related to



Series/Report Number

Funding information

Isbn identifier

Doi identifier

Previously Published Citation

Suggested citation

Dong, Yingfei; Zhang, Zhi-Li; DuHung-Chang, David. (2002). Full-Sharing Optimal Scheduling for VOD Service on Broadband Cable Networks. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/215532.

Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.