題名: | Service Curve Allocation For End-to-end Delay Requirement |
作者: | Chu, Yen-Ping Chen, Chin-Hsing |
關鍵字: | guaranteed service scheduling local QOS allocation service curve |
期刊名/會議名稱: | 1999 NCS會議 |
摘要: | 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 guaranteed 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 even division 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 proposed an allocation scheme called MaxMin allocation to improve network utilization. Under SCED (Service Curve Earlist Deadline) scheduling policy, we reduce the service curve allocation to end-to-end delay allocation, and using MaxMin delay allocation policy, to promote the network utilization. From simulations, we find that the performance of MaxMin policy is better than even division policy. |
日期: | 2006-11-13T02:04:41Z |
分類: | 1999年 NCS 全國計算機會議 |
文件中的檔案:
檔案 | 描述 | 大小 | 格式 | |
---|---|---|---|---|
ce07ncs001999000092.pdf | 458.3 kB | Adobe PDF | 檢視/開啟 |
在 DSpace 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。