Fraida Fund

Fraida Fund

Auto-generated profile, based on publicly available information

Fraida Fund

New York University, New York, NY, USA

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
22 December 2020 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
CTCaglar Tunc
Caglar Tunc
MOMustafa Furkan Ozkoc
Mustafa Furkan Ozkoc
FFFraida Fund
Fraida Fund
SPShivendra S. Panwar
Shivendra S. Panwar
Millimeter-wave (mmWave) is a promising network access technology to enable high data rates, high reliability and ultra-low latency required by connected vehicle services in future vehicular networks. However, mmWave links are prone to blockages due to high penetration loss, which can cause frequent service interruptions and degrade the system performance in terms of reliability and latency. In this study, we analyze the latency and reliability performance of mmWave communications between vehicles and roadside units (RSUs) in a highway scenario, where the line-of-sight (LOS) links can be blocked by vehicles. First, we establish a continuous-time Markov chain model of the blockage events. By using the steady-state solution of this model, we explicitly derive the blockage probability and average blockage duration, which can be used to characterize the reliability and latency performance. We validate the accuracy of the analytical model by comparing it with simulations using real-world traffic data and vehicle distributions. We demonstrate that reducing the duration of long-lasting blockage events is more challenging than reducing the frequency of blockages. We consider three approaches to control the blockage probability and distribution of blockage durations: (i) increasing RSU density, (ii) increasing RSU heights and (iii) managing the vehicular speed limits. We show that the first two approaches are effective in reducing the blockage probability, whereas the third approach can be used to eliminate the long blockages and improve the latency performance. We discuss the implications of our results in terms of the benefits and challenges associated with these approaches.

20 July 2024
Verified
Conference Paper
Open access
FSFatih Berkay Sarpkaya
Fatih Berkay Sarpkaya
ASAshutosh Srivastava
Ashutosh Srivastava
FFFraida Fund
Fraida Fund
SPShivendra Panwar
Shivendra Panwar
The Low Latency, Low Loss, Scalable Throughput (L4S) architecture has the potential to reduce queuing delay when it is deployed at endpoints and routers throughout the Internet. However, it is not clear how TCP Prague, a prototype scalable congestion control for L4S, behaves when L4S is not yet universally deployed. Specifically, we consider the question: in a partial L4S deployment, will a user benefit by unilaterally switching from the status quo TCP to TCP Prague? To address this question, we evaluate the performance of a TCP Prague flow when sharing an L4S or non-L4S bottleneck queue with a non-L4S flow. Our findings suggest that the L4S congestion control, TCP Prague, has less favorable throughput or fairness properties than TCP Cubic or BBR in some coexistence scenarios, which may hinder adoption.


27 June 2023
Verified
Conference Paper
Open access
FFFraida Fund
Fraida Fund
With increasing recognition of the importance of reproducibility in computer science research, a wide range of efforts to promote reproducible research have been implemented across various sub-disciplines of computer science. These include artifact review and badging processes, and dedicated reproducibility tracks at conferences. However, these initiatives primarily engage active researchers and students already involved in research in their respective areas. In this paper, we present an argument for expanding the scope of these efforts to include a much larger audience, by introducing more reproducibility content into computer science courses. We describe various ways to integrate reproducibility content into the curriculum, drawing on our own experiences, as well as published experience reports from several sub-disciplines of computer science and computational science.


24 October 2023
Verified
Conference Paper
Open access
SDSoumyadeep Datta
Soumyadeep Datta
FFFraida Fund
Fraida Fund
We replicate the paper, "When to Use and When Not to Use BBR: An Empirical Analysis and Evaluation Study" by Cao et al, published in IMC 2019 [2], with a focus on the relative goodput of TCP BBR and TCP CUBIC for a range of bottleneck buffer sizes, bandwidths, and delays. We replicate the experiments performed by the original authors on two large-scale open-access testbeds, to validate the conclusions of the paper. We further extend the experiments to BBRv2. We package the experiment artifacts and make them publicly available so that others can repeat and build on this work.