计算机工程与应用 ›› 2007, Vol. 43 ›› Issue (17): 143-145.

• 网络、通信与安全 • 上一篇    下一篇

一个实时与尽力服务并存的队列调度方案

钱光明   

  1. 湖南师范大学 数学与计算机科学学院,长沙 410081
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2007-06-11 发布日期:2007-06-11
  • 通讯作者: 钱光明

Scheduling mechanism of real-time queues coexisting with best-effort services

QIAN Guang-ming   

  1. College of Mathematics and Computer Science,Hunan Normal University,Changsha 410081,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-06-11 Published:2007-06-11
  • Contact: QIAN Guang-ming

摘要: 某些工业环境往往有一个或多个用于监测和/或控制的周期性实时系统,而今,这样的环境也难以抵御Internet的吸引和渗透。如果在单个系统中,既能保证实时数据的正常传递,又能与Internet连通实现尽力服务,应该是一个值得研究的课题。为此提出了IaI(Industry and Internet)交换设备的概念,主要讨论了其中的队列调度一环。以三个实时队列和一个尽力服务队列为前提,分析了四种队列模型,给出了实时数据包最长等待时间的计算公式。

Abstract: In some industry environments,there are one or more periodic real-time systems for monitoring and/or controlling purposes.Today,the attraction and penetration of the Internet are difficult to be kept out in these environments.It is worthy to study the topic of getting the best-effort services from the Internet while guaranteeing real-time traffics in a single system.Based on this,an IaI(Industry and Internet) switch is introduced and its queue scheduling is discussed in this paper.On the premise that three real-time and one best-effort queues exist in an IaI switch,four models of queues are analysed and the formulas for evaluating the maximum waiting time of real-time packets are given out.