Please use this identifier to cite or link to this item: http://hdl.handle.net/11455/19233
DC FieldValueLanguage
dc.contributor.advisor朱延平zh_TW
dc.contributor.advisorYen-Ping Chuen_US
dc.contributor.author郭昭佑zh_TW
dc.contributor.authorKuo, Chao-Yuen_US
dc.date2004zh_TW
dc.date.accessioned2014-06-06T07:06:23Z-
dc.date.available2014-06-06T07:06:23Z-
dc.identifier.urihttp://hdl.handle.net/11455/19233-
dc.description.abstract頻寬公平分享(Fair Share),將有效保護行為良好(要求頻寬小於等於頻寬公平分享)的使用者,而抑制行為不好(要求頻寬大於頻寬公平分享)的使用者,對擁塞控制(Congestion Control)有非常好的性質,可讓擁塞控制達到不錯的效能。在差異式服務(DiffServ)網路,Core-Stateless Fair Queueing (CSFQ)達到一指標性的頻寬公平分享,本論文以CSFQ為基準,提出更接近理想頻寬公平分享的方法“一個植基於CSFQ架構的封包控制方法”。本論文提出一創新的方法,可藉由估測連線數,進而估算出頻寬公平分享值,再以此公平分享值判斷進入封包是Drop或Enqueue到Output queue。 在演算法複雜度方面,本論文方法跟CSFQ是一樣的,但在頻寬公平分享部份優於CSFQ。在緩衝區控制(Buffer Control)部份,本論文方法採用到達外出排程速率的控制方法(Output Queue Arrival Rate Control)來控制緩衝區的使用,使得封包幾乎不會因緩衝區滿溢(Overflow)而被丟棄,如此准許進入的封包可以通過多段擁塞的連線(Links),因此在真實的網路環境裡,本論文方法可以達到預期的頻寬公平分享。zh_TW
dc.description.abstractThe fair bandwidth allocation is a method to protect the users who request the bandwidth less than the fair bandwidth and to control the users who request the bandwidth more than the fair bandwidth. There is a good property for the fair bandwidth allocation that it provides a good performance in congestion control. In DiffServ networks, the Core-Stateless Fair Queueing (CSFQ) is a standard for the fair bandwidth allocation. In this thesis, the proposed method proposes a new method to measure the shared value of fair bandwidth allocation by estimating the number of flows. Thus, a new method, called A New Packet Control Scheme Based on CSFQ Architecture, is proposed such that the estimating value of fair bandwidth allocation is closer to the ideal Fair Queueing. In the time complexity of two algorithms, the proposed method and the CSFQ are both the same. But the proposed method is better than the CSFQ in the fair bandwidth allocation. In buffer control, the proposed method controls the utility of buffer by Output Queue Arrival Rate Control. Another advantage of the proposed method is that the packets almost do not be dropped because of the buffer overflow. Thus the enqueue packets can pass a lot of congested links. Then in real networks, the proposed method can achieve the expectative fair bandwidth allocation.en_US
dc.description.tableofcontents摘要 I Abstract II 目錄 IV 圖目錄 VI 第一章 序論 1 1.1 研究動機 1 1.2 研究目的 3 1.3 論文架構 4 第二章 文獻探討 5 2.1 Max-min Fair Share 5 2.2 DRR (Deficit Round Robin) 6 2.3 CSFQ (Core-Stateless Fair Queueing) 8 第三章 研究方法 10 3.1 一個植基於CSFQ架構的封包控制方法 10 3.2 本論文方法 11 3.3 演算法 14 3.4 權重值 18 3.5 估測連線數的證明 18 第四章 實驗 21 4.1 Single Congested Link實驗 21 4.1.1 實驗一: 32條UDP 22 4.1.2 實驗二和三: 1條UDP和31條TCP 23 4.1.3 實驗四: 1條TCP和N條UDP 24 4.2 Multiple Congested Links實驗 25 4.2.1 實驗五: 1條UDP和N段Congested Links 26 4.2.1 實驗六: 1條TCP和N段Congested Links 27 第五章 討論與建議 28 5.1 討論 28 5.2 未來方向 28 參考文獻 30 附錄一 NS2程式碼之修改 31 附錄二 本論文方法之原始程式碼 32zh_TW
dc.language.isoen_USzh_TW
dc.publisher資訊科學研究所zh_TW
dc.subjectCongestion Controlen_US
dc.subject雍塞控制zh_TW
dc.subjectMax-min Fair Shareen_US
dc.subjectPacket Scheduling Algorithmen_US
dc.subjectDiffServen_US
dc.subjectCSFQen_US
dc.subjectDRRen_US
dc.subject公平排班演算法zh_TW
dc.subject封包排班演算法zh_TW
dc.subject差異式服務zh_TW
dc.title一個植基於CSFQ架構的封包控制方法zh_TW
dc.titleA New Packet Control Scheme Based on CSFQ Architectureen_US
dc.typeThesis and Dissertationzh_TW
Appears in Collections:資訊科學與工程學系所
文件中的檔案:

取得全文請前往華藝線上圖書館

Show simple item record
 
TAIR Related Article
 
Citations:


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.