File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: A fast ant colony optimization based embedding algorithm for virtual network

TitleA fast ant colony optimization based embedding algorithm for virtual network
Authors
KeywordsNetwork virtualization
Gaussian process
Ant colony optimization
Virtual network embedding
Issue Date2013
Citation
Journal of Computational Information Systems, 2013, v. 9, n. 17, p. 7115-7122 How to Cite?
AbstractAiming at optimizing the efficiency of resource utilization, a new fast ant colony optimization based embedding algorithm for virtual network (VNE-FACO) is proposed under the assumption that substrate network doesn't needs to support the path splitting. By introducing the Gaussian process model, the convergence rate of ant colony optimization algorithm is accelerated to meet the practical real-time requirements. The resource cost of virtual network embedding is considered as the fitness function and the parameters are redefined according to the embedding problem. Experimental results show that VNE-FACO can reduce the computation time significantly with the same accuracy compared with existing researches. © 2013 Binary Information Press.
Persistent Identifierhttp://hdl.handle.net/10722/296085
ISSN

 

DC FieldValueLanguage
dc.contributor.authorLi, Ling-
dc.contributor.authorChen, He-
dc.contributor.authorDu, Zhanwei-
dc.contributor.authorMa, Chuang-
dc.date.accessioned2021-02-11T04:52:48Z-
dc.date.available2021-02-11T04:52:48Z-
dc.date.issued2013-
dc.identifier.citationJournal of Computational Information Systems, 2013, v. 9, n. 17, p. 7115-7122-
dc.identifier.issn1553-9105-
dc.identifier.urihttp://hdl.handle.net/10722/296085-
dc.description.abstractAiming at optimizing the efficiency of resource utilization, a new fast ant colony optimization based embedding algorithm for virtual network (VNE-FACO) is proposed under the assumption that substrate network doesn't needs to support the path splitting. By introducing the Gaussian process model, the convergence rate of ant colony optimization algorithm is accelerated to meet the practical real-time requirements. The resource cost of virtual network embedding is considered as the fitness function and the parameters are redefined according to the embedding problem. Experimental results show that VNE-FACO can reduce the computation time significantly with the same accuracy compared with existing researches. © 2013 Binary Information Press.-
dc.languageeng-
dc.relation.ispartofJournal of Computational Information Systems-
dc.subjectNetwork virtualization-
dc.subjectGaussian process-
dc.subjectAnt colony optimization-
dc.subjectVirtual network embedding-
dc.titleA fast ant colony optimization based embedding algorithm for virtual network-
dc.typeArticle-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.12733/jcis7054-
dc.identifier.scopuseid_2-s2.0-84886283973-
dc.identifier.volume9-
dc.identifier.issue17-
dc.identifier.spage7115-
dc.identifier.epage7122-
dc.identifier.issnl1553-9105-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats