Realization of Earliest-Due-Date Scheduling Discipline for ATM Switches

University of Taipei > 理學院 > 資訊科學系 > 期刊論文 > Item 987654321/2708

請使用永久網址來引用或連結此文件: http://utaipeir.lib.utaipei.edu.tw/dspace/handle/987654321/2708

題名:	Realization of Earliest-Due-Date Scheduling Discipline for ATM Switches
作者:	LIANG Shih T. YUANG Maria C. 梁世聰
貢獻者:	臺北市立教育大學資訊科學系
日期:	1998
上傳時間:	2009-08-04 12:15:38 (UTC+8)
摘要:	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.
關聯:	IEICE transactions on communications, E81-B(2), p.363-372
顯示於類別:	[資訊科學系] 期刊論文

文件中的檔案:

沒有與此文件相關的檔案.

在uTaipei中所有的資料項目都受到原著作權保護.

資料載入中.....