Abstract
Typical block placement schemes generally assume CTL (Constant Time Length) block size, one block read for each stream in a round, round-robin stripping, and peak rate-based admission control. Traditional smoothing schemes for stored continuous media objects do not consider the block layout of the storage system. Hence, the combination of schemes from the two domains can introduce new challenges. In this paper, we present a server transmission delay problem that arises when traditional block placement and smoothing schemes are used at the same time in a continuous media server. To resolve the problem, we first present two simple straight-forward solutions, Server-side Block Prefetching and Multiple Block Read, and then propose a new solution Smoothed Fetching. SF overcomes the defects of the other two schemes by exploiting a smoothing technique when retrieving blocks from disks and using a tight admission control algorithm. Simulation results show that SF achieves the best performance among the three solutions.
Original language | English |
---|---|
Title of host publication | Proceedings of the ACM Symposium on Applied Computing |
Place of Publication | New York |
Publisher | Association for Computing Machinery |
Pages | 755-760 |
Number of pages | 6 |
ISBN (Print) | 1581134452 |
Publication status | Published - 2002 |
Externally published | Yes |
Event | Applied Computing 2002: Proceeedings of the 2002 ACM Symposium on Applied Computing - Madrid, Spain Duration: 11 Mar 2002 → 14 Mar 2002 |
Other
Other | Applied Computing 2002: Proceeedings of the 2002 ACM Symposium on Applied Computing |
---|---|
Country/Territory | Spain |
City | Madrid |
Period | 11/03/02 → 14/03/02 |
Keywords
- Data placement
- Multimedia system
- Traffic smoothing