期刊文献+

Internet路由器中拥塞控制机制研究的现状与展望 被引量:5

RESEARCH ON ROUTER MECHANISMS FOR CONGESTION CONTROL IN THE INTERNET
下载PDF
导出
摘要 目前,Internet路由器中拥塞控制机制研究的热点在于:在不破坏网络可扩展性的前提下,如何在路由器上提供拥塞控制机制。该文从信息与激励的角度出发,以部分流状态、核心路由器状态无关、拥塞计费等为3个基本思路,对该领域中已提出的主要研究方案进行了分类阐述和比较分析,总结了其最新研究进展,为下一步的研究提出了新的课题和设想。 This paper summaries the recent research advance in the field providing congestion control mechanisms as powerful and flexible as the ones implemented by a stateful network. In a partial stateful or stateless network, three kinds of mechanisms are introduced for Internet routers: partial per-flow state, stateless core, congestion pricing and their representative implementation schemes are discussed in detail. The paper summaries this research field from the information and incentive point of view, discusses the internal relationships between these mechanisms and analyzes their performance characteristics.
作者 魏蛟龙 张驰
出处 《电子与信息学报》 EI CSCD 北大核心 2003年第3期404-411,共8页 Journal of Electronics & Information Technology
基金 湖北省自然科学基金(No.99J041和No.2001ABB104)
关键词 INTERNET 路由器 网络拥塞控制 部分流状态 拥塞计费 核心路由器状态无关 Network congestion control, Partial per-flow state, Stateless core, Congestion pricing
  • 相关文献

参考文献21

  • 1[1]S. Floyd, A report on recent developments in TCP congestion control, IEEE Communications Magazine, 2001, 39(4), 84-90.
  • 2[2]S. Floyd, K. Fall, Promoting the use of end-to-end congestion control in the Internet, IEEE/ACM Trans. on Networking, 1999, 7(4), 458-472.
  • 3[3]R. Kapoor, C. Casetti, M. Gerla, Core-stateless fair bandwidth allocation for TCP flows, IEEE International Conference on Communications, Helsinki, Finland, 2001, 1, 146-150.
  • 4[4]V.P. Kumar, T. V. Lakshman, Beyond best effort: router architectures for the differentiated services of tomorrow's Internet, IEEE Communications Magazine, 1998, 36(5), 152-164.
  • 5[5]D. Lin, R. Morris, Dynamics of random early detection, Proc. from ACM SIGCOMM 97, Cannes,France, October 1997, 127-137.
  • 6[6]R. Mahajan, S. Floyd, Controlling high-bandwidth flows at the congested router, ICSI Tech Report TR-01-001, April 2001.
  • 7[7]P. Rong, B. Prabhakar, CHOKe, A stateless active queue management scheme for approximating fair bandwidth allocation, INFOCOM 2000, Tel Aviv, Israel, 2000, Vol. 2, 942-951.
  • 8[8]P. Gevros, J. Crowcroft, P. Kirstein, S. Bhatti, Congestion control mechanisms and the best effort service model, IEEE Network, 2001, 15(3), 235-277.
  • 9[9]J. Padhye, V. Firoiu, D. Towsley, J. Kurose, Modeling TCP throughput: a simple model and its empirical validation, ACM SIGCOMM'98, Vancouver, USA, 1998, 303-314.
  • 10[10]R. Roy, R. C. Mudumbai, S. S. Panwar, Analysis of TCP congestion control using a fluid model,IEEE International Conference on Communications, Helsinki, Finland, 2001, Vol. 8, 151-160.

同被引文献25

  • 1蔡军,王移芝.IPv6相关路由算法技术的研究[J].计算机技术与发展,2006,16(5):91-93. 被引量:3
  • 2ASERRI C, MEO M. A new approach to model the stationary behavior of TCP conneetions [A]. Proe IEEE INFOCOM2000, Tel Aviv, Israel [ C]. CA: IEEE. Computer Sodety, 2000: 367-375.
  • 3BRESLAU L, ESIRIN D, FALL K, et al. Advances in network simulation simulation.[J]. IEEE Computer, 2000, 33 (5): 59 - 67.
  • 4PAN R, PRABHAKAR B, PSOUNIS K. CHOKe - a stateless active queue management scheme for approximating fair bandwidth allocation [ A ]. INFFOCOM 2000. IEEE [C]. 2000. 942-951.
  • 5GEVROS P, CROWCROFT 1, KIRSIEIN P, BHATTI S. Congestion control mechanisms and the best effort service model [J]. IEEE Network, 2001, 15(3):16-26.
  • 6CAO Z R, WANG Z, ZEGURA E. Rainbow fair queueing:fair bandwidth sharing without per - flow state [A]. INFOCOM 2000 [C]. IEEE, 2000, 922-931.
  • 7WETHERALL D, LINBLAD C J. Extending Tcl for dynamic object- oriented programming [EB/OL]. http: //tns-www. los. mit. edu/publieafmns/tcltk95. djw. html,1995.
  • 8GREIS M. Marc Greis' tutorial for the UCB- LBNL- VINT network simulator ns [EB/OL]. http: //202. 38. 75.11/~ hwang/ns/, 2001.
  • 9The network simulator ns- 2: Documentation [ EB/OL].http: //www. isi. edu/nsnam/ns/ns -documentation.html, 2001.
  • 10W Feng,D Kandlur,D Saha et al.BLUE:A new class of active queue management algorithms[R].US:University of Michigan,CSE-TR-387-99,1999

引证文献5

二级引证文献8

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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