期刊文献+

解决FAST TCP缓存溢出相关问题的改进pacing technique算法和α参数调整算法 被引量:1

Improved Pacing Technique Algorithm and α-adjusting Algorithm to Solve Problems Related to Buffer Overflowing of FAST TCP
在线阅读 下载PDF
导出
摘要 分析FAST TCP在缓存溢出发生时的性能,发现在缓存溢出场景中,收敛中的FAST TCP流经历严重的报文段丢失。相反,已经收敛了的FAST TCP流维持着高吞吐量和低报文段丢失概率。这种不公平是由FAST TCP缩减其窗口时的零传输率导致的。通过修改FAST TCP pacing算法,可以解决此问题。文中提出的α-adjusting算法,通过动态调整FAST TCP协议中的α参数来避免频繁的缓存溢出。通过分析ns2仿真结果,证明该算法在公平性和稳定性方面可获得令人满意的性能。 By analyzing the performance of FAST TCP when buffer overflows occur.We find that,in this case,converging FAST TCP flows suffer from heavy packet losses.In contrast,converged FAST TCP flows maintain high throughput and low packet loss probability.This unfairness results from the zero transmission rate when FAST TCP decreases its congestion window.We tackle this problem by modifying FAST TCP pacing algorithm.Morevoer,we propose an α-adjusting algorithm to avoid frequent buffer overflows by dynamically tuning the α parameter of the FAST TCP protocol.Validated by ns2 simulations,this algorithm demonstrates satisfactory performance in fairness and stability.
作者 朱小松
机构地区 南京邮电大学
出处 《信息通信技术》 2012年第1期60-65,共6页 Information and communications Technologies
关键词 FAST TCP 缓存溢出 节拍技术 α参数调整 算法 FAST TCP Buffer Overflow Pacing Technique α-adjusting Algorithm
  • 相关文献

参考文献11

  • 1Tucker R. Will optical replace electronic packet switching[EB/OL].http://spie.org/x14157.xml?highlight=x2414,March 2007,2011.
  • 2Tucker R S. Petabit-per-second routers:optical vs.electronic implementa-tions[A].Anaheim,California,2006.3.
  • 3Tucker R S. The role of optics and electronics in highcapacity routers[J].lEEE/OSA Journal of Lightwave Tech nology,2006,(12):4655-4673.
  • 4Wong E W M,Zukerman M. Bandwidth and buffer tradeoffs in optical packet switching[J].IEEE/OSA Journal of Lightwave Technolo gy,2006,(12):4790-4798.
  • 5Jin C,Wei D,Low S H. FAST TCP for high-speed longdistance networks[EB/OL].http://netlab.caltech.edu/pub/papers/draft-jwl-tcp-fast-01.txt,2001.
  • 6Wei D X;Jin C;Low S H.FAST TCP:Motivation,architecture,al-gorithms and performance[A]香港,20042490-2501.
  • 7Jin C,Wei D,Low S H,et aI. FAST TCP:From theory to experiments[J].lEEE Network,2005,(01):4-11.
  • 8Tang A,Wei D,Low S H. Heterogeneous congestion control:Efficiency,faimess and design[A].St.Barbara,CA,2006.127-136.
  • 9Wang J T,Tang A,Hegde S. Equilibrium and fairness of networks shared by TCP Reno and Vegas/FAST[J].Journal Telecommunication Systems,2005,(04):417-439.
  • 10Tang A;Wang J T;Low S H;et alNetwork equilibrium of hetero-geneous congestion control protocols.查看详情[A],MiamiFloridaUSA20051338-1349.

同被引文献14

  • 1宋丽华,陈鸣,张睿.一种基于测量的TCP Fast改进方案[J].北京邮电大学学报,2005,28(4):27-31. 被引量:6
  • 2宋丽华,王海涛,陈鸣.基于网络测量和模糊控制技术的拥塞控制机制[J].华南理工大学学报(自然科学版),2006,34(6):89-94. 被引量:6
  • 3黄小猛,林闯,任丰源.高速传输协议研究进展[J].计算机学报,2006,29(11):1901-1908. 被引量:17
  • 4David X W, Cheng J, Low S H. FAST TCP: motivation, architecture, algorithms, performance. IEEE/ACM Transactions on Networking, 2006, 14 (6) : 1246-1259.
  • 5Choi Y J, Ko J W, Wook S. Improved global stability renditions of the tuning parameter in FAST TCP. IEEE Communications Letters, 2009, 13 ( 3 ) :202-205.
  • 6Gu. , Grossman R L. SABUL: A transport protocol for grid computing. Journal of Grid Computing, 2003,1 (4) : 377-386.
  • 7Tang A, Wei D, Low S H. Heterogeneous congestion control: efficiency, fairness and design. In: Proceeding of the 14th IEEE International Conference on Network Protocols, St. Barbara, USA, 2006. 127-136.
  • 8Zhang H Y, Zhang X Y. Adaptive FAST TCP. In: Pro- ceeding of the 2nd International Conference on Future Networks, Sanya, China, 2010. 114-119.
  • 9Choi J Y, Koo K, Low S H. Global exponential Stability of FAST TCP. In: Proceedings of the 45th IEEE Confer- ence on Decision and Control, San Diego, USA, 2006. 639 -643.
  • 10Kyungmo Koo, Joon-Young Choi, Jin S. Lee. Two differ- ent models of FAST TCP and their stable and efficient modification. Network Control and Optimization, 2007, 44(1) : 65-73.

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部