期刊文献+

基于流量预判的校园选课网络拥塞控制方法 被引量:1

Campus Network Congestion Control Method Based on the Flow of the Course Anticipation
下载PDF
导出
摘要 在学校的选课系统中,如果多名学生同时选择同一门课程,这种瞬时增大的数据流量流动的倾向会造成数据的分布均匀性较差。传统的校园网络选课系统多是基于CS结构,如果服务器数据源节点动态传输数据过于集中,会造成瞬时数据量猛涨,导致选课网络信道发生拥塞现象,选课数据无法及时传输到终端,造成选课系统存在较大延迟。为了解决上述问题,提出了一种基于流量预判算法的校园网络选课系统的拥塞控制策略,通过获取数据流量分布情况,进行流量参数估计;通过流量预测,判断信道流量拥塞程度,从而实现校园网络的拥塞分流控制。实验证明,这种基于流量预判算法的拥塞控制方式提高了校园网络选课速度,取得了令人满意的效果。 In the course of the school system,if many students and select the same course,this kind of data traffic flow instantaneous increase tendency of distribution and not even,can cause data distribution uniformity is poorer.The traditional campus network elective course system are based on CS structure,and if the server data source node dynamic data transmission is too centralized,can cause instantaneous data quantity has soared,leading to the network course and collided channel phenomenon,data transmission to course is unable to terminal,cause large delay course system.In order to solve the above problems,and put forward a kind of anticipation algorithm based on the flow of the course system of campus network congestion control strategy,through the get the data flow distribution,for flow parameters estimation;Through the flow prediction,judge channel flow congestion level,so as to realize the campus network congestion tap control.Experiments show that the algorithm based on flow anticipation of congestion control mode to the campus network speed increase course satisfactory results have been obtained.
作者 沈艺敏
出处 《科技通报》 北大核心 2012年第6期158-160,共3页 Bulletin of Science and Technology
关键词 拥塞控制 流量算法 校园网络 congestion control flow algorithm campus network
  • 相关文献

参考文献5

二级参考文献23

  • 1吕海寰.美国军事卫星通信系统的现状与发展[J].军事通信技术,1994,15(3):1-12. 被引量:5
  • 2C Caserri, M Meo. A new approach to model the stationary behavior of TCP connections. In: Proc of IEEE INFOCOM2000, Tel Aviv, Israel, CA: IEEE Computer Society, 2000.
  • 3S Floyd. A report on me recent developments in TCP congestion control. IEEE Communications Magazine, 2001, 39(4): 84-90.
  • 4V Jacobson, Michael J Karels. Congestion avoidance and control. IEEE/ACM Trans on Networking, 1988, 6(3) : 314-329.
  • 5W Stevens. TCP slow start, congestion avoidance, fast retransmit, and fast recovery algorithms. Internet Network Working Group, RFC 2001, 1997.
  • 6S Floyd, T Henderson. The new Reno modification to TCP' s fast recovery algorithm. Internet Network Working Cttoup, RFC 2582, 1999.
  • 7M Mathis, J Mahdavi, S Floyd et al. TCP selective acknowledgment optkms. Internet Network Working Group, RFC 2018, 1996.
  • 8S Floyd, V Jacobson. Random early detection gateways for congestion avoidance. IEEE/ACM Trans on Networking, 1993,1(4) : 397-413.
  • 9K Rarnakrishnan, S Floyd. A proposal to add explicit congestion notification(ECN). Internet Network Working Group, RFC 2481, 1999.
  • 10Venkata N Padmanabban, Randy H Katz. TCP fast start: A technique for speeding up Web transfers. In: Proc of the IEEE Globecom Imernet Mini-Conference'98. 1998. http://www. cs. berkeley, edu-padm. anab/papers/gi98-unabridged, gs.

共引文献210

同被引文献1

引证文献1

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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