政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/113275

English | 正體中文 | 简体中文 | Post-Print筆數 : 27 | Items with full text/Total items : 113980/145005 (79%)
Visitors : 52018370 Online Users : 751

RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.

Home ‧ Login ‧ Upload ‧ Help ‧ About ‧ Administer

政大機構典藏 > 政大會議論文集 > TANET 台灣網際網路研討會 > 會議論文 > Item 140.119/113275

Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/113275

Title:	植基於比例式延遲差異的封包排程演算法：最長等待時間優先
Authors:	黃一泓蔡安喬朱延平
Keywords:	封包排程演算法;差異式服務;相對性差異的服務 Packet Scheduling;DiffServ;relative service differentiation
Date:	2005
Issue Date:	2017-09-29 17:40:59 (UTC+8)
Abstract:	本文提出一個植基於比例式延遲差異(proportional delay differentiation，PDD)模組的封包排程演算法：最長等待時間優先(Longest Waiting Time First，LWTF)。本演算法的時間複雜度為N O ，優於Advanced Waiting Time Priority (AWTP)[17] 的�v �w 2 N O 。經由模擬實驗的結果，LWTF 不管在一般流量(moderate traffic load)以及高流量(high traffic load)的情況下，都可以獲得比AWTP 更確實的延遲比例分配，讓不同等級之間產生相對延遲的差異來達成相對性差異式服務的需求。 In this paper, we proposed a new packet scheduling algorithm for proportional delay differentiation (PDD) model called Longest Waiting Time First (LWTF). The time complexity of LWTF is �v �w N O , that is better than the time complexity of Advanced Waiting Time Priority (AWTP) algorithms [17], 2 N O . Simulation results show that when the link utilization is moderate (60%~90%), LWTF obtains more accurate delay proportion than the Waiting Time Priority (WTP) [5] and AWTP scheduling algorithms.
Relation:	TANET 2005 台灣網際網路研討會論文集網際網路技術
Data Type:	conference
Appears in Collections:	[TANET 台灣網際網路研討會] 會議論文

Files in This Item:

File	Description	Size	Format
275.pdf		258Kb	Adobe PDF2	163	View/Open

社群 sharing

著作權政策宣告 Copyright Announcement

1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.

Loading...