• Publications
  • Influence
Cost Efficient Design of Survivable Virtual Infrastructure to Recover from Facility Node Failures
TLDR
This paper develops two solutions namely the 1-redundant scheme and the K-redundy scheme for surviving facility node failures while minimizing network resource costs and proposes efficient heuristics based on the MILP formulations. Expand
Survivable Virtual Infrastructure Mapping in a Federated Computing and Networking System under Single Regional Failures
TLDR
This paper first formulate the minimum-cost SVIM problem using mixed integer linear programming (MILP) and proposes an efficient heuristic solution to NSVIM, based on which two novel heuristic SVIM algorithms are proposed called Separate Optimization with Unconstrained Mapping (SOUM) and Incrementaloptimization with ConstrainedMapping (IOCM). Expand
Enhancing the reliability of services in NFV with the cost-efficient redundancy scheme
TLDR
This work proposes a novel redundancy scheme using the Cost-aware Importance Measure (CIM) to improve the reliability of the VNFs placed on the Physical Network and cuts down the backup cost for up to 46% with respect to the present algorithms and keeping high cost-efficiency. Expand
A new technique for efficient live migration of multiple virtual machines
TLDR
This paper proposes an improved serial migration strategy for migrating multiple VMs and introduces the post-copy migration scheme into it, and presents the m mixed migration strategy that is based on the improvedserial migration strategy and the parallel migration strategy. Expand
Fast incremental flow table aggregation in SDN
TLDR
This paper proposes offline FFTA (Fast Flow Table Aggregation) and its online improver iFFTA to shrink the flow table size and to provide practical fast updates and is the first online non-prefix aggregation scheme. Expand
Swing State: Consistent Updates for Stateful and Programmable Data Planes
TLDR
S Swing State is presented, a general state-management framework and runtime system supporting consistent state migration in stateful data planes to perform state migration entirely within the data plane by piggybacking state updates on live traffic. Expand
A cost efficient framework and algorithm for embedding dynamic virtual network requests
TLDR
This paper addresses the issue of how to optimally reconfigure and map an existing VN while the VN request changes, and model this problem as a mathematical optimization problem with the objective of minimizing the reconfiguration cost by using mixed integer linear programming. Expand
Minimizing average coflow completion time with decentralized scheduling
TLDR
D-CAS is proposed, a preemptive, decentralized, coflow-aware scheduling system that pursues coflows' remaining-time-first (MRTF) principle by leveraging a simple negotiation mechanism between each coflow's data senders and receivers and achieves a performance close to Varys and outperforms Baraat. Expand
TimeoutX: An Adaptive Flow Table Management Method in Software Defined Networks
TLDR
The proposed method Time outX, for the first time, combines traffic characteristics, flow types and Flow Table utilization ratio to decide the timeout of each entry and it outperforms current timeout setting strategies in both metrics of table miss number and blocked packet number, which indicates TimeoutX could make the best of Flow Table and support more flows. Expand
Online Deadline-Aware Bulk Transfer Over Inter-Datacenter WANs
TLDR
An online framework to efficiently manage mixed bulk transfers and a competitive algorithm that applies the primal-dual method to make routing and resource allocation based on the LP are proposed. Expand
...
1
2
3
4
5
...