一種公平輸入排隊調(diào)度算法

周衛(wèi)華; 朱新寧; 武穆清; 丁煒

一级黄色片免费播放|中国黄色视频播放片|日本三级a|可以直接考播黄片影视免费一级毛片

留言板

尊敬的讀者、作者、審稿人, 關(guān)于本刊的投稿、審稿、編輯和出版的任何問題, 您可以本頁添加留言。我們將盡快給您答復。謝謝您的支持!

姓名

郵箱

手機號碼

標題

留言內(nèi)容

驗證碼

文章導航 > 電子與信息學報 > 2005 > 27(3): 341-345

周衛(wèi)華, 朱新寧, 武穆清, 丁煒. 一種公平輸入排隊調(diào)度算法[J]. 電子與信息學報, 2005, 27(3): 341-345.

引用本文:

周衛(wèi)華, 朱新寧, 武穆清, 丁煒. 一種公平輸入排隊調(diào)度算法[J]. 電子與信息學報, 2005, 27(3): 341-345.

Zhou Wei-hua, Zhu Xin-ning, Wu Mu-qing, Ding Wei. A Scheduling Algorithm for Input Queued Switch with Guaranteed Fairness[J]. Journal of Electronics & Information Technology, 2005, 27(3): 341-345.

Citation:

Zhou Wei-hua, Zhu Xin-ning, Wu Mu-qing, Ding Wei. A Scheduling Algorithm for Input Queued Switch with Guaranteed Fairness[J]. Journal of Electronics & Information Technology, 2005, 27(3): 341-345.

周衛(wèi)華, 朱新寧, 武穆清, 丁煒. 一種公平輸入排隊調(diào)度算法[J]. 電子與信息學報, 2005, 27(3): 341-345.

引用本文:

周衛(wèi)華, 朱新寧, 武穆清, 丁煒. 一種公平輸入排隊調(diào)度算法[J]. 電子與信息學報, 2005, 27(3): 341-345.

Zhou Wei-hua, Zhu Xin-ning, Wu Mu-qing, Ding Wei. A Scheduling Algorithm for Input Queued Switch with Guaranteed Fairness[J]. Journal of Electronics & Information Technology, 2005, 27(3): 341-345.

Citation:

Zhou Wei-hua, Zhu Xin-ning, Wu Mu-qing, Ding Wei. A Scheduling Algorithm for Input Queued Switch with Guaranteed Fairness[J]. Journal of Electronics & Information Technology, 2005, 27(3): 341-345.

一種公平輸入排隊調(diào)度算法

計量
- 文章訪問數(shù): 2261
- HTML全文瀏覽量: 96
- PDF下載量: 922
- 被引次數(shù): 0
出版歷程
- 收稿日期: 2003-10-14
- 修回日期: 2004-02-20
- 刊出日期: 2005-03-19

A Scheduling Algorithm for Input Queued Switch with Guaranteed Fairness

摘要

摘要: 輸入排隊交換結(jié)構(gòu)以其良好的可擴展性被越來越多的高速交換機和路由器所采用。當前的調(diào)度算法大都以犧牲公平性來換取最大的吞吐量。但隨著對QoS支持的要求增強,適用于輸入排隊交換結(jié)構(gòu)的高效、公平的調(diào)度算法成為迫切需要解決的問題。該文提出了一種具有公平性保證的基于虛服務(wù)量的公平調(diào)度算法。理論分析和計算機仿真都表明算法在信元時延和公平性方面都能提供較好的保證。算法還具有與iSLIP相同的較低通信開銷,以及和iLQF相同的算法復雜度。因此,算法具有較好的實用性。
- 輸入排隊; 公平性; QoS; 統(tǒng)一服務(wù)量
Abstract: The input queued switch fabric, because of its scalability, has been implemented in more and more high speed switches and routers. Existing scheduling algorithms attempt to get the maximum throughput at the expense of fairness. As the need for Quality of Service (QoS) becomes stronger, the efficient scheduling algorithm with guaranteed fairness for Input Queued (IQ) switch has become an urgent problem. In this paper a virtual service based fair scheduling algorithm with guaranteed fairness for IQ is proposed. Theoretical analysis and computer simulation show that this algorithm can provide better performance in respects of fairness and cell delay. With the same low communication cost as iSLIP and the same computing complexity as iLQF, this algorithm has better practicability.