English  |  正體中文  |  简体中文  |  Items with full text/Total items : 54367/62174 (87%)
Visitors : 14639678      Online Users : 48
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTHU 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
    National Tsing Hua University Institutional Repository > 電機資訊學院 > 資訊工程學系 > 專利  >  Weighted longest queue first adaptive scheduling discipline for ATM networks

    Please use this identifier to cite or link to this item: http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/61256

    Title: Weighted longest queue first adaptive scheduling discipline for ATM networks
    Authors: Lee, Duan-Shin
    教師: 李端興
    Date: 2000/6/6
    Relation: NEC USA, Inc.
    Keywords: Weighted longest queue first
    scheduling discipline
    cell delay variation
    Abstract: Disclosed is a weighted longest queue first (WLQF) service discipline for ATM networks. The sources are classified so that sources in one class have the same cell loss probability requirement. For N classes of traffic the WLQF system has N buffers to store the traffic, wherein buffer i is assigned a positive number w.sub.i for the weight of buffer i. The scheduler transmits a cell from that buffer whose index maximizes w.sub.i Q.sub.i for i=1, 2, . . . ,N, where Q.sub.i is the queue length of buffer i at the moment when the scheduler makes a decision about which buffer to serve. Accordingly, the inventive system always serves the most congested buffer relative to the weighted queue lengths, and can adapt to temporary overload quickly. This feature ensures that in temporary overloads of one of the buffers, the overloaded buffer, receives almost all the service and therefore, losses due to buffer overflows and cell delay variation (CDV) are much small. Additionally, when a call is received, the system determines whether it can provide the requested QoS, and rejects the call if not.
    URI: http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO2&Sect2=HITOFF&p=1&u=%2Fnetahtml%2FPTO%2Fsearch-bool.html&r=29&f=G&l=50&co1=AND&d=PTXT&s1=6072800&OS=6072800&RS=6072800
    Appears in Collections:[資訊工程學系] 專利

    Files in This Item:

    There are no files associated with this item.


    SFX Query


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