Virtual Network Mapping Algorithm for Minimizing Piecewise Linear Cost Function 


Vol. 41,  No. 6, pp. 672-677, Jun.  2016


PDF
  Abstract

Development of Internet has been successfully inspired with extensive deployment of the network technology and application. However, increases in Internet usage had caused a lot of traffic overload in these days. Thus, we need a continuous research and development on the network virtualization for effective resource allocation. In this paper, we propose a minimal cost virtual network mapping algorithm using Piecewise Linear Cost Function. We exploited an algorithm with Linear Programming and D-VINE for node mapping, and Shortest Path Algorithm based on linear programming solution is used for link mapping. In this way, we compared and analyzed the average cost for arrival rate of VN request with linear and tree structure. Simulation results show that the average cost of our algorithm shows better efficiency than ViNEyard.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

C. Pyoung and S. Baek, "Virtual Network Mapping Algorithm for Minimizing Piecewise Linear Cost Function," The Journal of Korean Institute of Communications and Information Sciences, vol. 41, no. 6, pp. 672-677, 2016. DOI: .

[ACM Style]

Chan-kyu Pyoung and Seung-jun Baek. 2016. Virtual Network Mapping Algorithm for Minimizing Piecewise Linear Cost Function. The Journal of Korean Institute of Communications and Information Sciences, 41, 6, (2016), 672-677. DOI: .

[KICS Style]

Chan-kyu Pyoung and Seung-jun Baek, "Virtual Network Mapping Algorithm for Minimizing Piecewise Linear Cost Function," The Journal of Korean Institute of Communications and Information Sciences, vol. 41, no. 6, pp. 672-677, 6. 2016.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880