Abstract
We study the design of interactive video servers that store videos on disk arrays. In order to avoid the hot-spot problem in video servers it is conventional wisdom to stripe the videos over the disk array using Fine Grained Striping or Coarse Grained Striping techniques. Striping, however, increases the seek and rotational overhead, thereby reducing the throughput of the disk array. Our results indicate that the decrease in throughput is substantial when interactive delays are constrained to be less than 1 second. We show that both a high degree of interactivity and high throughput are achieved by using a narrow striping width and replicating the videos according to the users' request pattern. Specifically, we find that striping over two disks gives the highest throughput when a tight 1 second constraint on interactive delays is imposed. We also demonstrate that localized placement (i.e., no striping at all) performs nearly as well when a good estimate of the user request pattern is available.
| Original language | English (US) |
|---|---|
| Title of host publication | International Conference on Multimedia Computing and Systems -Proceedings |
| Publisher | IEEE |
| Pages | 635-640 |
| Number of pages | 6 |
| Volume | 2 |
| State | Published - 1999 |
| Event | Proceedings of the 1999 6th International Conference on Multimedia Computing and Systems - IEEE ICMCS'99 - Florence, Italy Duration: Jun 7 1999 → Jun 11 1999 |
Other
| Other | Proceedings of the 1999 6th International Conference on Multimedia Computing and Systems - IEEE ICMCS'99 |
|---|---|
| City | Florence, Italy |
| Period | 6/7/99 → 6/11/99 |
Fingerprint
ASJC Scopus subject areas
- Computer Science(all)
- Engineering(all)
Cite this
Striping for interactive video : is it worth it? / Reisslein, Martin; Ross, Keith; Shrestha, Subin.
International Conference on Multimedia Computing and Systems -Proceedings. Vol. 2 IEEE, 1999. p. 635-640.Research output: Chapter in Book/Report/Conference proceeding › Chapter
}
TY - CHAP
T1 - Striping for interactive video
T2 - is it worth it?
AU - Reisslein, Martin
AU - Ross, Keith
AU - Shrestha, Subin
PY - 1999
Y1 - 1999
N2 - We study the design of interactive video servers that store videos on disk arrays. In order to avoid the hot-spot problem in video servers it is conventional wisdom to stripe the videos over the disk array using Fine Grained Striping or Coarse Grained Striping techniques. Striping, however, increases the seek and rotational overhead, thereby reducing the throughput of the disk array. Our results indicate that the decrease in throughput is substantial when interactive delays are constrained to be less than 1 second. We show that both a high degree of interactivity and high throughput are achieved by using a narrow striping width and replicating the videos according to the users' request pattern. Specifically, we find that striping over two disks gives the highest throughput when a tight 1 second constraint on interactive delays is imposed. We also demonstrate that localized placement (i.e., no striping at all) performs nearly as well when a good estimate of the user request pattern is available.
AB - We study the design of interactive video servers that store videos on disk arrays. In order to avoid the hot-spot problem in video servers it is conventional wisdom to stripe the videos over the disk array using Fine Grained Striping or Coarse Grained Striping techniques. Striping, however, increases the seek and rotational overhead, thereby reducing the throughput of the disk array. Our results indicate that the decrease in throughput is substantial when interactive delays are constrained to be less than 1 second. We show that both a high degree of interactivity and high throughput are achieved by using a narrow striping width and replicating the videos according to the users' request pattern. Specifically, we find that striping over two disks gives the highest throughput when a tight 1 second constraint on interactive delays is imposed. We also demonstrate that localized placement (i.e., no striping at all) performs nearly as well when a good estimate of the user request pattern is available.
UR - http://www.scopus.com/inward/record.url?scp=0032651012&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0032651012&partnerID=8YFLogxK
M3 - Chapter
AN - SCOPUS:0032651012
VL - 2
SP - 635
EP - 640
BT - International Conference on Multimedia Computing and Systems -Proceedings
PB - IEEE
ER -