頁籤選單縮合
題 名 | Design and Analysis for a Delay-Bounded Fair Queueing Algorithm |
---|---|
作 者 | Liu, Mingshou; | 書刊名 | 中國工程學刊 |
卷 期 | 29:6 民95.10 |
頁 次 | 頁1105-1108 |
分類號 | 448.6 |
關鍵詞 | Packet scheduling; RSVP; QoS; Weighted fair queueing; |
語 文 | 英文(English) |
英文摘要 | In this paper, we propose a fair resource reservation and scheduling algorithm for delay-bounded services. User applications initiate the requests by specifying the tolerable delay and priorities. Packets are scheduled according to the requirements negotiated during the resource reservation phase. Instead of tracking the fair utilization before the packet can be served in WFQ, the bandwidth share is monitored after the packet is sent. This approach can significantly reduce the computational complexity resulting from WFQ while maintaining the long-term fairness. Examples and simulations are illustrated to show the performance difference from WFQ. |
本系統中英文摘要資訊取自各篇刊載內容。