English  |  正體中文  |  简体中文  |  Items with full text/Total items : 49621/84835 (58%)
Visitors : 7687808      Online Users : 84
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/70301


    Title: An adaptive approach to weighted fair queue with QoS enhanced on IP network
    Authors: Horng, Mong-fong;Lee, Wei-tsong;Lee, Kuan-ron;Kuo, Yau-hwang
    Contributors: 淡江大學電機工程學系
    Date: 2001-08
    Issue Date: 2011-10-23 21:09:06 (UTC+8)
    Publisher: IEEE
    Abstract: We propose an adaptive bandwidth allocation algorithm for reservation protocols to support quality-of-service networking on the future multimedia Internet. QoS design is the fundamental functionality of the next generation IP router to enable differentiated delivery and to guarantee the delivery quality for diverse service traffic. The proposed algorithm called adaptive weighted fair queue (AWFQ) scheduling employs the queue status and priority assignment to determine the bandwidth sharing of various Internet services and to ensure the defined QoS policy is obtained. We propose a smart methodology of distributing the outlink bandwidth in a flexible, fair and prioritized manner to utilize network bandwidth more effectively and efficiently. In simulation, we compare the proposed AWFQ algorithm with priority queue (PQ) and weighted fair queue (WFQ) that are two famous scheduling algorithms in practice. In comparison, we examine their performances in terms of packet loss, bandwidth utilization and queue dynamics to verify our algorithm. We find that the proposed algorithm has the following advantages: 1) improves the bandwidth starvation of low-priority traffic occurring in PQ, 2) has a high bandwidth utilization close to PQ, 3) has a low queue congestion and 4) maintains the fairness of WFQ. Overall, the proposed algorithm not only has an excellent performance close to PQ but also improve the disadvantage of PQ.
    Relation: TENCON 2001. Proceedings of IEEE Region 10 International Conference on Electrical and Electronic Technology, pp.181~186(vol.1)
    DOI: 10.1109/TENCON.2001.949576
    Appears in Collections:[電機工程學系暨研究所] 會議論文

    Files in This Item:

    There are no files associated with this item.

    All items in 機構典藏 are protected by copyright, with all rights reserved.


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - Feedback