2000
DOI: 10.1109/6046.825795
|View full text |Cite
|
Sign up to set email alerts
|

Run-time optimization of heterogeneous media access in a multimedia server

Abstract: Discrete media (DM) data throughput is vital to systems that need to support the heterogeneity and variety of data found in interactive hypermedia and digital library applications. Therefore, a multimedia server's ability in delivering a high DM data throughput without degrading its CM data throughput deserves more attention. In this paper, we address this issue by optimizing the use of disk bandwidth spent on CM service at run-time and redirecting the saved bandwidth to service DM requests. Based on a new cos… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
5
0

Year Published

2003
2003
2005
2005

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(5 citation statements)
references
References 19 publications
0
5
0
Order By: Relevance
“…The sizes of image and text objects requested are randomly generated from their respective ranges. For the video clips, we take a trace file of the movie Star Wars which consists of 7200 groups 5 Other T SR values were also used with the results exhibiting a similar trend and thus they are not reported. For a classic tradeoff analysis between the magnitude of T SR versus the memory requirement, and the number of requests admissible, see [9].…”
Section: Analysis and Simulation Validationmentioning
confidence: 99%
See 3 more Smart Citations
“…The sizes of image and text objects requested are randomly generated from their respective ranges. For the video clips, we take a trace file of the movie Star Wars which consists of 7200 groups 5 Other T SR values were also used with the results exhibiting a similar trend and thus they are not reported. For a classic tradeoff analysis between the magnitude of T SR versus the memory requirement, and the number of requests admissible, see [9].…”
Section: Analysis and Simulation Validationmentioning
confidence: 99%
“…(i) Video-First: the video-first algorithm always gives the highest priority to video requests (an example of which can be found in [5]). Under this algorithm, all resources are allocated to video requests with the leftover bandwidth being used to serve image and text requests.…”
Section: Comparison Basis: Video-first and Greedy Algorithmsmentioning
confidence: 99%
See 2 more Smart Citations
“…The goal is either to reduce the overall cost per request or to maximize the maximum number of requests the system is able to service simultaneously with statistical or absolute QoS guarantees. There also have been research efforts to deal with mixed workloads, again by means of admission control and disk scheduling mechanisms [13,14]. This paper also concerns with the server end design.…”
Section: Introductionmentioning
confidence: 99%