Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Multimedia Tools and...arrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
Multimedia Tools and Applications
Article . 1996 . Peer-reviewed
License: Springer TDM
Data sources: Crossref
DBLP
Article . 1996
Data sources: DBLP
versions View all 2 versions
addClaim

Multicast scheduling for VOD services

Authors: Heekyoung Woo; Chong-kwon Kim;

Multicast scheduling for VOD services

Abstract

Recent developments in networking technologies, coupled with the advent of high-capacity storage devices and improved coding schemes, will make it feasible to provide many advanced multimedia communications services. Among future telecommunication services, the VOD (Video On Demand) service is emerging as one of the most promising services. In this paper, we propose a new VOD service scheme that utilizes the dynamic multicasting capabilities of future networks. We first describe an overall VOD service architecture that consists of CPEs (Customer Premise Equipments), SCCs (Service Control Centers), and ISs (Information Stores). Based on the assumptions that each subscriber has local storage space and the video transfer speed is faster than the playback speed, we develop a new service scheme where video signals are multicasted to multiple subscribers simultaneously. To realize the potential benefits of multicasting, we propose two scheduling algorithms: EDS (Earliest Deadline Scheduling) and MMS (Most Multicasting Scheduling). Finally, we study the performance of multicasting scheme and compare the performance of the two scheduling algorithms via computer simulation. The simulation results show that multicasting increases the service capacity of an SCC significantly.

Related Organizations
  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    10
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Top 10%
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
10
Average
Top 10%
Average
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!