Competitive Analysis of Buffer Policies with SLA Commitments与SLA承诺缓冲政策竞争分析.pptVIP

下载本文档

1
0
约4.58千字
约 17页
2016-12-30 发布于上海
举报
版权申诉

Competitive Analysis of Buffer Policies with SLA Commitments与SLA承诺缓冲政策竞争分析.ppt

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

IPDPS 2009 Competitive Buffer Management with Packet Dependencies * Competitive Buffer Management with Packet Dependencies Alex Kesselman, Google Boaz Patt-Shamir, Tel Aviv University Gabriel Scalosub, University of Toronto Motivation: Video Streaming Smart encoding: Suffices to recover many Every video frame is fragmented into packets Restoration depends on recovering all packets If packets are lost: Affects other packets as well (become redundant) Streaming: retransmission is not an option Buffering Schematics buffer management incoming packets outgoingstream dropped packets finite linkspeed (“drain rate”) Buffer and Traffic Model Single FIFO queue of size Discrete time: Delivery substep One packet delivered from head of queue Arrival substep Packets arrive Some packets may be dropped Packets accommodated in the buffer Traffic: frames consists of packets Goal: Maximize number of whole frames delivered frame ‘s j-packet Previous Work Buffer management for QoS Multi-valued packets Constant competitive ratio for finite values Some results for multiple buffers No results about co-dependent packets! [Kesselman et al., 2004], [Englert Westerman, 2006], and many more [Lapid et al., 2000], Our Results Frames consisting of k1 parts Bad news: No finite competitive ratio in general Good news: If frame parts are consistently ordered There exists an algorithm with c.r. All deterministic algorithms have c.r. Preliminaries Offline Closely related to k-DM (as hard) Simple greedy algorithm is a (k+1)-approximation Online (arbitrary traffic) Not much you can do … time OPT ALG … packets ALG OPT Restricted Traffic Problem: Selective unbounded delay/burstiness Model requirement (solution): Both ALG and OPT have to deal with same delay/burstiness Order-respecting traffic: Frame order induced by j-packets is the same for every j OK: 2.1 (frame 2, part 1), 3.1, 2.2, 3.2 Not OK: 3.1, 2.1, 2.2, 3.2 All Is Well if Order-Respecting? Answer: Yes and No No: A