Journal of South China University of Technology(Natural Science) >

2011 , Vol. 39 >Issue 2: 76 - 80

DOI: https://doi.org/10.3969/j.issn.1000-565X.2011.02.013

Electronics, Communication & Automation Technology

Least Laxity First Information Scheduling Algorithm of Industrial Ethernet Ring Network

Expand
  • South China university of technology, mechanical and automotive engineering school, guangdong guangzhou 510640
张宇辉(1969-)，男，博士生，主要从事网络控制系统研究

Received date: 2010-07-07

  Revised date: 2010-10-21

  Online published: 2011-01-02

Supported by

国家“863”计划项目(2009AAO4Z111)；国家自然科学基金资助项目(50875090，50575075)

Fold

Abstract

In order to improve the quality of service of the industrial Ethernet ring network and avoid the frame conflict,congestion and loss,a least laxity first information scheduling algorithm of industrial Ethernet ring network,namely IERN-LLF,is presented.IERN-LLF is proved to be an optimal scheduling algorithm for the industrial Ethernet ring network when all frames are released at the same time.Simulated results indicate that,as compared with the EDF and RM algorithms,IERN-LLF algorithm is of the lowest frame loss rate in the industrial Ethernet ring network,which means that IERN-LLF algorithm is effective in reducing frame conflict,congestion and loss and improving the stability of networked control systems.

Key words： scheduling algorithms; networked control system; motion control; Ethernet

Cite this article

Zhang Yu-hui Li Di . Least Laxity First Information Scheduling Algorithm of Industrial Ethernet Ring Network[J]. Journal of South China University of Technology(Natural Science), 2011 , 39(2) : 76 -80 . DOI: 10.3969/j.issn.1000-565X.2011.02.013

Options
Outlines

/

〈 〉