Alireza Erfanian

Alireza Erfanian

Auto-generated profile, based on publicly available information

Alireza Erfanian

Christian Doppler Laboratory ATHENA, Alpen-Adria-Universitt, Klagenfurt, Austria

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

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

Representative Publications

View All Publications
18 January 2021 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
AEAlireza Erfanian
Alireza Erfanian
FTFarzad Tashtarian
Farzad Tashtarian
AZAnatoliy Zabrovskiy
Anatoliy Zabrovskiy
CTChristian Timmerer
Christian Timmerer
HHHermann Hellwagner
Hermann Hellwagner
Live video streaming traffic and related applications have experienced significant growth in recent years. However, this has been accompanied by some challenging issues, especially in terms of resource utilization. Although IP multicasting can be recognized as an efficient mechanism to cope with these challenges, it suffers from many problems. Applying software-defined networking (SDN) and network function virtualization (NFV) technologies enable researchers to cope with IP multicasting issues in novel ways. In this article, by leveraging the SDN concept, we introduce OSCAR (Optimizing reSourCe utilizAtion in live video stReaming) as a new cost-aware video streaming approach to provide advanced video coding (AVC)-based live streaming services in the network. In this article, we use two types of virtualized network functions (VNFs): virtual reverse proxy (VRP) and virtual transcoder function (VTF). At the edge of the network, VRPs are responsible for collecting clients' requests and sending them to an SDN controller. Then, by executing a mixed-integer linear program (MILP), the SDN controller determines a group of optimal multicast trees for streaming the requested videos from an appropriate origin server to the VRPs. Moreover, to elevate the efficiency of resource allocation and meet the given end-to-end latency threshold, OSCAR delivers only the highest requested quality from the origin server to an optimal group of VTFs over a multicast tree. The selected VTFs then transcode the received video segments and transmit them to the requesting VRPs in a multicast fashion. To mitigate the time complexity of the proposed MILP model, we present a simple and efficient heuristic algorithm that determines a near-optimal solution in polynomial time. Using the MiniNet emulator, we evaluate the performance of OSCAR in various scenarios. The results show that OSCAR surpasses other SVC- and AVC-based multicast and unicast approaches in terms of cost and resource utilization.

7 February 2022 in IEEE Transactions on Multimedia
Verified
Journal Article
Open access
FTFarzad Tashtarian
Farzad Tashtarian
ABAbdelhak Bentaleb
Abdelhak Bentaleb
AEAlireza Erfanian
Alireza Erfanian
HHHermann Hellwagner
Hermann Hellwagner
CTChristian Timmerer
Christian Timmerer
RZRoger Zimmermann
Roger Zimmermann
While most of the HTTP adaptive streaming (HAS) traffic continues to be video-on-demand (VoD), more users have started generating and delivering live streams with high quality through popular online streaming platforms. Typically, the video contents are generated by streamers and being watched by large audiences which are geographically distributed far away from the streamers locations. The locations of streamers and audiences create a significant challenge in delivering HAS-based live streams with low latency and high quality. Any problem in the delivery paths will result in a reduced viewer experience. In this paper, we propose HxL3, a novel architecture for low-latency live streaming. HxL3 is agnostic to the protocol and codecs that can work equally with existing HAS-based approaches. By holding the minimum number of live media segments through efficient caching and prefetching policies at the edge, improved transmissions, as well as transcoding capabilities, HxL3 is able to achieve high viewer experiences across the Internet by alleviating rebuffering and substantially reducing initial startup delay and live stream latency. HxL3 can be easily deployed and used. Its performance has been evaluated using real live stream sources and entities that are distributed worldwide. Experimental results show the superiority of the proposed architecture and give good insights into how low latency live streaming is working.

5 August 2021 in IEEE Access
Verified
Journal Article
Open access
AEAlireza Erfanian
Alireza Erfanian
HAHadi Amirpour
Hadi Amirpour
FTFarzad Tashtarian
Farzad Tashtarian
CTChristian Timmerer
Christian Timmerer
HHHermann Hellwagner
Hermann Hellwagner
Due to the growing demand for video streaming services, providers have to deal with increasing resource requirements for increasingly heterogeneous environments. To mitigate this problem, many works have been proposed which aim to ( i) improve cloud/edge caching efficiency, (ii) use computation power available in the cloud/edge for on-the-fly transcoding, and (iii) optimize the trade-off among various cost parameters, e.g., storage, computation, and bandwidth. In this paper, we propose LwTE, a novel Light- weight Transcoding approach at the Edge, in the context of HTTP Adaptive Streaming (HAS). During the encoding process of a video segment at the origin side, computationally intense search processes are going on. The main idea of LwTE is to store the optimal results of these search processes as metadata for each video bitrate and reuse them at the edge servers to reduce the required time and computational resources for on-the-fly transcoding. LwTE enables us to store only the highest bitrate plus corresponding metadata (of very small size) for unpopular video segments/bitrates. In this way, in addition to the significant reduction in bandwidth and storage consumption, the required time for on-the-fly transcoding of a requested segment is remarkably decreased by utilizing its corresponding metadata; unnecessary search processes are avoided. Popular video segments/bitrates are being stored. We investigate our approach for Video-on-Demand (VoD) streaming services by optimizing storage and computation (transcoding) costs at the edge servers and then compare it to conventional methods (store all bitrates, partial transcoding). The results indicate that our approach reduces the transcoding time by at least 80% and decreases the aforementioned costs by 12% to 70% compared to the state-of-the-art approaches.

1 May 2016
Verified
Conference Paper
Open access
KAKayvan Atefi
Kayvan Atefi
SYSaadiah Yahya
Saadiah Yahya
ARAmirali Rezaei
Amirali Rezaei
AEAlireza Erfanian
Alireza Erfanian
Nowadays, Local Area Networks (LAN) are one of the most popular networks, and the LAN performance is very important for operators. The LAN method has been applied as an essential infrastructure of numerous companies and organizations for a long time. This study aims to evaluate the M/M/1 queuing model in LAN Based on Poisson and Exponential Distribution and compare the traffic behavior of these Distributions in terms of some essential parameters. Moreover, it also aims to design and implement a model to perform the M/M/1 queuing model with different metrics and finally analyze the results to evaluate traffic behavior of M/M/1 queuing model for Poisson and Exponential Distribution in LAN.

4 April 2022 in Computer Communications
Verified
Journal Article
Open access
AEAlireza Erfanian
Alireza Erfanian
FTFarzad Tashtarian
Farzad Tashtarian
CTChristian Timmerer
Christian Timmerer
HHHermann Hellwagner
Hermann Hellwagner

16 December 2022 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Open access
AEAlireza Erfanian
Alireza Erfanian
HAHadi Amirpour
Hadi Amirpour
FTFarzad Tashtarian
Farzad Tashtarian
CTChristian Timmerer
Christian Timmerer
HHHermann Hellwagner
Hermann Hellwagner
The edge computing paradigm brings cloud capabilities close to the clients. Leveraging the edge’s capabilities can improve video streaming services by employing the storage capacity and processing power at the edge for caching and transcoding tasks, respectively, resulting in video streaming services with higher quality and lower latency. In this paper, we propose, a Cost-and Delay-aware Light-weight Transcoding approach at the Edge, in the context of HTTP Adaptive Streaming (HAS). The encoding of a video segment requires computationally intensive search processes. The main idea of is to store the optimal search results as metadata for each bitrate of video segments and reuse it at the edge servers to reduce the required time and computational resources for transcoding. Aiming at minimizing the cost and delay of Video-on-Demand (VoD) services, we formulate the problem of selecting an optimal policy for serving segment requests at the edge server, including (i) storing at the edge server, (ii) transcoding from a higher bitrate at the edge server, and (iii) fetching from the origin or a CDN server, as a Binary Linear Programming (BLP) model. As a result, stores the popular video segments at the edge and serves the unpopular ones by transcoding using metadata or fetching from the origin/CDN server. In this way, in addition to the significant reduction in bandwidth and storage costs, the transcoding time of a requested segment is remarkably decreased by utilizing its corresponding metadata. Moreover, we prove the proposed BLP model is an NP-hard problem and propose two heuristic algorithms to mitigate the time complexity of . We investigate the performance of in comprehensive scenarios with various video contents, encoding software, encoding settings, and available resources at the edge. The experimental results show that our approach (i) reduces the transcoding time by up to 97%, (ii) decreases the streaming cost, including storage, computation, and bandwidth costs, by up to 75%, and (iii) reduces delay by up to 48% compared to approaches.