Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Age-aware scheduling in communication networks
Download
12625923.pdf
Date
2020-10-30
Author
Beytur, Hasan Burhan
Metadata
Show full item record
Item Usage Stats
620
views
255
downloads
Cite This
In next-generation communication networks, various types of data traffic with different requirements will coexist. This type of coexistence requires new techniques based on new metrics to distinguish the various types of data traffic based on their value. The emerging metric Age of Information (AoI) quantifying the timeliness of the communication flow is a promising metric to prepare future networks for new technologies such as the Internet of Things and Autonomous Driving. In this thesis, we studied scheduling problems with the objective of minimizing AoI on different network models. With the help of the results obtained from the theoretical study of LCFS queues using the Stochastic Hybrid System method, we propose a prominent scheduling algorithm called Maximum Age Difference, which is useful for optimizing the network in terms of AoI. Additionally, we approached the age-minimizing scheduling problem with Reinforcement Learning-based methods, which is advantageous when the network statistics are unknown
Subject Keywords
Age of information
,
Communication networks
,
Scheduling algorithms
URI
https://hdl.handle.net/11511/69140
Collections
Graduate School of Natural and Applied Sciences, Thesis
Suggestions
OpenMETU
Core
Scheduling Policies for Minimizing Age of Information in Broadcast Wireless Networks
Kadota, Igor; Sinha, Abhishek; Uysal, Elif; Singh, Rahul; Modiano, Eytan (2018-12-01)
In this paper, we consider a wireless broadcast network with a base station sending time-sensitive information to a number of clients through unreliable channels. The Age of Information (AoI), namely the amount of time that elapsed since the most recently delivered packet was generated, captures the freshness of the information. We formulate a discrete-time decision problem to find a transmission scheduling policy that minimizes the expected weighted sum AoI of the clients in the network. We first show that...
QUERY AGE OF INFORMATION IN COMMUNICATION NETWORKS
Ildız, Muhammed Emrullah; Uysal, Elif; Department of Electrical and Electronics Engineering (2002-8-22)
We study a pull-based status update communication model where a source node submits update packets to a channel with random transmission delay, at times requested by a remote destination node. The objective is to minimize the average query-age-of-information (QAoI), defined as the age of information (AoI) measured at query instants that occur at the destination side according to a stochastic arrival process. In reference to a push-based problem formulation defined in the literature where the source decides ...
A comparative study of evolutionary network design
Kalkan, Sinan; Şehitoğlu, Onur Tolga; Üçoluk, Göktürk; Department of Computer Engineering (2003)
In network design, a communication network is optimized for a given set of parameters like cost, reliability and delay. This study analyzes network design problem using Genetic Algorithms in detail and makes comparison of different approaches and representations. Encoding of a problem is one of the most crucial design choices in Genetic Algorithms. For network design problem, this study compares adjacency matrix representation with list of edges representation. Also, another problem is defining a fair fitne...
Implementation and Evaluation of Age-Aware Downlink Scheduling Policies in Push-Based and Pull-Based Communication
Oğuz, Tahir Kerem; Ceran Arslan, Elif Tuğçe; Uysal, Elif; Girici, Tolga (2022-5-01)
As communication systems evolve to better cater to the needs of machine-type applications such as remote monitoring and networked control, advanced perspectives are required for the design of link layer protocols. The age of information (AoI) metric has firmly taken its place in the literature as a metric and tool to measure and control the data freshness demands of various applications. AoI measures the timeliness of transferred information from the point of view of the destination. In this study, we exper...
Admission control and buffer management of wireless communication systems with mobile stations and integrated voice and data services
Gemikonakli, Eser; Ever, Enver; Mapp, Glenford; Gemikonakli, Orhan (2017-08-01)
This study presents models for management of voice and data traffic and new algorithms, which use call admission control as well as buffer management to optimise the performance of single channel systems such as wireless local area networks in the presence of mobile stations. Unlike existing studies, the new approach queues incoming voice packets as well as data packets, and uses a new pre-emption algorithm in order to keep the response time of voice requests at certain levels while the blocking of data req...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
H. B. Beytur, “Age-aware scheduling in communication networks,” M.S. - Master of Science, Middle East Technical University, 2020.
