Reaz Ahmed

TL;DR: In this survey, the naming and routing mechanisms proposed by some of the most prominent ICN research projects are analyzed, compare, and contrast.

TL;DR: This paper proposes a framework for deploying multiple controllers within an WAN that dynamically adjusts the number of active controllers and delegates each controller with a subset of Openflow switches according to network dynamics while ensuring minimal flow setup time and communication overhead.

TL;DR: This paper utilizes the Floodlight controller's API to implement the proposed PayLess - a monitoring framework for SDN that uses an adaptive statistics collection algorithm that delivers highly accurate information in real-time without incurring significant network overhead.

TL;DR: This work provides an Integer Linear Programming (ILP) formulation and a dynamic programming based heuristic to solve larger instances of VNF-OP and suggests that a VNF based approach can provide more than 4 χ reduction in the operational cost of a network.

Abstract: Middleboxes or network appliances like firewalls, proxies, and WAN optimizers have become an integral part of today’s ISP and enterprise networks Middlebox functionalities are usually deployed on expensive and proprietary hardware that require trained personnel for deployment and maintenance Middleboxes contribute significantly to a network’s capital and operation costs In addition, organizations often require their traffic to pass through a specific sequence of middleboxes for compliance with security and performance policies This makes the middlebox deployment and maintenance tasks even more complicated Network function virtualization (NFV) is an emerging and promising technology that is envisioned to overcome these challenges It proposes to move packet processing from dedicated hardware middleboxes to software running on commodity servers In NFV terminology, software middleboxes are referred to as virtualized network functions (VNFs) It is a challenging problem to determine the required number and placement of VNFs that optimizes network operational costs and utilization, without violating service level agreements We call this the VNF orchestration problem (VNF-OP) and provide an integer linear programming formulation with implementation in CPLEX We also provide a dynamic programming-based heuristic to solve larger instances of VNF-OP Trace driven simulations on real-world network topologies demonstrate that the heuristic can provide solutions that are within 13 times of the optimal solution Our experiments suggest that a VNF-based approach can provide more than $ {4\times }$ reduction in the operational cost of a network