{"title":"广播多个连续媒体数据的调度方法","authors":"T. Yoshihisa, M. Tsukamoto, S. Nishio","doi":"10.1145/951676.951685","DOIUrl":null,"url":null,"abstract":"Recently, various schemes for broadcasting continuous media data such as music or movies have been studied. These schemes reduce the waiting time for playing the data under the continuity condition, i.e., playing continuous media data without any intermittence until the end of the data. These schemes usually employ multiple channels to broadcast the data. However, most clients are not able to receive data from multiple channels concurrently. In this paper, we propose methods for reducing client waiting time for multiple data via a single channel. In our proposed methods, we divide each data into several segments and produce a schedule that includes the first segment of each data more frequent than the rest. By changing the number of segments according to the playback ratio, client waiting time is effectively reduced.","PeriodicalId":415406,"journal":{"name":"ACM International Workshop on Multimedia Databases","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Scheduling methods for broadcasting multiple continuous media data\",\"authors\":\"T. Yoshihisa, M. Tsukamoto, S. Nishio\",\"doi\":\"10.1145/951676.951685\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Recently, various schemes for broadcasting continuous media data such as music or movies have been studied. These schemes reduce the waiting time for playing the data under the continuity condition, i.e., playing continuous media data without any intermittence until the end of the data. These schemes usually employ multiple channels to broadcast the data. However, most clients are not able to receive data from multiple channels concurrently. In this paper, we propose methods for reducing client waiting time for multiple data via a single channel. In our proposed methods, we divide each data into several segments and produce a schedule that includes the first segment of each data more frequent than the rest. By changing the number of segments according to the playback ratio, client waiting time is effectively reduced.\",\"PeriodicalId\":415406,\"journal\":{\"name\":\"ACM International Workshop on Multimedia Databases\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-11-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM International Workshop on Multimedia Databases\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/951676.951685\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM International Workshop on Multimedia Databases","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/951676.951685","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Scheduling methods for broadcasting multiple continuous media data
Recently, various schemes for broadcasting continuous media data such as music or movies have been studied. These schemes reduce the waiting time for playing the data under the continuity condition, i.e., playing continuous media data without any intermittence until the end of the data. These schemes usually employ multiple channels to broadcast the data. However, most clients are not able to receive data from multiple channels concurrently. In this paper, we propose methods for reducing client waiting time for multiple data via a single channel. In our proposed methods, we divide each data into several segments and produce a schedule that includes the first segment of each data more frequent than the rest. By changing the number of segments according to the playback ratio, client waiting time is effectively reduced.