A Resource Finding Mechanism for Network Virtualization Environment

Article Preview

Abstract:

There are large numbers of infrastructure resources in network virtualization environment (NVE), how to quickly and accurately find the resources that virtual network required is a challenging problem. Pointing to this problem, a resource finding mechanism for network virtualization environment (NVERFM) is proposed. NVERFM is mainly comprised of three modules, virtual resources publishing module (VRPM), virtual resources clustering framework (VRCF), and virtual resources finding module (VRFM). VRPM is responsible for publishing the infrastructure resources to VRCF; and the published information contains functional and non-functional attributes. VRCF is responsible for classifying the published information into different clustering according to the attributes from high priority to low priority. VRFM mainly completes resource finding based on resource similarity principle. Finding the resource clustering that meet the user’s requirements; and then combinatorial auction mechanism is used to help users choose the optimal infrastructure resource. Finally, experiments are used to validate NVERFM, and the results show that NVERFM can not only help users find the optimal resource, but also improve the efficiency.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 433-440)

Pages:

5078-5086

Citation:

Online since:

January 2012

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Turner J S, Taylor D E. Diversifying the Internet. GLOBECOM (2005).

Google Scholar

[2] Petersonl L, Shenker S, Turner J. Overcoming the Internet Impasse through Virtualization. HotNets (2005).

Google Scholar

[3] Haider A, Potter R, Nakao A. Challenges in Resource Allocation in Network Virtualization. 20th ITC Specialist Seminar. (2009).

Google Scholar

[4] Chowdhury N M M K, Boutaba R. A Survey of Network Virtualization. Computer Networks. (2010).

Google Scholar

[5] Yu M, Yi Y, Rexford J, et al. Rethinking Virtual Network Embedding: Substrate Support for Path Splitting and Migration. SIGCOMM Comput. Commun. Rev. 2008, 38(2): 17-29.

DOI: 10.1145/1355734.1355737

Google Scholar

[6] Chowdhury N M M K. Virtual network embedding with coordinated node and link mapping. In IEEE INFOCOM. (2009).

DOI: 10.1109/infcom.2009.5061987

Google Scholar

[7] Zhu Y, Ammar M. Algorithms for assigning substrate network resources to virtual network components. In Proc IEEE INFOCOM. (2006).

DOI: 10.1109/infocom.2006.322

Google Scholar

[8] Lu J, Turner J. Efficient mapping of virtual networks onto a shared substrate. Technical Report WUCSE-2006-35. (2006).

Google Scholar

[9] Fan J, Ammar M. Dynamic topology configuration in service overlay networks: A study of reconfiguration polocies. In Proc. IEEE INFOCOM. (2006).

DOI: 10.1109/infocom.2006.139

Google Scholar

[10] Houidi I, Louati W, Zeghlache D. A Distributed Virtual Network Mapping Algortihm. ICC proceedings, (2008).

DOI: 10.1109/icc.2008.1056

Google Scholar

[11] De Vries S, Vohra R V. Combinatorial auctions: A survey. INFORMS Journal on Computing. 2003, 15(3): 284-309.

DOI: 10.1287/ijoc.15.3.284.16077

Google Scholar

[12] GEANT2 common Network Information Service Schema Specification. http: /www. geant2. net.

Google Scholar

[13] NDL web page. http: /www. science. uva. nl/researcj/sne/ndl.

Google Scholar

[14] NM-WG. http: /nmwg. internet2. edu.

Google Scholar

[15] Houidi I, Louati W, Zeghlache D, et al. Virtual Resource Description and Clustering for Virtual Network Discovery. In Proceedings of IEEE ICC Workshop on the Network of the Future 2009, Dresden.

DOI: 10.1109/iccw.2009.5207979

Google Scholar

[16] Hailong Sun, Jinpeng Huai, Gongwei Fu. An adaptive grid resource organization and discovery mechanism. Journal of Software. 2009, vol. 20(No. 1): 152-163. (in chinese).

DOI: 10.3724/sp.j.1001.2009.00152

Google Scholar

[17] Barbosa L, Freire J. An Adaptive Crawler for Locating Hidden-Web Entry Points. WWW 2007: 441-450.

DOI: 10.1145/1242572.1242632

Google Scholar

[18] Tompson S, Giles N, Li Y, et al. Using AI and semantic web technologies to attack process complexity in open systems. Knowledge-Based Systems, vol. 20(Issue 2): 152-159.

DOI: 10.1016/j.knosys.2006.11.016

Google Scholar

[19] Houidi I, Louati W, Zeghlache D. A Distributed Virtual Network Mapping Algorithm. In Proceedings of IEEE ICC 2008: 5634-5640.

DOI: 10.1109/icc.2008.1056

Google Scholar