{"title":"同步多媒体演示的最佳流","authors":"David A. Turner, K. Ross","doi":"10.1145/319878.319903","DOIUrl":null,"url":null,"abstract":"A synchronized multimedia presentation consists of a collection of objects, with each object having one or more rendering intervals within the presentation timeline. These intervals specify the objects' start times and end times relative to the presentation timeline. In this paper we consider the problem of streaming a multimedia presentation from a server to a client over a bandwidth-limited communication network. We suppose that each of the static objects is layered-encoded. For a given maximum delay, we consider the problem of finding the optimal number of layers in each object in order to maximize a measure of the overall quality of the presentation. We devise efficient algorithms for determining an optimal policy for several natural criteria. We also consider the problem of gradual rendering of objects after their start times. We then apply the algorithms to a randomly generated presentation containing layer-encoded JPEG images.","PeriodicalId":265329,"journal":{"name":"MULTIMEDIA '99","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Optimal streaming of synchronized multimedia presentations\",\"authors\":\"David A. Turner, K. Ross\",\"doi\":\"10.1145/319878.319903\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A synchronized multimedia presentation consists of a collection of objects, with each object having one or more rendering intervals within the presentation timeline. These intervals specify the objects' start times and end times relative to the presentation timeline. In this paper we consider the problem of streaming a multimedia presentation from a server to a client over a bandwidth-limited communication network. We suppose that each of the static objects is layered-encoded. For a given maximum delay, we consider the problem of finding the optimal number of layers in each object in order to maximize a measure of the overall quality of the presentation. We devise efficient algorithms for determining an optimal policy for several natural criteria. We also consider the problem of gradual rendering of objects after their start times. We then apply the algorithms to a randomly generated presentation containing layer-encoded JPEG images.\",\"PeriodicalId\":265329,\"journal\":{\"name\":\"MULTIMEDIA '99\",\"volume\":\"36 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"MULTIMEDIA '99\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/319878.319903\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"MULTIMEDIA '99","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/319878.319903","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Optimal streaming of synchronized multimedia presentations
A synchronized multimedia presentation consists of a collection of objects, with each object having one or more rendering intervals within the presentation timeline. These intervals specify the objects' start times and end times relative to the presentation timeline. In this paper we consider the problem of streaming a multimedia presentation from a server to a client over a bandwidth-limited communication network. We suppose that each of the static objects is layered-encoded. For a given maximum delay, we consider the problem of finding the optimal number of layers in each object in order to maximize a measure of the overall quality of the presentation. We devise efficient algorithms for determining an optimal policy for several natural criteria. We also consider the problem of gradual rendering of objects after their start times. We then apply the algorithms to a randomly generated presentation containing layer-encoded JPEG images.