| dc.contributor | 資訊系 | |
| dc.creator (作者) | 郭桐惟 | |
| dc.creator (作者) | Kuo, Tung-Wei;Jien, Chen-Rui | |
| dc.date (日期) | 2023-09 | |
| dc.date.accessioned | 16-Feb-2024 15:36:52 (UTC+8) | - |
| dc.date.available | 16-Feb-2024 15:36:52 (UTC+8) | - |
| dc.date.issued (上傳時間) | 16-Feb-2024 15:36:52 (UTC+8) | - |
| dc.identifier.uri (URI) | https://nccur.lib.nccu.edu.tw/handle/140.119/149881 | - |
| dc.description.abstract (摘要) | Maintaining up-to-date information is essential for enhancing the quality of service in mobile devices. The freshness of a mobile device is typically evaluated using the Age of Information (AoI) metric. This study considers a system where a Base Station (BS) transmits update messages to its terminals, and the goal is to design message transmission scheduling algorithms that minimize the overall AoI across all terminals. Previous studies have demonstrated that online algorithms perform poorly when the BS is required to send every message. However, in many applications, once a new message is generated, older ones can be discarded. This policy is called packet management. We prove that Round Robin (RR) is O(1)-competitive under packet management. We also generalize RR and consider a broader class of fair scheduling algorithms. | |
| dc.format.extent | 107 bytes | - |
| dc.format.mimetype | text/html | - |
| dc.relation (關聯) | ALGO 2023, Centrum Wiskunde & Informatica (CWI) | |
| dc.subject (關鍵詞) | Age of information; Round Robin; Competitive analysis | |
| dc.title (題名) | Fair Scheduling Under Packet Management: Competitive Analysis of Age of Information | |
| dc.type (資料類型) | conference | |
| dc.identifier.doi (DOI) | 10.1007/978-3-031-48882-5_9 | |
| dc.doi.uri (DOI) | https://doi.org/10.1007/978-3-031-48882-5_9 | |
