Publications-Periodical Articles
Article View/Open
Publication Export
Google ScholarTM
NCCU Library
Citation Infomation
-
Loading...Loading...
Related Publications in TAIR
| Title | Optimal Services for Content Delivery based on Business Priority |
| Creator | 陸行 Luh,Hsing Liang, Chih-Chin |
| Contributor | 應數系 |
| Key Words | content delivery;resource reservation;optimization |
| Date | 2013 |
| Date Issued | 26-Dec-2013 10:04:52 (UTC+8) |
| Summary | In a content-delivery system, connections are viewed as resources for sending files. However, the growing business needs of large-scale networks require an effective content-delivery service for transferring files. Since connections are sparse resources, prioritizing connections is essential for efficiently delivering urgent files and regular files based on various business priorities. This study presents a loss function as a performance index for a content-delivery service. The proposed loss function was applied to a sample content-delivery system to derive the average number of regular files in the retry group, the probability of failure to transfer a regular file in the first attempt, and the probability of failure to transmit urgent files. Additionally, the loss was associated with the decreased number of reserve connections under regular hours and peak hours. The experimental results show that the proposed model finds the optimal number of reserve connections for sending high- and low-priority files, and a manager can increase the service rate to ensure that losses are tolerable when delivering urgent files. Finally, the relative probabilities of blocked urgent files and blocked regular files are used as an indicator of efficiency in reserving connections. |
| Relation | Journal of the Chinese Institute of Engineers,36(4),422-440 |
| Type | article |
| DOI | http://dx.doi.org/10.1080/02533839.2012.731885 |
| dc.contributor | 應數系 | en_US |
| dc.creator (作者) | 陸行 | zh_TW |
| dc.creator (作者) | Luh,Hsing | en_US |
| dc.creator (作者) | Liang, Chih-Chin | en_US |
| dc.date (日期) | 2013 | en_US |
| dc.date.accessioned | 26-Dec-2013 10:04:52 (UTC+8) | - |
| dc.date.available | 26-Dec-2013 10:04:52 (UTC+8) | - |
| dc.date.issued (上傳時間) | 26-Dec-2013 10:04:52 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/63001 | - |
| dc.description.abstract (摘要) | In a content-delivery system, connections are viewed as resources for sending files. However, the growing business needs of large-scale networks require an effective content-delivery service for transferring files. Since connections are sparse resources, prioritizing connections is essential for efficiently delivering urgent files and regular files based on various business priorities. This study presents a loss function as a performance index for a content-delivery service. The proposed loss function was applied to a sample content-delivery system to derive the average number of regular files in the retry group, the probability of failure to transfer a regular file in the first attempt, and the probability of failure to transmit urgent files. Additionally, the loss was associated with the decreased number of reserve connections under regular hours and peak hours. The experimental results show that the proposed model finds the optimal number of reserve connections for sending high- and low-priority files, and a manager can increase the service rate to ensure that losses are tolerable when delivering urgent files. Finally, the relative probabilities of blocked urgent files and blocked regular files are used as an indicator of efficiency in reserving connections. | - |
| dc.format.extent | 127 bytes | - |
| dc.format.mimetype | text/html | - |
| dc.language.iso | en_US | - |
| dc.relation (關聯) | Journal of the Chinese Institute of Engineers,36(4),422-440 | en_US |
| dc.subject (關鍵詞) | content delivery;resource reservation;optimization | - |
| dc.title (題名) | Optimal Services for Content Delivery based on Business Priority | en_US |
| dc.type (資料類型) | article | en |
| dc.identifier.doi (DOI) | 10.1080/02533839.2012.731885 | en_US |
| dc.doi.uri (DOI) | http://dx.doi.org/10.1080/02533839.2012.731885 | en_US |