实时分层多媒体的有限重传

Matthew Podolsky, M. Vetterli, S. McCanne
{"title":"实时分层多媒体的有限重传","authors":"Matthew Podolsky, M. Vetterli, S. McCanne","doi":"10.1109/MMSP.1998.739045","DOIUrl":null,"url":null,"abstract":"In contrast to multimedia applications that involve human-to-human communication, streaming media over the Internet enjoys relaxed delay constraints. Thus, streaming media servers are at liberty to retransmit missing packets to avoid unnecessary signal corruption. While state-of-the-art media servers employ such strategies, no work to date has proposed an optimal strategy for delay-constrained retransmissions of streaming media. In this paper, we propose a framework for streaming media retransmission based on layered media representations and explore the performance advantage of integrating layered signal structure into the retransmission strategy. In our approach, the source must choose between transmitting an older layer that expires sooner and a newer layer that expires later but is more important. To arrive at the proper mix of these two extreme strategies, we derive an optimal strategy for transmitting layered data over a binary erasure channel with instantaneous feedback. To provide a quantitative performance comparison of different transmission policies, we conduct a Markov-chain analysis, which shows that the best transmission policy is time-invariant and thus does not change as the layers approach their expiration times.","PeriodicalId":180426,"journal":{"name":"1998 IEEE Second Workshop on Multimedia Signal Processing (Cat. No.98EX175)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"33","resultStr":"{\"title\":\"Limited retransmission of real-time layered multimedia\",\"authors\":\"Matthew Podolsky, M. Vetterli, S. McCanne\",\"doi\":\"10.1109/MMSP.1998.739045\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In contrast to multimedia applications that involve human-to-human communication, streaming media over the Internet enjoys relaxed delay constraints. Thus, streaming media servers are at liberty to retransmit missing packets to avoid unnecessary signal corruption. While state-of-the-art media servers employ such strategies, no work to date has proposed an optimal strategy for delay-constrained retransmissions of streaming media. In this paper, we propose a framework for streaming media retransmission based on layered media representations and explore the performance advantage of integrating layered signal structure into the retransmission strategy. In our approach, the source must choose between transmitting an older layer that expires sooner and a newer layer that expires later but is more important. To arrive at the proper mix of these two extreme strategies, we derive an optimal strategy for transmitting layered data over a binary erasure channel with instantaneous feedback. To provide a quantitative performance comparison of different transmission policies, we conduct a Markov-chain analysis, which shows that the best transmission policy is time-invariant and thus does not change as the layers approach their expiration times.\",\"PeriodicalId\":180426,\"journal\":{\"name\":\"1998 IEEE Second Workshop on Multimedia Signal Processing (Cat. No.98EX175)\",\"volume\":\"40 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-12-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"33\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1998 IEEE Second Workshop on Multimedia Signal Processing (Cat. No.98EX175)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MMSP.1998.739045\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1998 IEEE Second Workshop on Multimedia Signal Processing (Cat. No.98EX175)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MMSP.1998.739045","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 33

摘要

与涉及人与人之间通信的多媒体应用程序相比,互联网上的流媒体享有宽松的延迟限制。因此,流媒体服务器可以自由地重传丢失的数据包,以避免不必要的信号损坏。虽然最先进的媒体服务器采用了这样的策略,但迄今为止还没有工作提出流媒体延迟限制重传的最佳策略。本文提出了一种基于分层媒体表示的流媒体重传框架,并探讨了将分层信号结构集成到重传策略中的性能优势。在我们的方法中,源必须在传输较早过期的旧层和较晚过期但更重要的新层之间做出选择。为了达到这两种极端策略的适当混合,我们推导了在具有瞬时反馈的二进制擦除信道上传输分层数据的最佳策略。为了提供不同传输策略的定量性能比较,我们进行了马尔可夫链分析,结果表明最佳传输策略是时不变的,因此不会随着层接近到期时间而改变。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Limited retransmission of real-time layered multimedia
In contrast to multimedia applications that involve human-to-human communication, streaming media over the Internet enjoys relaxed delay constraints. Thus, streaming media servers are at liberty to retransmit missing packets to avoid unnecessary signal corruption. While state-of-the-art media servers employ such strategies, no work to date has proposed an optimal strategy for delay-constrained retransmissions of streaming media. In this paper, we propose a framework for streaming media retransmission based on layered media representations and explore the performance advantage of integrating layered signal structure into the retransmission strategy. In our approach, the source must choose between transmitting an older layer that expires sooner and a newer layer that expires later but is more important. To arrive at the proper mix of these two extreme strategies, we derive an optimal strategy for transmitting layered data over a binary erasure channel with instantaneous feedback. To provide a quantitative performance comparison of different transmission policies, we conduct a Markov-chain analysis, which shows that the best transmission policy is time-invariant and thus does not change as the layers approach their expiration times.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信