University of Taipei:Item 987654321/2708
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 3600/17059 (21%)
Visitors : 427950      Online Users : 572
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU 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://utaipeir.lib.utaipei.edu.tw/dspace/handle/987654321/2708


    Title: Realization of Earliest-Due-Date Scheduling Discipline for ATM Switches
    Authors: LIANG Shih T.
    YUANG Maria C.
    梁世聰
    Contributors: 臺北市立教育大學資訊科學系
    Date: 1998
    Issue Date: 2009-08-04 12:15:38 (UTC+8)
    Abstract: Asynchronous Transfer Mode(ATM) networks are expected to support a diverse mix of traffic sources requiring different Quality Of Service(QOS) guarantees. This paper initially examines several existing scheduling disciplines which offer delay guarantees in ATM switches. Among them, the Earliest-Due-Data(EDD) discipline has been regarded as one of the most promising scheduling disciplines. The EDD discipline schedules the departure of a cell belonging to a call based on the delay priority assigned for that call during the call set-up. Supporting n delay-based service classes through the use of n respective urgency numbers D_0 to D_<n-1>(D_0≤D_1≤…≤D_<n-1>), EDD allows a class-i cell to precede any class-j(j>i) cell arriving not prior to(D_j-D_i) -slot time. The main goal of the paper is to determine the urgency numbers(D_i's), based on an in-depth queueing analysis, in an attempt to offer ninety-nine percentile delay guarantees for higher priority calls under various traffic loads. In the analysis, we derive system-time distributions for both high- and low-priority cells based on a discrete-time, single-server queueing model assuming renewal and non-renewal arrival processes. The validity of the analysis is justified via simulation. With the urgency numbers(D_i's) determined, we further propose a feasible efficient VLSI implementation architecture for the EDD scheduling discipline, furnishing the realization of QOS guarantees in ATM switches.
    Relation: IEICE transactions on communications, E81-B(2), p.363-372
    Appears in Collections:[Department of Computer Science] Periodical Articles

    Files in This Item:

    There are no files associated with this item.



    All items in uTaipei are protected by copyright, with all rights reserved.


    如有問題歡迎與系統管理員聯繫
    02-23113040轉2132
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback