Please use this identifier to cite or link to this item:
https://ah.lib.nccu.edu.tw/handle/140.119/113847
題名: | 連線允諾控制中利用平行演算法求最小延遲 | 作者: | 黃蓮池 王三元 郭家旭 |
關鍵詞: | 服務品質;連線允諾控制;片段線函數;到達程序外封;序列演算法;平行演算法 Quality of service;connection admission control;piecewise linear function;envelope of arrival process;series algorithm;parallel algorithm |
日期: | 2006 | 上傳時間: | 19-Oct-2017 | 摘要: | 本文提出一個簡單,但卻很有效率的演算法,用在連線允諾控制上。連線允諾控制是未來多媒體網際網路提供服務品質的第一道控制機制。服務品質使用服務曲線來描述是一個有效的方式,因而Sariowan提出了SCED的排程機制用來保證連線要求的服務曲線。SCED也是屬於EDF,而Firoiu針對EDF的連線允諾控制提出了一種低複雜度的演算法。這種演算法複雜度雖低,但因計算過程是使用序列進行方式,所以比較耗時。因此本文將提出一種演算法,利用平行計算的方式來加速最低延遲的計算。平行演算法不僅保有序列演算法之低複雜度,且可在較短的時間內完成連線允諾控制。除了提出平行演算法外,本文亦修正Firoiu文中的一些錯誤。 This paper proposed a simple but efficient algorithm, which is applied to the connection admission controls. Connection admission controls are the first gate of control mechanisms for provision of quality of service in the future multimedia Internet. Utilizing a service curve to describe the quality of service is an effective method. Therefore, Sariowan proposed the SCED scheduling mechanism to guarantee the service curves required by connections. The SCED is also a kind of EDF scheduling and Firoiu proposed an algorithm with low complexity for the connection admission control of EDF. Although the complexity of the algorithm is low, it is time-consuming because it processes the calculation in series. Therefore, this paper proposed a new algorithm that accelerates the calculation of the lowest delay by a method of parallel calculation. The parallel algorithm keeps the low complexity of the series algorithm and completes the connection admission control in a shorter time. Except proposing the parallel algorithm, this paper also modified some mistakes in the Firoiu`s paper. |
關聯: | TANET 2006 台灣網際網路研討會論文集 網際網路技術 |
資料類型: | conference |
Appears in Collections: | 會議論文 |
Show full item record
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.