一种减少近距离交货等待时间的调度方法

Y. Gotoh, T. Yoshihisa
{"title":"一种减少近距离交货等待时间的调度方法","authors":"Y. Gotoh, T. Yoshihisa","doi":"10.1109/3PGCIC.2015.116","DOIUrl":null,"url":null,"abstract":"Due to the recent popularization of digital broadcasting systems, close-range broadcasting using continuous media data, i.e. audio and video, has attracted great attention. For example, in a drama, after a user watches interesting content such as a highlight scene, he/she will watch the main scene continuously. In close-range broadcasting, the necessary bandwidth for continuously playing the two types of data increases. Conventional methods reduce the necessary bandwidth by producing an effective broadcast schedule for continuous media data. In addition, we have proposed the scheduling method to reduce the waiting time for close-range broadcasting. In this method, by setting the loading time of main scene, we can reduce total waiting time. However, when the server schedules two types of continuous media data, the loading time of highlight scene may increase. In this paper, we propose a scheduling method for close-range broadcasting based on loading time. In our proposed method, by producing an effective broadcast schedule considering both loading time of highlight scene and main scene, we can reduce the waiting time.","PeriodicalId":395401,"journal":{"name":"2015 10th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC)","volume":"84 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Scheduling Method to Reduce Waiting Time for Close-Range Delivery\",\"authors\":\"Y. Gotoh, T. Yoshihisa\",\"doi\":\"10.1109/3PGCIC.2015.116\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Due to the recent popularization of digital broadcasting systems, close-range broadcasting using continuous media data, i.e. audio and video, has attracted great attention. For example, in a drama, after a user watches interesting content such as a highlight scene, he/she will watch the main scene continuously. In close-range broadcasting, the necessary bandwidth for continuously playing the two types of data increases. Conventional methods reduce the necessary bandwidth by producing an effective broadcast schedule for continuous media data. In addition, we have proposed the scheduling method to reduce the waiting time for close-range broadcasting. In this method, by setting the loading time of main scene, we can reduce total waiting time. However, when the server schedules two types of continuous media data, the loading time of highlight scene may increase. In this paper, we propose a scheduling method for close-range broadcasting based on loading time. In our proposed method, by producing an effective broadcast schedule considering both loading time of highlight scene and main scene, we can reduce the waiting time.\",\"PeriodicalId\":395401,\"journal\":{\"name\":\"2015 10th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC)\",\"volume\":\"84 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-11-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 10th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/3PGCIC.2015.116\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 10th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/3PGCIC.2015.116","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

近年来,随着数字广播系统的普及,使用连续媒体数据(即音频和视频)的近距离广播引起了人们的极大关注。例如,在电视剧中,用户在观看了有趣的内容(如一个亮点场景)后,他/她会继续观看主要场景。在近距离广播中,连续播放两种数据所需的带宽增加。传统方法通过为连续媒体数据产生有效的广播调度来减少必要的带宽。此外,我们还提出了减少近距离广播等待时间的调度方法。在该方法中,通过设置主场景的加载时间,可以减少总等待时间。但是,当服务器调度两种类型的连续媒体数据时,高亮场景的加载时间可能会增加。本文提出了一种基于加载时间的近距离广播调度方法。在我们提出的方法中,通过同时考虑高光场景和主场景的加载时间来产生有效的广播调度,可以减少等待时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Scheduling Method to Reduce Waiting Time for Close-Range Delivery
Due to the recent popularization of digital broadcasting systems, close-range broadcasting using continuous media data, i.e. audio and video, has attracted great attention. For example, in a drama, after a user watches interesting content such as a highlight scene, he/she will watch the main scene continuously. In close-range broadcasting, the necessary bandwidth for continuously playing the two types of data increases. Conventional methods reduce the necessary bandwidth by producing an effective broadcast schedule for continuous media data. In addition, we have proposed the scheduling method to reduce the waiting time for close-range broadcasting. In this method, by setting the loading time of main scene, we can reduce total waiting time. However, when the server schedules two types of continuous media data, the loading time of highlight scene may increase. In this paper, we propose a scheduling method for close-range broadcasting based on loading time. In our proposed method, by producing an effective broadcast schedule considering both loading time of highlight scene and main scene, we can reduce the waiting time.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信