以工业以太网与商用网络信息整合为研究背景,从调度算法入手,研究了基于LARS调度算法在多业务网络中改进网络服务质量的问题.在研究LARS调度算法的原理和优缺点基础上,提出了利用数据分类技术改进LARS的方法,并在算法参数不同取值的条件下对转发性能做了测试,证明该方法在实际应用中能够保留LARS的基本特性,同时能够有效提升LARS的执行效率,并具有较好的动态参数稳定性.
Aiming at the demand of industrial ethernet and office network information integration, this paper studies the problem of improving the quality of network service in multi-service network based on LARS scheduling algorithm. The principles, advantages and disadvantages of LARS are studied,and a method for improving LARS by using data classification technology is proposed. The forwarding performance test under different parameters proves that the method can preserve LARS’s basic characteristics, can effectively improve the efficiency of the implementation of LARS, and has a good robustness.
[1] DECOTIGNIE J D.The many faces of industrial ethernet[Past and Present] [J].IEEE Industrial Electronics Magazine, 2009, 3(1):8-19. DOI: 10.1109/MIE.2009.932171.
[2] GORECKY D, SCHMITT M, LOSKYLL M, et al. Human-machine-interaction in the industry 4.0 era[J]. Management Science, 2014, 23(6):595-605. DOI: 10.1109/INDIN.2014.6945523.
[3] 杨金翠, 方滨兴, 翟立东, 等.面向物联网的通用控制系统安全模型研究通信学报[J].通信学报, 2012, 1(11):49-56. DOI:10.3969/j.issn.1000-436x.2012.11.007.
[4] SKEIE T, JOHANNESSEN S, HOLMEIDE O. Timeliness of real-time IP communication in switched industrial Ethernet networks[J].IEEE Transactions on Industrial Informatics, 2006, 2(1):25-39. DOI: 10.1109/TII.2006.869934.
[5] ABUTEIR M, OBERMAISSER R. Simulation environment for Time-Triggered Ethernet[Z]. IEEE International Conference on Industrial Informatics, Bochum, 2013.
[6] PRYTZ G.A performance analysis of EtherCAT and PROFINET IRT[Z]. IEEE International Conference on Emerging Technologies & Factory Automation, Hamburg, 2008.
[7] TIAN Z, GAO X, KUN L I, et al.The improvement of IEEE 802.1p priority scheduling protocol in industrial ethernet[J].Information & Control, 2012, 41(1):117-68. DOI:10.3724/SP.J.1219.2012.00117.
[8] 姜国臣,谭贤四,范照勇等.排队规则对FTP,Video,VoIP应用的性能影响[J].现代电子技术,2006,29(5):50-51,56.DOI:10.3969/j.issn.1004-373X.2006.05.027.
[9] DELL'AMICO M, CARRA D, PASTORELLI M, et al. Revisiting size-based scheduling with estimated job sizes[Z]. IEEE, International Symposium on Modelling, Analysis & Simulation of Computer and Telecommunication Systems, Paris, 2014.
[10] HARCHOL-BALTER M, SCHROEDER B, BANSAL N, et al. Size-based scheduling to improve web performance[J]. Acm Transactions on Computer Systems, 2003, 21(2):207-233. DOI: 10.1145/762483.762486.
[11] KHADEMI N, OTHMAN M. Least attained service queue management for ns-2 network simulator[Z]. International Conference on Computer Research & Development, Kuala Lumpur, 2010.
[12] AUCHMANN M, URVOY-KELLER G. On the variance of the least attained service policy and its use in multiple bottleneck networks[M]. Network Control and Optimization, Springer Berlin Heidelberg, 2008:70-77.
[13] RAI I A, BIERSACK E W, URVOY-KELLER G.Size-based scheduling to improve the performance of short TCP flows[J].IEEE Network, 2005, 19(1):12-17. DOI: 10.1109/mnet.2005.1383435.
[14] HEUSSE M, URVOY-KELLER G, BROWN T X, et al.Least attained recent service for packet scheduling over access links[J].Pervasive & Mobile Computing, 2011, 7(4):479-494. DOI: 10.1016/j.pmcj.2011.04.002.
