虚拟网络实验室支撑环境研究
|
摘要
虚拟实验室的成功建立必须依托在能传输可靠的实时数据流的网络环境中。尽管人们对主机端的拥塞控制研究已取得了长足的进展，但目前的路由器队列管理机制不能提供端到端的拥塞控制机制以支撑这种网络环境，具体表现为发生拥塞时对不同类型流量的带宽分配或数据包丢失不具有公平性及网络中各TCP连接流量的同步性。因此，我们很有必要对传统的队列管理机制Drop_Tail、RED等进行改进以达到提高网络服务质量的目的。
本文分析了主机端的拥塞控制机制和网络中路由器的现有各种队列管理机制：绝对优先级队列机制、加权公平队列(Weighted Fair Queue)[1]机制、基于类的队列(Class-based Queue)[2]机制以及RED(Random Early Detection)[3]机制的主要特点，并重点针对IETF(Internet Engineering Task Force)推荐的把RED算法与明确的拥塞通告ECN(Explicit Congestion Notification)[4]结合的方法进行了分析，发现随着Internet流量的日益递增，RED机制的依赖平均队列长度来管理拥塞控制的算法并不能有效地阻止包丢失：与Drop-Tail相比，RED确实消除了对阵发流量(TCP)的偏见，但是增加了平滑流量(UDP)的丢包概率。因此本文在分析各种RED机制的基础之上，对RED算法作了一定的改进，提出了一种根据带宽占有量而把各种流量分类且称之为New_RED的机制,这样就保证了网络中各连接流量共享瓶颈带宽。最后本文就RED机制和New_RED机制的性能利用Berkeley的NS(Network Simulator)仿真器[5]进行了仿真性能的对比，实验表明New_RED的丢包性能得到了一定的改进。
The successful setup of Virtual Laboratory will be dependent on reliable real-time data stream transmission in the network environment. Although the congestion control research of host-ends has made great strides,the current queue management mechanism in router is not able to provide end-to-end congestion control mechanism to sustain the above environment, namely, the unfairness of assigned bandwidth or drop-rate for different types of flows and the synchronization of all TCP flows in network. So it is necessary to improve the classical queue management mecnanism such as Drop_Tail and RED in order to boost the QoS(Quality of Service ).
This article analyzes the main traits of host-ends congestion control and all kinds of fashionable queue management machanism ,which include Queue Mechanism with absolute priority ,Weighted Fair Queue Mechanism and Class-based Queue Mechanism . Further , we emphatically analyze the method of combined RED and ECN which is recommended by IETF . In the analysis we find that with the increase of Internet traffic ,RED mechanism doesn't effectively prevent the packets from dropping . In comparison with Drop_Tail Algorithm , RED Algorithm surely eliminates the bias against the bursty traffic(TCP),but increases the drop probability of smooth traffic(UDP) . So on the bases of the analytic RED mechanism , we make an improvement in maintaining the fair bandwidth shares among all flows in bottleneck links,which we call New_RED Algorithm and classfies all flows according to bandwidth shared by per flow. Finally the article also compares the simulated performance between RED mechanism and New_RED mechanism by the use of NS . The simulated results verify that New_RED mechanism will work better.
本文分析了主机端的拥塞控制机制和网络中路由器的现有各种队列管理机制：绝对优先级队列机制、加权公平队列(Weighted Fair Queue)[1]机制、基于类的队列(Class-based Queue)[2]机制以及RED(Random Early Detection)[3]机制的主要特点，并重点针对IETF(Internet Engineering Task Force)推荐的把RED算法与明确的拥塞通告ECN(Explicit Congestion Notification)[4]结合的方法进行了分析，发现随着Internet流量的日益递增，RED机制的依赖平均队列长度来管理拥塞控制的算法并不能有效地阻止包丢失：与Drop-Tail相比，RED确实消除了对阵发流量(TCP)的偏见，但是增加了平滑流量(UDP)的丢包概率。因此本文在分析各种RED机制的基础之上，对RED算法作了一定的改进，提出了一种根据带宽占有量而把各种流量分类且称之为New_RED的机制,这样就保证了网络中各连接流量共享瓶颈带宽。最后本文就RED机制和New_RED机制的性能利用Berkeley的NS(Network Simulator)仿真器[5]进行了仿真性能的对比，实验表明New_RED的丢包性能得到了一定的改进。
The successful setup of Virtual Laboratory will be dependent on reliable real-time data stream transmission in the network environment. Although the congestion control research of host-ends has made great strides,the current queue management mechanism in router is not able to provide end-to-end congestion control mechanism to sustain the above environment, namely, the unfairness of assigned bandwidth or drop-rate for different types of flows and the synchronization of all TCP flows in network. So it is necessary to improve the classical queue management mecnanism such as Drop_Tail and RED in order to boost the QoS(Quality of Service ).
This article analyzes the main traits of host-ends congestion control and all kinds of fashionable queue management machanism ,which include Queue Mechanism with absolute priority ,Weighted Fair Queue Mechanism and Class-based Queue Mechanism . Further , we emphatically analyze the method of combined RED and ECN which is recommended by IETF . In the analysis we find that with the increase of Internet traffic ,RED mechanism doesn't effectively prevent the packets from dropping . In comparison with Drop_Tail Algorithm , RED Algorithm surely eliminates the bias against the bursty traffic(TCP),but increases the drop probability of smooth traffic(UDP) . So on the bases of the analytic RED mechanism , we make an improvement in maintaining the fair bandwidth shares among all flows in bottleneck links,which we call New_RED Algorithm and classfies all flows according to bandwidth shared by per flow. Finally the article also compares the simulated performance between RED mechanism and New_RED mechanism by the use of NS . The simulated results verify that New_RED mechanism will work better.
引文
[1] Keshav S. Congestion Control in Computer Network.PhD thesis,Berkeley,September 1991.
[2] Floyd S. and Jacobson V. Link-sharing and resource management models for packet network. IEEE/ACM Transations on Networking,3(4).August 1995.
[3] S.Floyd, V.Jacobson, "Random Early Detection Gateways for Congestion Avoidance",IEEE/ACM Transaction on Netwworking August 1993
[4] K.K.Ramakrhishnen,S.Floyd, "A proposal to add Explicit Congestion Notification(ECN) to IPv6 and TCP",Internet Draftkksjf-ecn-00.txt,November'97.
[5] McCanne S. and Floyd S.UCB/LBNL/VINT Network Simulator ,2000 http://www-mash.cs.berkeley.edu/ns
[6] http://www.emsl.pnl.gov.
[7] http://www.nersc.gov
[8] A.Heybey. Netsim Manual. MIT. 1989.
[9] S.Keshav. REAL 5.0 User Manual. http://www.cs.cornell.edu/skeshav/real/user.html. 1997.8
[10] OPNET Modelling Manual, Release 2.5, MIL 3 Inc., Washington D.C., 1994
[11] Zhang H. Service disciplines for guaranteed perormance service in packet-switching networks. proceedings of the IEEE,1995,83(10):1374~1399.
[12] Sally Floyd. Validation Experiences with the NS Simulator. 1999.4
[13] Sandeep Bajaj,Lee Breslau,Deborah Estrin,Kevin Fall,Sally Floyd,Padma Haldar,Mark Handley,Ahmed Helmy,John Heidemann,Polly Huang,Satish Kumar,Steven McCanne,Reza Pejaie,Puneet Sharma,Scott Shenker,Kannan Varadhan,Haobo Yu,Ya Xu,Daniel Zappala. Virtual InterNetwork Testbed:Status and Research Agenda. 1998.
[14] David Wetherall. Christopher J.Lindblad.Extending Tcl for Dynamic Object-Oriented Programming.1995.
[15] Brent Welch. Practical Programming in Tcl and Tk. Prentice Hall,1995. http://www.sunlabs.com/~bwelch/book/.
[16] (美)Brent B.Welch著，王道义，季陶鹏等译，Tcl/TK组合教程--双语教材+多媒体教室，北京：电子工业出版社，2001。
[17] Polly Huang , Deborah Estrin, John Heidemann. Enabling Large-scale Simulations: Selective Abstraction Approach to The Study of Multicast Protocols. http://www-mash.cs.berkeley.edu/ns/.
[18] Deborah Estrin, Mark Handley, John Heidemann, Steven McCanne, Ya Xu, Haobo Yu. Network Visualization with the VINT Network Animator Nam. http://www-mash.cs.berkeley.edu/ns/.
[19] Andrew S.Tanenbaum 熊桂喜等译 计算机网络 清华大学出版社(第三版)，北京，(1999),414~417。
[20]M.Allman,S.Dawkins,D.Glover,J.riner,D.Tran,T.Henderson,J.Heidemann,J.Touch,H.Kruse,S.Ostermann.K.Scott and J.Semke. On going TCP Research Related to Satellites. RFC2760 ,February 2000.
[21] S.floyd ,J.Mahdavi,M.Mathis,and M.Podolsky. An Extension to The Selective Acknoledgement(SACK) Option for TCP. RFC2883 ,Jul.2000.
[22] Floyd S.Jacobson V.Link-sharing and Resource Management Models for Packet Networks. IEEE/ACM Trans.on Networking,1995,3(4):7~9
[23] S.Floyd and K.Fall. "Promoting the Use of End-to-End Congestion Control in the Internet".Submitted to IEEE/ACM Transactions on Networking, URL http://www-nrg.eelbl.gov/floyd/end2end-paper.html,Feb.1998.
[24] Feng W.Kandlur D.Saha D. and Shin K. Blue: A new class of active queue management algorithms University of Michign,Tech. Report CSE-TR-387-99,April 1999.
[25] Ott T.,Lakeshman T. and Wong L. SRED: Stabilized RED. Proceedings IEEE INFOCOM'99, March 1999:1364~1355.
[26] Feng W.Kandlur D.Saha D. and Shin K. A self-configuring RED gateways. Proceedings IEEE INFOCOM'99,March 1999:1320~1328.
[27] Lin D. and Morris R. Dynamics of Random Early Detection. Proceedings IEEE SIGCOMM'97,September 1997:127~138.
[28] Dynamic-CBT- Better performing active managemetn for multimedia networking.
[29] Crovella M and Bestavros A. Explaining World Wide Web traffic self-similarity. Boston University Computer Science Department, Tech Report,TR-95-015,October 1995.
[30] http://www.inria.fr/welcome-eng.html
[31] May M, Bolot J,Diot C. and Lyles B. Resons not to deploy RED performance. Proceedings IWQoS'99, London,March 2000.
[32] May M,Bonald T and Bolot J. Analytic evalution of RED performance . Proceedings INFOCOM'2000,March 2000.
[33] R.Hashem. Analysis of Random Drop for Gateway Congestion Control. MIT Technical Report,1990.
[34] W.FEng et al ,Techniques for eliminating Packet Loss in congesteed TCP/IP Networks 1999.
[35] Cisco Web-pages http://www.cisco.com/warp/public/732/netflow/qos.ds.html.
[36] D.Clark, "Explicit Allocation of Best Effort Packet Delivery Service", http://ietf.org/html.charters/diffserv-charter.html.
[37] O.Elloumi,H.A.Affifi,"RED Algorithm in ATM Networks", International ATM Workshop'97 , Lisboa.
[38] Sally Floyd,Kevin Fall and Kinh Tieu Estimating Arrival Rates from the RED Packet Drop History.
[39] Sally Floyd,Kevin Fall and Kinh Tieu Router Mechanisms to support End-to-end Congestion control, Technical Report,1990
[40] 李仁发 周祖德 李方敏 虚拟实验室网络体系结构研究 系统仿真学报
3（14）（2002） 359~362
[2] Floyd S. and Jacobson V. Link-sharing and resource management models for packet network. IEEE/ACM Transations on Networking,3(4).August 1995.
[3] S.Floyd, V.Jacobson, "Random Early Detection Gateways for Congestion Avoidance",IEEE/ACM Transaction on Netwworking August 1993
[4] K.K.Ramakrhishnen,S.Floyd, "A proposal to add Explicit Congestion Notification(ECN) to IPv6 and TCP",Internet Draftkksjf-ecn-00.txt,November'97.
[5] McCanne S. and Floyd S.UCB/LBNL/VINT Network Simulator ,2000 http://www-mash.cs.berkeley.edu/ns
[6] http://www.emsl.pnl.gov.
[7] http://www.nersc.gov
[8] A.Heybey. Netsim Manual. MIT. 1989.
[9] S.Keshav. REAL 5.0 User Manual. http://www.cs.cornell.edu/skeshav/real/user.html. 1997.8
[10] OPNET Modelling Manual, Release 2.5, MIL 3 Inc., Washington D.C., 1994
[11] Zhang H. Service disciplines for guaranteed perormance service in packet-switching networks. proceedings of the IEEE,1995,83(10):1374~1399.
[12] Sally Floyd. Validation Experiences with the NS Simulator. 1999.4
[13] Sandeep Bajaj,Lee Breslau,Deborah Estrin,Kevin Fall,Sally Floyd,Padma Haldar,Mark Handley,Ahmed Helmy,John Heidemann,Polly Huang,Satish Kumar,Steven McCanne,Reza Pejaie,Puneet Sharma,Scott Shenker,Kannan Varadhan,Haobo Yu,Ya Xu,Daniel Zappala. Virtual InterNetwork Testbed:Status and Research Agenda. 1998.
[14] David Wetherall. Christopher J.Lindblad.Extending Tcl for Dynamic Object-Oriented Programming.1995.
[15] Brent Welch. Practical Programming in Tcl and Tk. Prentice Hall,1995. http://www.sunlabs.com/~bwelch/book/.
[16] (美)Brent B.Welch著，王道义，季陶鹏等译，Tcl/TK组合教程--双语教材+多媒体教室，北京：电子工业出版社，2001。
[17] Polly Huang , Deborah Estrin, John Heidemann. Enabling Large-scale Simulations: Selective Abstraction Approach to The Study of Multicast Protocols. http://www-mash.cs.berkeley.edu/ns/.
[18] Deborah Estrin, Mark Handley, John Heidemann, Steven McCanne, Ya Xu, Haobo Yu. Network Visualization with the VINT Network Animator Nam. http://www-mash.cs.berkeley.edu/ns/.
[19] Andrew S.Tanenbaum 熊桂喜等译 计算机网络 清华大学出版社(第三版)，北京，(1999),414~417。
[20]M.Allman,S.Dawkins,D.Glover,J.riner,D.Tran,T.Henderson,J.Heidemann,J.Touch,H.Kruse,S.Ostermann.K.Scott and J.Semke. On going TCP Research Related to Satellites. RFC2760 ,February 2000.
[21] S.floyd ,J.Mahdavi,M.Mathis,and M.Podolsky. An Extension to The Selective Acknoledgement(SACK) Option for TCP. RFC2883 ,Jul.2000.
[22] Floyd S.Jacobson V.Link-sharing and Resource Management Models for Packet Networks. IEEE/ACM Trans.on Networking,1995,3(4):7~9
[23] S.Floyd and K.Fall. "Promoting the Use of End-to-End Congestion Control in the Internet".Submitted to IEEE/ACM Transactions on Networking, URL http://www-nrg.eelbl.gov/floyd/end2end-paper.html,Feb.1998.
[24] Feng W.Kandlur D.Saha D. and Shin K. Blue: A new class of active queue management algorithms University of Michign,Tech. Report CSE-TR-387-99,April 1999.
[25] Ott T.,Lakeshman T. and Wong L. SRED: Stabilized RED. Proceedings IEEE INFOCOM'99, March 1999:1364~1355.
[26] Feng W.Kandlur D.Saha D. and Shin K. A self-configuring RED gateways. Proceedings IEEE INFOCOM'99,March 1999:1320~1328.
[27] Lin D. and Morris R. Dynamics of Random Early Detection. Proceedings IEEE SIGCOMM'97,September 1997:127~138.
[28] Dynamic-CBT- Better performing active managemetn for multimedia networking.
[29] Crovella M and Bestavros A. Explaining World Wide Web traffic self-similarity. Boston University Computer Science Department, Tech Report,TR-95-015,October 1995.
[30] http://www.inria.fr/welcome-eng.html
[31] May M, Bolot J,Diot C. and Lyles B. Resons not to deploy RED performance. Proceedings IWQoS'99, London,March 2000.
[32] May M,Bonald T and Bolot J. Analytic evalution of RED performance . Proceedings INFOCOM'2000,March 2000.
[33] R.Hashem. Analysis of Random Drop for Gateway Congestion Control. MIT Technical Report,1990.
[34] W.FEng et al ,Techniques for eliminating Packet Loss in congesteed TCP/IP Networks 1999.
[35] Cisco Web-pages http://www.cisco.com/warp/public/732/netflow/qos.ds.html.
[36] D.Clark, "Explicit Allocation of Best Effort Packet Delivery Service", http://ietf.org/html.charters/diffserv-charter.html.
[37] O.Elloumi,H.A.Affifi,"RED Algorithm in ATM Networks", International ATM Workshop'97 , Lisboa.
[38] Sally Floyd,Kevin Fall and Kinh Tieu Estimating Arrival Rates from the RED Packet Drop History.
[39] Sally Floyd,Kevin Fall and Kinh Tieu Router Mechanisms to support End-to-end Congestion control, Technical Report,1990
[40] 李仁发 周祖德 李方敏 虚拟实验室网络体系结构研究 系统仿真学报
3（14）（2002） 359~362