Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Pouya Yasrebi

dblp:164/8010 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 2016
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 100%
Computer networks
1 paper
Software-defined and programmable networks · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Software-defined and programmable networks › SDN flow management
flow migration
0.212015
Fast Network Flow Resumption for Live Virtual Machine Migration on SDN · ICNP 2015
Cloud and datacenter computing › virtualization › virtual machine migration
live migration
0.212015
Fast Network Flow Resumption for Live Virtual Machine Migration on SDN · ICNP 2015
Cloud and datacenter computing › virtualization
virtual machine migration
0.212015
Fast Network Flow Resumption for Live Virtual Machine Migration on SDN · ICNP 2015
Cloud and datacenter computing
datacenter network
0.112015
Fast Network Flow Resumption for Live Virtual Machine Migration on SDN · ICNP 2015

Methods — techniques the papers use, named apart from their topics

integer programming · 0.4heuristic algorithm · 0.4NP-completeness proof · 0.4
YearPublicationVenuePosition
2016 Enhanced real time content delivery using vCPE and NFV service chaining
abstract
Real-time content delivery (RTCD) systems have become a prominent aspect of telecommunications as evidence by popularity of news-casting, real-time event subscription / publication and live media streaming. Unlike conventional content delivery systems, RTCDs need to deliver processed information to users in real time. This may require the network to handle some of the processing closer to the users to efficiently use the bandwidth consumed by the applications. The combination of Network Function Virtualization (NFV) and service chaining is a promising solution to address this challenge. Our work applies a service chaining algorithm to place NFV modules of an RTCD application in a Software Defined Infrastructure (SDI), where virtualized Customer Premise Edges (vCPEs), possessing scarce resources, are employed. We suggest containers to efficiently pack VNFs into vCPEs. Our objective is to maximize the total number of chains that can be serviced in the RTCD application. To optimally chain the NFV modules, a heuristic algorithm is proposed and evaluated. Using simulations, we show that our algorithm with the help of vCPEs can support higher number of users while providing high-level service quality.
Pouya Yasrebi, Hadi Bannazadeh, Alberto Leon-Garcia
CNSM1
2015 Fast Network Flow Resumption for Live Virtual Machine Migration on SDN
abstract
Virtual machine (VM) migration occurs very frequently in cloud computing. VM Migration enables a running OS, including memory and storage to move from one physical host to another physical host. A particular case of interest is live migration where the process of migrating the full state from one OS to the other should happen continuously and without any connection disruption. In order to have a seamless VM migration process the system has to be able to resume network connectivity very quickly. Fast resumption has proved to be a challenging problem. In this paper, we present a scheme to efficiently to migrate VMs networking resources using SDN techniques to achieve fast network flow resumption on SDN. We formulate the problem by an integer programming problem, we prove its NP-completeness and we propose a heuristic algorithm to solve the problem. Software simulation and real testbed implementation are done to demonstrate the performance of the flow migration scheme.
Sai Qian Zhang, Pouya Yasrebi, Ali Tizghadam, Hadi Bannazadeh, Alberto Leon-Garcia
ICNP2
2015 Security function virtualization in software defined infrastructure
abstract
In this paper we present an approach to implement security as a Virtualized Network Function (VNF) that is implemented within a Software-Defined Infrastructure (SDI). We present a scalable, flexible, and seamless design for a Deep Packet Inspection (DPI) system for network intrusion detection and prevention. We discuss how our design introduces significant reductions in both capital and operational expenses (CAPEX and OPEX). As proof of concept, we describe an implementation for a modular security solution that uses the SAVI SDI testbed to first detect and then block an attack or to re-direct it to a honey-pot for further analysis. We discuss our testing methodology and provide measurement results for the test cases where an application faces various security attacks.
Pouya Yasrebi, Sina Monfared, Hadi Bannazadeh, Alberto Leon-Garcia
IM1