A
Ahmed M. Bedewy
Researcher at Ohio State University
Publications - 50
Citations - 1346
Ahmed M. Bedewy is an academic researcher from Ohio State University. The author has contributed to research in topics: Network packet & Computer science. The author has an hindex of 13, co-authored 45 publications receiving 965 citations. Previous affiliations of Ahmed M. Bedewy include Alexandria University.
Papers
More filters
Proceedings ArticleDOI
Age-optimal information updates in multihop networks
TL;DR: In this paper, it was shown that a preemptive Last Generated First Served (LGFS) policy results in smaller age processes at all nodes of the network (in a stochastic ordering sense) than any other causal policy.
Proceedings ArticleDOI
Optimizing data freshness, throughput, and delay in multi-server information-update systems
TL;DR: In this article, a preemptive Last Generated First Served (LGFS) policy was proposed to optimize the age of updates without throughput loss in information-update systems, where incoming updates do not necessarily arrive in the order of their generation times.
Journal ArticleDOI
Minimizing the Age of Information Through Queues
TL;DR: The Last-Generated, First-Serve (LGFS) scheduling policy, in which the packet with the earliest generation time is processed with the highest priority, is proposed, and the age optimality results of LCFS-type policies are established.
Journal ArticleDOI
The Age of Information in Multihop Networks
Abstract: Information updates in multihop networks such as Internet of Things (IoT) and intelligent transportation systems have received significant recent attention. In this paper, we minimize the age of a single information flow in interference-free multihop networks. When preemption is allowed and the packet transmission times are exponentially distributed, we prove that a preemptive last-generated, first-served (LGFS) policy results in smaller age processes across all nodes in the network than any other causal policy (in a stochastic ordering sense). In addition, for the class of new-better-than-used (NBU) distributions, we show that the non-preemptive LGFS policy is within a constant age gap from the optimum average age. In contrast, our numerical result shows that the preemptive LGFS policy can be very far from the optimum for some NBU transmission time distributions. Finally, when preemption is prohibited and the packet transmission times are arbitrarily distributed, the non-preemptive LGFS policy is shown to minimize the age processes across all nodes in the network among all work-conserving policies (again in a stochastic ordering sense). Interestingly, these results hold under quite general conditions, including 1) arbitrary packet generation and arrival times, and 2) for minimizing both the age processes in stochastic ordering and any non-decreasing functional of the age processes.
Proceedings ArticleDOI
Age-optimal Sampling and Transmission Scheduling in Multi-Source Systems
TL;DR: It is proved that, for any given sampling strategy, the Maximum Age First (MAF) scheduling strategy provides the best age performance among all scheduling strategies.