| STF：PROVIDE RATE GUARANTEES IN INPUT—QUEUED SWITCH |
| |
| 作者姓名： | WangWenjie WeiGang |
| |
| 作者单位： | InstituteofRadioandAutomaticControl,SouthChinaUniv.ofTech.,Guangzhou510640 |
| |
| 基金项目： | Supported by National Natural Science Foundation of China under Grant No.69896246 |
| |
| 摘 要： | A QoS-aware input-queued scheduling algorithm,called Smallest Timestamp First (stf),is propsed,which is improved upon is LIP and can allocate bandwidth among imputs sharing a common output based on their reservation by assigning suitable finishing timestamps to contending cells .STF can also provide isolation between flows that share a common output link.Misbehaving flows will be restricted to guarantee the behaving flow^s bandwidth .Simulations prove the feasibility of our algorithm.
|
| 关 键 词： | ATM 异步传输模式 输入排队 调度算法 服务算法 |
STF: Provide rate guarantees in input-queued switch |
| |
| WangWenjie WeiGang.STF: Provide rate guarantees in input-queued switch[J].Journal of Electronics,2002,19(2):204-208. |
| |
| Authors: | Wenjie Wang Gang Wei |
| |
| Affiliation: | Institute of Radio and Automatic Control, South China Univ. of Tech., Guangzhou 510640 |
| |
| Abstract: | A QoS-aware input-queued scheduling algorithm, called Smallest Timestamp First (STF), is proposed, which is improved upon iSLIP and can allocate bandwidth among inputs sharing a common output based on their reservation by assigning suitable finishing tiniest-amps to contending cells. STF can also provide isolation between flows that share a common output, link. Misbehaving flows will be restricted to guarantee the behaving flows' bandwidth. Simulations prove the feasibility of our algorithm. |
| |
| Keywords: | Asynchronous transfer mode Input-queued Scheduling algorithm QoS |
| 本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录！ |
| 点击此处可从《电子科学学刊(英文版)》浏览原始摘要信息 |
|
点击此处可从《电子科学学刊(英文版)》下载全文 |
