11 citations · 27 across the 9 of their papers we have counts for
7 papers · 1 filter
Data Replication for Reducing Computing Time in Distributed Systems with Stragglers
Amir Behrouzi-Far, Emina Soljanin
In distributed computing systems with stragglers, various forms of redundancy can improve the average delay performance. We study the optimal replication of data in systems where t…
Scheduling in the Presence of Data Intensive Compute Jobs
Amir Behrouzi-Far, Emina Soljanin
We study the performance of non-adaptive scheduling policies in computing systems with multiple servers. Compute jobs are mostly regular, with modest service requirements. However,…
Cooperative Beamforming in Cognitive Radio Relay Networks Using Amplify-and-Forward Relaying Technique
Amir Behrouzi-Far, Saeideh Mohammadkhani
In this work, we study the problem of relay beamforming for an underlay cognitive radio relay network using amplify-and-forward (AF) relaying technique. We consider a cognitive rad…
Dynamic Resource Allocation and Activity Management for Energy Efficiency and Fairness in Heterogeneous Networks
Amir Behrouzi-Far, Ezhan Karasan
Higher energy consumption of Heterogeneous Networks (HetNet), compared to Macro Only Networks (MONET), raises a great concern about the energy efficiency of HetNets. In this work w…
Evaluating Load Balancing Performance in Distributed Storage with Redundancy
Mehmet Fatih Aktas, Amir Behrouzi-Far, Emina Soljanin +1
To facilitate load balancing, distributed systems store data redundantly. We evaluate the load balancing performance of storage schemes in which each object is stored at differ…
Redundancy Scheduling in Systems with Bi-Modal Job Service Time Distribution
Amir Behrouzi-Far, Emina Soljanin
Queuing systems with redundant requests have drawn great attention because of their promise to reduce the job completion time and variability. Despite a large body of work on the t…
On the Average Maximal Number of Balls in a Bin Resulting from Throwing r Balls into n Bins T times
Amir Behrouzi-Far, Doron Zeilberger
We use the holonomic ansatz to estimate the asymptotic behavior, in , of the average maximal number of balls in a bin that is obtained when one throws uniformly at random (witho…