Publications-Conference Papers
Article View/Open
Publication Export
-
Google ScholarTM
NCCU Library
Citation Infomation
Related Publications in TAIR
題名 A Benchmark for QOS Guarantee Schemes 作者 Chu, Yen-Ping
Chen, Chin-Hsing
Lin, Kuan-Cheng關鍵詞 guaranteed service ; scheduling ; local QOS allocation 日期 1999 上傳時間 18-Oct-2017 16:51:41 (UTC+8) 摘要 An application with guaranteed service only cares about whether or not the network can satisfy its performance requirement, such as end-to-end delay. However, the network wants to achieve the high utilization and performance guarantee simultaneously. If the end-to-end delay provided by the network can be allocated properly to each switching node, then the network resources can get a better utilization. Conventionally, the delay is allocated equally to each switching node along the path that the connections pass through, referred to as equal (EQ) allocation policy. The advantage of this policy is easy to implement. However, we can not understand how this policy will affect the network utilization. In this paper, we will prove the EQ policy has good performance in excess bandwidth. We proposed an allocation scheme called MaxMin allocation to improve network utilization. With the excess bandwidth as the performance index, we have showed that MaxMin policy is an optimal scheme. In addition, we use the MaxMin allocation policy as the benchmark to compare with EQ policy, and we find the distinction of the performance between the EQ and MaxMin policy is tiny. 關聯 TANet`99會議論文
同步與非同步教學系統資料類型 conference dc.creator (作者) Chu, Yen-Ping en_US dc.creator (作者) Chen, Chin-Hsing en_US dc.creator (作者) Lin, Kuan-Cheng en_US dc.date (日期) 1999 dc.date.accessioned 18-Oct-2017 16:51:41 (UTC+8) - dc.date.available 18-Oct-2017 16:51:41 (UTC+8) - dc.date.issued (上傳時間) 18-Oct-2017 16:51:41 (UTC+8) - dc.identifier.uri (URI) http://nccur.lib.nccu.edu.tw/handle/140.119/113796 - dc.description.abstract (摘要) An application with guaranteed service only cares about whether or not the network can satisfy its performance requirement, such as end-to-end delay. However, the network wants to achieve the high utilization and performance guarantee simultaneously. If the end-to-end delay provided by the network can be allocated properly to each switching node, then the network resources can get a better utilization. Conventionally, the delay is allocated equally to each switching node along the path that the connections pass through, referred to as equal (EQ) allocation policy. The advantage of this policy is easy to implement. However, we can not understand how this policy will affect the network utilization. In this paper, we will prove the EQ policy has good performance in excess bandwidth. We proposed an allocation scheme called MaxMin allocation to improve network utilization. With the excess bandwidth as the performance index, we have showed that MaxMin policy is an optimal scheme. In addition, we use the MaxMin allocation policy as the benchmark to compare with EQ policy, and we find the distinction of the performance between the EQ and MaxMin policy is tiny. dc.format.extent 101460 bytes - dc.format.mimetype application/pdf - dc.relation (關聯) TANet`99會議論文 zh_TW dc.relation (關聯) 同步與非同步教學系統 zh_TW dc.subject (關鍵詞) guaranteed service ; scheduling ; local QOS allocation en_US dc.title (題名) A Benchmark for QOS Guarantee Schemes en_US dc.type (資料類型) conference
