Autosoft Journal

Online Manuscript Access


Time Efficient Virtual Network Embedding Algorithm


Authors



Abstract

The virtual network embedding problem is an essential problem in network virtualization. Researchers care about efficiency of the virtual network embedding algorithm. This issue has two procedures: node embedding and link embedding. However, previous studies mainly concentrate on the node embedding while neglecting the link embedding, which is the main cause for the bad running time. In this paper, we propose a new algorithm2014Deleting-first algorithm, which deletes incapable substrate links for the current virtual request before link mapping. The efficiency of virtual network embedding will be improved. The simulation results show that the average performance of the new algorithm is better at runtime.


Keywords


Pages

Total Pages: 8
Pages: 273-280

DOI
10.1080/10798587.2015.1095477


Manuscript ViewPdf Subscription required to access this document

Obtain access this manuscript in one of the following ways


Already subscribed?

Need information on obtaining a subscription? Personal and institutional subscriptions are available.

Already an author? Have access via email address?


Published

Volume: 22
Issue: 2
Year: 2015

Cite this document


References

Chowdhury N. M. IEEE International Conference on Computer Communications (INFOCOM)

Fan J. IEEE International Conference on Computer Communications (INFOCOM)

Feng, Ye et al. "A Novel Cloud Load Balancing Mechanism in Premise of Ensuring QoS." Intelligent Automation & Soft Computing 19.2 (2013): 151-163. Crossref. Web. https://doi.org/10.1080/10798587.2013.786968

Fischer, Andreas et al. "Virtual Network Embedding: A Survey." IEEE Communications Surveys & Tutorials 15.4 (2013): 1888-1906. Crossref. Web. https://doi.org/10.1109/SURV.2013.013013.00155

Guo T. IEEE International Conference on Communications (ICC)

Huang Tao et al. "A Topology-Cognitive Algorithm Framework for Virtual Network Embedding Problem." China Communications 11.4 (2014): 73-84. Crossref. Web. https://doi.org/10.1109/CC.2014.6827570

Huang T. China Communications

Hu, Qian, Yang Wang, and Xiaojun Cao. "Survivable Network Virtualization for Single Facility Node Failure: A Network Flow Perspective." Optical Switching and Networking 10.4 (2013): 406-415. Crossref. Web. https://doi.org/10.1016/j.osn.2013.06.007

"Proceedings of the 1st ACM Workshop on Virtualized Infrastructure Systems and Architectures - VISA ”09." (2009): n. pag. Crossref. Web. https://doi.org/10.1145/1592648

Liu, Jiang et al. "A New Algorithm Based on the Proximity Principle for the Virtual Network Embedding Problem." Journal of Zhejiang University SCIENCE C 12.11 (2011): 910-918. Crossref. Web. https://doi.org/10.1631/jzus.C1100003

Resource not found. https://doi.org/10.1145/956981

Tran H. V. Computational Science and Its Applications (ICCSA)

Turner J. S. Proceedings of Global Telecommunications Conference (GLOBECOM)

ACM SIGCOMM Computer Communication Review 38.2 (2008): n. pag. Crossref. Web. https://doi.org/10.1145/1355734

Zegura E. W. Fifteenth Annual Joint Conference of the IEEE Computer Societies, Networking the Next Generation

International Journal of Communication Systems 26.8 (2013): n. pag. Crossref. Web. https://doi.org/10.1002/dac.v26.8

Sheng Zhang et al. "Virtual Network Embedding with Opportunistic Resource Sharing." IEEE Transactions on Parallel and Distributed Systems 25.3 (2014): 816-827. Crossref. Web. https://doi.org/10.1109/TPDS.2013.64

Zhang M. IEEE International Conference on Communications (ICC)

Zhu Y. IEEE International Conference on Computer Communications (INFOCOM)

JOURNAL INFORMATION


ISSN PRINT: 1079-8587
ISSN ONLINE: 2326-005X
DOI PREFIX: 10.31209
10.1080/10798587 with T&F
IMPACT FACTOR: 0.652 (2017/2018)
Journal: 1995-Present




CONTACT INFORMATION


TSI Press
18015 Bullis Hill
San Antonio, TX 78258 USA
PH: 210 479 1022
FAX: 210 479 1048
EMAIL: tsiepress@gmail.com
WEB: http://www.wacong.org/tsi/