摘要
传统的基于实时优先级的网络调度策略,一般只是考虑在优先级不同的情况下按优先级值的大小顺序来转发数据帧,在优先级相同的情况下轮流转发数据帧。但是在后者的情况下,长度相对大的数据帧的优先发送往往会加大数据传输的延迟。针对此问题提出了一种改进的算法。并在一种网络模型中验证了此算法的优点。
The tradition based on the real-time priority's network scheduling strategy, is only generally the consideration retransmits the data frame in the priority different situation according to the priority value size order, retransmits the data frame in turn in the priority same situation. But in the latter's situation, the length relatively big data frame's first transmission will often increase the data transmission the de- tention. Proposed in view of this question one kind of improvement's algorithm, and has confirmed this algorithm merit in one kind of network model.
作者
钟伟胜
钱光明
ZHONG Wei-sheng, QIAN Guang-ming (College of Mathematics and Computer Science,Hunan Normal University,Changsha 410081,China)
出处
《电脑知识与技术》
2009年第1期197-198,共2页
Computer Knowledge and Technology
关键词
优先级队列
服务质量
短作业优先
延迟_长度矩阵
priority queue
quality of service
short assignment preferential
defer_length matrix