Mitra: A Scalable Continuous Media Server

Ghandeharizadeh, Shahram; Zimmermann, Roger; Shi, Weifeng; Rejaie, Reza; Ierardi, Doug; Li, Ta-Wei

doi:10.1007/978-0-585-28767-6_3

Cited by 8 publications

(9 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Data striping has been proposed in many video servers, in which videos are striped over a set of disks [2][5][8] [14][22] [27]. The advantage of striping over designs in which different objects are stored on different disks is that it decouples storage allocation from bandwidth allocation, avoiding potential load imbalances due to variations in object popularity.…”

Section: Related Workmentioning

confidence: 99%

“…There are a number of proposals for layout of video data on parallel disks. The most common method proposed is to stripe each object across the parallel disks using a fixed size stripe granule (i.e., disk block) [2] [5] [8] [14] [22] [27]. While allocation of a disk block on a disk is often random, logically consecutive blocks are typically allocated in strictly roundrobin order to disks.…”

Section: Motivationmentioning

confidence: 99%

See 1 more Smart Citation

Comparing random data allocation and data striping in multimedia servers

Santos¹,

Muntz²,

Ribeiro-Neto

2000

SIGMETRICS Perform. Eval. Rev.

View full text Add to dashboard Cite

We compare perfbrmance of a multimedia storage server based on a random data allocation layout and block replication with traditional data striping techniques. Data striping techniques in multimedia servers are often designed for restricted workloads, e.g. sequential access patterns with CBR (constant bit rate) requirements. On the other hand, a system based on random data allocation can support virtually any type of multimedia application, including VBR (variable bit rate) video or audio, and interactive applications with unpredictable access patterns, such as 3D interactive virtual worlds, interactive scientific visualizations, etc. Surprisingly, our results show that system performance with random data allocation is competitive and sometimes even outperforms traditional data striping techniques, for the workloads for which data striping is designed to work best; i.e. streams with sequential access patterns and CBR requirements. Due to its superiority :in supporting general workloads and competitive system performance, we believe that random data allocation will be the scheme of choice for next generation multimedia servers.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Motivationmentioning

confidence: 99%

Comparing random data allocation and data striping in multimedia servers

Santos¹,

Muntz²,

Ribeiro-Neto

2000

SIGMETRICS Perform. Eval. Rev.

View full text Add to dashboard Cite

show abstract

“…Every time a disk fails, the operator might replace it with a newer disk model because either (1) this disk model costs less and provides a higher performance, or (2) the model of the failed disk has been discontinued and is no longer available. Second, with a scalable server (e.g., Mitra [15]), a service provider might want to expand the server to meet its increased demand for both storage and bandwidth. If several years have passed since the original installation of the system, the service provider might be forced to purchase newer disk models, yielding a heterogeneous disk subsystem.…”

Section: Introductionmentioning

confidence: 99%

“…This enables the server to retrieve the blocks of the next time period using an elevator algorithm to minimize the impact of seeks [31]. A detailed description of our target architecture is contained in [15].…”

Section: Introductionmentioning

confidence: 99%

Continuous display using heterogeneous disk-subsystems

Zimmermann¹,

Ghandeharizadeh²

1997

Proceedings of the Fifth ACM International Conference on Multimedia - MULTIMEDIA '97

Self Cite

View full text Add to dashboard Cite

A number of recent technological trends have made data intensive applications such as continuous media (audio and video) servers a reality. These servers store and retrieve a large volume of data using magnetic disks. Servers consisting of heterogeneous disk drives have become a fact of life for several reasons. First, disks are mechanical devices that might fail. The failed disks are almost always replaced with new models. Second, the current technological trend for these devices is one of annual increase in both performance and storage capacity. Older disk models are discontinued because they cannot compete with the newer ones in the commercial arena. With a heterogeneous disk subsystem, the system should support continuous display while managing resources intelligently in order to maximize their utilization.This study describes a taxonomy of techniques that ensure a continuous display of objects using a heterogeneous disk subsystem. This taxonomy consists of: (a) strategies that partition resources into homogeneous groups of disks and manage each independently, and (b) techniques that treat all disks uniformly, termed non-partitioning techniques. We introduce three non-partitioning techniques: disk merging, disk grouping, and staggered grouping. We investigate these techniques using analytical models. Our results demonstrate that disk merging is the most flexible scheme while providing among the lowest cost per simultaneous display. Finally, using an open simulation model, we compare disk merging with a partitioning technique. The obtained results demonstrate the superiority of disk merging.

show abstract

“…It continues to rely on wired centralized servers, e.g., Mitra [12], and cache servers [13,15] as the main repository for continuous media. Each H2O device pre-stages data in order to bring it closer to a consuming client, minimizing the number of accesses to the remote servers.…”

Section: Introductionmentioning

confidence: 99%

H2O clouds: issues, challenges and solutions

Ghandeharizadeh

Fourth International Conference on Information, Communications and Signal Processing, 2003 and the Fourth Pacific Rim Conferenc

View full text Add to dashboard Cite

Home-to-Home Online (H2O) devices use their wireless communication to complement existing wired infrastructure such as Internet and provide data services to individual households. Those within the same radio range form an ad-hoc network of peers that collaborate to increase availability of data. This data might range from educational and entertainment content to personal libraries uploaded by each household. This paper describes the H2O framework and challenges posed by its design. It provides a summary of our in-progress work to date and outlines future research directions.

show abstract

Mitra: A Scalable Continuous Media Server

Cited by 8 publications

References 10 publications

Comparing random data allocation and data striping in multimedia servers

Comparing random data allocation and data striping in multimedia servers

Continuous display using heterogeneous disk-subsystems

H2O clouds: issues, challenges and solutions

Contact Info

Product

Resources

About