2003
DOI: 10.1016/s0166-218x(02)00231-7
|View full text |Cite
|
Sign up to set email alerts
|

Sharing video on demand

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
13
0

Year Published

2006
2006
2013
2013

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 12 publications
(13 citation statements)
references
References 21 publications
0
13
0
Order By: Relevance
“…How to make admission decisions is not trivial. The idea of admission control in the context of deadline scheduling takes the form of "customer notification" [21] where the service provider can choose to accept or decline a customer's request upon the request arrival; see also [22,23] and references therein. The optimal admission control is not known in the literature.…”
Section: Related Workmentioning
confidence: 99%
“…How to make admission decisions is not trivial. The idea of admission control in the context of deadline scheduling takes the form of "customer notification" [21] where the service provider can choose to accept or decline a customer's request upon the request arrival; see also [22,23] and references therein. The optimal admission control is not known in the literature.…”
Section: Related Workmentioning
confidence: 99%
“…The admission control has been considered in the literature under the term "immediate notification" in [19] for the application of video-on-demand. Later, joint admission and scheduling has been studied in [20], [21], [22], [23] for nonpreemptive job requests without non-completion penalty.…”
Section: B Related Workmentioning
confidence: 99%
“…As in many previous works (e.g., [3,6,9,10,18,20]), we assume that all jobs have the same length . (Note that this assumption is not unrealistic and is applicable to PDD systems using DNS servers.…”
Section: The Modelmentioning
confidence: 99%
“…After defining the patience τ to be the smallest number such that any job of length has a start-up delay at least τ , he proved that the competitive ratio for scheduling such system is exactly 1 + 1 τ +1 . Later, Bar-Noy, Garay and Herzberg [3] studied the scheduling of VOD systems. Their results imply that if the start-up delay d is smaller than √ s/u times the job length , then the competitive ratio κ = Θ(ln u s ).…”
Section: Related Workmentioning
confidence: 99%