Ahmad Khonsari

Ahmad Khonsari

Auto-generated profile, based on publicly available information

Ahmad Khonsari

University of Tehran

Research Focus & Metrics

Academic Career Length

27Years (2000-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 May 2014 in Journal of Computer and System Sciences
Verified
Journal Article
Closed access
HSH. Shafiei
H. Shafiei
AKA. Khonsari
A. Khonsari
HDH. Derakhshi
H. Derakhshi
PMP. Mousavi
P. Mousavi

1 June 2017 in IEEE Transactions on Multimedia
Verified
Journal Article
Closed access
MHMohammad H. Hajiesmaili
Mohammad H. Hajiesmaili
LMLok To Mak
Lok To Mak
ZWZhi Wang
Zhi Wang
CWChuan Wu
Chuan Wu
MCMinghua Chen
Minghua Chen
AKAhmad Khonsari
Ahmad Khonsari
Multiparty cloud video conferencing architecture has been recently advocated to exploit rich computing and bandwidth resources in the cloud to effectively improve video conferencing performance. As a typical design in this architecture, multiple agents, i.e., virtual machines, are deployed in different cloud sites, and users are assigned to the agents. Then, the users communicate through the agents, and the agents might transcode the recorded videos given the heterogeneities among devices in terms of hardware specification and connectivity. In this architecture, two critical and nontrivial challenges are: 1) assigning users to agents to reduce the operational cost and the user-to-user conferencing delay and 2) identifying best agents to perform transcoding tasks, taking into account the heterogeneous bandwidth and processing availabilities. To address these challenges, we cast a joint problem of user-to-agent assignment and transcoding-agent selection. The ultimate objective is to simultaneously minimize the cost of the service provider and the conferencing delay. The problem is combinatorial in nature, which belongs to the NP-hard node assignment problems. We leverage the Markov approximation framework and devise an adaptive parallel algorithm that finds a close-to-optimal solution to our problem with a bounded performance guarantee. To evaluate the performance of our solution, we implement a prototype video conferencing system and carry out trace-driven experiments. In a set of largescale experiments using PlanetLab traces, our solution decreases the operational cost by 77% and simultaneously yields lower conferencing delay compared with an existing alternative.

8 January 2024 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
MMMasoumeh Moradian
Masoumeh Moradian
ADAresh Dadlani
Aresh Dadlani
AKAhmad Khonsari
Ahmad Khonsari
Hina TabassumHina Tabassum
Hina Tabassum
2=0.54ex Information aging has gained prominence in characterizing communication protocols for timely remote estimation and control applications. This work proposes an Age of Information (AoI)-aware threshold-based dynamic frame slotted ALOHA (T-DFSA) for contention resolution in random access machine-type communication networks. Unlike conventional DFSA that maximizes the throughput in each frame, the frame length and age-gain threshold in T-DFSA are determined to minimize the normalized average AoI reduction of the network in each frame. At the start of each frame in the proposed protocol, the common Access Point (AP) stores an estimate of the age-gain distribution of a typical node. Depending on the observed status of the slots, age-gains of successful nodes, and maximum available AoI, the AP adjusts its estimation in each frame. The maximum available AoI is exploited to derive the maximum possible age-gain at each frame and thus, to avoid overestimating the age-gain threshold, which may render T-DFSA unstable. Numerical results validate our theoretical analysis and demonstrate the effectiveness of the proposed T-DFSA compared to the existing optimal frame slotted ALOHA, threshold-ALOHA, and age-based thinning protocols in a considerable range of update generation rates.

22 July 2011 in Wireless Networks
Verified
Journal Article
Closed access
PDF file
EGE. Ghadimi
E. Ghadimi
AKA. Khonsari
A. Khonsari
ADA. Diyanat
A. Diyanat
MFM. Farmani
M. Farmani
NYN. Yazdani
N. Yazdani

30 June 2023 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
SRSeyed Hamed Rastegar
Seyed Hamed Rastegar
HSHossein Shafiei
Hossein Shafiei
AKAhmad Khonsari
Ahmad Khonsari
The emerging serverless computing paradigm has recently attracted huge attention from both academia and industry. It brings benefits, such as less operational complexity, high scalability and availability, and lower costs. Serverless applications are usually partitioned into several chains of functions. The serverless provider should schedule functions for execution per customers' requests considering their chained nature. Also, the existing scheduling mechanisms for serverless platforms pay little attention to the reduction of energy consumption during functions' execution. To fill this gap, we present an energy-aware execution scheduler for serverless service providers named EneX. To do so, we formulate the minimization of energy consumption for executing the incoming chains of functions with specified computational loads and deadlines. Due to the intractability of the problem, we introduce a linear programming reformulation based on which, we propose an online scheduler. Finally, our experiments demonstrate the significant improvement of EneX in terms of energy efficiency.

4 June 2020 in Energies
Verified
Journal Article
Open access
PDF file
AAAbbas Akbari
Abbas Akbari
AKAhmad Khonsari
Ahmad Khonsari
Seyed Mohammad GhoreyshiSeyed Mohammad Ghoreyshi
Seyed Mohammad Ghoreyshi
In recent years, a large and growing body of literature has addressed the energy-efficient resource management problem in data centers. Due to the fact that cooling costs still remain the major portion of the total data center energy cost, thermal-aware resource management techniques have been employed to make additional energy savings. In this paper, we formulate the problem of minimizing the total energy consumption of a heterogeneous data center (MITEC) as a non-linear integer optimization problem. We consider both computing and cooling energy consumption and provide a thermal-aware Virtual Machine (VM) allocation heuristic based on the genetic algorithm. Experimental results show that, using the proposed formulation, up to 30 % energy saving is achieved compared to thermal-aware greedy algorithms and power-aware VM allocation heuristics.