Hierarchical Deficit Round-Robin Packet Scheduling Algorithm
碩士 === 國立東華大學 === 資訊工程學系 === 101 === In the paper, we propose Hierarchical Deficit Round-Robin (HDRR) packet scheduling algorithm for multiple classes of service to provide a fair share of residual bandwidth with lower computation complexity. We design HDRR based on the Deficit Round-Robin packet sc...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Published: |
2013
|
Online Access: | http://ndltd.ncl.edu.tw/handle/60137723094365177749 |
id |
ndltd-TW-101NDHU5392081 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-101NDHU53920812015-10-13T22:40:51Z http://ndltd.ncl.edu.tw/handle/60137723094365177749 Hierarchical Deficit Round-Robin Packet Scheduling Algorithm 階層式欠額輪替式封包排程演算法 Shih-Hao Liu 劉士豪 碩士 國立東華大學 資訊工程學系 101 In the paper, we propose Hierarchical Deficit Round-Robin (HDRR) packet scheduling algorithm for multiple classes of service to provide a fair share of residual bandwidth with lower computation complexity. We design HDRR based on the Deficit Round-Robin packet scheduling algorithm, and can distribute bandwidth in proportion to weights of flows sharing the bandwidth, and share the unused bandwidth to backlogged flows according to the hierarchical architecture. In order to realize the performance differences be-tween the proposed scheduling algorithm and the other related scheduling algorithms, we implement the pro-posed scheduling algorithm in our simulation. The simulation results show that the proposed algorithm provides well QoS guarantees while fully utilizing the system bandwidth and low computation complexity. Min-Xiou Chen 陳旻秀 2013 學位論文 ; thesis 60 |
collection |
NDLTD |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立東華大學 === 資訊工程學系 === 101 === In the paper, we propose Hierarchical Deficit Round-Robin (HDRR) packet scheduling algorithm for multiple classes of service to provide a fair share of residual bandwidth with lower computation complexity. We design HDRR based on the Deficit Round-Robin packet scheduling algorithm, and can distribute bandwidth in proportion to weights of flows sharing the bandwidth, and share the unused bandwidth to backlogged flows according to the hierarchical architecture. In order to realize the performance differences be-tween the proposed scheduling algorithm and the other related scheduling algorithms, we implement the pro-posed scheduling algorithm in our simulation. The simulation results show that the proposed algorithm provides well QoS guarantees while fully utilizing the system bandwidth and low computation complexity.
|
author2 |
Min-Xiou Chen |
author_facet |
Min-Xiou Chen Shih-Hao Liu 劉士豪 |
author |
Shih-Hao Liu 劉士豪 |
spellingShingle |
Shih-Hao Liu 劉士豪 Hierarchical Deficit Round-Robin Packet Scheduling Algorithm |
author_sort |
Shih-Hao Liu |
title |
Hierarchical Deficit Round-Robin Packet Scheduling Algorithm |
title_short |
Hierarchical Deficit Round-Robin Packet Scheduling Algorithm |
title_full |
Hierarchical Deficit Round-Robin Packet Scheduling Algorithm |
title_fullStr |
Hierarchical Deficit Round-Robin Packet Scheduling Algorithm |
title_full_unstemmed |
Hierarchical Deficit Round-Robin Packet Scheduling Algorithm |
title_sort |
hierarchical deficit round-robin packet scheduling algorithm |
publishDate |
2013 |
url |
http://ndltd.ncl.edu.tw/handle/60137723094365177749 |
work_keys_str_mv |
AT shihhaoliu hierarchicaldeficitroundrobinpacketschedulingalgorithm AT liúshìháo hierarchicaldeficitroundrobinpacketschedulingalgorithm AT shihhaoliu jiēcéngshìqiànélúntìshìfēngbāopáichéngyǎnsuànfǎ AT liúshìháo jiēcéngshìqiànélúntìshìfēngbāopáichéngyǎnsuànfǎ |
_version_ |
1718080217050775552 |