An algorithm for fragment-aware virtual network reconfiguration

Xinbo Liu and Buhong Wang

PLOS ONE, 2018, vol. 13, issue 11, 1-16

Abstract: In view of the fact that the current online virtual network embedding algorithms do not consider the fragment resources generated in the embedding process deeply enough, resulting in the problem that the acceptance ratio and the revenue to cost ratio are both low, a mathematical model for virtual network reconfiguration is constructed and a heuristic algorithm for fragment-aware virtual network reconfiguration (FA-VNR) is proposed. The FA-VNR algorithm selects the set of virtual nodes to be migrated according to the fragment degrees of the physical nodes, and selects the best virtual node migration scheme according to the reduction of the fragment degrees of the physical nodes as well as the reduction of the embedding cost of the embedded virtual networks. Extensive simulation results show that the proposed FA-VNR algorithm not only can obviously improve the acceptance ratio and the revenue to cost ratio of the current online virtual network embedding algorithm, but also has better optimization effect than the existing virtual network reconfiguration algorithm.

Date: 2018
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0207705 (text/html)
https://journals.plos.org/plosone/article/file?id= ... 07705&type=printable (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:plo:pone00:0207705

DOI: 10.1371/journal.pone.0207705

Access Statistics for this article

More articles in PLOS ONE from Public Library of Science
Bibliographic data for series maintained by plosone ().