skip to main content
10.1145/3050220.3060602acmconferencesArticle/Chapter ViewAbstractPublication PagescommConference Proceedingsconference-collections
short-paper

PRAM: Priority-aware Flow Migration Scheme in NFV Networks

Published: 03 April 2017 Publication History

Abstract

We propose PRAM, a priority-aware flow migrating scheme to address the problem of which flows to migrate during dynamic scale in or out of network functions in NFV networks. We introduce the concept of Priority-Weighted Migration Time (PWMT), and use a greedy algorithm to minimize the PWMT, in order to exert the minimum impact on latency-sensitive flows. Simulation results show that PRAM can reduce the PWMT by 5.61x to 18.48x compared with the random strategy.

References

[1]
Gember-Jacobson, A., Viswanathan, R., et al. Opennf: Enabling innovation in network function control. In SIGCOMM'14.
[2]
Rajagopalan, S., Williams, D., et al. Split/merge: System support for elastic execution in virtual middleboxes. In NSDI'13.
[3]
Roy, A., Zeng, H., et al. Inside the social network's (datacenter) network. In SIGCOMM'15.
[4]
Wang, Y., Xie, G., et al. Transparent flow migration for nfv. In ICNP'16.

Cited By

View all
  • (2021)A Hybrid Virtual Network Function Placement Strategy for Maximizing the Profit of Network Service Deployment Over Time-Varying WorkloadsIEEE Access10.1109/ACCESS.2021.30946649(99983-99994)Online publication date: 2021
  1. PRAM: Priority-aware Flow Migration Scheme in NFV Networks

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    SOSR '17: Proceedings of the Symposium on SDN Research
    April 2017
    211 pages
    ISBN:9781450349475
    DOI:10.1145/3050220
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 03 April 2017

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. Network Function Virtualization
    2. flow scheduling
    3. network management algorithm

    Qualifiers

    • Short-paper
    • Research
    • Refereed limited

    Funding Sources

    • National Natual Science Foundation of China

    Conference

    SOSR '17
    Sponsor:
    SOSR '17: Symposium on SDN Research
    April 3 - 4, 2017
    CA, Santa Clara, USA

    Acceptance Rates

    Overall Acceptance Rate 7 of 43 submissions, 16%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)3
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 01 Mar 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2021)A Hybrid Virtual Network Function Placement Strategy for Maximizing the Profit of Network Service Deployment Over Time-Varying WorkloadsIEEE Access10.1109/ACCESS.2021.30946649(99983-99994)Online publication date: 2021

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media