Striping for interactive video: is it worth it?

Martin Reisslein, Keith Ross, Subin Shrestha

    Research output: Chapter in Book/Report/Conference proceedingChapter

    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 languageEnglish (US)
    Title of host publicationInternational Conference on Multimedia Computing and Systems -Proceedings
    PublisherIEEE
    Pages635-640
    Number of pages6
    Volume2
    StatePublished - 1999
    EventProceedings of the 1999 6th International Conference on Multimedia Computing and Systems - IEEE ICMCS'99 - Florence, Italy
    Duration: Jun 7 1999Jun 11 1999

    Other

    OtherProceedings of the 1999 6th International Conference on Multimedia Computing and Systems - IEEE ICMCS'99
    CityFlorence, Italy
    Period6/7/996/11/99

    Fingerprint

    Throughput
    Servers

    ASJC Scopus subject areas

    • Computer Science(all)
    • Engineering(all)

    Cite this

    Reisslein, M., Ross, K., & Shrestha, S. (1999). Striping for interactive video: is it worth it? In International Conference on Multimedia Computing and Systems -Proceedings (Vol. 2, pp. 635-640). IEEE.

    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 proceedingChapter

    Reisslein, M, Ross, K & Shrestha, S 1999, Striping for interactive video: is it worth it? in International Conference on Multimedia Computing and Systems -Proceedings. vol. 2, IEEE, pp. 635-640, Proceedings of the 1999 6th International Conference on Multimedia Computing and Systems - IEEE ICMCS'99, Florence, Italy, 6/7/99.
    Reisslein M, Ross K, Shrestha S. Striping for interactive video: is it worth it? In International Conference on Multimedia Computing and Systems -Proceedings. Vol. 2. IEEE. 1999. p. 635-640
    Reisslein, Martin ; Ross, Keith ; Shrestha, Subin. / Striping for interactive video : is it worth it?. International Conference on Multimedia Computing and Systems -Proceedings. Vol. 2 IEEE, 1999. pp. 635-640
    @inbook{a73d9a54cb684af2bd558247953dc371,
    title = "Striping for interactive video: is it worth it?",
    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.",
    author = "Martin Reisslein and Keith Ross and Subin Shrestha",
    year = "1999",
    language = "English (US)",
    volume = "2",
    pages = "635--640",
    booktitle = "International Conference on Multimedia Computing and Systems -Proceedings",
    publisher = "IEEE",

    }

    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 -