scispace - formally typeset
A

Ashkan Yousefpour

Researcher at University of Texas at Dallas

Publications -  24
Citations -  1989

Ashkan Yousefpour is an academic researcher from University of Texas at Dallas. The author has contributed to research in topics: Computer science & Edge computing. The author has an hindex of 10, co-authored 22 publications receiving 1050 citations. Previous affiliations of Ashkan Yousefpour include University of California, Berkeley & Facebook.

Papers
More filters
Journal ArticleDOI

All one needs to know about fog computing and related edge computing paradigms: A complete survey

TL;DR: This paper provides a tutorial on fog computing and its related computing paradigms, including their similarities and differences, and provides a taxonomy of research topics in fog computing.
Journal ArticleDOI

All One Needs to Know about Fog Computing and Related Edge Computing Paradigms: A Complete Survey

TL;DR: In this paper, the authors provide a tutorial on fog computing and its related computing paradigms, including their similarities and differences, and provide a taxonomy of research topics in fog computing.
Journal ArticleDOI

On Reducing IoT Service Delay via Fog Offloading

TL;DR: This paper introduces a general framework for IoT-fog-cloud applications, and proposes a delay-minimizing collaboration and offloading policy for fog-capable devices that aims to reduce the service delay for IoT applications.
Proceedings ArticleDOI

Fog Computing: Towards Minimizing Delay in the Internet of Things

TL;DR: A general framework for IoT-fog-cloud applications is introduced, and a delay-minimizing policy for fog-capable devices that aims to reduce the service delay for IoT applications is proposed, and how the proposed framework helps to reduce IoT service delay is shown.
Journal ArticleDOI

FOGPLAN: A Lightweight QoS-Aware Dynamic Fog Service Provisioning Framework

TL;DR: This paper introduces FOGPLAN, a framework for QoS-aware dynamic fog service provisioning (QDFSP), and presents a possible formulation and two efficient greedy algorithms for addressing the QDFSP at one instance of time.