JOURNAL BROWSE
Search
Advanced SearchSearch Tips
Virtual Network Mapping Algorithm for Minimizing Piecewise Linear Cost Function
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
Virtual Network Mapping Algorithm for Minimizing Piecewise Linear Cost Function
Pyoung, Chan-kyu; Baek, Seung-jun;
  PDF(new window)
 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.
 Keywords
Network Virtualization;Virtual Network Mapping;Optimization;Piecewise Linear Cost Function;
 Language
Korean
 Cited by
1.
효율적인 가상 네트워크 대응 방안,우미애;

한국통신학회논문지, 2016. vol.41. 12, pp.1793-1800 crossref(new window)
 References
1.
M. Chowdhury, M. R. Rahman, and R. Boutaba, "Vineyard: Virtual network embedding algorithms with coordinated node and link mapping," IEEE/ACM Trans. Networking (TON), vol. 20, no. 1, pp. 206-219, Feb. 2012.

2.
A. Haider, R. Potter, and A. Nakao, "Challenges in resource allocation in network virtualization," 20th ITC Specialist Seminar, vol. 18, Hoi An, Vietnam, May 2009.

3.
Y. Zhu and M. Ammar, "Algorithms for assigning substrate network resources to virtual network components," in Proc. INFOCOM, pp. 1-12, Barcelona, Spain, Apr. 2006.

4.
M. Yu, Y. Yi, J. Rexford, and M. Chian, "Rethinking virtual network embedding: Substrate support for path splitting and migration," ACM SIGCOMM Computer Comm. Rev., vol. 38, no. 2, pp. 17-29, Seattle, USA, Apr. 2008.

5.
A. Razzaq, P. Sjodin, and M. Hidell, "Minimizing bottleneck nodes of a substrate in virtual network embedding," in Proc. Network of the Future (NOF), pp. 35-40, Paris, France, Nov. 2011.

6.
M. Woo, "A survey on the virtual network embedding," in Proc. KICS Winter Conf., pp. 489-490, Seoul, Korea, Nov. 2013.

7.
M. Woo, "A study on node selection strategy for the virtual network embedding," J. KICS, vol. 39b, no. 8 pp. 491-498, Aug. 2014.

8.
M. Woo, "A comparison of mapping priorities for virtual network embedding," in Proc. KICS Winter Conf., pp. 815-816, Gangwon-do, Korea, Jan. 2015.