欢迎来到麦多课文档分享! | 帮助中心 海量文档,免费浏览,给你所需,享你所想!
麦多课文档分享
全部分类
  • 标准规范>
  • 教学课件>
  • 考试资料>
  • 办公文档>
  • 学术论文>
  • 行业资料>
  • 易语言源码>
  • ImageVerifierCode 换一换
    首页 麦多课文档分享 > 资源分类 > PPT文档下载
    分享到微信 分享到微博 分享到QQ空间

    High-performance bulk data transfers with TCP.ppt

    • 资源ID:372915       资源大小:163KB        全文页数:18页
    • 资源格式: PPT        下载积分:2000积分
    快捷下载 游客一键下载
    账号登录下载
    微信登录下载
    二维码
    微信扫一扫登录
    下载资源需要2000积分(如需开发票,请勿充值!)
    邮箱/手机:
    温馨提示:
    如需开发票,请勿充值!快捷下载时,用户名和密码都是您填写的邮箱或者手机号,方便查询和重复下载(系统自动生成)。
    如需开发票,请勿充值!如填写123,账号就是123,密码也是123。
    支付方式: 支付宝扫码支付    微信扫码支付   
    验证码:   换一换

    加入VIP,交流精品资源
     
    账号:
    密码:
    验证码:   换一换
      忘记密码?
        
    友情提示
    2、PDF文件下载后,可能会被浏览器默认打开,此种情况可以点击浏览器菜单,保存网页到桌面,就可以正常下载了。
    3、本站不支持迅雷下载,请使用电脑自带的IE浏览器,或者360浏览器、谷歌浏览器下载即可。
    4、本站资源下载后的文档和图纸-无水印,预览文档经过压缩,下载后原文更清晰。
    5、试题试卷类文档,如果标题没有明确说明有答案则都视为没有答案,请知晓。

    High-performance bulk data transfers with TCP.ppt

    1、High-performance bulk data transfers with TCP,Matei Ripeanu University of Chicago,Problem,Bulk transfers transfer of many large blocks of data from one storage resource to another delivery order is not important Parallel flows to accommodate to parallel end systems Questions What is the achievable t

    2、hroughput using TCP Which TCP extensions are worth investigating Do we need another protocol?,Outline,TCP review Parallel transfers with TCP shared environments non-shared environments Considering alternatives to TCP Conclusion and future work,TCP Review,Provides a reliable, full duplex, and streami

    3、ng channel Design assumptions: Low physical link error rates assumed Packet loss = congestion signal No packet reordering at network (IP) level Packet reordering = congestion signal Design assumptions challenged today! Parallel networking hardware = reordering Dedicated links, reservations = no cong

    4、estion Bulk transfers = streaming not needed,TCP algorithms,Flow control ACK clocked Slow start exponential growth Congestion Control set sstresh to cwnd/2, slow start until sstresh then linear growth Fast Retransmit Fast Recovery,Steady state throughput model,M. Mathis,Steady state throughput model

    5、,Parallel TCP transfers - - shared environments,Advantages: More resilient to network layer packet losses More aggressive behavior: faster slow start and recovery Drawbacks: Aggregated flow not TCP friendly! Does not respond to congestion signals (RED routers might take “appropriate” action) Solutio

    6、n: E-TCP (RFC2140) Difficult to configure transfer properly to maximize link utilization,Shared environments (cont),Framework for simulation studies Change network path proprieties, no. of lows, loss/reordering rates, competing traffic etc. Identify additional problems: TCP congestion control does n

    7、ot scale Unfair sharing of the available bandwidth among flows Low link utilization efficiency If competing traffic is formed by many short lived flows, performance is even worse Self synchronizing traffic Burstiness,50 flows try to send data over paths that has a 1 Mbps bottleneck segment. RTT=80ms

    8、 and MSS=1000bytes. Router buffers: 100 packets. The graph reports the number of packets successfully sent during a 600s period.,Fair share.,Non-shared environments,Dedicated links or reservations Transfer can be set up properly: Use TCP tools to discover: bottleneck bandwidth, MSS, RTT; pipe size P

    9、S = bw*RTT/MSS Set receivers advertised window: rwnd=PS/no_flows No packets will be lost due to buffer overflow TCP design assumptions do not hold anymore Packet loss Reordering,Non-shared environment,Analytical models supported by simulations: Throughput as a function of: Network path proprieties:

    10、RTT, MSS, bottleneck bandwidth Number of parallel flows used Frequency of packet loss/reordering events. (On optical links link error rate is very low) Achievable throughput using TCP can get close to 100% of bottleneck bandwidth,Single flow throughput as a function of loss indication rates. MSS = 5

    11、00bytes Bottleneck bandwidth=100Mbps; RTT=100ms;.,Increasing segment size: to 1460, 4400 and 9000 bytes Single flow throughput as a function of loss indication rates for various pipe sizes for various segment sizes. Bottleneck bandwidth=100Mbps; RTT=100m.,Increase the number of parallel flows. The n

    12、ew transfer uses 5 flows. Bottleneck bandwidth=100Mbps; RTT=100ms;.,To increase throughput,Decrease pipe size for each flow: segment size (hardware trend) number of parallel flows Detect packet reordering events; SACK (RFC2018; RFC2883) could be used to pass info adjust duplicate ACK threshold dynam

    13、ically “undo” reduction of the congestion window Skip slow start; cache and share RTT values among flows (T/TCP, ),Alternatives,A rate-based protocol like NETBLT (RFC998) Shared environments Aggarwal & all 00 simulation studies Counterintuitive: no performance improvements Non-shared environments Th

    14、eoretically should be a bit faster, but needs to beat the huge amount of engineering around TCP implementations Requires smaller buffers at routers Simulation studies needed,Summary and next steps,We have a framework for simulation studies of high-performance transfers. Used it for investigating TCP performance in shared and non-shared environments.Next: Use simulations to evaluate SACK TCP extensions effectiveness in detecting reordering. Evaluate decisions after reordering is detected. Simulate a rate-based protocol and compare with TCP dialects,


    注意事项

    本文(High-performance bulk data transfers with TCP.ppt)为本站会员(王申宇)主动上传,麦多课文档分享仅提供信息存储空间,仅对用户上传内容的表现方式做保护处理,对上载内容本身不做任何修改或编辑。 若此文所含内容侵犯了您的版权或隐私,请立即通知麦多课文档分享(点击联系客服),我们立即给予删除!




    关于我们 - 网站声明 - 网站地图 - 资源地图 - 友情链接 - 网站客服 - 联系我们

    copyright@ 2008-2019 麦多课文库(www.mydoc123.com)网站版权所有
    备案/许可证编号:苏ICP备17064731号-1 

    收起
    展开