隨著智慧家庭概念與技術的興盛與成熟，未來ISP(Internet Service Provider)業者勢必面臨管理大量智慧家庭中各種不同應用競爭頻寬資源的情況。為因應大量且繁雜類型的應用服務彼此競爭智慧家庭端及ISP端的頻寬資源，考量並應用適當的頻寬分配法則以盡可能優化使用者體驗(QoE)是本研究的研究動機。相關文獻的排程演算法如TDPSS (Time Domain Priority Set Scheduler)、MSCDL (Mac Scheduler)、Proportional Fair (PF)及Adaptive Modified Largest Weighted Delay First (AMLWDF)等。若要用以管理大量智慧家庭的頻寬資源時，ISP業者須將家庭申辦頻寬方案以及ISP端的系統頻寬分開考量。ISP在整合(aggregate)多個家庭的頻寬資源請求時，會依服務類別分配頻寬，最後依據不同類別採取適當處理，進而提升不同應用的QoS品質。
本篇論文著重於延遲時間的考量，提出能分類來自各個智慧家庭中，屬於不同
QCI (QoS Class Identifier)級別的頻寬請求並以不同佇列存放，依DADS (Delay Aware Dynamical Scheduling)演算法計算優先權值。我們利用保障頻寬與動態配置頻寬給不同用戶服務佇列，並優先分配頻寬給較高優先權的用戶服務，以期在維持一定公平性的前提下，盡可能地降低延遲來提升QoS品質。
在我們的實驗數據分析中，我們將DADS和其他方法如MSCDL、PF、TDPSS以及AMLWDF進行公平性、產能、延遲以及抖動率等效能優劣的比較與分析。最後在總結與未來研究方向，我們歸納與整理了DADS與PF、MSCDL、TDPSS以及AMLWDF等演算法的效能優劣。實驗結果顯示，在延遲上，DADS勝過PF和TDPSS，但略輸MSCDL及AMLWDF；在抖動率及產能上，DADS均較其它四者為差；公平性上則是劣於TDPSS、PF及MSCDL但優於AMLWDF。雖然DADS在整體的表現並非最好，但在特別重視延遲時間的Category1類別(包含QCI級別為1、2及5的應用服務)的延遲效能僅輸AMLWDF些許，而產能卻明顯勝過AMLWDF，由此可見DADS在Category1的表現最佳。 / With the concept and technology of smart homes becoming more and more mature and popular, Internet service provider (ISP) must face managing large set of various applications from smart homes which competing for bandwidth resources. In order to enhance Quality of Services (QoS) of a lot of various applications while they are competing bandwidth resources of both smart homes (home internal) and Internet service provider (home external), we propose a QoS aware bandwidth allocation criterion to optimize Quality of user Experience (QoE). Since ISP has to manage bandwidth resources of large set of smart homes, in the proposed criterion each ISP separates the bandwidth resources for home external bandwidth and system bandwidth of ISP, respectively. Then, aggregates bandwidth requests of large number of smart homes according to distinct service classes.
This thesis focuses on the performance index of delay. We proposed to classify bandwidth requests from smart homes and put them into different queues, finally, calculate priority values by DADS (Delay Aware Dynamical Scheduling) algorithm. The proposed method is able to effectively reduce delay time with certain degree of fairness guarantee by dynamically allocate bandwidth resources for services with distinct service priorities.
In the experiments, we compared DADS with other algorithms such as MSCDL (Mac Scheduler), PF (Proportional Fair), TDPSS (Time Domain Priority Set Scheduler) and AMLWDF (Adaptive Modified Largest Weighted Delay First), etc. in terms of fairness, throughput, delay and jitter. The experiments results show that DADS performs much better than PF and TDPSS but a bit worse than MSCDL and AMLWDF in terms of delay. However, DADS shows no better performance than all other algorithms in terms of jitter and throughput. In fairness comparison, DADS is worse than PF, TDPSS and MSCDL but is better than AMLWDF.
Though DADS has no superior performance on overall indices, it is a bit worse than AMLWDF in delay of Category1 (including QCI 1, 2 and 5), its throughput is better than AMLWDF. Therefore, DADS’s performance is the best on Category1 considering overall indices.
| Identifer | oai:union.ndltd.org:CHENGCHI/G0103753004 |
| Creators | 黃麒瑋, Huang, Chi-Wei |
| Publisher | 國立政治大學 |
| Source Sets | National Chengchi University Libraries |
| Language | 中文 |
| Detected Language | English |
| Type | text |
| Rights | Copyright © nccu library on behalf of the copyright holders |
Page generated in 0.0017 seconds