网站大量收购闲置独家精品文档,联系QQ:2885784924

Dynamic-CBT - Worcester Polytechnic Institute (WPI)动态的CBT -伍斯特理工学院(WPI).ppt

Dynamic-CBT - Worcester Polytechnic Institute (WPI)动态的CBT -伍斯特理工学院(WPI).ppt

  1. 1、本文档共16页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
Dynamic-CBT - Worcester Polytechnic Institute (WPI)动态的CBT -伍斯特理工学院(WPI)

Dynamic-CBT Better Performing Active Queue Management for Multimedia Networking Outline Introduction CBT D-CBT Evaluation Issues Internet Routers Today Volume of traffic increasing More simultaneous active flows Increase in multimedia flows Tight timing constraints Different flow-control mechanism than TCP Emphasis on Congestion Control and Fairness among active flows Current Router Queue Mgmt CBT Design CBT - Pros and Cons Pros: RED + Class-Based Isolation Early congestion notification Protect TCP and protect Tagged UDP (MM) Different classes of flows coexist with predefined fairness Cons: CBQ function w/o admission control Fairness for changing traffic mixes Utilization on outgoing link Changes “Best-Effort” nature of Internet Dynamic-CBT (D-CBT) D-CBT Design Evaluation using NS Developed a flow-controlled Multimedia Application (for tagged UDP class) AIMD Media Scaling (5 discrete rates) “MPEG-1 like” transmission rates Implemented and validated CBT Implemented D-CBT and measured congestion time fairness RED vs. CBT vs. D-CBT Simulation (RED, CBT, D-CBT) Fairness: RED Fairness: CBT Fairness: D-CBT D-CBT Issues Tagging UDP packets Who tags packets? (End Host? ISP?) Which field of IP header to use? IPv4: Unused Bit in Type-Of-Service Field IPv4: Another Protocol in Protocol Field IPv6: Use Priority Field Define a flow IPv4: Source-Destination Address IPv6: Plus Flow-ID D-CBT Issues Active Flow Counting (Overhead) For every incoming packet, insert or update dest-addr, flow-id, local-time info and update count Hash Table - O(1) Every ? ms, delete old flows and update count Hash Table - O(n) Measure Active Flow Counting overheads: Linux implementation Processing Time and Memory Usage D-CBT Issues Test D-CBT with other (available) flow-controlled MM Applications Effect of the thresholds on MM quality Sensitivity of D-CBT to RED parameters How many different classes are needed? Example 1 class is RED 1 class per flow is FRED Overhead per class * * Jae Chung and

文档评论(0)

wuyoujun92 + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档