English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 110182/141115 (78%)
Visitors : 46776494      Online Users : 637
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    政大機構典藏 > 資訊學院 > 資訊科學系 > 會議論文 >  Item 140.119/149881
    Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/149881


    Title: Fair Scheduling Under Packet Management: Competitive Analysis of Age of Information
    Authors: 郭桐惟
    Kuo, Tung-Wei;Jien, Chen-Rui
    Contributors: 資訊系
    Keywords: Age of information;Round Robin;Competitive analysis
    Date: 2023-09
    Issue Date: 2024-02-16 15:36:52 (UTC+8)
    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.
    Relation: ALGO 2023, Centrum Wiskunde & Informatica (CWI)
    Data Type: conference
    DOI 連結: https://doi.org/10.1007/978-3-031-48882-5_9
    DOI: 10.1007/978-3-031-48882-5_9
    Appears in Collections:[資訊科學系] 會議論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML27View/Open


    All items in 政大典藏 are protected by copyright, with all rights reserved.


    社群 sharing

    著作權政策宣告 Copyright Announcement
    1.本網站之數位內容為國立政治大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,惟仍請適度,合理使用本網站之內容,以尊重著作權人之權益。商業上之利用,則請先取得著作權人之授權。
    The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

    2.本網站之製作,已盡力防止侵害著作權人之權益,如仍發現本網站之數位內容有侵害著作權人權益情事者,請權利人通知本網站維護人員(nccur@nccu.edu.tw),維護人員將立即採取移除該數位著作等補救措施。
    NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback