Proceedings of the Fifth ACM International Conference on Multimedia - MULTIMEDIA '97 1997
DOI: 10.1145/266180.266387
|View full text |Cite
|
Sign up to set email alerts
|

Scheduling video programs in near video-on-demand systems

Abstract: This paper presents an analytical (in contrast to commonlyused simulations) approach to program scheduling in near video-on-demand (NVoD) systems. NVoD servers batch customers' requests by sourcing the same mr$erial at certain intervals called phase offsets. The proposed approach to analytical modeling integrates both customers' and serviceprovider's views to account for the tradeoff between system throughput and customers' partial patience. We first determine the optimal scheduling of movies of different popu… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
15
0

Year Published

2002
2002
2010
2010

Publication Types

Select...
3
3
2

Relationship

0
8

Authors

Journals

citations
Cited by 25 publications
(15 citation statements)
references
References 11 publications
0
15
0
Order By: Relevance
“…• Quasi Video-on-Demand (QVoD): QVoD [15] is a threshold-based NVoD. The server delivers a video when the number of user requests lager than a predefined threshold.…”
Section: Video On Demand Systems and Techniquesmentioning
confidence: 99%
“…• Quasi Video-on-Demand (QVoD): QVoD [15] is a threshold-based NVoD. The server delivers a video when the number of user requests lager than a predefined threshold.…”
Section: Video On Demand Systems and Techniquesmentioning
confidence: 99%
“…True Video-on-Demand systems [3] allow users to have total control: they can pause, rewind, fast forward the stream whenever they like. Such activities put additional strain on the provider's resources; to prevent that, near Video-onDemand [4] systems allow such user actions but at discrete time intervals.…”
Section: Multimedia Streamingmentioning
confidence: 99%
“…These free channels can be added to the pool of unicast channels to further reduce latency. Define as the latency function for UVoD with channel folding, and then it can be computed from (16) which accounts for the additional unicast channels made available by channel folding. We can also conclude that channel folding is effective only if or .…”
Section: A Latencymentioning
confidence: 99%